Antos, András and Grover, Varun and Szepesvári, Csaba (2010) Active learning in heteroscedastic noise. Theoretical Computer Science, 411. pp. 2712-2728.

Preview	Image (cover image) cover.jpg - Cover Image Download (10kB) | Preview
	Text S0304397510002021.pdf - Published Version Restricted to Registered users only Download (484kB)
	Text angrsz_allocation.pdf - Published Version Restricted to Registered users only Download (361kB)
	Text AllocationTCS10.pdf - Published Version Restricted to Registered users only Download (360kB)

Abstract

We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate the next observation from, the goal being to produce estimates with equally good precision for all the options. If sample means are used to estimate the unknown values then the optimal solution, assuming that the distributions are known up to a shift, is to sample from each distribution proportional to its variance. No information other than the distributions' variances is needed to calculate the optimal solution. In this paper we propose an incremental algorithm that asymptotically achieves the same loss as an optimal rule. We prove that the excess loss suffered by this algorithm, apart from logarithmic factors, scales as $n^{-3/2}$, which we conjecture to be the optimal rate. The performance of the algorithm is illustrated on a simple problem.

Item Type:	ISI Article
Uncontrolled Keywords:	active learning, heteroscedastic noise, regression, sequential analysis, sequential allocation
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User:	Eszter Nagy
Date Deposited:	11 Dec 2012 16:05
Last Modified:	11 Dec 2012 16:05
URI:	https://eprints.sztaki.hu/id/eprint/6029

Update Item