{"total":33,"rows":[{"id":"2111.12306","title":"Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability","created":"2021-11-24","cited_by_count":44,"area":null},{"id":"2202.04593","title":"Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Models","created":"2022-02-09","cited_by_count":37,"area":null},{"id":"2404.06013","title":"Feel-Good Thompson Sampling for Contextual Dueling Bandits","created":"2024-04-09","cited_by_count":27,"area":null},{"id":"2302.01513","title":"Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processes","created":"2023-02-03","cited_by_count":19,"area":null},{"id":"2402.05367","title":"Principled Preferential Bayesian Optimization","created":"2024-02-08","cited_by_count":16,"area":null},{"id":"2105.11802","title":"Bias-Robust Bayesian Optimization via Dueling Bandits","created":"2021-05-25","cited_by_count":11,"area":null},{"id":"2202.11795","title":"Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits","created":"2022-02-23","cited_by_count":11,"area":null},{"id":"2202.10660","title":"Batched Dueling Bandits","created":"2022-02-22","cited_by_count":10,"area":null},{"id":"2111.03917","title":"Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits","created":"2021-11-06","cited_by_count":9,"area":null},{"id":"2210.14322","title":"ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits","created":"2022-10-25","cited_by_count":8,"area":null},{"id":"2306.13104","title":"Human-in-the-Loop Optimization for Deep Stimulus Encoding in Visual Prostheses","created":"2023-06-16","cited_by_count":8,"area":null},{"id":"2510.13907","title":"LLM Prompt Duel Optimizer: Efficient Label-Free Prompt Optimization","created":"2025-10-14","cited_by_count":8,"area":null},{"id":"2302.03805","title":"Eliciting User Preferences for Personalized Multi-Objective Decision Making through Comparative Feedback","created":"2023-02-07","cited_by_count":7,"area":null},{"id":"2210.02562","title":"Dueling Convex Optimization with General Preferences","created":"2022-09-27","cited_by_count":6,"area":null},{"id":"2306.06779","title":"Multi-Source Test-Time Adaptation as Dueling Bandits for Extractive Question Answering","created":"2023-06-11","cited_by_count":6,"area":null},{"id":"2107.02274","title":"Dueling Bandits with Adversarial Sleeping","created":"2021-07-05","cited_by_count":5,"area":null},{"id":"2110.09361","title":"Efficient Exploration in Binary and Preferential Bayesian Optimization","created":"2021-10-18","cited_by_count":5,"area":null},{"id":"2211.10293","title":"Dueling Bandits: From Two-dueling to Multi-dueling","created":"2022-11-16","cited_by_count":4,"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":"2202.01879","title":"Learning from a Learning User for Optimal Recommendations","created":"2022-02-03","cited_by_count":3,"area":null},{"id":"2210.14998","title":"One Arrow, Two Kills: An Unified Framework for Achieving Optimal Regret Guarantees in Sleeping Bandits","created":"2022-10-26","cited_by_count":3,"area":null},{"id":"2305.16074","title":"Combinatorial Bandits for Maximum Value Reward Function under Max Value-Index Feedback","created":"2023-05-25","cited_by_count":3,"area":null},{"id":"2312.11788","title":"Faster Convergence with Multiway Preferences","created":"2023-12-19","cited_by_count":3,"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":"2406.14699","title":"Preferential Multi-Objective Bayesian Optimization","created":"2024-06-20","cited_by_count":3,"area":null},{"id":"2603.09276","title":"On Regret Bounds of Thompson Sampling for Bayesian Optimization","created":"2026-03-10","cited_by_count":3,"area":null},{"id":"2209.12108","title":"An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem","created":"2022-09-25","cited_by_count":2,"area":null},{"id":"2103.02741","title":"Combinatorial Bandits without Total Order for Arms","created":"2021-03-03","cited_by_count":1,"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":"2406.12475","title":"Adversarial Multi-dueling Bandits","created":"2024-06-18","cited_by_count":1,"area":null},{"id":"2107.02738","title":"Dueling Bandits with Team Comparisons","created":"2021-07-06","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":"2606.01799","title":"Tree-Guided Identify-Then-Exploit: A Unified Framework of Best Arm Identification and Regret Minimization for Dueling Bandits","created":"2026-06-01","cited_by_count":0,"area":null}],"next_cursor":null}