:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sarkar, Dhruv, Sinha, Abhishek
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning
Accès en ligne:	https://arxiv.org/abs/2602.05019
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Constrained Contextual Bandits with Adversarial Contexts
par: Sarkar, Dhruv, et autres
Publié: (2026)

Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction
par: Sarkar, Dhruv, et autres
Publié: (2026)

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sarkar, Dhruv, et autres
Publié: (2025)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
par: Sarkar, Dhruv, et autres
Publié: (2025)

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sarkar, Dhruv, et autres
Publié: (2025)

BanditQ: Fair Bandits with Guaranteed Rewards
par: Sinha, Abhishek
Publié: (2023)

Causal Contextual Bandits with Adaptive Context
par: Madhavan, Rahul, et autres
Publié: (2024)

An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
par: van Erven, Tim, et autres
Publié: (2025)

Active Context Selection Improves Simple Regret in Contextual Bandits
par: Shahverdikondori, Mohammad, et autres
Publié: (2026)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
par: Goyal, Tanmay, et autres
Publié: (2025)

Linear Contextual Bandits with Hybrid Payoff: Revisited
par: Das, Nirjhar, et autres
Publié: (2024)

Improved Algorithms for Nash Welfare in Linear Bandits
par: Sarkar, Dhruv, et autres
Publié: (2026)

DP-NCB: Privacy Preserving Fair Bandits
par: Sarkar, Dhruv, et autres
Publié: (2025)

Contextual Bandits for Unbounded Context Distributions
par: Zhao, Puning, et autres
Publié: (2024)

Revisiting Social Welfare in Bandits: UCB is (Nearly) All You Need
par: Sarkar, Dhruv, et autres
Publié: (2025)

A Reduction Algorithm for Markovian Contextual Linear Bandits
par: Buyukkalayci, Kaan, et autres
Publié: (2026)

Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
par: Slivkins, Aleksandrs, et autres
Publié: (2022)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
par: Supantha, Subhamon, et autres
Publié: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2023)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2024)

Contextual Bandits for Resource-Constrained Devices using Probabilistic Learning
par: Angioli, Marco, et autres
Publié: (2026)

Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2025)

Learning with Incomplete Context: Linear Contextual Bandits with Pretrained Imputation
par: Yan, Hao, et autres
Publié: (2025)

Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
par: Di, Qiwei, et autres
Publié: (2024)

Online Multi-LLM Selection via Contextual Bandits under Unstructured Context Evolution
par: Poon, Manhin, et autres
Publié: (2025)

Optimal Multitask Linear Regression and Contextual Bandits under Sparse Heterogeneity
par: Huang, Xinmeng, et autres
Publié: (2023)

Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
par: Verma, Abhishek, et autres
Publié: (2025)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
par: Vaze, Rahul, et autres
Publié: (2025)

Context-Action Embedding Learning for Off-Policy Evaluation in Contextual Bandits
par: Chandak, Kushagra, et autres
Publié: (2025)

Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
par: Levy, Orin, et autres
Publié: (2025)

Exploration via Feature Perturbation in Contextual Bandits
par: Yi, Seouh-won, et autres
Publié: (2025)

High Probability Bound for Cross-Learning Contextual Bandits with Unknown Context Distributions
par: Huang, Ruiyuan, et autres
Publié: (2024)

Learning to Attack: A Bandit Approach to Adversarial Context Poisoning
par: Telikani, Ray, et autres
Publié: (2026)

Scaling Federated Linear Contextual Bandits via Sketching
par: Yang, Hantao, et autres
Publié: (2026)

Sparse Nonparametric Contextual Bandits
par: Flynn, Hamish, et autres
Publié: (2025)

Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise
par: Tani, Naoto, et autres
Publié: (2026)

Linear Contextual Bandits with Interference
par: Xu, Yang, et autres
Publié: (2024)

Bayesian Inference of Contextual Bandit Policies via Empirical Likelihood
par: Ouyang, Jiangrong, et autres
Publié: (2026)

Replicable Constrained Bandits
par: Bollini, Matteo, et autres
Publié: (2026)

Neural Exploitation and Exploration of Contextual Bandits
par: Ban, Yikun, et autres
Publié: (2023)