Mingquan Ye

collaborators

2 papers

cs.DS2025

$O (lo g n)$ -Approximation Algorithms for Bipartiteness Ratio

Tasuku Soma, Mingquan Ye, Yuichi Yoshida

We propose an $O (lo g n)$ -approximation algorithm for the bipartiteness ratio of undirected graphs introduced by Trevisan (SIAM Journal on Computing, vol. 41, no. 6, 2012), where $…

cs.LG2025

Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation

Zhao Song, Mingquan Ye, Junze Yin +1

Weighted low rank approximation is a fundamental problem in numerical linear algebra, and it has many applications in machine learning. Given a matrix $M \in \mathbb{R}^{n \times n…

O(logn)-Approximation Algorithms for Bipartiteness Ratio

Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation

$O (lo g n)$ -Approximation Algorithms for Bipartiteness Ratio