274 citations · 3.1k across the 75 of their papers we have counts for
7 papers · 1 filter
Estimating Normalizing Constants for Log-Concave Distributions: Algorithms and Lower Bounds
Rong Ge, Holden Lee, Jianfeng Lu
Estimating the normalizing constant of an unnormalized probability distribution has important applications in computer science, statistical physics, machine learning, and statistic…
Online Service with Delay
Yossi Azar, Arun Ganesh, Rong Ge +1
In this paper, we introduce the online service with delay problem. In this problem, there are points in a metric space that issue service requests over time, and a server that…
Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms
Rong Ge, Tengyu Ma
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up…
More Algorithms for Provable Dictionary Learning
Sanjeev Arora, Aditya Bhaskara, Rong Ge +1
In dictionary learning, also known as sparse coding, the algorithm is given samples of the form where is an unknown random sparse vector and is an…
New Algorithms for Learning Incoherent and Overcomplete Dictionaries
Sanjeev Arora, Rong Ge, Ankur Moitra
In sparse recovery we are given a matrix (the dictionary) and a vector of the form where is sparse, and the goal is to recover . This is a central notion in signal…
Towards a better approximation for sparsest cut?
Sanjeev Arora, Rong Ge, Ali Kemal Sinop
We give a new -approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size expand by a factor $\sqr…