Dynamic Matrix Recovery
From MaRDI portal
Cites work
- A Bernstein type inequality and moderate deviations for weakly dependent sequences
- A Bernstein-type inequality for some mixing processes and dynamical systems with an application to learning
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Bernstein inequality and moderate deviations under strong mixing conditions
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 7370582 (Why is no real title available?)
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Optimal estimation of low rank density matrices
- Rank penalized estimators for high-dimensional matrices
- Robust principal component analysis?
- Statistical Inferences of Linear Forms for Noisy Matrix Completion
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor Regression with Applications in Neuroimaging Data Analysis
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
This page was built for publication: Dynamic Matrix Recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651406)
