5 citations · 8 across the 8 of their papers we have counts for
6 papers · 1 filter
Fast and Efficient Matching Algorithm with Deadline Instances
Zhao Song, Weixin Wang, Chenbo Yin +1
The online weighted matching problem is a fundamental problem in machine learning due to its numerous applications. Despite many efforts in this area, existing algorithms are eithe…
Faster Sinkhorn's Algorithm with Small Treewidth
Zhao Song, Tianyi Zhou
Computing optimal transport (OT) distances such as the earth mover's distance is a fundamental problem in machine learning, statistics, and computer vision. In this paper, we study…
A Faster -means++ Algorithm
Jiehao Liang, Somdeb Sarkhel, Zhao Song +3
-means++ is an important algorithm for choosing initial cluster centers for the -means clustering algorithm. In this work, we present a new algorithm that can solve the -m…
Faster Algorithm for Structured John Ellipsoid Computation
Yang Cao, Xiaoyu Li, Zhao Song +2
The famous theorem of Fritz John states that any convex body has a unique maximal volume inscribed ellipsoid, known as the John Ellipsoid. Computing the John Ellipsoid is a fundame…
A Nearly Optimal Size Coreset Algorithm with Nearly Linear Time
Yichuan Deng, Zhao Song, Yitan Wang +1
A coreset is a point set containing information about geometric properties of a larger point set. A series of previous works show that in many machine learning problems, especially…
Sublinear Time Algorithm for Online Weighted Bipartite Matching
Hang Hu, Zhao Song, Runzhou Tao +3
Online bipartite matching is a fundamental problem in online algorithms. The goal is to match two sets of vertices to maximize the sum of the edge weights, where for one set of ver…