arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1502.05774cs.GTcs.AIcs.LGstat.ML
收藏

通过主动数据采购实现低成本学习

Low-Cost Learning via Active Data Procurement

University of Michigan(密歇根大学);Harvard SEAS(哈佛大学约翰·A·保尔森工程与应用科学学院);UCLA(加州大学洛杉矶分校)

Jacob Abernethy, Yiling Chen, Chien-Ju Ho, Bo Waggoner

摘要:

我们设计的机制,在线采购数据的战略代理机器学习任务。挑战在于使用过去的数据来积极地为未来的数据定价,并提供学习保证,即使代理人透露数据的成本可能任意取决于数据本身。我们通过展示如何将一大类无遗憾算法转换为在线发布价格和学习机制来实现这一目标。我们的结果在某种意义上平行经典样本的复杂性保证,但与关键资源是金钱,而不是数据量:与预算约束$B$,我们给强大的风险(预测误差)界的顺序$1/\sqrt{B}$。因为我们使用主动的方法,我们通常可以通过利用成本和数据之间的相关性来保证做得更好。我们的算法和分析经历了一个模型的无悔学习$T$到达对(成本,数据)和预算约束$B$。我们对这个模型的遗憾界的顺序是$T/\sqrt{B}$,我们给出了相同的顺序下界。

英文摘要:

We design mechanisms for online procurement of data held by strategic agents for machine learning tasks. The challenge is to use past data to actively price future data and give learning guarantees even when an agent's cost for revealing her data may depend arbitrarily on the data itself. We achieve this goal by showing how to convert a large class of no-regret algorithms into online posted-price and learning mechanisms. Our results in a sense parallel classic sample complexity guarantees, but with the key resource being money rather than quantity of data: With a budget constraint $B$, we give robust risk (predictive error) bounds on the order of $1/\sqrt{B}$. Because we use an active approach, we can often guarantee to do significantly better by leveraging correlations between costs and data. Our algorithms and analysis go through a model of no-regret learning with $T$ arriving pairs (cost, data) and a budget constraint of $B$. Our regret bounds for this model are on the order of $T/\sqrt{B}$ and we give lower bounds on the same order.

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

↑