← Search

Kyoungseok Jang

7 accepted papers

2025

GL-LowPopArt: A Nearly Instance-Wise Minimax-Optimal Estimator for Generalized Low-Rank Trace Regression

ICML 2025spotlight

We present `GL-LowPopArt`, a novel Catoni-style estimator for generalized low-rank trace regression. Building on `LowPopArt` (Jang et al., 2024), it employs a two-stage approach: nuclear norm regularization followed by matrix Catoni estimation. We establish state-of-the-art estimation error bounds,…

Cited by 0SourcePDFScholar
2024

Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits

ICML 2024poster

We study low-rank matrix trace regression and the related problem of low-rank matrix bandits. Assuming access to the distribution of the covariates, we propose a novel low-rank matrix estimation method called *LowPopArt* and provide its recovery guarantee that depends on a novel quantity denoted by…

2024

Fixed Confidence Best Arm Identification in the Bayesian Setting

NeurIPS 2024poster

We consider the fixed-confidence best arm identification (FC-BAI) problem in the Bayesian setting. This problem aims to find the arm of the largest mean with a fixed confidence level when the bandit model has been sampled from the known prior. Most studies on the FC-BAI problem have been conducted…

Cited by 0SourcePDFScholar
2024

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries

NeurIPS 2024poster

We study stochastic linear bandits where, in each round, the learner receives a set of actions (i.e., feature vectors), from which it chooses an element and obtains a stochastic reward. The expected reward is a fixed but unknown linear function of the chosen action. We study \emph{sparse} regret bou…

Cited by 1SourcePDFScholar
2022

PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits

NeurIPS 2022accept

In sparse linear bandits, a learning agent sequentially selects an action from a fixed action set and receives reward feedback, and the reward function depends linearly on a few coordinates of the covariates of the actions. This has applications in many real-world sequential decision making problems…

2021

Improved Regret Bounds of Bilinear Bandits using Action Space Analysis

ICML 2021spotlight

We consider the bilinear bandit problem where the learner chooses a pair of arms, each from two different action spaces of dimension $d_1$ and $d_2$, respectively. The learner then receives a reward whose expectation is a bilinear function of the two chosen arms with an unknown matrix parameter $\Th…

Cited by 10SourcePDFScholar