:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Sarkar, Dhruv, Sinha, Abhishek
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning
Accesso online:	https://arxiv.org/abs/2602.05019
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

BanditQ: Fair Bandits with Guaranteed Rewards
di: Sinha, Abhishek
Pubblicazione: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sparse Nonparametric Contextual Bandits
di: Flynn, Hamish, et al.
Pubblicazione: (2025)

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

Linear Contextual Bandits with Interference
di: Xu, Yang, et al.
Pubblicazione: (2024)

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

Replicable Constrained Bandits
di: Bollini, Matteo, et al.
Pubblicazione: (2026)

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