1 citations · 2 across the 8 of their papers we have counts for
5 papers · 1 filter
The Price of Hidden Curvature: Improved Lower Bounds for Bandit Convex Optimization
Nived Rajaraman, Yanjun Han
We establish improved lower bounds on the minimax expected regret of stochastic bandit convex optimization for -Lipschitz functions on the -dimensional Euclidean ball. For ti…
Interactive Learning of Single-Index Models via Stochastic Gradient Descent
Nived Rajaraman, Yanjun Han
Stochastic gradient descent (SGD) is a cornerstone algorithm for high-dimensional optimization, renowned for its empirical successes. Recent theoretical advances have provided a de…
Universal priors: solving empirical Bayes via Bayesian inference and pretraining
Nick Cannella, Anzo Teh, Yanjun Han +1
We theoretically justify the recent empirical finding of [Teh et al., 2025] that a transformer pretrained on synthetically generated data achieves strong performance on empirical B…
Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits
Yuzhou Gu, Yanjun Han, Jian Qian
We study the evolution of information in interactive decision making through the lens of a stochastic multi-armed bandit problem. Focusing on a fundamental example where a unique o…
Online Estimation via Offline Estimation: An Information-Theoretic Framework
Dylan J. Foster, Yanjun Han, Jian Qian +1
The classical theory of statistical estimation aims to estimate a parameter of interest under data generated from a fixed design ("offline estimation"), while the contemporary t…