Skip to main content
Article thumbnail
Location of Repository

Online and Batch Learning Algorithms for Data with Missing Features

By Afshin Rostamizadeh, Alekh Agarwal and Peter Bartlett

Abstract

We introduce new online and batch algorithms that are robust to data with missing features, a situation that arises in many practical applications. In the online setup, we allow for the comparison hypothesis to change as a function of the subset of features that is observed on any given round, extending the standard setting where the comparison hypothesis is fixed throughout. In the batch setup, we present a convex relation of a non-convex problem to jointly estimate an imputation function, used to fill in the values of missing features, along with the classification hypothesis. We prove regret bounds in the online setting and Rademacher complexity bounds for the batch i.i.d. setting. The algorithms are tested on several UCI datasets, showing superior performance over baselines

Topics: Computer Science - Machine Learning, Statistics - Machine Learning
Year: 2011
OAI identifier: oai:arXiv.org:1104.0729
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.0729 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.