scientific article; zbMATH DE number 7370623
From MaRDI portal
Publication:4999045
Aukosh Jagannath, Reza Gheissari, Gérard Ben Arous
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/2003.10409
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parameter estimationsupervised learningnon-convex optimizationgeneralized linear modelsstochastic gradient descenttensor PCA
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probability in Banach spaces. Isoperimetry and processes
- Algorithmic thresholds for tensor PCA
- The largest eigenvalue of small rank perturbations of Hermitian random matrices
- On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
- On tail probabilities for martingales
- A geometric analysis of phase retrieval
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- On the distribution of the largest eigenvalue in principal components analysis
- Stochastic algorithms
- The landscape of empirical risk for nonconvex losses
- Bridging the gap between constant step size stochastic gradient descent and Markov chains
- Bounding flows for spherical spin glass dynamics
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
- Statistical thresholds for tensor PCA
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- An Introduction to Random Matrices
- Functional and random central limit theorems for the Robbins-Munro process
- Analysis of recursive stochastic algorithms
- Batched Stochastic Gradient Descent with Weighted Sampling
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- The Landscape of the Spiked Tensor Model
- Sampling can be faster than optimization
- A modern maximum-likelihood theory for high-dimensional logistic regression
- Optimal errors and phase transitions in high-dimensional generalized linear models
- Optimal Spectral Initialization for Signal Recovery With Applications to Phase Retrieval
- Phase retrieval via randomized Kaczmarz: theoretical guarantees
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- Advanced Lectures on Machine Learning
- A Stochastic Approximation Method
This page was built for publication:
