Copertina

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Rajaraman, Nived, Han, Yanjun, Jiao, Jiantao, Ramchandran, Kannan
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Machine Learning Information Theory Statistics Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Interactive Learning of Single-Index Models via Stochastic Gradient Descent
di: Rajaraman, Nived, et al.
Pubblicazione: (2026)

Toward a Theory of Tokenization in LLMs
di: Rajaraman, Nived, et al.
Pubblicazione: (2024)

Transformers on Markov Data: Constant Depth Suffices
di: Rajaraman, Nived, et al.
Pubblicazione: (2024)

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
di: Praharaj, Samya, et al.
Pubblicazione: (2025)

On the Statistical Complexity of Sample Amplification
di: Axelrod, Brian, et al.
Pubblicazione: (2022)

Towards Optimal Statistical Watermarking
di: Huang, Baihe, et al.
Pubblicazione: (2023)

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
di: Chen, Fan, et al.
Pubblicazione: (2024)

Optimal Arm Elimination Algorithms for Combinatorial Bandits
di: Wen, Yuxiao, et al.
Pubblicazione: (2025)

From Markov to Laplace: How Mamba In-Context Learns Markov Chains
di: Bondaschi, Marco, et al.
Pubblicazione: (2025)

Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions
di: Wu, Jingda, et al.
Pubblicazione: (2026)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
di: Azize, Achraf, et al.
Pubblicazione: (2025)

Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm
di: Boudart, Pierre, et al.
Pubblicazione: (2025)

Online Clustering of Data Sequences with Bandit Information
di: Chandran, G Dhinesh, et al.
Pubblicazione: (2025)

Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity
di: Dudeja, Rishabh, et al.
Pubblicazione: (2022)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
di: Lau, Ivan, et al.
Pubblicazione: (2025)

Federated PCA and Estimation for Spiked Covariance Matrices: Optimal Rates and Efficient Algorithm
di: Li, Jingyang, et al.
Pubblicazione: (2024)

Avoiding the Price of Adaptivity: Inference in Linear Contextual Bandits via Stability
di: Praharaj, Samya, et al.
Pubblicazione: (2025)

Ridge interpolators in correlated factor regression models -- exact risk analysis
di: Stojnic, Mihailo
Pubblicazione: (2024)

On Universality of Non-Separable Approximate Message Passing Algorithms
di: Lovig, Max, et al.
Pubblicazione: (2025)

Optimality of Approximate Message Passing Algorithms for Spiked Matrix Models with Rotationally Invariant Noise
di: Dudeja, Rishabh, et al.
Pubblicazione: (2024)

Concentrated Differential Privacy for Bandits
di: Azize, Achraf, et al.
Pubblicazione: (2023)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
di: Réveillard, William, et al.
Pubblicazione: (2025)

Statistical Mean Estimation with Coded Relayed Observations
di: Ling, Yan Hao, et al.
Pubblicazione: (2025)

Minimax Optimal Algorithms with Fixed-$k$-Nearest Neighbors
di: Ryu, J. Jon, et al.
Pubblicazione: (2022)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
di: Li, Gen, et al.
Pubblicazione: (2021)

$L^1$ Estimation: On the Optimality of Linear Estimators
di: Barnes, Leighton P., et al.
Pubblicazione: (2023)

Optimal Anytime-Valid Tests for Composite Nulls
di: Shekhar, Shubhanshu
Pubblicazione: (2025)

Optimal training-conditional regret for online conformal prediction
di: Liang, Jiadong, et al.
Pubblicazione: (2026)

Minimax Optimality of the Probability Flow ODE for Diffusion Models
di: Cai, Changxiao, et al.
Pubblicazione: (2025)

The Sample Complexity of Simple Binary Hypothesis Testing
di: Pensia, Ankit, et al.
Pubblicazione: (2024)

On the Sample Complexity of Robust Binary Hypothesis Testing
di: Vallinayagam, Shankar, et al.
Pubblicazione: (2026)

Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
di: Zhou, Julien, et al.
Pubblicazione: (2024)

Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits
di: Liu, Jingyu, et al.
Pubblicazione: (2025)

Instance-Optimal Estimation with Multiple LLM Judges on a Budget
di: Lee, Junghyun, et al.
Pubblicazione: (2026)

Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
di: Lau, Ivan, et al.
Pubblicazione: (2026)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
di: Zhang, Kaihong, et al.
Pubblicazione: (2024)

Orthogonal Approximate Message Passing with Optimal Spectral Initializations for Rectangular Spiked Matrix Models
di: Chen, Haohua, et al.
Pubblicazione: (2025)

Fast Convergence of $Φ$-Divergence Along the Unadjusted Langevin Algorithm and Proximal Sampler
di: Mitra, Siddharth, et al.
Pubblicazione: (2024)

The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints
di: Kazemi, Hadi, et al.
Pubblicazione: (2025)

Besting Good--Turing: Optimality of Non-Parametric Maximum Likelihood for Distribution Estimation
di: Han, Yanjun, et al.
Pubblicazione: (2025)