5 papers
Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors
Kapilan Balagopalan, Yinan Li, Yao Zhao +4
The best-arm identification (BAI) problem is one of the most fundamental problems in interactive machine learning, which has two flavors: the fixed-budget setting (FB) and the fixe…
Training-Free Cultural Alignment of Large Language Models via Persona Disagreement
Huynh Trung Kiet, Dao Sy Duy Minh, Tuan Nguyen +5
Large language models increasingly mediate decisions that turn on moral judgement, yet a growing body of evidence shows that their implicit preferences are not culturally neutral.…
-Good Action Identification in Fixed-Budget Monte Carlo Tree Search
Yinan Li, Tuan Nguyen, Kwang-Sung Jun
We study the fixed-budget max-min action identification problem in depth-2 max-min trees, an important special case of Monte Carlo Tree Search. A learner sequentially allocates …
Fixing the Loose Brake: Exponential-Tailed Stopping Time in Best Arm Identification
Kapilan Balagopalan, Tuan Ngo Nguyen, Yao Zhao +1
The best arm identification problem requires identifying the best alternative (i.e., arm) in active experimentation using the smallest number of experiments (i.e., arm pulls), whic…
HAVER: Instance-Dependent Error Bounds for Maximum Mean Estimation and Applications to Q-Learning and Monte Carlo Tree Search
Tuan Ngo Nguyen, Jay Barrett, Kwang-Sung Jun
We study the problem of estimating the \emph{value} of the largest mean among K distributions via samples from them (rather than estimating \emph{which} distribution has the larges…