The following pages link to Weak greedy algorithms (Q1968628):
Displaying 50 items.
- Greedy algorithms for prediction (Q265302) (← links)
- Efficiency of weak greedy algorithms for \(m\)-term approximations (Q294506) (← links)
- Rescaled pure greedy algorithm for Hilbert and Banach spaces (Q326773) (← links)
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations (Q347862) (← links)
- Convergence of orthogonal greedy algorithm with errors in projectors (Q355338) (← links)
- Boosting algorithms: regularization, prediction and model fitting (Q449780) (← links)
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms (Q466526) (← links)
- Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space (Q477247) (← links)
- Greedy expansions in convex optimization (Q483395) (← links)
- Simultaneous greedy approximation in Banach spaces (Q558004) (← links)
- Approximation on anisotropic Besov classes with mixed norms by standard information (Q558005) (← links)
- Greedy approximation of characteristic functions (Q605979) (← links)
- Realizability of greedy algorithms (Q643840) (← links)
- Vector greedy algorithms (Q652444) (← links)
- On orthorecursive expansions in terms of a chain of systems (Q735856) (← links)
- Variable selection in high-dimensional sparse multiresponse linear regression models (Q779699) (← links)
- Group orthogonal greedy algorithm for change-point estimation of multivariate time series (Q830674) (← links)
- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm (Q863343) (← links)
- Greedy expansions in Banach spaces (Q877783) (← links)
- Toward optimal model averaging in regression models with time series errors (Q888324) (← links)
- On \(n\)-term approximation with positive coefficients (Q942052) (← links)
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\) (Q1012556) (← links)
- Weakly adaptive comparison searching (Q1124340) (← links)
- Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries (Q1288881) (← links)
- Cubature formulas, discrepancy, and nonlinear approximation (Q1401998) (← links)
- Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces. (Q1414073) (← links)
- The Marcinkiewicz-type discretization theorems (Q1615927) (← links)
- Greedy expansions with prescribed coefficients in Hilbert spaces (Q1728990) (← links)
- Some remarks on greedy algorithms (Q1923887) (← links)
- Super greedy type algorithms (Q1928073) (← links)
- Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms (Q1929788) (← links)
- Stochastic approximation: from statistical origin to big-data, multidisciplinary applications (Q2038304) (← links)
- Boosting high dimensional predictive regressions with time varying parameters (Q2043255) (← links)
- Projection greedy algorithm (Q2049278) (← links)
- Biorthogonal greedy algorithms in convex optimization (Q2155817) (← links)
- Sharp sufficient condition for the convergence of greedy expansions with errors in coefficient computation (Q2162664) (← links)
- Conical greedy algorithm (Q2170508) (← links)
- Sparse approximation of individual functions (Q2209292) (← links)
- Model selection for high-dimensional linear regression with dependent observations (Q2215720) (← links)
- Recursive expansions with respect to a chain of subspaces (Q2248329) (← links)
- On the differences between \(L_2\) boosting and the Lasso (Q2288790) (← links)
- Variable selection for high-dimensional regression models with time series and heteroscedastic errors (Q2305978) (← links)
- The regularized weak functional matching pursuit for linear inverse problems (Q2316685) (← links)
- A unified way of analyzing some greedy algorithms (Q2329295) (← links)
- Boosting as a kernel-based method (Q2331677) (← links)
- Greedy approximation in convex optimization (Q2343051) (← links)
- FFT formulations of adaptive Fourier decomposition (Q2360717) (← links)
- The rate of convergence of weak greedy approximations over orthogonal dictionaries (Q2399411) (← links)
- A note on the hardness of sparse approximation (Q2444766) (← links)
