:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Sarkar, Dhruv, Sinha, Abhishek
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2602.05019
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Constrained Contextual Bandits with Adversarial Contexts
by: Sarkar, Dhruv, et al.
Published: (2026)

Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction
by: Sarkar, Dhruv, et al.
Published: (2026)

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

BanditQ: Fair Bandits with Guaranteed Rewards
by: Sinha, Abhishek
Published: (2023)

Causal Contextual Bandits with Adaptive Context
by: Madhavan, Rahul, et al.
Published: (2024)

An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
by: van Erven, Tim, et al.
Published: (2025)

Active Context Selection Improves Simple Regret in Contextual Bandits
by: Shahverdikondori, Mohammad, et al.
Published: (2026)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
by: Goyal, Tanmay, et al.
Published: (2025)

Linear Contextual Bandits with Hybrid Payoff: Revisited
by: Das, Nirjhar, et al.
Published: (2024)

Improved Algorithms for Nash Welfare in Linear Bandits
by: Sarkar, Dhruv, et al.
Published: (2026)

DP-NCB: Privacy Preserving Fair Bandits
by: Sarkar, Dhruv, et al.
Published: (2025)

Contextual Bandits for Unbounded Context Distributions
by: Zhao, Puning, et al.
Published: (2024)

Revisiting Social Welfare in Bandits: UCB is (Nearly) All You Need
by: Sarkar, Dhruv, et al.
Published: (2025)

A Reduction Algorithm for Markovian Contextual Linear Bandits
by: Buyukkalayci, Kaan, et al.
Published: (2026)

Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
by: Slivkins, Aleksandrs, et al.
Published: (2022)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
by: Supantha, Subhamon, et al.
Published: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2023)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2024)

Contextual Bandits for Resource-Constrained Devices using Probabilistic Learning
by: Angioli, Marco, et al.
Published: (2026)

Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2025)

Learning with Incomplete Context: Linear Contextual Bandits with Pretrained Imputation
by: Yan, Hao, et al.
Published: (2025)

Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
by: Di, Qiwei, et al.
Published: (2024)

Online Multi-LLM Selection via Contextual Bandits under Unstructured Context Evolution
by: Poon, Manhin, et al.
Published: (2025)

Optimal Multitask Linear Regression and Contextual Bandits under Sparse Heterogeneity
by: Huang, Xinmeng, et al.
Published: (2023)

Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
by: Verma, Abhishek, et al.
Published: (2025)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
by: Vaze, Rahul, et al.
Published: (2025)

Context-Action Embedding Learning for Off-Policy Evaluation in Contextual Bandits
by: Chandak, Kushagra, et al.
Published: (2025)

Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
by: Levy, Orin, et al.
Published: (2025)

Exploration via Feature Perturbation in Contextual Bandits
by: Yi, Seouh-won, et al.
Published: (2025)

High Probability Bound for Cross-Learning Contextual Bandits with Unknown Context Distributions
by: Huang, Ruiyuan, et al.
Published: (2024)

Learning to Attack: A Bandit Approach to Adversarial Context Poisoning
by: Telikani, Ray, et al.
Published: (2026)

Scaling Federated Linear Contextual Bandits via Sketching
by: Yang, Hantao, et al.
Published: (2026)

Sparse Nonparametric Contextual Bandits
by: Flynn, Hamish, et al.
Published: (2025)

Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise
by: Tani, Naoto, et al.
Published: (2026)

Linear Contextual Bandits with Interference
by: Xu, Yang, et al.
Published: (2024)

Bayesian Inference of Contextual Bandit Policies via Empirical Likelihood
by: Ouyang, Jiangrong, et al.
Published: (2026)

Replicable Constrained Bandits
by: Bollini, Matteo, et al.
Published: (2026)

Neural Exploitation and Exploration of Contextual Bandits
by: Ban, Yikun, et al.
Published: (2023)