2 citations · 2 across the 5 of their papers we have counts for
5 papers
On the Complexity of First-Order Methods in Stochastic Bilevel Optimization
Jeongyeol Kwon, Dohyun Kwon, Hanbaek Lyu
We consider the problem of finding stationary points in Bilevel optimization when the lower-level problem is unconstrained and strongly convex. The problem has been extensively stu…
Four-parameter coalescing ballistic annihilation
Kimberly Affeld, Christian Dean, Matthew Junge +3
In coalescing ballistic annihilation, infinitely many particles move with fixed velocities across the real line and, upon colliding, either mutually annihilate or generate a new pa…
Exponentially Convergent Algorithms for Supervised Matrix Factorization
Joowon Lee, Hanbaek Lyu, Weixin Yao
Supervised matrix factorization (SMF) is a classical machine learning method that simultaneously seeks feature extraction and classification tasks, which are not necessarily a prio…
Complexity of Block Coordinate Descent with Proximal Regularization and Applications to Wasserstein CP-dictionary Learning
Dohyun Kwon, Hanbaek Lyu
We consider the block coordinate descent methods of Gauss-Seidel type with proximal regularization (BCD-PR), which is a classical method of minimizing general nonconvex objectives…
A Note on Graph Characteristics and Hadwiger's Conjecture
Hanbaek Lyu
This is a note on three graph parameters motivated by the Euler-Poincare characteristic for simplicial complex. We show those three graph parameters of a given connected graph …