Co-occurring keywords · papers mentioning both
Papers
Wedge Sampling: Efficient Tensor Completion with Nearly-Linear Sample Complexity
COLT 2026
Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity Extended Abstract
COLT 2025
Understanding the Learning Dynamics of LoRA: A Gradient Flow Perspective on Low-Rank Adaptation in Matrix Factorization
AISTATS 2025
Guaranteed Nonconvex Factorization Approach for Tensor Train Recovery
JMLR 2024
LipsFormer: Introducing Lipschitz Continuity to Vision Transformers
ICLR 2023
Online Stochastic Gradient Descent with Arbitrary Initialization Solves Non-smooth, Non-convex Phase Retrieval
JMLR 2023
Convergence and Recovery Guarantees of the K-Subspaces Method for Subspace Clustering
ICML 2022
Misspecified Phase Retrieval with Generative Priors
NeurIPS 2022
Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Completion
AISTATS 2022
Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements
JMLR 2022
Approximate Message Passing with Spectral Initialization for Generalized Linear Models
AISTATS 2021
Initialization and Regularization of Factorized Neural Layers
ICLR 2021
Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors
NeurIPS 2021
Blind Demixing via Wirtinger Flow with Random Initialization
AISTATS 2019
Nonconvex Matrix Factorization from Rank-One Measurements
AISTATS 2019
Approximate message passing for amplitude based optimization
ICML 2018
Convolutional Phase Retrieval
NeurIPS 2017
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
NeurIPS 2015