125 citations to 10.1023/A:1018917218956 (Crossref Cited-By Service)
  1. L. Burusheva, V. Temlyakov, “Sparse approximation of individual functions”, Journal of Approximation Theory, 259, 2020, 105471  crossref
  2. Tzu-Chang F. Cheng, Ching-Kang Ing, Shu-Hui Yu, “Toward optimal model averaging in regression models with time series errors”, Journal of Econometrics, 189, no. 2, 2015, 321  crossref
  3. Tze Leung Lai, Hongsong Yuan, “Stochastic Approximation: From Statistical Origin to Big-Data, Multidisciplinary Applications”, Statist. Sci., 36, no. 2, 2021  crossref
  4. Artur R. Valiullin, Albert R. Valiullin, Alexei P. Solodov, “Sharp sufficient condition for the convergence of greedy expansions with errors in coefficient computation”, Demonstratio Mathematica, 55, no. 1, 2022, 254  crossref
  5. A.V. Dereventsov, V.N. Temlyakov, “A unified way of analyzing some greedy algorithms”, Journal of Functional Analysis, 277, no. 12, 2019, 108286  crossref
  6. Ching-Kang Ing, Tze Leung Lai, “Discussion on “Two-Stage Procedures for High-Dimensional Data” by Makoto Aoshima and Kazuyoshi Yata”, Sequential Analysis, 30, no. 4, 2011, 404  crossref
  7. Magali Champion, Christine Cierco-Ayrolles, Sébastien Gadat, Matthieu Vignes, “Sparse regression and support recovery with L2-Boosting algorithms”, Journal of Statistical Planning and Inference, 155, 2014, 19  crossref
  8. Ching-Kang Ing, “Model selection for high-dimensional linear regression with dependent observations”, Ann. Statist., 48, no. 4, 2020  crossref
  9. Gérard Biau, Benoît Cadre, Advances in Contemporary Statistics and Econometrics, 2021, 23  crossref
  10. E. D. Livshits, “Realizability of greedy algorithms”, Proc. Steklov Inst. Math., 273, no. S1, 2011, 107  crossref
Previous
1
2
3
4
5
6
13
Next