No article text was recorded for this version.
sparsity-dependent regret bounds
Version 1 of 149 papers64 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Variance-Aware Sparse Linear Bandits
- Blog: Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection
- Blog: Contextual Information-Directed Sampling
- Blog: PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits
- Blog: Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
- Blog: Minimax Concave Penalized Multi-Armed Bandit Model with High-Dimensional Convariates
- Blog: High-Dimensional Sparse Linear Bandits
- Blog: High-dimensional Linear Bandits with Knapsacks
- Blog: Thompson Sampling for High-Dimensional Sparse Linear Contextual Bandits
- Blog: Sparsity-Agnostic Lasso Bandit
- Blog: Contextual Information-Directed Sampling
- Blog: Thompson Sampling for High-Dimensional Sparse Linear Contextual Bandits
- Blog: Efficient Reinforcement Learning for High Dimensional Linear Quadratic Systems
- Blog: Logistic Regression Regret: What's the Catch?
- Blog: Bandit Multiclass List Classification
- Blog: Sparsity, variance and curvature in multi-armed bandits
- Blog: A Unified Regularization Approach to High-Dimensional Generalized Tensor Bandits
- Blog: Stochastic Shortest Path with Sparse Adversarial Costs
- Blog: Contextual Information-Directed Sampling
- Blog: Thresholded Lasso Bandit
- Blog: A Simple Unified Framework for High Dimensional Bandit Problems
- Blog: Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
- Blog: High dimensional stochastic linear contextual bandit with missing covariates
- Blog: Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit
- Blog: Smoothed Adversarial Linear Contextual Bandits with Knapsacks
- Blog: Sparsity Regret Bounds for Individual Sequences in Online Linear Regression
- Blog: Beyond Johnson-Lindenstrauss: Uniform Bounds for Sketched Bilinear Forms
- Blog: From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards
- Blog: Lasso Bandit with Compatibility Condition on Optimal Arm
- Blog: Flexible and Efficient Contextual Bandits with Heterogeneous Treatment Effect Oracles
- Blog: Information Directed Sampling for Sparse Linear Bandits
- Blog: Sparsity-Agnostic Lasso Bandit
- Blog: Doubly-Robust Lasso Bandit
- Blog: A Doubly Robust Approach to Sparse Reinforcement Learning
- Blog: Problem-Complexity Adaptive Model Selection for Stochastic Linear Bandits
- Blog: Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits
- Blog: Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds
- Blog: Exploiting Relevance for Online Decision-Making in High-Dimensions
- Blog: Near Instance Optimal Model Selection for Pure Exploration Linear Bandits
- Blog: Sparse Optimistic Information Directed Sampling
- Blog: Lasso Bandit with Compatibility Condition on Optimal Arm
- Blog: Model Selection for Generic Contextual Bandits
- Blog: Infrequent Exploration in Linear Bandits
- Blog: Bernoulli Rank-1 Bandits for Click Feedback
- Blog: Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms
- Blog: Fixed-Budget Best-Arm Identification in Sparse Linear Bandits
- Blog: A Novel General Framework for Sharp Lower Bounds in Succinct Stochastic Bandits
- Blog: Regret Lower Bound and Optimal Algorithm for High-Dimensional Contextual Linear Bandit
- Blog: A Simple Unified Framework for High Dimensional Bandit Problems
History & citation
Current · Permanent link
- This direction split from Sparse Linear Bandits for High Dimensional Decision Making (78% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_sparsity_dependent_regret_bounds_69a5e2de,
title = {sparsity-dependent regret bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparsity-dependent-regret-bounds/rdr_69a5e2de9141430aba56c77f74e9245f},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_sparsity_dependent_regret_bounds_69a5e2de_v1,
title = {sparsity-dependent regret bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparsity-dependent-regret-bounds/rdr_69a5e2de9141430aba56c77f74e9245f/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}