Weak greedy algorithms
From MaRDI portal
Recommendations
Cited in
(82)- Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
- Approximation on anisotropic Besov classes with mixed norms by standard information
- Cubature formulas, discrepancy, and nonlinear approximation
- FFT formulations of adaptive Fourier decomposition
- The rate of convergence of weak greedy approximations over orthogonal dictionaries
- Realizability of greedy algorithms
- Convergence of a weak greedy algorithm when one vector is added to the orthogonal dictionary
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
- Boosting algorithms: regularization, prediction and model fitting
- Super greedy type algorithms
- Greedy expansions with prescribed coefficients in Hilbert spaces
- Stability Selection
- Two-dimensional adaptive Fourier decomposition
- On Lebesgue-type inequalities for greedy approximation
- How to best sample a solution manifold?
- Approximate weak greedy algorithms
- Group orthogonal greedy algorithm for change-point estimation of multivariate time series
- Generalized approximate weak greedy algorithms
- Projection greedy algorithm
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Variable selection in high-dimensional sparse multiresponse linear regression models
- Adaptive orthonormal systems for matrix-valued functions
- Boosting as a kernel-based method
- On the convergence of greedy algorithms for initial segments of the Haar basis
- scientific article; zbMATH DE number 2111760 (Why is no real title available?)
- Incremental greedy algorithm and its applications in numerical integration
- Convergence of orthogonal greedy algorithm with errors in projectors
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Sparse approximation by greedy algorithms
- Greedy expansions in Hilbert spaces
- Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space
- On \(n\)-term approximation with positive coefficients
- Greedy approximation of characteristic functions
- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
- Greedy expansions in Banach spaces
- Weakly adaptive comparison searching
- On orthorecursive expansions in terms of a chain of systems
- Simultaneous greedy approximation in Banach spaces
- Greedy algorithms with restricted depth search
- Toward optimal model averaging in regression models with time series errors
- Vector greedy algorithms
- Fixed-size confidence regions in high-dimensional sparse linear regression models
- Boosting for high-dimensional linear models
- Optimization by Gradient Boosting
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Greedy expansions in convex optimization
- Sparse approximation is provably hard under coherent dictionaries
- Greedy algorithms for prediction
- Simultaneous approximation by greedy algorithms
- Efficiency of weak greedy algorithms for \(m\)-term approximations
- Stochastic approximation: from statistical origin to big-data, multidisciplinary applications
- Sparse approximation of individual functions
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Tests of the martingale difference hypothesis using boosting and RBF neural network approximations
- Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems
- Convergence almost everywhere of orthorecursive expansions in systems of translates and dilates
- Greedy approximation in convex optimization
- Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces.
- The Marcinkiewicz-type discretization theorems
- Variable selection for high-dimensional regression models with time series and heteroscedastic errors
- Efficiency of the weak Rescaled Pure Greedy Algorithm
- Boosting high dimensional predictive regressions with time varying parameters
- Sharp sufficient condition for the convergence of greedy expansions with errors in coefficient computation
- Entropy-based convergence rates of greedy algorithms
- Sparse approximation based on a random overcomplete basis
- Discussion on ``Two-stage procedures for high-dimensional data by Makoto Aoshima and Kazuyoshi Yata
- A counter-example to the general convergence of partially greedy algorithms
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
- A unified way of analyzing some greedy algorithms
- Recursive expansions with respect to a chain of subspaces
- Biorthogonal greedy algorithms in convex optimization
- Approximation by Egyptian fractions and the weak greedy algorithm
- A note on the hardness of sparse approximation
- Threshold Estimation via Group Orthogonal Greedy Algorithm
- Conical greedy algorithm
- The absolute stability of orthorecursive expansions in redundant systems of subspaces
- Adaptive frame methods for nonlinear variational problems
- The regularized weak functional matching pursuit for linear inverse problems
- Model selection for high-dimensional linear regression with dependent observations
- Unified error estimate for weak biorthogonal greedy algorithms
- On the differences between \(L_2\) boosting and the Lasso
- Random points are good for universal discretization
This page was built for publication: Weak greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968628)
