Cong Ma

Orcid: 0000-0003-2532-0038

Affiliations:
  • University of Chicago, Department of Statistics, Chicago, IL, USA
  • University of California Berkeley, Department of Electrical Engineering and Computer Sciences, Berkeley, CA, USA
  • Princeton University, Department of Operations Research and Financial Engineering, Princeton, NJ, USA (PhD 2020)


According to our database1, Cong Ma authored at least 40 papers between 2015 and 2024.

Collaborative distances:

Timeline

2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
8
9
10
4
4
6
6
3
3
2
3
4
3
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
High-Probability Sample Complexities for Policy Evaluation With Linear Function Approximation.
IEEE Trans. Inf. Theory, August, 2024

Trans-Glasso: A Transfer Learning Approach to Precision Matrix Estimation.
CoRR, 2024

Random pairing MLE for estimation of item parameters in Rasch model.
CoRR, 2024

Batched Nonparametric Contextual Bandits.
CoRR, 2024

Off-policy estimation with adaptively collected data: the power of online learning.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Maximum Likelihood Estimation is All You Need for Well-Specified Covariate Shift.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Top-K ranking with a monotone adversary.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Optimal Tuning-Free Convex Relaxation for Noisy Matrix Completion.
IEEE Trans. Inf. Theory, October, 2023

Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled Gradient Descent, Even with Overparameterization.
CoRR, 2023

Unraveling Projection Heads in Contrastive Learning: Insights from Expansion and Shrinkage.
CoRR, 2023

Sharp high-probability sample complexities for policy evaluation with linear function approximation.
CoRR, 2023

Conformalized matrix completion.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Jump-Start Reinforcement Learning.
Proceedings of the International Conference on Machine Learning, 2023

The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing.
Proceedings of the International Conference on Machine Learning, 2023

O(T<sup>-1</sup> Convergence of Optimistic-Follow-the-Regularized-Leader in Two-Player Zero-Sum Markov Games.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimism.
IEEE Trans. Inf. Theory, 2022

Minimax Off-Policy Evaluation for Multi-Armed Bandits.
IEEE Trans. Inf. Theory, 2022

Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements.
J. Mach. Learn. Res., 2022

$O(T^{-1})$ Convergence of Optimistic-Follow-the-Regularized-Leader in Two-Player Zero-Sum Markov Games.
CoRR, 2022

Fast and Provable Tensor Robust Principal Component Analysis via Scaled Gradient Descent.
CoRR, 2022

Optimally tackling covariate shift in RKHS-based nonparametric regression.
CoRR, 2022

A new similarity measure for covariate shift with applications to nonparametric regression.
Proceedings of the International Conference on Machine Learning, 2022

Accelerating ILL-Conditioned Robust Low-Rank Tensor Regression.
Proceedings of the IEEE International Conference on Acoustics, 2022

Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Completion.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Low-Rank Matrix Recovery With Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number.
IEEE Trans. Signal Process., 2021

Beyond Procrustes: Balancing-Free Gradient Descent for Asymmetric Low-Rank Matrix Sensing.
IEEE Trans. Signal Process., 2021

Nonconvex Matrix Factorization From Rank-One Measurements.
IEEE Trans. Inf. Theory, 2021

Learning Mixtures of Low-Rank Models.
IEEE Trans. Inf. Theory, 2021

Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descent.
J. Mach. Learn. Res., 2021

Spectral Methods for Data Science: A Statistical Perspective.
Found. Trends Mach. Learn., 2021

2020
Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization.
SIAM J. Optim., 2020

Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution.
Found. Comput. Math., 2020

Bridging Convex and Nonconvex Optimization in Robust PCA: Noise, Outliers, and Missing Data.
CoRR, 2020

2019
Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval.
Math. Program., 2019

Inference and Uncertainty Quantification for Noisy Matrix Completion.
CoRR, 2019

A Selective Overview of Deep Learning.
CoRR, 2019

2018
Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval and Matrix Completion.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Fast and Flexible Top-<i>k</i> Similarity Search on Large Networks.
ACM Trans. Inf. Syst., 2017

Spectral Method and Regularized MLE Are Both Optimal for Top-$K$ Ranking.
CoRR, 2017

2015
Panther: Fast Top-k Similarity Search on Large Networks.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015


  Loading...