1 citations · 2 across the 9 of their papers we have counts for
9 papers
Classical and Quantum Speedups for Non-Convex Optimization via Energy Conserving Descent
Yihang Sun, Huaijin Wang, Patrick Hayden +1
We present the first analytical study of ECD, focusing on the one-dimensional setting for this first installment. We formalize a stochastic ECD dynamics (sECD) with energy-preservi…
Optimal Quantum Speedups for Repeatedly Nested Expectation Estimation
Yihang Sun, Guanyang Wang, Jose Blanchet
We study the estimation of repeatedly nested expectations (RNEs) with a constant horizon (number of nestings) using quantum computing. We propose a quantum algorithm that achieves…
Computation of Approximately Stable Committees in Approval-based Elections
Drew Gao, Yihang Sun, Jan Vondrák
Approval-based committee selection is a model of significant interest in social choice theory. In this model, we have a set of voters , a set of candidates $\mathcal{C…
On the number of modes of Gaussian kernel density estimators
Borjan Geshkovski, Philippe Rigollet, Yihang Sun
We consider the Gaussian kernel density estimator with bandwidth of iid Gaussian samples. Using the Kac-Rice formula and an Edgeworth expansion, we prove that th…
Tetrahedra tiling problem
A. Anas Chentouf, Yihang Sun
Kedlaya, Kolpakov, Poonen, and Rubinstein classified tetrahedra all of whose dihedral angles are rational multiples of into two one-parameter families (a Hill family and a new…
Dehn invariant zero tetrahedra
A. Anas Chentouf, Yihang Sun
We survey literature on all known families and examples of Dehn invariant zero tetrahedra. We also contribute two previously unknown families of Dehn invariant zero tetrahedra. Fol…
Rainbow common graphs must be forests
Yihang Sun
We study the rainbow version of the graph commonness property: a graph is -rainbow common if the number of rainbow copies of (where all edges have distinct colors) in an…
Size of the largest sum-free subset of and
Saba Lepsveridze, Yihang Sun
We determine the density of the largest sum-free subset of the lattice cube for and . This solves a conjecture of Cameron and Aydinian in dime…
Randomly Initialized One-Layer Neural Networks Make Data Linearly Separable
Promit Ghosal, Srinath Mahankali, Yihang Sun
Recently, neural networks have demonstrated remarkable capabilities in mapping two arbitrary sets to two linearly separable sets. The prospect of achieving this with randomly initi…