The following pages link to Learning Theory (Q5473636):
Displaying 30 items.
- Matrix completion via max-norm constrained optimization (Q302432) (← links)
- Conditional gradient algorithms for norm-regularized smooth convex optimization (Q494314) (← links)
- Estimation of high-dimensional low-rank matrices (Q548539) (← links)
- Max-norm optimization for robust matrix recovery (Q681486) (← links)
- Cross: efficient low-rank tensor completion (Q1731066) (← links)
- Low-rank matrix completion using nuclear norm minimization and facial reduction (Q1756746) (← links)
- Flexible low-rank statistical modeling with missing data and side information (Q1799348) (← links)
- On the exponentially weighted aggregate with the Laplace prior (Q1800807) (← links)
- Robust low-rank matrix estimation (Q1990590) (← links)
- Online optimization for max-norm regularization (Q2014582) (← links)
- Improving maximum margin matrix factorization (Q2036266) (← links)
- Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data (Q2054540) (← links)
- Quantile trace regression via nuclear norm regularization (Q2070597) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Computational mechanics enhanced by deep learning (Q2310108) (← links)
- Deep collective matrix factorization for augmented multi-view learning (Q2320570) (← links)
- Parallel stochastic gradient algorithms for large-scale matrix completion (Q2392935) (← links)
- Low-rank nonnegative matrix factorization on Stiefel manifold (Q2660701) (← links)
- An Introduction to Compressed Sensing (Q3296174) (← links)
- (Q4614121) (← links)
- Regularization and the small-ball method II: complexity dependent error rates (Q4637079) (← links)
- Sharper Bounds for Regularized Data Fitting (Q5002630) (← links)
- Machine Learning for Metabolic Identification (Q5022209) (← links)
- Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization (Q5131966) (← links)
- Deterministic Tensor Completion with Hypergraph Expanders (Q5162629) (← links)
- On the Simplicity and Conditioning of Low Rank Semidefinite Programs (Q5162653) (← links)
- An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656) (← links)
- (Q5214187) (← links)
- Decentralized Dictionary Learning Over Time-Varying Digraphs (Q5214231) (← links)
- Spectral gap in random bipartite biregular graphs and applications (Q5886318) (← links)