Image de couverture de livre

Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Oh, Youngmin
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Neural Variance-aware Dueling Bandits with Deep Representation and Shallow Exploration
par: Oh, Youngmin, et autres
Publié: (2025)

Linear and Neural Dueling Bandits with Delayed Feedback
par: Wang, Xiangyi, et autres
Publié: (2026)

Federated Linear Dueling Bandits
par: Huang, Xuhan, et autres
Publié: (2025)

Biased Dueling Bandits with Stochastic Delayed Feedback
par: Yi, Bongsoo, et autres
Publié: (2024)

Cascading Bandits Robust to Adversarial Corruptions
par: Xie, Jize, 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)

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
par: Ghaffari, Fatemeh, et autres
Publié: (2024)

Conversational Dueling Bandits in Generalized Linear Models
par: Yang, Shuhua, et autres
Publié: (2024)

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

Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification
par: Liu, Haolin, et autres
Publié: (2024)

Online Clustering of Dueling Bandits
par: Wang, Zhiyong, et autres
Publié: (2025)

Multi-Player Approaches for Dueling Bandits
par: Raveh, Or, et autres
Publié: (2024)

A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions
par: Kim, Sanghwa, et autres
Publié: (2026)

Learning from Imperfect Human Feedback: a Tale from Corruption-Robust Dueling
par: Cheng, Yuwei, et autres
Publié: (2024)

Beyond Numeric Rewards: In-Context Dueling Bandits with LLM Agents
par: Xia, Fanzeng, et autres
Publié: (2024)

Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
par: Li, Long-Fei, et autres
Publié: (2024)

Best-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda Objectives
par: Akash, S, et autres
Publié: (2026)

Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach
par: Ghaffari, Fatemeh, et autres
Publié: (2025)

A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond
par: Hu, Zicheng, et autres
Publié: (2025)

The Sampling Complexity of Condorcet Winner Identification in Dueling Bandits
par: Saad, El Mehdi, et autres
Publié: (2026)

Learning to Explore with Lagrangians for Bandits under Unknown Linear Constraints
par: Das, Udvas, et autres
Publié: (2024)

Fusing Reward and Dueling Feedback in Stochastic Bandits
par: Wang, Xuchuang, et autres
Publié: (2025)

Safe Linear Bandits over Unknown Polytopes
par: Gangrade, Aditya, et autres
Publié: (2022)

Contextual Linear Bandits with Delay as Payoff
par: Zhang, Mengxiao, et autres
Publié: (2025)

Utility-based Dueling Bandits as a Partial Monitoring Game
par: Gajane, Pratik, et autres
Publié: (2015)

Recycling History: Efficient Recommendations from Contextual Dueling Bandits
par: Sankagiri, Suryanarayana, et autres
Publié: (2025)

Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions
par: Kang, Yue, et autres
Publié: (2025)

Feel-Good Thompson Sampling for Contextual Dueling Bandits
par: Li, Xuheng, et autres
Publié: (2024)

Linear Causal Bandits: Unknown Graph and Soft Interventions
par: Yan, Zirui, et autres
Publié: (2024)

Infrequent Exploration in Linear Bandits
par: Lee, Harin, et autres
Publié: (2025)

Active Human Feedback Collection via Neural Contextual Dueling Bandits
par: Verma, Arun, et autres
Publié: (2025)

When Can We Track Significant Preference Shifts in Dueling Bandits?
par: Suk, Joe, et autres
Publié: (2023)

Non-Stationary Dueling Bandits Under a Weighted Borda Criterion
par: Suk, Joe, et autres
Publié: (2024)

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

Neural Dueling Bandits: Preference-Based Optimization with Human Feedback
par: Verma, Arun, et autres
Publié: (2024)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
par: Di, Qiwei, et autres
Publié: (2023)

Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback
par: Liu, Haolin, et autres
Publié: (2024)

Lipschitz Dueling Bandits over Continuous Action Spaces
par: Sharma, Mudit, et autres
Publié: (2026)

Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
par: Zhao, Canzhe, et autres
Publié: (2025)

Preference is More Than Comparisons: Rethinking Dueling Bandits with Augmented Human Feedback
par: Wang, Shengbo, et autres
Publié: (2025)