{"total":22,"rows":[{"id":"2404.06013","title":"Feel-Good Thompson Sampling for Contextual Dueling Bandits","created":"2024-04-09","cited_by_count":27,"area":null},{"id":"2310.00968","title":"Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits","created":"2023-10-02","cited_by_count":22,"area":null},{"id":"2310.18701","title":"Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards","created":"2023-10-28","cited_by_count":11,"area":null},{"id":"2510.00841","title":"LLM Routing with Dueling Feedback","created":"2025-10-01","cited_by_count":7,"area":null},{"id":"2405.03059","title":"Active Preference Learning for Ordering Items In- and Out-of-sample","created":"2024-05-05","cited_by_count":6,"area":null},{"id":"2407.18488","title":"Conversational Dueling Bandits in Generalized Linear Models","created":"2024-07-26","cited_by_count":5,"area":null},{"id":"2402.18917","title":"Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization","created":"2024-02-29","cited_by_count":4,"area":null},{"id":"2312.17229","title":"Think Before You Duel: Understanding Complexities of Preference Learning under Constrained Resources","created":"2023-12-28","cited_by_count":3,"area":null},{"id":"2502.02079","title":"Online Clustering of Dueling Bandits","created":"2025-02-04","cited_by_count":3,"area":null},{"id":"2509.24701","title":"FedPOB: Sample-Efficient Federated Prompt Optimization via Bandits","created":"2025-09-29","cited_by_count":3,"area":null},{"id":"2502.01085","title":"Federated Linear Dueling Bandits","created":"2025-02-03","cited_by_count":2,"area":null},{"id":"2506.01250","title":"Neural Variance-aware Dueling Bandits with Deep Representation and Shallow Exploration","created":"2025-06-02","cited_by_count":2,"area":null},{"id":"2403.15045","title":"DP-Dueling: Learning from Preference Feedback without Compromising User Privacy","created":"2024-03-22","cited_by_count":1,"area":null},{"id":"2502.20033","title":"Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization","created":"2025-02-27","cited_by_count":1,"area":null},{"id":"2310.00750","title":"Identifying Copeland Winners in Dueling Bandits with Indifferences","created":"2023-10-01","cited_by_count":0,"area":null},{"id":"2508.18841","title":"Recycling History: Efficient Recommendations from Contextual Dueling Bandits","created":"2025-08-26","cited_by_count":0,"area":null},{"id":"2512.14263","title":"DT-PBO: an Interpretable Tree-based Surrogate Model for Preferential Bayesian Optimization","created":"2025-12-16","cited_by_count":0,"area":null},{"id":"2604.25025","title":"A Finite Time Analysis of Thompson Sampling for Bayesian Optimization with Preferential Feedback","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2605.01752","title":"Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions","created":"2026-05-03","cited_by_count":0,"area":null},{"id":"2609.39351","title":"On the Complexity of Preference-Based Bandits","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.03824","title":"Targeted Active Learning for Preference-Based Treatment Effects on Multivariate Outcomes","created":"2026-10-02","cited_by_count":0,"area":null},{"id":"2610.17203","title":"Online LLM Personalization from Pairwise Preferences Across Users","created":"2026-10-12","cited_by_count":0,"area":null}],"next_cursor":null}