PENALIZED MAXIMUM LIKELIHOOD AND SEMIPARAMETRIC SECOND-ORDER EFFICIENCY

By Arnak S. Dalalyan, G. Golubev, Alexandre B. Tsybakov. 2006

52 citations recorded by the source corpus.

We consider the problem of estimation of a shift parameter of an unknown symmetric function in Gaussian white noise. We introduce a notion of semiparametric second-order efficiency and propose estimators that are semiparametrically efficient and second-orderefficient in our model. These estimators are of a penalized maximum likelihood type with an appropriately chosen penalty. We argue that secondorder efficiency is crucial in semiparametric problems sinceonly the second-order terms in asymptotic expansion for the risk account for the behavior of the “nonparametric component” of a semiparametric procedure, and they are not dramatically smaller than the first-order terms. 1. Introduction. Semiparametric statistical models are the ones containing a finite-dimensional parameter of interest θ and an infinite-dimensional nuisance parameter f which is a member of some large functional class. The goal is then to estimate θ efficiently without knowingf. A comprehensive account of the theory of semiparametric estimation is given in the book of Bickel, Klaassen, Ritov and Wellner [3]. In particular, it is shown that for many semiparametric models there exist estimators attaining the same asymptotic performance as efficient parametric estimators c for the problem where f is completely specified. In other words, for such semiparametric models there is no loss of efficiency as compared tothe corresponding parametric models with known f. These semiparametric models are usually called adaptive, but we prefer here to call them S-adaptive, or semiparametrically adaptive, in order to avoid confusion with nonparametric adaptivity to unknown smoothness of f. Estimators attaining parametric

Subfields: Computer Networks and Communications, Finance, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/1ff2251dc31ef23566e7cb3963ff1527356dc370

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Francis R. Bach
  2. Percy Liang
  3. Guillaume Bouchard
  4. Michael I. Jordan
  5. Evarist Gin'e
  6. Richard Nickl
  7. Yu Zhang
  8. Qiang Yang

In Finance

  1. Richard Nickl
  2. Evarist Gin'e
  3. Francis R. Bach
  4. Michael I. Jordan
  5. Bharath K. Sriperumbudur
  6. Karim Lounici
  7. I. Castillo

In Statistics and Probability

  1. Richard Nickl
  2. Evarist Gin'e
  3. Bharath K. Sriperumbudur
  4. Francis R. Bach
  5. Michael I. Jordan
  6. Percy Liang
  7. Arthur Gretton
  8. Victor Chernozhukov

Citations in the corpus