4 papers
Change Point Detection in Precision Matrices with D-trace Loss
Ying Lin, Benjamin Poignard, Ting Kei Pong +1
We consider the problem of estimating a time-varying sparse precision matrix, which is assumed to evolve in a piecewise constant manner. Building upon the Group Fused LASSO and LAS…
Projection onto hyperbolicity cones and beyond: a dual Frank-Wolfe approach
Takayuki Nagano, Bruno F. Lourenço, Akiko Takeda
We discuss the problem of projecting a point onto an arbitrary hyperbolicity cone from both theoretical and numerical perspectives. While hyperbolicity cones are furnished with a g…
Modified K-means Algorithm with Local Optimality Guarantees
Mingyi Li, Michael R. Metel, Akiko Takeda
The K-means algorithm is one of the most widely studied clustering algorithms in machine learning. While extensive research has focused on its ability to achieve a globally optimal…
The Adaptive Complexity of Finding a Stationary Point
Huanjian Zhou, Andi Han, Akiko Takeda +1
In large-scale applications, such as machine learning, it is desirable to design non-convex optimization algorithms with a high degree of parallelization. In this work, we study th…