On two continuum armed bandit problems in high dimensions
From MaRDI portal
Publication:260274
DOI10.1007/s00224-014-9570-8zbMath1414.91084OpenAlexW1974484513MaRDI QIDQ260274
Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner
Publication date: 21 March 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/30373922/TOCS2014.pdf
online optimizationbandit problemscontinuum armed banditsfunctions of few variableslow-rank matrix recovery
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning functions of few arbitrary linear parameters in high dimensions
- Approximation of functions of few variables in high dimensions
- User-friendly tail bounds for sums of random matrices
- Learning non-parametric basis independent models from point queries via low-rank methods
- Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint
- Adaptive estimation of a quadratic functional by model selection.
- Diffusion wavelets
- Bayesian Optimization in a Billion Dimensions via Random Embeddings
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Lipschitz Bandits without the Lipschitz Constant
- Continuum Armed Bandit Problem of Few Variables in High Dimensions
- Learning juntas
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Fredman–Komlós bounds and information theory
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Worst-case interactive communication. I. Two messages are almost optimal
- Perfect Hashing and Probability
- Learning Theory
- The Nonstochastic Multiarmed Bandit Problem
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- The Continuum-Armed Bandit Problem
- Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems
- Interior-Point Methods for Full-Information and Bandit Online Learning
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Improved Rates for the Stochastic Continuum-Armed Bandit Problem
- Perturbation bounds in connection with singular value decomposition
- Finite-time analysis of the multiarmed bandit problem
