Pages that link to "Item:Q2941498"
From MaRDI portal
The following pages link to Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method (Q2941498):
Displayed 23 items.
- Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
- Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018 (Q1731982) (← links)
- Learning semidefinite regularizers (Q1740575) (← links)
- Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling (Q1746610) (← links)
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning (Q1748252) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Smoothed analysis for tensor methods in unsupervised learning (Q2144543) (← links)
- On the optimization landscape of tensor decompositions (Q2144549) (← links)
- Fast overcomplete dictionary construction with probabilistic guarantees (Q2198175) (← links)
- Compressed dictionary learning (Q2310825) (← links)
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors (Q3456878) (← links)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
- (Q4969112) (← links)
- (Q5002634) (← links)
- (Q5005186) (← links)
- $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials (Q5088657) (← links)
- (Q5090440) (← links)
- (Q5091162) (← links)
- (Q5091238) (← links)
- (Q5149225) (← links)
- Sums of Squares and Sparse Semidefinite Programming (Q5157588) (← links)
- Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) (← links)
