Greedy approximation

Acta Numerica

Volumn 17, Issue , 2008, Pages 235-409

  Temlyakov, V N ^a  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 58149380535     PISSN: 09624929     EISSN: 14740508     Source Type: Journal    
DOI: 10.1017/S0962492906380014     Document Type: Article

References (149)

1. A. R. Barron (1993), 'Universal approximation bounds for superposition of n sig-moidal functions', IEEE Trans. Inform. Theory 39, 930-945.
2. A. Barron, A. Cohen, W. Dahmen and R. DeVorc (2005), Approximation and learning by greedy algorithms. Manuscript.
3. B. M. Baishanski (1983), 'Approximation by polynomials of given length', Illinois J. Math. 27, 449-458.
4. N. K. Bary (1961), Trigonometric Series, Nauka, Moscow (in Russian). English translation: Pergamon Press, Oxford (1964).
5. J. Beck and W. Chen (1987), Irregularities of Distribution, Cambridge University Press.
6. W. Bednorz (2006), Greedy bases are best for m-term approximation. Manuscript.
7. M. S. Birman and M. Z. Solomyak (1977), 'Estimates of singular numbers of integral operators', Uspekhi Mat. Nauk 32, 17-84. English translation in Russian Math. Surveys 32 (1977).
8. p-spaces', Israel J. Math. 79, 193-206.
9. E. Candés (2006), Compressive sampling. In Proc. International Congress of Mathematics (Madrid 2006), Vol. 3, pp. 1433-1452.
10. E. Candés, J. Romberg and T. Tao (2006), 'Stable signal recovery from incomplete and inaccurate measurements', Comm. Pure Appl. Math. 59, 1207-1223.
11. E. Candés and T. Tao (2005), 'Decoding by linear programming', IEEE Trans. Inform. Theory 51, 4203-4215.
12. B. Carl (1981), 'Entropy numbers, s-numbers, and eigenvalue problems', J. Fund. Anal. 41, 290-306.
13. S. S. Chen, D. L. Donoho and M. A. Saunders (2001), 'Atomic decomposition by basis pursuit', SIAM Review 43, 129-159.
14. J. A. Cochran (1977), 'Composite integral operators and nuclearity', Ark. Mat. 15, 215-222.
15. A. Cohen, R. A. DeVore and R. Hochmuth (2000), 'Restricted nonlinear approximation'. Constr. Approx. 16, 85-113.
16. A. Cohen, W. Dahmen and R. DeVore (2007), Compressed sensing and k-term approximation. Manuscript.
17. R. R. Coifman and M. V. Wickerhauser (1992), 'Entropy-based algorithms for best-basis selection', IEEE Trans. Inform. Theory 38, 713-718.
18. A. Cordoba and R Fernandez (1998), 'Convergence and divergence of decreasing rearranged Fourier series', SIAM J. Math. Anal. 29, 1129-1139.
19. F. Cucker and S. Smale (2001), 'On the mathematical foundations of learning', Bull. Amer. Math. Soc. 39, 1-49.
20. G. Davis, S. Mallat and M. Avellaneda (1997), 'Adaptive greedy approximations', Constr. Approx. 13, 57-98.
21. R. A. DeVore (1998), Nonlinear approximation. In Acta Numerica, Vol. 7, Cambridge University Press, pp. 51-150.
22. R. A. DeVore (2006), Optimal computation. In Proc. International Congress of Mathematics (Madrid 2006), Vol. 1, pp. 187-215.
23. R. DeVore, B. Jawerth and V. Popov (1992), 'Compression of wavelet decompositions', Amer. J. Math. 114, 737-785.
24. R. DeVore, G. Kerkyacharian, D. Picard and V. Temlyakov (2004), On mathematical methods of learning. IMI Preprint 10, Department of Mathematics, University of South Carolina.
25. R. DeVore, G. Kerkyacharian, D. Picard and V. Temlyakov (2006), 'Mathematical methods for supervised learning', Found. Comput. Math. 6, 3-58.
26. R. A. DeVore, S. V. Konyagin and V. N. Temlyakov (1998), 'Hyperbolic wavelet approximation', Constr. Approx. 14, 1-26.
27. R. A. DeVore and G. G. Lorenz (1993), Constructive Approximation, Springer, Berlin.
28. p Found. Comput. Math. 3, 161-185.
29. R. A. DeVore and V. A. Popov (1988), Interpolation spaces and non-linear approximation. In Function Spaces and Approximation, Vol. 1302 of Lecture Notes in Mathematics, Springer, pp. 191-205.
30. R. A. DeVore and V. N. Temlyakov (1995), 'Nonlinear approximation by trigonometric sums', J. Fourier Anal. Appl. 2, 29-48.
31. R. A. DeVore and V. N. Temlyakov (1996), 'Some remarks on greedy algorithms', Adv. Comput. Math. 5, 173-187.
32. R. A. DeVore and V. N. Temlyakov (1997), 'Nonlinear approximation in finite- dimensional spaces', J. Complexity 13, 489-508.
33. S. J. Dilworth, N. J. Kalton and D. Kutzarova (2003), 'On the existence of almost greedy bases in Banach spaces', Studio, Math. 158, 67-101.
34. S. J. Dilworth, N. J. Kalton, D. Kutzarova and V. N. Temlyakov (2003), 'The thresholding greedy algorithm, greedy bases, and duality', Constr. Approx. 19, 575-597.
35. S. Dilworth, D. Kutzarova and V. Temlyakov (2002), 'Convergence of some greedy algorithms in Banach spaces', J. Fourier Anal. Appl. 8, 489-505.
36. l systems in Banach spaces', J. Approx. Theory 114, 214-241.
37. M. Donahue, L. Gurvits, C. Darken and E. Sontag (1997), 'Rate of convex approximation in non-Hilbert spaces', Constr. Approx. 13, 187-220.
38. D. L. Donoho (1993), 'Unconditional bases are optimal bases for data compression and for statistical estimation', Appl. Comput. Harmon. Anal. 1, 100-115.
39. D. L. Donoho (1997), 'CART and best-ortho-basis: A connection', Ann. Statist. 25, 1870-1911.
40. D. L. Donoho (2001), 'Sparse components of images and optimal atomic decompositions', Constr. Approx. 17, 353-382.
41. D. Donoho (2006), 'Compressed sensing', IEEE Trans. Inform. Theory 52, 1289-1306.
42. D. Donoho, M. Elad and V. N. Temlyakov (2006), 'Stable recovery of sparse over- complete representations in the presence of noise', IEEE Trans. Inform,. Theory 52, 6-18.
43. D. Donoho, M. Elad and V. N. Temlyakov (2007), 'On the Lebesgue type inequalities for greedy approximation', J. Approx. Theory 147, 185-195.
44. D. Donoho and I. Johnstone (1994), 'Ideal spatial adaptation via wavelet shrinkage', Biometrica 81, 425-455.
45. V. V. Dubinin (1997), Greedy algorithms and applications. PhD Thesis, University of South Carolina.
46. 'p spaces of several variables', Acta Math. 129, 137-193.
47. r F, Studio, Math. 89, 79-103.
48. M. Frazier and B. Jawerth (1990), 'A discrete transform and decomposition of distribution spaces', J. Funct. Anal. 93, 34-170.
49. F Fredholm (1903), 'Sur une classc d'équations fonctionelles', Acta Math. 27, 365-390.
50. J. H. Friedman and W. Stuetzlc (1981), 'Projection pursuit regression', J. Amer. Statist. Assoc. 76, 817-823.
51. V. V. Galatenko and E. D. Livshitz (2003), 'On convergence of approximate weak greedy algorithms', East J. Approx. 9, 43-49.
52. V. V. Galatenko and E. D. Livshitz (2005), 'Generalized approximate weak greedy algorithms', Math. Notes 78, 170-184.
53. p-spaces', J. Approx. Theory 124, 89-95.
54. A. Garnaev and E. Gluskin (1984), 'The widths of a Euclidean ball', Dokl. Akad. Nauk USSR 277, 1048-1052. English translation in Soviet Math. Dokl. 30, 200-204.
55. A. C. Gilbert, S. Muthukrishnan and M. J. Strauss (2003), Approximation of functions over redundant dictionaries using coherence. In Proc. 14-th Annual ACM-SIAM Symposium, on Discrete Algorithms, pp. 243-252.
56. S. Gogyan (2005), 'Greedy algorithm with regard to Haar subsystems', East J. Approx. 11, 221-236.
57. 1(0, 1). Manuscript.
58. R. Gribonval and M. Nielsen (2001a), 'Approximate weak greedy algorithms', Adv. Comput. Math. 14, 361-368.
59. R. Gribonval and M. Nielsen (2001b), 'Some remarks on non-linear approximation with Schauder bases', East J. Approx. 7, 267-285.
60. P. Habala, P. Hájek and V. Zizler (1996), Introduction to Banach Spaces, Vol. I, Matfyzpress, Univerzity Karlovy.
61. S. Heinrich, E. Novak, G. Wasilkowski and H. Wozniakowski (2001), 'The inverse of the star-discrepancy depends linearly on the dimension', Acta Arith. 96, 279-302.
62. E. Hille and J. D. Tamarkin (1931), 'On the characteristic values of linear integral equations', Acta Math. 57, 1-76.
63. P. J. Huber (1985), 'Projection pursuit', Ann. Statist. 13, 435-475.
64. L. Jones (1987), 'On a conjecture of Huber concerning the convergence of projection pursuit regression', Ann. Statist. 15, 880-882.
65. L. Jones (1992), 'A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training', Ann. Statist. 20, 608-613.
66. N. J. Kalton, N. T. Beck and J. W. Roberts (1984), An F-Space Sampler, Vol. 5 of London Math. Soc. Lecture Notes, Cambridge University Press, Cambridge.
67. A. Kamont and V. N. Temlyakov (2004), 'Greedy approximation and the multivariate Haar system', Studia Math. 161, 199-223.
68. B. S. Kashin (1977), 'Widths of certain finite-dimensional sets and classes of smooth functions', Izv. Akad. Nauk SSSR, Ser. Mat. 41, 334-351. English translation in Math. USSR IZV. 11.
69. B. S. Kashin (1985), 'On approximation properties of complete orthonormal systems', Tr. Mat. Inst. Steklova 172, 187-191. English translation in Proc. Steklov Inst. Math. 3, 207-211.
70. B. S. Kashin and V. N. Temlyakov (2007), A remark on compressed sensing. Manuscript.
71. G. Kerkyacharian and D. Picard (2004), 'Entropy, universal coding, approximation, and bases properties', Constr. Approx. 20, 1-37.
72. G. Kerkyacharian, D. Picard and V. N. Temlyakov (2006), 'Some inequalities for the tensor product of greedy bases and weight-greedy bases', East J. Approx. 12, 103-118.
73. 1-norms of total and truncated exponential sums', Mat. Zametki 69, 699-707.
74. S. V. Konyagin and V. N. Temlyakov (1999a), 'A remark on greedy approximation in Banach spaces', East J. Approx. 5, 1-15.
75. S. V. Konyagin and V. N. Temlyakov (19996), 'Rate of convergence of pure greedy algorithms', East J. Approx. 5, 493-499.
76. S. V. Konyagin and V. N. Temlyakov (2002), 'Greedy approximation with regard to bases and general minimal systems', Serdica Math. J. 28, 305-328.
77. S. V. Konyagin and V. N. Temlyakov (2003a), 'Convergence of greedy approximation I: General systems', Studia Math. 159, 143-160.
78. S. V. Konyagin and V. N. Temlyakov (20036), 'Convergence of greedy approximation II: The trigonometric system', Studia Math. 159, 161-184.
79. S. V. Konyagin and V. N. Temlyakov (2004), Some error estimates in learning theory. In Approximation Theory: A Volume Dedicated to Borislav Bojanov, Marin Drinov Academy Publishing House, Sofia, pp. 126-144.
80. S. V. Konyagin and V. N. Temlyakov (2005), 'Convergence of greedy approximation for the trigonometric system', Anal. Math. 31, 85-115.
81. S. V. Konyagin and V. N. Temlyakov (2007), 'The entropy in learning theory: Error estimates', Constr. Approx. 25, 1-27.
82. T. W. Körner (1996), 'Divergence of decreasing rearranged Fourier series', Ann. of Math. 144, 167-180.
83. T. W. Körner (1999), 'Decreasing rearranged Fourier series', J. Fourier Anal. Appl. 5, 1-19.
84. H. Lcbesgue (1909), 'Sur les intégrates singuliércs', Ann. Fac. Sci. Univ. Toulouse (3) 1, 25-117.
85. W. S. Lee, P. L. Bartlett and R. C. Williamson (1996), 'Efficient agnostic learning of neural networks with bounded fan-in', IEEE Trans. Inform. Theory 42, 2118-2132.
86. D. Leviatan and V. N. Temlyakov (2005), 'Simultaneous greedy approximation in Banach spaces', J. Complexity 21, 275-293.
87. D. Leviatan and V. N. Temlyakov (2006), 'Simultaneous approximation by greedy algorithms', Adv. Comput. Math. 25, 73-90.
88. J. Lindenstrauss and L. Tzafriri (1977), Classical Banach Spaces, Vol. I, Springer, Berlin.
89. E. D. Livshitz (2003), 'Convergence of greedy algorithms in Banach spaces', Math. Notes 73, 342-368.
90. E. D. Livshitz (2006), 'On the recursive greedy algorithm', Izv. RAN. Ser. Mat. 70, 95-116.
91. E. D. Livshitz (2007a), 'Optimality of the greedy algorithm for some function classes', Mat. Sb. 198, 95-114.
92. E. D. Livshitz (20076), On lower estimates of rate of convergence of greedy algorithms. Manuscript.
93. E. D. Livshitz and V. N. Temlyakov (2001), 'On the convergence of weak greedy algorithms', Tr. Mat. Inst. Steklova 232, 236-247.
94. E. D. Livshitz and V. N. Temlyakov (2003), 'Two lower estimates in greedy approximation', Constr. Approx. 19, 509-523.
95. A. Lutoborski and V. N. Temlyakov (2003), 'Vector greedy algorithms', J. Complexity 19, 458-473.
96. V. E. Maiorov, K. I. Oskolkov and V. N. Temlyakov (2002), Gridge approximations and Radon compass. In Approximation Theory: A Volume Dedicated to Blagovest Sendov, DARBA, Sofia, pp. 284-309.
97. S. Mallat and Z. Zhang (1993), 'Matching pursuit in a time-frequency dictionary', IEEE Trans. Signal Proc. 41, 3397-3415.
98. D. Needell and R. Vershynin (2007), Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Manuscript.
99. H. Niederreiter, R. F. Tichy and G. Turnwald (1990), 'An inequality for differences of distribution functions', Arch. Math. 54, 166-172.
100. p(T;w). Manuscript.
101. S. N. Nikol'skii(1975), Approximation of Functions of Several Variables and Embedding Theorems. Springer.
102. P. Oswald (2001), 'Greedy algorithms and best m-term approximation with respect to biorthogonal systems', J. Fourier Anal. Appl. 7, 325-341.
103. P. Petrushev (1988), Direct and converse theorems for spline and rational approximation and Besov spaces. In Function Spaces and Applications, Vol. 1302 of Lecture Notes in Mathematics, pp. 363-377.
104. T. Poggio and S. Smale (2003), 'The mathematics of learning: Dealing with data', Notices Amer. Math. Soc., 50, 537-544.
105. E. Schmidt (1906), 'Zur Theorie der linearen und nichtlinearen Integralgleichun-gen I', Math. Annalen 63, 433-476.
106. A. V. Sil'nichenko (2004), 'Rate of convergence of greedy algorithms', Mat. Zametki 76, 628-632.
107. F. Smithies (1937), 'The eigen-values and singular values of integral equations', Proc. London Math. Soc. (2) 43, 255-279.
108. T. Stromberg and R. Heath Jr. (2003), 'Grassmannian frames with applications to coding and communications', Appl. Comput. Harm. Anal. 14, 257-275.
109. V. N. Temlyakov (1988), 'Approximation by elements of a finite dimensional sub-space of functions from various Sobolcv or Nikol'skii spaces', Matem. Zametki 43, 770-786. English translation in Math. Notes 43, 444-454.
110. V. N. Temlyakov (1989a), 'Approximation of functions with bounded mixed derivative', Proc. Steklov Inst. 1, 1-122.
111. V. N. Temlyakov (19896) 'Estimates of the best bilinear approximations of functions of two variables and some of their applications', Math. USSR Sb. 62, 95-109.
112. V. N. Temlyakov (1990), 'Bilinear approximation and applications', Proc. Steklov Inst. Math. 3, 221-248.
113. V. N. Temlyakov (1992a), 'On estimates of approximation numbers and best bilinear approximation', Constr. Approx. 8, 23-33.
114. V. N. Temlyakov (19926), 'Estimates of best bilinear approximations of functions and approximation numbers of integral operators', Math. Notes 51, 510-517.
115. V. N. Temlyakov (19936), 'Bilinear approximation and related questions', Proc. Steklov Inst. Math. 4, 245-265.
116. V. N. Temlyakov (1998a), 'The best m-term approximation and greedy algorithms', Adv. Comput. Math. 8, 249-265.
117. V. N. Temlyakov (19986), 'Nonlinear m-term approximation with regard to the multivariate Haar system', East J. Approx. 4, 87-106.
118. V. N. Temlyakov (1998c), 'Greedy algorithm and m-term trigonometric approximation', Constr. Approx. 14, 569-587.
119. V. N. Temlyakov (1999), 'Greedy algorithms and m-term approximation with regard to redundant dictionaries', J. Approx. Theory 98, 117-145.
120. V. N. Temlyakov (2000a), 'Greedy algorithms with regard to multivariate systems with special structure', Constr. Approx. 16, 399-425.
121. V. N. Temlyakov (20006), 'Weak greedy algorithms', Adv. Comput. Math. 12, 213-227.
122. V. N. Temlyakov (2001a), Lecture notes on approximation theory, Chapter I, University of South Carolina, pp. 1-20.
123. V. N. Temlyakov (20016), 'Greedy algorithms in Banach spaces', Adv. Comput. Math. 14, 277-292.
124. V. N. Temlyakov (2002a), 'Universal bases and greedy algorithms for anisotropic function classes', Constr. Approx. 18, 529-550.
125. V. N. Temlyakov (20026), 'A criterion for convergence of weak greedy algorithms', Adv. Comput. Math. 17, 269-280.
126. V. N. Temlyakov (2002c), Nonlinear approximation with regard to bases. In Approximation Theory X, Vanderbilt University Press, Nashville, TN, pp. 373-402.
127. V. N. Temlyakov (2003a), 'Nonlinear methods of approximation', Found. Comput. Math. 3, 33-107.
128. V. N. Temlyakov (20036), 'Cubature formulas, discrepancy, and nonlinear approximation', J. Complexity 19, 352-391.
129. V. N. Temlyakov (2004), 'A remark on simultaneous greedy approximation', East J. Approx. 10, 17-25.
130. V. N. Temlyakov (2005a), 'Greedy type algorithms in Banach spaces and applications', Constr. Approx. 21, 257-292.
131. V. N. Temlyakov (20056), 'Greedy algorithms with restricted depth search', Proc. Steklov Inst. Math. 248, 255-267.
132. V. N. Temlyakov (2005c), Approximation in learning theory. IMI Preprint 05, Department of Mathematics, University of South Carolina.
133. V. N. Temlyakov (2005d), On universal estimators in learning theory. IMI Preprint 17, Department of Mathematics, University of South Carolina.
134. V. N. Temlyakov (2006a), Greedy approximations. In Foundations of Computational Mathematics: Santander 2005, Vol. 331 of London Mathematical Society Lecture Notes, Cambridge University Press, pp. 371-394.
135. V. N. Temlyakov (20066), Greedy approximations with regard to bases. In Proc. International Congress of Mathematics (Madrid 2006), Vol. 2, pp. 1479-1504.
136. V. N. Temlyakov (2006c), Relaxation in greedy approximation. IMI Preprint 03, Department of Mathematics, University of South Carolina.
137. V. N. Temlyakov (2006d), 'Optimal estimators in learning theory', Approximation and Probability, Banach Center Publications, 72, 341-366.
138. V. N. Temlyakov (2007a), 'Greedy expansions in Banach spaces', Adv. Comput. Math. 26, 431-449.
139. V. N. Temlyakov (2007b), 'Greedy algorithms with prescribed coefficients', J. Fourier Anal. Appl. 13, 71-86.
140. J. F. Traub, G. W. Wasilkowski and H. Wozniakowski (1988), Information-Based Complexity, Academic Press, New York.
141. J. A. Tropp (2004), 'Greed is good: Algorithmic results for sparse approximation', IEEE Trans. Inform. Theory 50, 2231-2242.
142. J. A. Tropp and A. C. Gilbert (2005), Signal recovery from partial information via orthogonal matching pursuit. Preprint, University of Michigan.
143. p and Bergman spaces', Constr. Approx. 13, 1-15.
144. P. Wojtaszczyk (2000), 'Greedy algorithms for general systems', J. Approx. Theory 107, 293-314.
145. P. Wojtaszczyk (2002a), Greedy type bases in Banach spaces. In Constructive Function Theory, DARBA, Sofia, pp. 1-20.
146. P. Wojtaszczyk (2002b), 'Existence of best m-term approximation', Functiones et Approximatio XXX, 127-133.
147. P. Wojtaszczyk (2006), 'Greediness of the Haar system in rearrangement invariant spaces', Banach Center Publications 72, 385-395.
148. H. Weyl (1911), 'Das asymptotische Verteilimgsgesetz der Eigenwerte linearer par- tieller Differentialgleichungen', Math. Ann. 71, 441-479.
149. A. Zygmund (1959), Trigonometric Series, Cambridge University Press.