Greedy Approximation
From MaRDI portal
Publication:3107195
DOI10.1017/CBO9780511762291zbMath1279.41001OpenAlexW4249999916MaRDI QIDQ3107195
Publication date: 21 December 2011
Full work available at URL: https://doi.org/10.1017/cbo9780511762291
Inequalities; stochastic orderings (60E15) Nonparametric estimation (62G05) Learning and adaptive systems in artificial intelligence (68T05) Multidimensional problems (41A63) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15) Research exposition (monographs, survey articles) pertaining to approximations and expansions (41-02)
Related Items
Sparse control for continuous‐time systems, A convergence rate estimate for remotest projections on three subspaces, Estimation and inference of treatment effects with \(L_2\)-boosting in high-dimensional settings, Universal sampling discretization, Matching pursuit with unbounded parameter domains, Sample average approximation of conditional value-at-risk based variational inequalities, An efficient algorithm for decomposing a vector into two vectors with a small uniform norm, Greedy algorithms for prediction, Numerical integration and discrepancy under smoothness assumption and without it, Constructive sparse trigonometric approximation for functions with small mixed smoothness, The Marcinkiewicz-type discretization theorems, Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces, Stochastic subspace correction in Hilbert space, FFT formulations of adaptive Fourier decomposition, The Fourier type expansions on tubes, Greedy strategies for convex optimization, Lebesgue-type inequalities in greedy approximation, Sampling discretization of integral norms of the hyperbolic cross polynomials, Convex optimization on Banach spaces, Translation and modulation invariant Banach spaces of tempered distributions satisfy the metric approximation property, Frames and non linear approximations in Hilbert spaces, Universal discretization, Regular families of kernels for nonlinear approximation, Computation of extreme eigenvalues in higher dimensions using block tensor train format, New parameters and Lebesgue-type estimates in greedy approximation, Rescaled pure greedy algorithm for Hilbert and Banach spaces, A remark on entropy numbers, Nonlinear trigonometric approximations of multivariate function classes, Convergence and rate of convergence of some greedy algorithms in convex optimization, Uniform approximation rates and metric entropy of shallow neural networks, Conical greedy algorithm, Sparse representation of approximation to identity, Entropy numbers of finite dimensional mixed-norm balls and function space embeddings with small mixed smoothness, Complex best \(r\)-term approximations almost always exist in finite dimensions, Lower bounds for Haar projections: deterministic examples, Lebesgue inequalities for the greedy algorithm in general bases, Lebesgue-type inequalities for quasi-greedy bases, Condition of coincidence between greedy approximations and \(m\)-term ones, Greedy algorithm with gaps, New characterizations of the unit vector basis of or, Orthogonalization in Clifford Hilbert modules and applications, On weighted greedy-type bases, Characterization of the variation spaces corresponding to shallow neural networks, Weight-almost greedy bases, Incremental Greedy Algorithm and Its Applications in Numerical Integration, Comparison of pure greedy algorithm with pure greedy algorithm in a pair of dictionaries, Rescaled pure greedy algorithm for convex optimization, Weak limits of consecutive projections and of greedy steps, Sampling discretization of integral norms and its application, Greedy approximation by arbitrary sets, Convergence of a weak greedy algorithm when one vector is added to the orthogonal dictionary, Low-Rank Solution to an Optimization Problem Constrained by the Navier--Stokes Equations, Nonlinear wavelet approximation of periodic function classes with generalized mixed smoothness, One-bit sensing, discrepancy and Stolarsky's principle, Lebesgue inequalities for Chebyshev thresholding greedy algorithms, Sparse Approximation by Greedy Algorithms, Flavors of Compressive Sensing, A Class of Intrinsic Trigonometric Mode Polynomials, Greedy training algorithms for neural networks and applications to PDEs, Weak convergence of a greedy algorithm and the WN-property, Alternating projections, remotest projections, and greedy approximation, Sampling discretization of the uniform norm, Greedy bases in \(L^p\) spaces, Greedy expansions in Hilbert spaces, Higher-order principal component analysis for the approximation of tensors in tree-based low-rank formats, Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space, Greedy expansions in convex optimization, The road to deterministic matrices with the restricted isometry property, On the convergence of a weak greedy algorithm for the multivariate Haar basis, Greedy algorithms for high-dimensional eigenvalue problems, The best \(m\)-term approximation with respect to polynomials with constant coefficients, Nonlinear frames and sparse reconstructions in Banach spaces, Orthogonal matching pursuit under the restricted isometry property, Compressed sensing from a harmonic analysis point of view, Dictionary descent in optimization, Positive-definite functions, exponential sums and the greedy algorithm: a curious phenomenon, Quasioptimality of maximum-volume cross interpolation of tensors, Schwarz iterative methods: infinite space splittings, Wavelet bases in the Lebesgue spaces on the field of \(p\)-adic numbers, Greedy Algorithms for Optimal Measurements Selection in State Estimation Using Reduced Models, Computational (numerical) diameter in a context of general theory of a recovery, Example of divergence of a greedy algorithm with respect to an asymmetric dictionary, On the differences between \(L_2\) boosting and the Lasso, Some problems in the theory of ridge functions, Characterization of weight-semi-greedy bases, Greedy adaptive decomposition of signals based on nonlinear Fourier atoms, Projection greedy algorithm, Results on Non-linear Approximation for Wavelet Bases in Weighted Function Spaces, On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames, Integral norm discretization and related problems, Generalized Sobol sensitivity indices for dependent variables: numerical methods, Chebyshev Polynomials and Best Rank-one Approximation Ratio, Optimal approximation order of piecewise constants on convex partitions, Sampling discretization of integral norms, Strong partially greedy bases and Lebesgue-type inequalities, Sparse radial basis function approximation with spatially variable shape parameters, The weighted property (A) and the greedy algorithm, Sequences of \(m\)-term deviations in Hilbert space, Unnamed Item, A solution for the greedy approximation of a step function with a waveform dictionary, Efficiency of the weak Rescaled Pure Greedy Algorithm, Approximation of functions by higher order Szegö kernels I. Complex variable cases, Greedy approximation in convex optimization, Lebesgue constants for the weak greedy algorithm, Recovery of regular ridge functions on the ball, On the coincidence of pure greedy and best \(m\)-term approximations
