Weak greedy algorithms
From MaRDI portal
DOI10.1023/A:1018917218956zbMATH Open0964.65009OpenAlexW2914629549MaRDI QIDQ1968628FDOQ1968628
Authors: V. N. Temlyakov 
Publication date: 21 March 2000
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018917218956
Recommendations
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15)
Cited In (82)
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Convergence almost everywhere of orthorecursive expansions in systems of translates and dilates
- Greedy approximation in convex optimization
- Greedy algorithms for prediction
- Stochastic approximation: from statistical origin to big-data, multidisciplinary applications
- Group orthogonal greedy algorithm for change-point estimation of multivariate time series
- Greedy expansions with prescribed coefficients in Hilbert spaces
- Projection greedy algorithm
- On Lebesgue-type inequalities for greedy approximation
- Greedy expansions in Hilbert spaces
- Incremental greedy algorithm and its applications in numerical integration
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- The Marcinkiewicz-type discretization theorems
- Two-dimensional adaptive Fourier decomposition
- Boosting for high-dimensional linear models
- Greedy expansions in convex optimization
- Approximation on anisotropic Besov classes with mixed norms by standard information
- Generalized approximate weak greedy algorithms
- Weakly adaptive comparison searching
- Vector greedy algorithms
- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
- Greedy algorithms with restricted depth search
- Efficiency of weak greedy algorithms for \(m\)-term approximations
- Sparse approximation of individual functions
- Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems
- Toward optimal model averaging in regression models with time series errors
- Fixed-size confidence regions in high-dimensional sparse linear regression models
- Title not available (Why is that?)
- Greedy approximation of characteristic functions
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
- FFT formulations of adaptive Fourier decomposition
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
- Super greedy type algorithms
- Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space
- Simultaneous greedy approximation in Banach spaces
- Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces.
- Cubature formulas, discrepancy, and nonlinear approximation
- Approximate weak greedy algorithms
- Sparse approximation is provably hard under coherent dictionaries
- Stability Selection
- The rate of convergence of weak greedy approximations over orthogonal dictionaries
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Simultaneous approximation by greedy algorithms
- On orthorecursive expansions in terms of a chain of systems
- Realizability of greedy algorithms
- Convergence of a weak greedy algorithm when one vector is added to the orthogonal dictionary
- Convergence of orthogonal greedy algorithm with errors in projectors
- Greedy expansions in Banach spaces
- Tests of the martingale difference hypothesis using boosting and RBF neural network approximations
- Boosting algorithms: regularization, prediction and model fitting
- Adaptive orthonormal systems for matrix-valued functions
- Variable selection in high-dimensional sparse multiresponse linear regression models
- Sparse approximation by greedy algorithms
- Boosting as a kernel-based method
- On the convergence of greedy algorithms for initial segments of the Haar basis
- On \(n\)-term approximation with positive coefficients
- Optimization by Gradient Boosting
- How to best sample a solution manifold?
- Model selection for high-dimensional linear regression with dependent observations
- A unified way of analyzing some greedy algorithms
- A note on the hardness of sparse approximation
- Threshold Estimation via Group Orthogonal Greedy Algorithm
- The regularized weak functional matching pursuit for linear inverse problems
- Sparse approximation based on a random overcomplete basis
- Recursive expansions with respect to a chain of subspaces
- Approximation by Egyptian fractions and the weak greedy algorithm
- Efficiency of the weak Rescaled Pure Greedy Algorithm
- Adaptive frame methods for nonlinear variational problems
- The absolute stability of orthorecursive expansions in redundant systems of subspaces
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
- Biorthogonal greedy algorithms in convex optimization
- Unified error estimate for weak biorthogonal greedy algorithms
- Random points are good for universal discretization
- Boosting high dimensional predictive regressions with time varying parameters
- Sharp sufficient condition for the convergence of greedy expansions with errors in coefficient computation
- Conical greedy algorithm
- On the differences between \(L_2\) boosting and the Lasso
- 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
- Variable selection for high-dimensional regression models with time series and heteroscedastic errors
- Entropy-based convergence rates of greedy algorithms
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)
