Picture for Rong Ge

Rong Ge

Clemson University

The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure

Add code
Apr 29, 2019
Figure 1 for The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure
Figure 2 for The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure
Figure 3 for The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure
Figure 4 for The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure
Viaarxiv icon

Stochastic Gradient Descent Escapes Saddle Points Efficiently

Add code
Feb 13, 2019
Figure 1 for Stochastic Gradient Descent Escapes Saddle Points Efficiently
Figure 2 for Stochastic Gradient Descent Escapes Saddle Points Efficiently
Figure 3 for Stochastic Gradient Descent Escapes Saddle Points Efficiently
Figure 4 for Stochastic Gradient Descent Escapes Saddle Points Efficiently
Viaarxiv icon

A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm

Add code
Feb 11, 2019
Viaarxiv icon

Understanding Composition of Word Embeddings via Tensor Decomposition

Add code
Feb 02, 2019
Figure 1 for Understanding Composition of Word Embeddings via Tensor Decomposition
Figure 2 for Understanding Composition of Word Embeddings via Tensor Decomposition
Figure 3 for Understanding Composition of Word Embeddings via Tensor Decomposition
Figure 4 for Understanding Composition of Word Embeddings via Tensor Decomposition
Viaarxiv icon

Simulated Tempering Langevin Monte Carlo II: An Improved Proof using Soft Markov Chain Decomposition

Add code
Nov 29, 2018
Figure 1 for Simulated Tempering Langevin Monte Carlo II: An Improved Proof using Soft Markov Chain Decomposition
Viaarxiv icon

High-Dimensional Robust Mean Estimation in Nearly-Linear Time

Add code
Nov 23, 2018
Figure 1 for High-Dimensional Robust Mean Estimation in Nearly-Linear Time
Viaarxiv icon

Stronger generalization bounds for deep nets via a compression approach

Add code
Nov 05, 2018
Figure 1 for Stronger generalization bounds for deep nets via a compression approach
Figure 2 for Stronger generalization bounds for deep nets via a compression approach
Figure 3 for Stronger generalization bounds for deep nets via a compression approach
Figure 4 for Stronger generalization bounds for deep nets via a compression approach
Viaarxiv icon

Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulator

Add code
Oct 21, 2018
Figure 1 for Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulator
Viaarxiv icon

On the Local Minima of the Empirical Risk

Add code
Oct 17, 2018
Figure 1 for On the Local Minima of the Empirical Risk
Figure 2 for On the Local Minima of the Empirical Risk
Figure 3 for On the Local Minima of the Empirical Risk
Figure 4 for On the Local Minima of the Empirical Risk
Viaarxiv icon

Learning Two-layer Neural Networks with Symmetric Inputs

Add code
Oct 16, 2018
Figure 1 for Learning Two-layer Neural Networks with Symmetric Inputs
Figure 2 for Learning Two-layer Neural Networks with Symmetric Inputs
Figure 3 for Learning Two-layer Neural Networks with Symmetric Inputs
Figure 4 for Learning Two-layer Neural Networks with Symmetric Inputs
Viaarxiv icon