activity
20232026
collaborators

7 papers

cs.LG2026

Sign Betting for Misspecified Regression: Variance Adaptivity and Optimal Approximation

Yinan Li, Han Han, Kwang-Sung Jun

We study bounded regression under model misspecification, evaluating a function by its distance to the conditional mean , rather than the…

cs.LG2026

-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 …

cs.LG2026

Provably Efficient Regularized Online RLHF with Generalized Bilinear Preferences

Junghyun Lee, Minju Hong, Kwang-Sung Jun +2

We consider the problem of regularized best-response max-regret minimization in online RLHF under general preferences and bandit feedback. While various regularizers are utilized t…

stat.ML2026

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…

cs.LG2025

Second-Order Bounds for [0,1]-Valued Regression via Betting Loss

Yinan Li, Kwang-Sung Jun

We consider the -valued regression problem in the i.i.d. setting. In a related problem called cost-sensitive classification, \citet{foster21efficient} have shown that the lo…

stat.ML2024

Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization

Kwang-Sung Jun, Jungtaek Kim

Adapting to a priori unknown noise level is a very important but challenging problem in sequential decision-making as efficient exploration typically requires knowledge of the nois…

cs.LG2023

Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search

Alvin Chiu, Mithun Ghosh, Reyan Ahmed +3

Graph neural networks have been successful for machine learning, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman…