Weak greedy algorithms
From MaRDI portal
Publication:1968628
DOI10.1023/A:1018917218956zbMath0964.65009OpenAlexW2914629549MaRDI QIDQ1968628
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
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15)
Related Items (72)
Greedy algorithms for prediction ⋮ The Marcinkiewicz-type discretization theorems ⋮ FFT formulations of adaptive Fourier decomposition ⋮ Group orthogonal greedy algorithm for change-point estimation of multivariate time series ⋮ Rescaled pure greedy algorithm for Hilbert and Banach spaces ⋮ On Lebesgue-type inequalities for greedy approximation ⋮ Biorthogonal greedy algorithms in convex optimization ⋮ Sparse approximation is provably hard under coherent dictionaries ⋮ Fixed-Size Confidence Regions in High-Dimensional Sparse Linear Regression Models ⋮ Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations ⋮ Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm ⋮ Sharp sufficient condition for the convergence of greedy expansions with errors in coefficient computation ⋮ Convergence of orthogonal greedy algorithm with errors in projectors ⋮ The rate of convergence of weak greedy approximations over orthogonal dictionaries ⋮ Conical greedy algorithm ⋮ Greedy expansions in Banach spaces ⋮ Greedy approximation of characteristic functions ⋮ Super greedy type algorithms ⋮ Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms ⋮ Toward optimal model averaging in regression models with time series errors ⋮ Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries ⋮ Random points are good for universal discretization ⋮ Incremental Greedy Algorithm and Its Applications in Numerical Integration ⋮ Cubature formulas, discrepancy, and nonlinear approximation ⋮ Convergence of a weak greedy algorithm when one vector is added to the orthogonal dictionary ⋮ Adaptive orthonormal systems for matrix-valued functions ⋮ Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces. ⋮ Sparse approximation of individual functions ⋮ Realizability of greedy algorithms ⋮ Boosting algorithms: regularization, prediction and model fitting ⋮ Model selection for high-dimensional linear regression with dependent observations ⋮ A note on the hardness of sparse approximation ⋮ Greedy expansions in Hilbert spaces ⋮ Vector greedy algorithms ⋮ Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms ⋮ Greedy expansions with prescribed coefficients in Hilbert spaces ⋮ Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space ⋮ Greedy expansions in convex optimization ⋮ Sparse approximation based on a random overcomplete basis ⋮ On \(n\)-term approximation with positive coefficients ⋮ Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms ⋮ On the convergence of greedy algorithms for initial segments of the Haar basis ⋮ Recursive expansions with respect to a chain of subspaces ⋮ Adaptive frame methods for nonlinear variational problems ⋮ Two‐dimensional adaptive Fourier decomposition ⋮ Simultaneous greedy approximation in Banach spaces ⋮ Approximation on anisotropic Besov classes with mixed norms by standard information ⋮ 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 ⋮ A counter-example to the general convergence of partially greedy algorithms ⋮ Boosting for high-dimensional linear models ⋮ Simultaneous approximation by greedy algorithms ⋮ How To Best Sample a Solution Manifold? ⋮ Stochastic approximation: from statistical origin to big-data, multidisciplinary applications ⋮ On the differences between \(L_2\) boosting and the Lasso ⋮ The Absolute Stability of Orthorecursive Expansions in Redundant Systems of Subspaces ⋮ On orthorecursive expansions in terms of a chain of systems ⋮ Boosting high dimensional predictive regressions with time varying parameters ⋮ Discussion on “Two-Stage Procedures for High-Dimensional Data” by Makoto Aoshima and Kazuyoshi Yata ⋮ Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\) ⋮ Projection greedy algorithm ⋮ Variable selection for high-dimensional regression models with time series and heteroscedastic errors ⋮ Convergence Almost Everywhere of Orthorecursive Expansions in Systems of Translates and Dilates ⋮ The regularized weak functional matching pursuit for linear inverse problems ⋮ Variable selection in high-dimensional sparse multiresponse linear regression models ⋮ A unified way of analyzing some greedy algorithms ⋮ Boosting as a kernel-based method ⋮ Efficiency of the weak Rescaled Pure Greedy Algorithm ⋮ Stability Selection ⋮ Generalized approximate weak greedy algorithms ⋮ Greedy approximation in convex optimization ⋮ Optimization by Gradient Boosting
This page was built for publication: Weak greedy algorithms
