Pages that link to "Item:Q5281235"
From MaRDI portal
The following pages link to $K$-Dimensional Coding Schemes in Hilbert Spaces (Q5281235):
Displaying 17 items.
- A chain rule for the expected suprema of Gaussian processes (Q329618) (← links)
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264) (← links)
- Empirical risk minimization for heavy-tailed losses (Q892246) (← links)
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning (Q1748252) (← links)
- On Hölder fields clustering (Q1936547) (← links)
- Robust \(k\)-means clustering for distributions with two moments (Q2054489) (← links)
- A forward-backward greedy approach for sparse multiscale learning (Q2083098) (← links)
- Learning sets with separating kernels (Q2252512) (← links)
- Reprint of: A forward-backward greedy approach for sparse multiscale learning (Q2679340) (← links)
- Lower Bounds for Sparse Coding (Q2805739) (← links)
- A Vector-Contraction Inequality for Rademacher Complexities (Q2830263) (← links)
- (Q4558493) (← links)
- Learning Finite-Dimensional Coding Schemes with Nonlinear Reconstruction Maps (Q5025792) (← links)
- Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data (Q5214182) (← links)
- Dimensionality-Dependent Generalization Bounds for <i>k</i>-Dimensional Coding Schemes (Q5380581) (← links)
- Alternating Proximal Regularized Dictionary Learning (Q5383811) (← links)
- Testing the manifold hypothesis (Q5741444) (← links)
