On Statistical Efficiency in Learning

Jie Ding, Enmao Diao, Jiawei Zhou, Vahid Tarokh

Research output: Contribution to journalArticlepeer-review

Abstract

A central issue of many statistical learning problems is to select an appropriate model from a set of candidate models. Large models tend to inflate the variance (or overfitting), while small models tend to cause biases (or underfitting) for a given fixed dataset. In this work, we address the critical challenge of model selection to strike a balance between model fitting and model complexity, thus gaining reliable predictive power. We consider the task of approaching the theoretical limit of statistical learning, meaning that the selected model has the predictive performance that is as good as the best possible model given a class of potentially misspecified candidate models. We propose a generalized notion of Takeuchi’s information criterion and prove that the proposed method can asymptotically achieve the optimal out-sample prediction loss under reasonable assumptions. It is the first proof of the asymptotic property of Takeuchi’s information criterion to our best knowledge. Our proof applies to a wide variety of nonlinear models, loss functions, and high dimensionality (in the sense that the models’ complexity can grow with sample size). The proposed method can be used as a computationally efficient surrogate for leave-one-out cross-validation. Moreover, for modeling streaming data, we propose an online algorithm that sequentially expands the model complexity to enhance selection stability and reduce computation cost. Experimental studies show that the proposed method has desirable predictive power and significantly less computational cost than some popular methods.

Original languageEnglish (US)
JournalIEEE Transactions on Information Theory
DOIs
StateAccepted/In press - 2020

Keywords

  • Adaptation models
  • Adaptivity to oracle
  • Analytical models
  • Complexity theory
  • Computational modeling
  • Cross-validation
  • Data models
  • Expert learning
  • Model expansion
  • Model selection
  • Predictive models
  • Solid modeling
  • Takeuchi’s information criterion

Fingerprint Dive into the research topics of 'On Statistical Efficiency in Learning'. Together they form a unique fingerprint.

Cite this