Skip to main navigation Skip to search Skip to main content

Competing against the best nearest neighbor filter in regression

  • Université Paris Est, ENPC LIGM, IMAGINE
  • Duke University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

Designing statistical procedures that are provably almost as accurate as the best one in a given family is one of central topics in statistics and learning theory. Oracle inequalities offer then a convenient theoretical framework for evaluating different strategies, which can be roughly classified into two classes: selection and aggregation strategies. The ultimate goal is to design strategies satisfying oracle inequalities with leading constant one and rate-optimal residual term. In many recent papers, this problem is addressed in the case where the aim is to beat the best procedure from a given family of linear smoothers. However, the theory developed so far either does not cover the important case of nearest-neighbor smoothers or provides a suboptimal oracle inequality with a leading constant considerably larger than one. In this paper, we prove a new oracle inequality with leading constant one that is valid under a general assumption on linear smoothers allowing, for instance, to compete against the best nearest-neighbor filters.

Original languageEnglish
Title of host publicationAlgorithmic Learning Theory - 22nd International Conference, ALT 2011, Proceedings
Pages129-143
Number of pages15
DOIs
Publication statusPublished - 20 Oct 2011
Externally publishedYes
Event22nd International Conference on Algorithmic Learning Theory, ALT 2011 - Espoo, Finland
Duration: 5 Oct 2011 → 7 Oct 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6925 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd International Conference on Algorithmic Learning Theory, ALT 2011
Country/TerritoryFinland
CityEspoo
Period5/10/11 → 7/10/11

Keywords

  • adaptive smoothing
  • nonparametric regression
  • supervised learning

Fingerprint

Dive into the research topics of 'Competing against the best nearest neighbor filter in regression'. Together they form a unique fingerprint.

Cite this