arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1311.2236stat.MLcs.LGmath.STstat.TH
收藏

快速分布到真实回归

Fast Distribution To Real Regression

Carnegie Mellon University(卡内基梅隆大学)

Junier B. Oliva, Willie Neiswanger, Barnabas Poczos, Jeff Schneider, Eric Xing

摘要:

我们研究的问题,分布到实值回归,其中一个的目的是回归映射$f$,需要在一个分布输入协变量$P\in \mathcal{I}$(对于一个非参数的家庭分布$\mathcal{I}$)和输出一个实值响应$Y=f(P) + ε$。最近研究了这种设置,并引入了“核-核”估计,并证明具有多项式收敛速度。但是,使用核-核估计量评估新预测时,尺度为$Ω(N)$。这导致困难的情况,其中大量的数据可能是必要的低估计风险,但估计的计算成本变得不可行时,数据集太大。为此,我们提出了双基估计器,它希望从两个方面缓解这个大数据问题:首先,当在训练后评估新的预测时,双基估计器的计算复杂度与实例$N$的数量无关;其次,双基估计器对于一般映射类$f\in\mathcal{F}$具有快速收敛速度。

英文摘要:

We study the problem of distribution to real-value regression, where one aims to regress a mapping $f$ that takes in a distribution input covariate $P\in \mathcal{I}$ (for a non-parametric family of distributions $\mathcal{I}$) and outputs a real-valued response $Y=f(P) + ε$. This setting was recently studied, and a "Kernel-Kernel" estimator was introduced and shown to have a polynomial rate of convergence. However, evaluating a new prediction with the Kernel-Kernel estimator scales as $Ω(N)$. This causes the difficult situation where a large amount of data may be necessary for a low estimation risk, but the computation cost of estimation becomes infeasible when the data-set is too large. To this end, we propose the Double-Basis estimator, which looks to alleviate this big data problem in two ways: first, the Double-Basis estimator is shown to have a computation complexity that is independent of the number of of instances $N$ when evaluating new predictions after training; secondly, the Double-Basis estimator is shown to have a fast rate of convergence for a general class of mappings $f\in\mathcal{F}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑