Cover Image

Avoiding the Price of Adaptivity: Inference in Linear Contextual Bandits via Stability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Praharaj, Samya, Khamaru, Koulik
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Information Theory Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

UCB algorithms for multi-armed bandits: Precise regret and adaptive inference
by: Han, Qiyang, et al.
Published: (2024)

Design Stability in Adaptive Experiments: Implications for Treatment Effect Estimation
by: Sengupta, Saikat, et al.
Published: (2025)

Inference with the Upper Confidence Bound Algorithm
by: Khamaru, Koulik, et al.
Published: (2024)

Efficient Inference after Directionally Stable Adaptive Experiments
by: Shen, Zikai, et al.
Published: (2026)

Bandit Simulation for Average Reward Inference
by: Praharaj, Samya, et al.
Published: (2026)

Semi-parametric inference based on adaptively collected data
by: Lin, Licong, et al.
Published: (2023)

Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
by: Zhao, Qingyue, et al.
Published: (2026)

Navigating Sparsities in High-Dimensional Linear Contextual Bandits
by: Zhao, Rui, et al.
Published: (2025)

Batches Stabilize the Minimum Norm Risk in High Dimensional Overparameterized Linear Regression
by: Ioushua, Shahar Stein, et al.
Published: (2023)

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

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
by: Rajaraman, Nived, et al.
Published: (2023)

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

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
by: Shi, Laixi, et al.
Published: (2023)

Batched Nonparametric Contextual Bandits
by: Jiang, Rong, et al.
Published: (2024)

The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements
by: Chaabouni, Youssef, et al.
Published: (2025)

Price of Quality: Sufficient Conditions for Sparse Recovery using Mixed-Quality Data
by: Chaabouni, Youssef, et al.
Published: (2026)

Early Stopping in Contextual Bandits and Inferences
by: Cui, Zihan
Published: (2025)

Concentrated Differential Privacy for Bandits
by: Azize, Achraf, et al.
Published: (2023)

The Adaptivity Barrier in Batched Nonparametric Bandits: Sharp Characterization of the Price of Unknown Margin
by: Jiang, Rong, et al.
Published: (2025)

Max-Linear Regression by Convex Programming
by: Kim, Seonho, et al.
Published: (2021)

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

Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing
by: Zhang, Yihan, et al.
Published: (2023)

Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models
by: Zhang, Yihan, et al.
Published: (2022)

Transfer Learning for Contextual Multi-armed Bandits
by: Cai, Changxiao, et al.
Published: (2022)

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

Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
by: Dmitriev, Daniil, et al.
Published: (2026)

Adaptive Refinement Protocols for Distributed Distribution Estimation under $\ell^p$-Losses
by: Yuan, Deheng, et al.
Published: (2024)

Inference for Heteroskedastic PCA with Missing Data
by: Yan, Yuling, et al.
Published: (2021)

Optimal Batched Linear Bandits
by: Ren, Xuanfei, et al.
Published: (2024)

Shuffled Linear Regression via Spectral Matching
by: Liu, Hang, et al.
Published: (2024)

Stability and Robustness via Regularization: Bandit Inference via Regularized Stochastic Mirror Descent
by: Halder, Budhaditya, et al.
Published: (2026)

Spectral Ranking Inferences based on General Multiway Comparisons
by: Fan, Jianqing, et al.
Published: (2023)

Fine-Grained Uncertainty Quantification via Collisions
by: Friedbaum, Jesse, et al.
Published: (2024)

Mixed Regression via Approximate Message Passing
by: Tan, Nelvin, et al.
Published: (2023)

Spectrum-Aware Debiasing: A Modern Inference Framework with Applications to Principal Components Regression
by: Li, Yufan, et al.
Published: (2023)

Degree Heterogeneity in Higher-Order Networks: Inference in the Hypergraph $\boldsymbolβ$-Model
by: Nandy, Sagnik, et al.
Published: (2023)

Stability of a Generalized Debiased Lasso with Applications to Resampling-Based Variable Selection
by: Liu, Jingbo
Published: (2024)

Optimal Estimation in Orthogonally Invariant Generalized Linear Models: Spectral Initialization and Approximate Message Passing
by: Zhang, Yihan, et al.
Published: (2026)

Testing the Feasibility of Linear Programs with Bandit Feedback
by: Gangrade, Aditya, et al.
Published: (2024)