Noisy tensor completion via the sum-of-squares hierarchy (Q2144539)

From MaRDI portal

Revision as of 05:51, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Noisy tensor completion via the sum-of-squares hierarchy	scientific article

Statements

scholarly article

0 references

Noisy tensor completion via the sum-of-squares hierarchy (English)

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

14 June 2022

0 references

full work available at URL

https://arxiv.org/abs/1501.06521

0 references

MaRDI profile type

MaRDI publication profile

0 references

A spectral algorithm for latent Dirichlet allocation

0 references

Hypercontractivity, sum-of-squares proofs, and their applications

0 references

A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem

0 references

Rounding sum-of-squares relaxations

0 references

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

0 references

Sum-of-squares proofs and the quest toward optimal algorithms

0 references

10.1162/153244303321897690

0 references

Tighter Low-rank Approximation via Sampling the Leveraged Element

0 references

Exact matrix completion via convex optimization

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Distributional and \(L^q\) norm inequalities for polynomials over convex bodies in \(\mathbb{R}^n\)

0 references

The convex geometry of linear inverse problems

0 references

Strong Refutation Heuristics for Random k-SAT

0 references

Relations between average case complexity and approximation complexity

0 references

0 references

Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently

0 references

Tensor completion and low-n-rank tensor recovery via convex optimization

0 references

Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms

0 references

0 references

Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity

0 references

Classical deterministic complexity of Edmonds' Problem and quantum entanglement

0 references

Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization

0 references

Some optimal inapproximability results

0 references

Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors

0 references

Learning mixtures of spherical gaussians

0 references

Low-rank matrix completion using alternating minimization

0 references

0 references

Empirical margin distributions and bounding the generalization error of combined classifiers

0 references

Low-rank tensor completion by Riemannian optimization

0 references

Global Optimization with Polynomials and the Problem of Moments

0 references

0 references

Spectral methods from tensor networks

0 references

Spectral Algorithms for Tensor Completion

0 references

Learning nonsingular phylogenies and hidden Markov models

0 references

0 references

Strongly refuting random CSPs below the spectral threshold

0 references

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

0 references

An approach to obtaining global extremums in polynomial mathematical programming problems

0 references

Learning Theory

0 references

Compressed Sensing Off the Grid

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

10.1007/S10107-022-01793-9

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2144539

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