Cover Image

Regret minimization in Linear Bandits with offline data via extended D-optimal exploration

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Vijayan, Sushant, Suggala, Arun, Shanmugam, Karthikeyan, Pal, Soumyabrata
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Bidding under RoS Constraints without Knowing the Value
by: Vijayan, Sushant, et al.
Published: (2025)

Bayesian Collaborative Bandits with Thompson Sampling for Improved Outreach in Maternal Health Program
by: Dasgupta, Arpan, et al.
Published: (2024)

Near-Optimal Streaming Heavy-Tailed Statistical Estimation with Clipped SGD
by: Das, Aniket, et al.
Published: (2024)

Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes
by: Sharma, Nihal, et al.
Published: (2021)

Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

Towards minimax optimal algorithms for Active Simple Hypothesis Testing
by: Vijayan, Sushant
Published: (2025)

Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

Sparse Linear Bandits with Blocking Constraints
by: Jain, Adit, et al.
Published: (2024)

Second Order Methods for Bandit Optimization and Control
by: Suggala, Arun, et al.
Published: (2024)

Bandits with Mean Bounds
by: Sharma, Nihal, et al.
Published: (2020)

Offline-to-online hyperparameter transfer for stochastic bandits
by: Sharma, Dravyansh, et al.
Published: (2025)

Combinatorial Multi-armed Bandits: Arm Selection via Group Testing
by: Mukherjee, Arpan, et al.
Published: (2024)

Prior Diffusiveness and Regret in the Linear-Gaussian Bandit
by: Zhu, Yifan, et al.
Published: (2026)

Robust Reward Modeling via Causal Rubrics
by: Srivastava, Pragya, et al.
Published: (2025)

Improving Generalization via Meta-Learning on Hard Samples
by: Jain, Nishant, et al.
Published: (2024)

No-Regret Linear Bandits under Gap-Adjusted Misspecification
by: Liu, Chong, et al.
Published: (2025)

Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
by: Rumi, Alberto, et al.
Published: (2026)

Linear Causal Representation Learning from Unknown Multi-node Interventions
by: Varıcı, Burak, et al.
Published: (2024)

Glauber Generative Model: Discrete Diffusion Models via Binary Classification
by: Varma, Harshit, et al.
Published: (2024)

Near-optimal Per-Action Regret Bounds for Sleeping Bandits
by: Nguyen, Quan, et al.
Published: (2024)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
by: Cassel, Asaf, et al.
Published: (2024)

On the Optimal Regret of Locally Private Linear Contextual Bandit
by: Li, Jiachun, et al.
Published: (2024)

Score-based Causal Representation Learning: Linear and General Transformations
by: Varıcı, Burak, et al.
Published: (2024)

Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
by: Zhang, Yu-Jie, et al.
Published: (2025)

Revisiting Matrix Sketching in Linear Bandits: Achieving Sublinear Regret via Dyadic Block Sketching
by: Wen, Dongxie, et al.
Published: (2024)

CDQuant: Greedy Coordinate Descent for Accurate LLM Quantization
by: Nair, Pranav Ajit, et al.
Published: (2024)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
by: Wang, Zhiyong, et al.
Published: (2024)

Stochastic Re-weighted Gradient Descent via Distributionally Robust Optimization
by: Kumar, Ramnath, et al.
Published: (2023)

Online Matrix Completion: A Collaborative Approach with Hott Items
by: Baby, Dheeraj, et al.
Published: (2024)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
by: Lee, Junghyun, et al.
Published: (2023)

Chained Information-Theoretic bounds and Tight Regret Rate for Linear Bandit Problems
by: Gouverneur, Amaury, et al.
Published: (2024)

Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
by: Kim, Seok-Jin, et al.
Published: (2024)

Selective classification using a robust meta-learning approach
by: Jain, Nishant, et al.
Published: (2022)

Representation Learning Preserving Ignorability and Covariate Matching for Treatment Effects
by: Nanavati, Praharsh, et al.
Published: (2025)

Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
by: Lancewicki, Tal, et al.
Published: (2025)

Bayesian Regret Minimization in Offline Bandits
by: Petrik, Marek, et al.
Published: (2023)

Optimal Regret for Single Index Bandits
by: Dey, Devdan, et al.
Published: (2026)

Efficient Public Health Intervention Planning Using Decomposition-Based Decision-Focused Learning
by: Shah, Sanket, et al.
Published: (2024)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
by: Bernasconi, Martino, et al.
Published: (2024)