Optimality of the rescaled pure greedy learning algorithms
From MaRDI portal
(Redirected from Publication:5880599)
Recommendations
- Learning rates of multi-kernel regression by orthogonal greedy algorithm
- On the convergence rate of kernel-based sequential greedy regression
- Approximation and learning by greedy algorithms
- Optimality of the greedy algorithm for some function classes
- On the rate of convergence of a pure greedy algorithm.
Cites work
- A Framework of Adaptive Multiscale Wavelet Decomposition for Signals on Undirected Graphs
- Adaptive algorithms of nonlinear approximation with finite terms
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
- Approximation and learning by greedy algorithms
- Coefficient-based \(l^q\)-regularized regression with indefinite kernels and unbounded sampling
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Convergence rate of the semi-supervised greedy algorithm
- Efficiency of orthogonal super greedy algorithm under the restricted isometry property
- Efficiency of the weak Rescaled Pure Greedy Algorithm
- Fractional-Wavelet Analysis of Positive definite Distributions and Wavelets on $$\varvec{\mathscr {D'}}(\mathbb {C})$$ D ′ ( C )
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- Hyperspectral image classification using wavelet transform-based smooth ordering
- Learning by atomic norm regularization with polynomial kernels
- Learning by nonsymmetric kernels with data dependent spaces and \(\ell^1\)-regularizer
- Learning rates of multi-kernel regression by orthogonal greedy algorithm
- Learning theory estimates for coefficient-based regularized regression
- Multi-kernel regularized classifiers
- On the Weierstrass-Mandelbrot fractal function
- Penalized empirical relaxed greedy algorithm for fixed design Gaussian regression
- Probability Inequalities for Sums of Bounded Random Variables
- Projection pursuit
- Randomized multi-scale kernels learning with sparsity constraint regularization for regression
- Rates of convex approximation in non-Hilbert spaces
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Riemann zeta fractional derivative-functional equation and link with primes
- Some remarks on greedy algorithms
- Unified error estimate for weak biorthogonal greedy algorithms
Cited in
(8)- Learning rates of multi-kernel regression by orthogonal greedy algorithm
- On the convergence rate of kernel-based sequential greedy regression
- Rescaled pure greedy algorithm for convex optimization
- Penalized empirical relaxed greedy algorithm for fixed design Gaussian regression
- Reproducing property of bounded linear operators and kernel regularized least square regressions
- -Rescaled Pure Super Greedy Algorithm with respect to Riesz dictionary
- Error bounds of approximate weak rescaled pure greedy algorithms
- Deterministic error analysis of kernel regularized regression for spherical scattered data
This page was built for publication: Optimality of the rescaled pure greedy learning algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5880599)
