paper-with-me

홈 › Papers

Volumetric Spanners: an Efficient Exploration Basis for Learning

2013-12-21 · Elad Hazan, Zohar Karnin, Raghu Mehka

Numerous machine learning problems require an exploration basis - a mechanism to explore the action space. We define a novel geometric notion of exploration basis with low variance, called volumetric spanners, and give efficient algorithms to construct such a basis. We show how efficient volumetric spanners give rise to the first efficient and optimal regret algorithm for bandit linear optimization over general convex sets. Previously such results were known only for specific convex sets, or under special conditions such as the existence of an efficient self-concordant barrier for the underlying set.

📄 PDF Abstract BibTeX arXiv:1312.6214

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningEfficient Exploration

Similar Papers 제목 키워드 기반

Tight Bounds for Volumetric Spanners and Applications

2023-09-29 · NeurIPS 2023 11

Given a set of points of interest, a volumetric spanner is a subset of the points using which all the points can be expressed using "small" coefficients (measured in an appropriate norm). Formally, given a set of vectors…

Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners

2020-10-26 · Markus L. Schmid, Nicole Schweikardt

The regular spanners (characterised by vset-automata) are closed under the algebraic operations of union, join and projection, and have desirable algorithmic properties. The core spanners (introduced by Fagin, Kimelfeld,…

Is a Good Foundation Necessary for Efficient Reinforcement Learning? The Computational Role of the Base Model in Exploration

2025-03-10 · Dylan J. Foster, Zakaria Mhammedi, Dhruv Rohatgi

Language model alignment (or, reinforcement learning) techniques that leverage active exploration -- deliberately encouraging the model to produce diverse, informative responses -- offer the promise of super-human capabi…

Efficient Exploration

Composable Core-sets for Determinant Maximization Problems via Spectral Spanners

2018-07-31 · Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei

We study a spectral generalization of classical combinatorial graph spanners to the spectral setting. Given a set of vectors $V\subseteq \Re^d$, we say a set $U\subseteq V$ is an $\alpha$-spectral spanner if for all $v\i…

SpannerLib: Embedding Declarative Information Extraction in an Imperative Workflow

2024-09-03 · Dean Light, Ahmad Aiashy, Mahmoud Diab, Daniel Nachmias 외

Document spanners have been proposed as a formal framework for declarative Information Extraction (IE) from text, following IE products from the industry and academia. Over the past decade, the framework has been studied…