Multi-Source Test-Time Adaptation as Dueling Bandits for Extractive Question Answering
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.
Code (1)
Tasks
Decision MakingExtractive Question-AnsweringQuestion AnsweringTest-time AdaptationSimilar Papers 제목 키워드 기반
Combinatorial Pure Exploration for Dueling Bandit
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…
PositionCombinatorial Pure Exploration of Dueling Bandit
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…
PositionFew-shot time-series anomaly detection with unsupervised domain adaptation
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+4Dueling Bandits: From Two-dueling to Multi-dueling
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 PredictionLinear and Neural Dueling Bandits with Delayed Feedback
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 …