62 citations · 151 across the 25 of their papers we have counts for
10 papers · 1 filter
Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing
Josh Alman, Jiehao Liang, Zhao Song +2
Over the last decade, deep neural networks have transformed our society, and they are already widely applied in various machine learning applications. State-of-art deep neural netw…
Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants
Andrew M. Childs, Tongyang Li, Jin-Peng Liu +2
Given a convex function , the problem of sampling from a distribution is called log-concave sampling. This task has wide app…
Quartic Samples Suffice for Fourier Interpolation
Zhao Song, Baocheng Sun, Omri Weinstein +1
We study the problem of interpolating a noisy Fourier-sparse signal in the time duration from noisy samples in the same range, where the ground truth signal can be any …
Quantum Speedups of Optimizing Approximately Convex Functions with Applications to Logarithmic Regret Stochastic Convex Bandits
Tongyang Li, Ruizhe Zhang
We initiate the study of quantum algorithms for optimizing approximately convex functions. Given a convex set and a function $F\colon\mathbb{R}^{n…
Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
Guoming Wang, Daniel Stilck França, Ruizhe Zhang +2
A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding…
A Faster Quantum Algorithm for Semidefinite Programming via Robust IPM Framework
Baihe Huang, Shunhua Jiang, Zhao Song +2
This paper studies a fundamental problem in convex optimization, which is to solve semidefinite programming (SDP) with high accuracy. This paper follows from the existing robust SD…
Fast Distance Oracles for Any Symmetric Norm
Yichuan Deng, Zhao Song, Omri Weinstein +1
In the Distance Oracle problem, the goal is to preprocess vectors in a -dimensional metric space into a cheap data st…
Improved Reconstruction for Fourier-Sparse Signals
Yeqi Gao, Zhao Song, Baocheng Sun +2
We revisit the classical problem of Fourier-sparse signal reconstruction -- a variant of the \emph{Set Query} problem -- which asks to efficiently reconstruct (a subset of) a -d…
Eigenstripping, Spectral Decay, and Edge-Expansion on Posets
Jason Gaitonde, Max Hopkins, Tali Kaufman +2
We study the relationship between the underlying structure of posets and the spectral and combinatorial properties of their higher-order random walks. While fast mixing of random w…
A Dynamic Low-Rank Fast Gaussian Transform
Baihe Huang, Zhao Song, Omri Weinstein +3
The \emph{Fast Gaussian Transform} (FGT) enables subquadratic-time multiplication of an Gaussian kernel matrix with…