Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Learning semidefinite regularizers - MaRDI portal

Learning semidefinite regularizers (Q1740575)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Learning semidefinite regularizers	scientific article

Statements

scholarly article

0 references

Learning semidefinite regularizers (English)

0 references

0 references

Venkat Chandrasekaran

0 references

Foundations of Computational Mathematics

0 references

publication date

30 April 2019

0 references

full work available at URL

https://arxiv.org/abs/1701.01207

0 references

https://authors.library.caltech.edu/78200/

0 references

zbMATH Keywords

atomic norm

0 references

convex optimization

0 references

low-rank matrices

0 references

nuclear norm

0 references

operator scaling

0 references

representation learning

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization

0 references

A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries

0 references

$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

0 references

Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method

0 references

Universal approximation bounds for superpositions of a sigmoidal function

0 references

Atomic Norm Denoising With Applications to Line Spectral Estimation

0 references

Iterative hard thresholding for compressed sensing

0 references

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

0 references

Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements

0 references

Exact matrix completion via convex optimization

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

0 references

Latent variable graphical model selection via convex optimization

0 references

The convex geometry of linear inverse problems

0 references

Atomic Decomposition by Basis Pursuit

0 references

0 references

Some remarks on greedy algorithms

0 references

Compressed sensing

0 references

For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution

0 references

Uncertainty principles and ideal atomic decomposition

0 references

Sparse and Redundant Representations

0 references

Convergence of fixed-point continuation algorithms for matrix rank minimization

0 references

Lifts of Convex Sets and Cone Factorizations

0 references

Sample Complexity of Dictionary Learning and Other Matrix Factorizations

0 references

Classical complexity and quantum entanglement

0 references

A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training

0 references

0 references

Diagonal Matrix Scaling and Linear Programming

0 references

A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents

0 references

Sparse Modeling for Image and Vision Processing

0 references

Transformations on tensor product spaces

0 references

High-dimensional graphs and variable selection with the Lasso

0 references

Sparse Approximate Solutions to Linear Systems

0 references

0 references

Sharp MSE bounds for proximal denoising

0 references

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

A Mathematical View of Interior-Point Methods in Convex Optimization

0 references

On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD

0 references

Convergence radius and sample complexity of ITKM algorithms for dictionary learning

0 references

A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices

0 references

0 references

A geometric analysis of phase retrieval

0 references

Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture

0 references

Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method

0 references

0 references

SDPT3 — A Matlab software package for semidefinite programming, Version 1.3

0 references

User-friendly tail bounds for sums of random matrices

0 references

0 references

0 references

Expressing combinatorial optimization problems by linear programs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S10208-018-9386-Z

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1740575

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1740575&oldid=38723021"