• DocumentCode
    1522737
  • Title

    How to overcome the curse of long-memory errors

  • Author

    Efromovich, Sam

  • Author_Institution
    Dept. of Math. & Stat., New Mexico Univ., Albuquerque, NM, USA
  • Volume
    45
  • Issue
    5
  • fYear
    1999
  • fDate
    7/1/1999 12:00:00 AM
  • Firstpage
    1735
  • Lastpage
    1741
  • Abstract
    Long-memory errors dramatically slow down the convergence of minimax risks in a fixed design nonparametric regression. The problem becomes even more complicated for the case of adaptive estimation. This defines the curse of long-memory errors. I show that using a random design, instead of a fixed one, allows one to overcome this curse and make familiar data-driven estimators robust. Moreover, the result holds for a wide class of nonstationary errors with bounded moments (including bounded deterministic errors). Possible extensions are discussed
  • Keywords
    Monte Carlo methods; adaptive estimation; error analysis; error statistics; information theory; minimax techniques; nonparametric statistics; statistical analysis; adaptive estimation; bounded deterministic errors; bounded moments; convergence of minimax risks; fixed design; long-memory errors; nonparametric regression; nonstationary errors; random design; Adaptive estimation; Convergence; Mathematics; Minimax techniques; Neural networks; Prototypes; Robustness; Shape; Signal design; Statistics;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.771257
  • Filename
    771257