SOTAVerified

Active Learning for Non-Parametric Regression Using Purely Random Trees

2018-12-01NeurIPS 2018Code Available0· sign in to hype

Jack Goetz, Ambuj Tewari, Paul Zimmerman

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Active learning is the task of using labelled data to select additional points to label, with the goal of fitting the most accurate model with a fixed budget of labelled points. In binary classification active learning is known to produce faster rates than passive learning for a broad range of settings. However in regression restrictive structure and tailored methods were previously needed to obtain theoretically superior performance. In this paper we propose an intuitive tree based active learning algorithm for non-parametric regression with provable improvement over random sampling. When implemented with Mondrian Trees our algorithm is tuning parameter free, consistent and minimax optimal for Lipschitz functions.

Tasks

Reproductions