No article text was recorded for this version.
high-dimensional regret scaling
Version 1 of 1473 papers568 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On the necessity of adaptive regularisation:Optimal anytime online learning on ℓp-balls
- Blog: Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States
- Blog: Stochastic convex optimization with bandit feedback
- Blog: Logistic Regression Regret: What's the Catch?
- Blog: Optimal Regret Algorithm for Pseudo-1d Bandit Convex Optimization
- Blog: Thresholded LASSO Bandit
- Blog: Dual Averaging on Compactly-Supported Distributions And Application to No-Regret Learning on a Continuum
- Blog: Exploiting the Surrogate Gap in Online Multiclass Classification
- Blog: On the necessity of adaptive regularisation: Optimal anytime online learning on $\boldsymbol{\ell_p}$-balls
- Blog: Breaking the $\sqrt{T}$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits
- Blog: Sequential Estimation under Multiple Resources: a Bandit Point of View
- Blog: Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm
- Blog: A conversion theorem and minimax optimality for continuum contextual bandits
- Blog: No-regret Algorithms for Online Convex Programs
- Blog: Minimax Optimality in Contextual Dynamic Pricing with General Valuation Models
- Blog: Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
- Blog: Adaptive Bandit Convex Optimization with Heterogeneous Curvature
- Blog: Localized exploration in contextual dynamic pricing achieves dimension-free regret
- Blog: Contextual bandits with surrogate losses: Margin bounds and efficient algorithms
- Blog: Contextual Online Bilateral Trade
- Blog: Lazy OCO: Online Convex Optimization on a Switching Budget
- Blog: Contextual Search for General Hypothesis Classes
- Blog: Online variance minimization
- Blog: Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond
- Blog: Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition
- Blog: Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection
- Blog: Faster Projection-free Online Learning
- Blog: Online Inverse Linear Optimization: Improved Regret Bound, Robustness to Suboptimality, and Toward Tight Regret Analysis
- Blog: On the Suboptimality of Thompson Sampling in High Dimensions
- Blog: Minimax Concave Penalized Multi-Armed Bandit Model with High-Dimensional Covariates
- Blog: Squeeze All: Novel Estimator and Self-Normalized Bound for Linear Contextual Bandits
- Blog: Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime
- Blog: Leveraging Initial Hints for Free in Stochastic Linear Bandits
- Blog: Open Problem: Fast and Optimal Online Portfolio Selection
- Blog: Online Isotonic Regression
- Blog: Breaking the $\sqrt{T}$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits
- Blog: Semi-Parametric Contextual Pricing Algorithm using Cox Proportional Hazards Model
- Blog: Multinomial Logit Contextual Bandits: Provable Optimality and Practicality
- Blog: Relax and Randomize : From Value to Algorithms
- Blog: Linear Submodular Bandits and their Application to Diversified Retrieval
- Blog: Adaptive Algorithms and Data-Dependent Guarantees for Bandit Convex Optimization
- Blog: Delayed Feedback in Generalised Linear Bandits Revisited
- Blog: Online Learning and Decision-Making under Generalized Linear Model with High-Dimensional Data
- Blog: Contextual Multi-Armed Bandits
- Blog: Distributed Projection-Free Online Learning for Smooth and Convex Losses
- Blog: Improved Differentially Private and Lazy Online Convex Optimization
- Blog: Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
- Blog: Stochastic Linear Bandits Robust to Adversarial Attacks
- Blog: Bandit Online Linear Optimization with Hints and Queries
- Blog: Open Problem: Tight Online Confidence Intervals for RKHS Elements
- Blog: High-dimensional Nonparametric Contextual Bandit Problem
- Blog: Near-Optimal No-Regret Learning Dynamics for General Convex Games
- Blog: Efficient Methods for Online Multiclass Logistic Regression
- Blog: Tracking Most Significant Shifts in Nonparametric Contextual Bandits
- Blog: On Batch Bayesian Optimization
- Blog: Breaking the √T Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits
- Blog: High-Dimensional Sparse Linear Bandits
- Blog: Faster Projection-free Online Learning
- Blog: On High-dimensional and Low-rank Tensor Bandits
- Blog: Tighter Regret Lower Bound for Gaussian Process Bandits with Squared Exponential Kernel in Hypersphere
Showing 60 of 473 papers.
History & citation
Current · Permanent link
- Scaling Contextual Bandits via Hidden Low Dimensional Structure merged into this direction (73% overlap)
- Dimension Efficient Regret Bounds for Online Learning merged into this direction (75% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_high_dimensional_regret_scaling_64baeaf3,
title = {high-dimensional regret scaling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/high-dimensional-regret-scaling/rdr_64baeaf332cc43f4a8356fe474d2ec39},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_high_dimensional_regret_scaling_64baeaf3_v1,
title = {high-dimensional regret scaling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/high-dimensional-regret-scaling/rdr_64baeaf332cc43f4a8356fe474d2ec39/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}