11 citations · 26 across the 25 of their papers we have counts for
14 papers · 1 filter
Hadamard Flattening and Gaussian Pooling Sketch for Least Squares with Coordinate-wise Guarantee
Zhao Song, Lichen Zhang
Randomized sketch-and-solve algorithms accelerate overconstrained regression by replacing the input with a smaller problem. Standard subspace embeddings guarantee that the…
A General Framework for Metropolis-Adjusted Dikin Walks: Dimension-Square Mixing on Polytopes and Log-Det Walks on Spectrahedra
Zhao Song, Lichen Zhang
We analyze exact-metric, Metropolis-adjusted Dikin walks by keeping the proposal determinant and reverse quadratic form together. Their leading uncentered terms cancel in the compl…
Sublinear Time Quantum Sensitivity Sampling
Zhao Song, David P. Woodruff, Lichen Zhang
We present a unified framework for quantum sensitivity sampling, extending the advantages of quantum computing to a broad class of classical approximation problems. Our unified fra…
On Differential Privacy for Adaptively Solving Search Problems via Sketching
Shiyuan Feng, Ying Feng, George Z. Li +3
Recently differential privacy has been used for a number of streaming, data structure, and dynamic graph problems as a means of hiding the internal randomness of the data structure…
Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk
Yuzhou Gu, Nikki Lijing Kuang, Yi-An Ma +2
We consider the problem of sampling from a -dimensional log-concave distribution for -Lipschitz , constrained to a convex body with an efficient…
On Differentially Private String Distances
Jerry Yao-Chieh Hu, Erzhi Liu, Han Liu +2
Given a database of bit strings , a fundamental data structure task is to estimate the distances between a given query with all the st…
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…
Convex Minimization with Integer Minima in Time
Haotian Jiang, Yin Tat Lee, Zhao Song +1
Given a convex function on with an integer minimizer, we show how to find an exact minimizer of using calls to a separation oracle and $O(n^4…
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}^…
Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance
Zhao Song, Xin Yang, Yuanyuan Yang +1
Projection maintenance is one of the core data structure tasks. Efficient data structures for projection maintenance have led to recent breakthroughs in many convex programming alg…
Dynamic Tensor Product Regression
Aravind Reddy, Zhao Song, Lichen Zhang
In this work, we initiate the study of \emph{Dynamic Tensor Product Regression}. One has matrices and a…
Accelerating Frank-Wolfe Algorithm using Low-Dimensional and Adaptive Data Structures
Zhao Song, Zhaozhuo Xu, Yuanyuan Yang +1
In this paper, we study the problem of speeding up a type of optimization algorithms called Frank-Wolfe, a conditional gradient method. We develop and employ two novel inner produc…
Speeding Up Sparsification using Inner Product Search Data Structures
Zhao Song, Zhaozhuo Xu, Lichen Zhang
We present a general framework that utilizes different efficient data structures to improve various sparsification problems involving an iterative process. We also provide insights…
Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching
S. Cliff Liu, Zhao Song, Hengjie Zhang +2
We study the problem of solving linear program in the streaming model. Given a constraint matrix and vectors , w…