%0 Journal Article %1 a.antos2010 %A Antos, A. %A Grover, V. %A Szepesvári, Cs. %D 2010 %J Theoretical Computer Science %K active algorithms, learning, regression, sequential theory %N 29--30 %P 2712--2728 %R 10.1016/j.tcs.2010.04.007 %T Active Learning in Heteroscedastic Noise %V 411 %X 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 su ered 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.

@article{a.antos2010, 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 su ered 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.}, added-at = {2020-03-17T03:03:01.000+0100}, author = {Antos, A. and Grover, V. and Szepesv{\'a}ri, {Cs}.}, bdsk-url-1 = {http://dx.doi.org/10.1016/j.tcs.2010.04.007}, biburl = {https://www.bibsonomy.org/bibtex/2228dfc1e933300a2137c4e8d855b6f13/csaba}, date-added = {2010-08-28 17:38:14 -0600}, date-modified = {2010-11-25 00:42:00 -0700}, doi = {10.1016/j.tcs.2010.04.007}, interhash = {5af85a7f109dd02f395546f1acdd997d}, intrahash = {228dfc1e933300a2137c4e8d855b6f13}, issn = {0304-3975}, journal = {Theoretical Computer Science}, keywords = {active algorithms, learning, regression, sequential theory}, month = {June}, number = {29--30}, pages = {2712--2728}, pdf = {papers/Allocation-TCS10.pdf}, timestamp = {2020-03-17T03:03:01.000+0100}, title = {Active Learning in Heteroscedastic Noise}, volume = 411, year = 2010 }