
A simpler strong refutation of random kXOR
Strong refutation of random CSPs is a fundamental question in theoretica...
read it

SGD with shuffling: optimal rates without component convexity and large epoch requirements
We study withoutreplacement SGD for solving finitesum optimization pro...
read it

From Proximal Point Method to Nesterov's Acceleration
The proximal point method (PPM) is a fundamental method in optimization ...
read it

On Tight Convergence Rates of Withoutreplacement SGD
For solving finitesum optimization problems, SGD without replacement sa...
read it

From Nesterov's Estimate Sequence to Riemannian Acceleration
We propose the first global accelerated gradient method for Riemannian m...
read it

Hypergraph Spectral Clustering in the Weighted Stochastic Block Model
Spectral clustering is a celebrated algorithm that partitions objects ba...
read it

Computing the maximum matching width is NPhard
The maximum matching width is a graph width parameter that is defined on...
read it

Community Recovery in Hypergraphs
Community recovery is a central problem that arises in a wide variety of...
read it
Kwangjun Ahn
is this you? claim profile