Imagen de Portada

When Can We Track Significant Preference Shifts in Dueling Bandits?

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Suk, Joe, Agarwal, Arpit
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Non-Stationary Dueling Bandits Under a Weighted Borda Criterion
por: Suk, Joe, et al.
Publicado: (2024)

Tracking Most Significant Shifts in Infinite-Armed Bandits
por: Suk, Joe, et al.
Publicado: (2025)

Neural Dueling Bandits: Preference-Based Optimization with Human Feedback
por: Verma, Arun, et al.
Publicado: (2024)

Adaptive Smooth Non-Stationary Bandits
por: Suk, Joe
Publicado: (2024)

Federated Linear Dueling Bandits
por: Huang, Xuhan, et al.
Publicado: (2025)

Preference is More Than Comparisons: Rethinking Dueling Bandits with Augmented Human Feedback
por: Wang, Shengbo, et al.
Publicado: (2025)

Online Clustering of Dueling Bandits
por: Wang, Zhiyong, et al.
Publicado: (2025)

Multi-Player Approaches for Dueling Bandits
por: Raveh, Or, et al.
Publicado: (2024)

Biased Dueling Bandits with Stochastic Delayed Feedback
por: Yi, Bongsoo, et al.
Publicado: (2024)

The Sampling Complexity of Condorcet Winner Identification in Dueling Bandits
por: Saad, El Mehdi, et al.
Publicado: (2026)

Conversational Dueling Bandits in Generalized Linear Models
por: Yang, Shuhua, et al.
Publicado: (2024)

Fusing Reward and Dueling Feedback in Stochastic Bandits
por: Wang, Xuchuang, et al.
Publicado: (2025)

Linear and Neural Dueling Bandits with Delayed Feedback
por: Wang, Xiangyi, et al.
Publicado: (2026)

Online Recommendations for Agents with Discounted Adaptive Preferences
por: Agarwal, Arpit, et al.
Publicado: (2023)

Utility-based Dueling Bandits as a Partial Monitoring Game
por: Gajane, Pratik, et al.
Publicado: (2015)

Recycling History: Efficient Recommendations from Contextual Dueling Bandits
por: Sankagiri, Suryanarayana, et al.
Publicado: (2025)

Best-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda Objectives
por: Akash, S, et al.
Publicado: (2026)

Feel-Good Thompson Sampling for Contextual Dueling Bandits
por: Li, Xuheng, et al.
Publicado: (2024)

Semi-Bandit Learning for Monotone Stochastic Optimization
por: Agarwal, Arpit, et al.
Publicado: (2023)

Active Human Feedback Collection via Neural Contextual Dueling Bandits
por: Verma, Arun, et al.
Publicado: (2025)

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

Neural Variance-aware Dueling Bandits with Deep Representation and Shallow Exploration
por: Oh, Youngmin, et al.
Publicado: (2025)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
por: Di, Qiwei, et al.
Publicado: (2023)

Lipschitz Dueling Bandits over Continuous Action Spaces
por: Sharma, Mudit, et al.
Publicado: (2026)

Beyond Numeric Rewards: In-Context Dueling Bandits with LLM Agents
por: Xia, Fanzeng, et al.
Publicado: (2024)

Multi-User Dueling Bandits: A Fair Approach using Nash Social Welfare
por: Ahmed, Maheed H., et al.
Publicado: (2026)

Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions
por: Oh, Youngmin
Publicado: (2026)

Latent Preference Bandits
por: Mwai, Newton, et al.
Publicado: (2025)

DP-Dueling: Learning from Preference Feedback without Compromising User Privacy
por: Saha, Aadirupa, et al.
Publicado: (2024)

LLM Routing with Dueling Feedback
por: Chiang, Chao-Kai, et al.
Publicado: (2025)

Creator Incentives in Recommender Systems: A Cooperative Game-Theoretic Approach for Stable and Fair Collaboration in Multi-Agent Bandits
por: Krishnamurthy, Ramakrishnan, et al.
Publicado: (2026)

Multi-Armed Bandits with Network Interference
por: Agarwal, Abhineet, et al.
Publicado: (2024)

Riemannian Dueling Optimization
por: Ren, Yuxuan, et al.
Publicado: (2026)

An Efficient Variant of One-Class SVM with Lifelong Online Learning Guarantees
por: Suk, Joe, et al.
Publicado: (2025)

Queueing Matching Bandits with Preference Feedback
por: Kim, Jung-hun, et al.
Publicado: (2024)

Duel-Evolve: Reward-Free Test-Time Scaling via LLM Self-Preferences
por: Karlekar, Sweta, et al.
Publicado: (2026)

When Can Proxies Improve the Sample Complexity of Preference Learning?
por: Zhu, Yuchen, et al.
Publicado: (2024)

Misalignment, Learning, and Ranking: Harnessing Users Limited Attention
por: Agarwal, Arpit, et al.
Publicado: (2024)

What Do We Care About in Bandits with Noncompliance? BRACE: Bandits with Recommendations, Abstention, and Certified Effects
por: Della Penna, Nicolás
Publicado: (2026)

Dueling Deep Reinforcement Learning for Financial Time Series
por: Giorgio, Bruno
Publicado: (2025)