The following pages link to Weak greedy algorithms (Q1968628):
Displaying 30 items.
- Greedy expansions in Hilbert spaces (Q2446184) (← links)
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms (Q2464708) (← links)
- Adaptive frame methods for nonlinear variational problems (Q2480889) (← links)
- Boosting for high-dimensional linear models (Q2497175) (← links)
- Simultaneous approximation by greedy algorithms (Q2498388) (← links)
- Generalized approximate weak greedy algorithms (Q2577360) (← links)
- On Lebesgue-type inequalities for greedy approximation (Q2643860) (← links)
- Convergence of a weak greedy algorithm when one vector is added to the orthogonal dictionary (Q2688113) (← links)
- How To Best Sample a Solution Manifold? (Q2799929) (← links)
- The Absolute Stability of Orthorecursive Expansions in Redundant Systems of Subspaces (Q2803682) (← links)
- Incremental Greedy Algorithm and Its Applications in Numerical Integration (Q2957058) (← links)
- Adaptive orthonormal systems for matrix-valued functions (Q2964040) (← links)
- Fixed-Size Confidence Regions in High-Dimensional Sparse Linear Regression Models (Q3194549) (← links)
- Sparse approximation based on a random overcomplete basis (Q3302727) (← links)
- On the convergence of greedy algorithms for initial segments of the Haar basis (Q3559982) (← links)
- Stability Selection (Q4632639) (← links)
- TESTS OF THE MARTINGALE DIFFERENCE HYPOTHESIS USING BOOSTING AND RBF NEURAL NETWORK APPROXIMATIONS (Q4933583) (← links)
- Efficiency of the weak Rescaled Pure Greedy Algorithm (Q5010120) (← links)
- Convergence Almost Everywhere of Orthorecursive Expansions in Systems of Translates and Dilates (Q5223383) (← links)
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries (Q5348776) (← links)
- Two‐dimensional adaptive Fourier decomposition (Q5739228) (← links)
- Optimization by Gradient Boosting (Q5870986) (← links)
- Discussion on “Two-Stage Procedures for High-Dimensional Data” by Makoto Aoshima and Kazuyoshi Yata (Q5894437) (← links)
- Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems (Q5943952) (← links)
- A counter-example to the general convergence of partially greedy algorithms (Q5944137) (← links)
- Approximate weak greedy algorithms (Q5950886) (← links)
- Approximation by Egyptian fractions and the weak greedy algorithm (Q6057050) (← links)
- Random points are good for universal discretization (Q6074492) (← links)
- Entropy-based convergence rates of greedy algorithms (Q6551364) (← links)
- Threshold Estimation via Group Orthogonal Greedy Algorithm (Q6616616) (← links)
