Pages that link to "Item:Q2978588"
From MaRDI portal
The following pages link to Sample Complexity of Dictionary Learning and Other Matrix Factorizations (Q2978588):
Displaying 16 items.
- On statistical learning of simplices: unmixing problem revisited (Q820821) (← links)
- Learning semidefinite regularizers (Q1740575) (← links)
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning (Q1748252) (← links)
- Customized dictionary learning for subdatasets with fine granularity (Q1793292) (← links)
- A forward-backward greedy approach for sparse multiscale learning (Q2083098) (← links)
- Compressive sensing and neural networks from a statistical learning perspective (Q2106482) (← links)
- Reprint of: A forward-backward greedy approach for sparse multiscale learning (Q2679340) (← links)
- Generalization Error in Deep Learning (Q3296180) (← links)
- (Q4558493) (← links)
- Multilinear Compressive Sensing and an Application to Convolutional Linear Networks (Q5025785) (← links)
- Tensor Regression Using Low-Rank and Sparse Tucker Decompositions (Q5037550) (← links)
- Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data (Q5214182) (← links)
- (Q5214233) (← links)
- On the Purity and Entropy of Mixed Gaussian States (Q5230194) (← links)
- Dimensionality-Dependent Generalization Bounds for <i>k</i>-Dimensional Coding Schemes (Q5380581) (← links)
- Alternating Proximal Regularized Dictionary Learning (Q5383811) (← links)
