Tengyu Ma
Harbin University of Science and Technology(CN)Qiqihar University(CN)
Publications by Year
Research Areas
Sparse and Compressive Sensing Techniques, Advanced Bandit Algorithms Research, Stochastic Gradient Optimization Techniques, Machine Learning and Algorithms, Tensor decomposition and applications
Most-Cited Works
- → Matrix Completion has No Spurious Local Minimum(2016)186 cited
- → Simple, Efficient, and Neural Algorithms for Sparse Coding(2015)84 cited
- Verified Uncertainty Calibration(2019)
- → Polynomial-Time Tensor Decompositions with Sum-of-Squares(2016)65 cited
- On the Margin Theory of Feedforward Neural Networks(2018)
- → Optimal Regularization Can Mitigate Double Descent(2020)48 cited
- → Data-dependent Sample Complexity of Deep Neural Networks via Lipschitz Augmentation(2019)45 cited
- → Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms(2015)33 cited
- Sum-of-squares lower bounds for Sparse PCA(2015)
- Online Learning of Eigenvectors(2015)