Realizability of greedy algorithms

被引：0
|
作者：
E. D. Livshits
机构：
[1] Evernote Corp.,
来源：
Proceedings of the Steklov Institute of Mathematics | 2011年 / 273卷
关键词：
best ; -term approximation; greedy algorithms; category;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A purely greedy algorithm and an orthogonal greedy algorithm are studied. It is established that the set of objective functions for which a greedy algorithm can be “realized correctly” has second category for discrete dictionaries.
引用
收藏
页码：107 / 115
页数：8
相关论文
共 50 条
  • [1] Realizability of Greedy Algorithms
    Livshits, E. D.
    PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2011, 273 : S107 - S115
  • [2] Realizability of greedy algorithms
    Livshits, E. D.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2010, 16 (04): : 228 - 236
  • [3] Greedy by Chance - Stochastic Greedy Algorithms
    Kodaganallur, Viswanathan
    Sen, Anup K.
    SIXTH INTERNATIONAL CONFERENCE ON AUTONOMIC AND AUTONOMOUS SYSTEMS: ICAS 2010, PROCEEDINGS, 2010, : 182 - 187
  • [4] On performance of greedy algorithms
    Temlyakov, Vladimir N.
    Zheltov, Pavel
    JOURNAL OF APPROXIMATION THEORY, 2011, 163 (09) : 1134 - 1145
  • [5] Greedy algorithms in Datalog
    2001, Cambridge University Press (01)
  • [6] Vector greedy algorithms
    Lutoborski, A
    Temlyakov, VN
    JOURNAL OF COMPLEXITY, 2003, 19 (04) : 458 - 473
  • [7] Greedy algorithms in Datalog
    Greco, S
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2001, 1 : 381 - 407
  • [8] Greedy algorithms for prediction
    Sancetta, Alessio
    BERNOULLI, 2016, 22 (02) : 1227 - 1277
  • [9] The classification of greedy algorithms
    Curtis, SA
    SCIENCE OF COMPUTER PROGRAMMING, 2003, 49 (1-3) : 125 - 157
  • [10] Beware greedy algorithms
    Simmons, Benno I.
    Hoeppke, Christoph
    Sutherland, William J.
    JOURNAL OF ANIMAL ECOLOGY, 2019, 88 (05) : 804 - 807
12345