5 citations · 9 across the 9 of their papers we have counts for
10 papers
-Approximation Algorithms for Bipartiteness Ratio
Tasuku Soma, Mingquan Ye, Yuichi Yoshida
We propose an -approximation algorithm for the bipartiteness ratio of undirected graphs introduced by Trevisan (SIAM Journal on Computing, vol. 41, no. 6, 2012), where $…
Streaming Semidefinite Programs: Passes, Small Space and Fast Runtime
Zhao Song, Mingquan Ye, Lichen Zhang
We study the problem of solving semidefinite programs (SDP) in the streaming model. Specifically, constraint matrices and a target matrix , all of size together…
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…
High-Accuracy Multicommodity Flows via Iterative Refinement
Li Chen, Mingquan Ye
The multicommodity flow problem is a classic problem in network flow and combinatorial optimization, with applications in transportation, communication, logistics, and supply chain…
A Nearly-Optimal Bound for Fast Regression with Guarantee
Zhao Song, Mingquan Ye, Junze Yin +1
Given a matrix and a vector , we consider the regression problem with guarantees: finding a vector $x'\in \mathbb{R}^…
A Data-dependent Approach for High Dimensional (Robust) Wasserstein Alignment
Hu Ding, Wenjie Liu, Mingquan Ye
Many real-world problems can be formulated as the alignment between two geometric patterns. Previously, a great amount of research focus on the alignment of 2D or 3D patterns in th…
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing
Goran Zuzic, Gramoz Goranci, Mingquan Ye +2
We provide universally-optimal distributed graph algorithms for -approximate shortest path problems including shortest-path-tree and transshipment. The universal o…
Minor Sparsifiers and the Distributed Laplacian Paradigm
Sebastian Forster, Gramoz Goranci, Yang P. Liu +3
We study distributed algorithms built around minor-based vertex sparsifiers, and give the first algorithm in the CONGEST model for solving linear systems in graph Laplacian matrice…
On Geometric Alignment in Low Doubling Dimension
Hu Ding, Mingquan Ye
In real-world, many problems can be formulated as the alignment between two geometric patterns. Previously, a great amount of research focus on the alignment of 2D or 3D patterns,…
A Novel Geometric Approach for Outlier Recognition in High Dimension
Hu Ding, Mingquan Ye
Outlier recognition is a fundamental problem in data analysis and has attracted a great deal of attention in the past decades. However, most existing methods still suffer from seve…