← Search

Yen-Huan Li

7 accepted papers

2024

Fast Minimization of Expected Logarithmic Loss via Stochastic Dual Averaging

AISTATS 2024poster

Consider the problem of minimizing an expected logarithmic loss over either the probability simplex or the set of quantum density matrices. This problem includes tasks such as solving the Poisson inverse problem, computing the maximum-likelihood estimate for quantum state tomography, and approximati…

2023

Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness

NeurIPS 2023poster

This work introduces the first small-loss and gradual-variation regret bounds for online portfolio selection, marking the first instances of data-dependent bounds for online convex optimization with non-Lipschitz, non-smooth losses. The algorithms we propose exhibit sublinear regret rates in the wo…

Cited by 7SourcePDFScholar
2016

Frank-Wolfe works for non-Lipschitz continuous gradient objectives: Scalable poisson phase retrieval

ICASSP 2016accepted

We study a phase retrieval problem in the Poisson noise model. Motivated by the PhaseLift approach, we approximate the maximum-likelihood estimator by solving a convex program with a nuclear norm constraint. While the Frank-Wolfe algorithm, together with the Lanczos method, can efficiently deal with…

Cited by 0SourceScholar
2015

Sparsistency of \ell_1-Regularized M-Estimators

AISTATS 2015poster

We consider the model selection consistency or sparsistency of a broad set of \ell_1-regularized M-estimators for linear and non-linear statistical models in a unified fashion. For this purpose, we propose the local structured smoothness condition (LSSC) on the loss function. We provide a general re…

Cited by 32SourcePDFScholar