55 citations · 109 across the 10 of their papers we have counts for
11 papers
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…
The Energy Complexity of Las Vegas Leader Election
Yi-Jun Chang, Shunhua Jiang
We consider the time and energy complexities of randomized leader election in a multiple-access channel, where the number of devices is unknown. It is well-known that for…
A Faster Interior-Point Method for Sum-of-Squares Optimization
Shunhua Jiang, Bento Natura, Omri Weinstein
We present a faster interior-point method for optimizing sum-of-squares (SOS) polynomials, which are a central tool in polynomial optimization and capture convex programming in the…
The Complexity of Dynamic Least-Squares Regression
Shunhua Jiang, Binghui Peng, Omri Weinstein
We settle the complexity of dynamic least-squares regression (LSR), where rows and labels can be adaptively inserted and/or deleted, and the…
Fast Graph Neural Tangent Kernel via Kronecker Sketching
Shunhua Jiang, Yunze Man, Zhao Song +2
Many deep learning tasks have to deal with graphs (e.g., protein structures, social networks, source code abstract syntax trees). Due to the importance of these tasks, people turne…
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election
Yi-Jun Chang, Ran Duan, Shunhua Jiang
We consider the energy complexity of the leader election problem in the single-hop radio network model, where each device has a unique identifier in . Energy i…
Tight Revenue Gaps among Multi-Unit Mechanisms
Yaonan Jin, Shunhua Jiang, Pinyan Lu +1
This paper considers Bayesian revenue maximization in the -unit setting, where a monopolist seller has copies of an indivisible item and faces unit-demand buyers (whose…
Solving SDP Faster: A Robust IPM Framework and Efficient Implementation
Baihe Huang, Shunhua Jiang, Zhao Song +2
This paper introduces a new robust interior point method analysis for semidefinite programming (SDP). This new robust analysis can be combined with either logarithmic barrier or hy…
Faster Dynamic Matrix Inverse for Faster LPs
Shunhua Jiang, Zhao Song, Omri Weinstein +1
Motivated by recent Linear Programming solvers, we design dynamic data structures for maintaining the inverse of an real matrix under updates, with…
A Faster External Memory Priority Queue with DecreaseKeys
Shunhua Jiang, Kasper Green Larsen
A priority queue is a fundamental data structure that maintains a dynamic set of (key, priority)-pairs and supports Insert, Delete, ExtractMin and DecreaseKey operations. In the ex…
Learning Gradient Descent: Better Generalization and Longer Horizons
Kaifeng Lv, Shunhua Jiang, Jian Li
Training deep neural networks is a highly nontrivial task, involving carefully selecting appropriate training algorithms, scheduling step sizes and tuning other hyperparameters. Tr…