Следене
Chi Jin
Chi Jin
Assistant Professor, Princeton University
Потвърден имейл адрес: princeton.edu - Начална страница
Заглавие
Позовавания
Позовавания
Година
Escaping from saddle points—online stochastic gradient for tensor decomposition
R Ge, F Huang, C Jin, Y Yuan
Conference on learning theory, 797-842, 2015
10032015
How to escape saddle points efficiently
C Jin, R Ge, P Netrapalli, SM Kakade, MI Jordan
International Conference on Machine Learning, 1724-1732, 2017
6902017
Is Q-learning provably efficient?
C Jin, Z Allen-Zhu, S Bubeck, MI Jordan
Advances in neural information processing systems 31, 2018
5542018
No spurious local minima in nonconvex low rank problems: A unified geometric analysis
R Ge, C Jin, Y Zheng
International Conference on Machine Learning, 1233-1242, 2017
3852017
Provably efficient reinforcement learning with linear function approximation
C Jin, Z Yang, Z Wang, MI Jordan
Conference on Learning Theory, 2137-2143, 2020
3552020
On gradient descent ascent for nonconvex-concave minimax problems
T Lin, C Jin, M Jordan
International Conference on Machine Learning, 6083-6093, 2020
2592020
What is local optimality in nonconvex-nonconcave minimax optimization?
C Jin, P Netrapalli, M Jordan
International conference on machine learning, 4880-4889, 2020
243*2020
Accelerated gradient descent escapes saddle points faster than gradient descent
C Jin, P Netrapalli, MI Jordan
Conference On Learning Theory, 1042-1085, 2018
2172018
Gradient descent can take exponential time to escape saddle points
SS Du, C Jin, JD Lee, MI Jordan, A Singh, B Poczos
Advances in neural information processing systems 30, 2017
2072017
Provably efficient exploration in policy optimization
Q Cai, Z Yang, C Jin, Z Wang
International Conference on Machine Learning, 1283-1294, 2020
1652020
Near-optimal algorithms for minimax optimization
T Lin, C Jin, MI Jordan
Conference on Learning Theory, 2738-2779, 2020
1442020
Stochastic cubic regularization for fast nonconvex optimization
N Tripuraneni, M Stern, C Jin, J Regier, MI Jordan
Advances in neural information processing systems 31, 2018
1402018
On nonconvex optimization for machine learning: Gradients, stochasticity, and saddle points
C Jin, P Netrapalli, R Ge, SM Kakade, MI Jordan
Journal of the ACM (JACM) 68 (2), 1-29, 2021
135*2021
Local maxima in the likelihood of gaussian mixture models: Structural results and algorithmic consequences
C Jin, Y Zhang, S Balakrishnan, MJ Wainwright, MI Jordan
Advances in neural information processing systems 29, 2016
1352016
Streaming pca: Matching matrix bernstein and near-optimal finite sample guarantees for oja’s algorithm
P Jain, C Jin, SM Kakade, P Netrapalli, A Sidford
Conference on learning theory, 1147-1164, 2016
1222016
Sampling can be faster than optimization
YA Ma, Y Chen, C Jin, N Flammarion, MI Jordan
Proceedings of the National Academy of Sciences 116 (42), 20881-20885, 2019
1142019
Faster eigenvector computation via shift-and-invert preconditioning
D Garber, E Hazan, C Jin, C Musco, P Netrapalli, A Sidford
International Conference on Machine Learning, 2626-2634, 2016
110*2016
Reward-free exploration for reinforcement learning
C Jin, A Krishnamurthy, M Simchowitz, T Yu
International Conference on Machine Learning, 4870-4879, 2020
982020
Provable meta-learning of linear representations
N Tripuraneni, C Jin, M Jordan
International Conference on Machine Learning, 10434-10443, 2021
922021
Provable efficient online matrix completion via non-convex stochastic gradient descent
C Jin, SM Kakade, P Netrapalli
Advances in Neural Information Processing Systems 29, 2016
922016
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20