paper-with-me

Papers

Multi-Source Test-Time Adaptation as Dueling Bandits for Extractive Question Answering

2023-06-11 · Hai Ye, Qizhe Xie, Hwee Tou Ng

In this work, we study multi-source test-time model adaptation from user feedback, where K distinct models are established for adaptation. To allow efficient adaptation, we cast the problem as a stochastic decision-making process, aiming to determine the best adapted model after adaptation. We discuss two frameworks: multi-armed bandit learning and multi-armed dueling bandits. Compared to multi-armed bandit learning, the dueling framework allows pairwise collaboration among K models, which is solved by a novel method named Co-UCB proposed in this work. Experiments on six datasets of extractive question answering (QA) show that the dueling framework using Co-UCB is more effective than other strong baselines for our studied problem.

📄 PDF Abstract BibTeX arXiv:2306.06779

Code (1)

oceanypt/multi-source-tta 공식 구현 pytorch

Tasks

Decision MakingExtractive Question-AnsweringQuestion AnsweringTest-time Adaptation

Similar Papers 제목 키워드 기반

Combinatorial Pure Exploration for Dueling Bandit

2020-01-01 · ICML 2020 1 · Wei Chen, Yihan Du, Longbo Huang, Haoyu Zhao

In this paper, we study combinatorial pure exploration for dueling bandits (CPE-DB): we have multiple candidates for multiple positions as modeled by a bipartite graph, and in each round we sample a duel of two candidate…

Position

Combinatorial Pure Exploration of Dueling Bandit

2020-06-23 · Wei Chen, Yihan Du, Longbo Huang, Haoyu Zhao

In this paper, we study combinatorial pure exploration for dueling bandits (CPE-DB): we have multiple candidates for multiple positions as modeled by a bipartite graph, and in each round we sample a duel of two candidate…

Position

Few-shot time-series anomaly detection with unsupervised domain adaptation

2023-11-01 · journal 2023 11 · Hongbo Li, Wenli Zheng, Feilong Tang, Yanmin Zhu 외

Anomaly detection for time-series data is crucial in the management of systems for streaming applications, computational services, and cloud platforms. The majority of current few-shot learning (FSL) approaches are suppo…

Anomaly DetectionDomain AdaptationFew-Shot LearningTime Series+4

Dueling Bandits: From Two-dueling to Multi-dueling

2022-11-16 · Yihan Du, Siwei Wang, Longbo Huang

We study a general multi-dueling bandit problem, where an agent compares multiple options simultaneously and aims to minimize the regret due to selecting suboptimal arms. This setting generalizes the traditional two-duel…

Vocal Bursts Valence Prediction

Linear and Neural Dueling Bandits with Delayed Feedback

2026-05-26 · Xiangyi Wang, Pingchen Lu, Jie Mao, Mingze Kong 외 arxiv

Contextual dueling bandits form a cornerstone of preference-based decision-making, with critical applications in recommender systems and large language model alignment. However, standard algorithms rely on the idealized …