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

从显示偏好中有效学习

Efficiently Learning from Revealed Preference

University of Pennsylvania(宾夕法尼亚大学)

Morteza Zadimoghaddam, Aaron Roth

摘要:

在本文中,我们考虑的显示偏好问题,从学习的角度。每一天,价格向量和预算都是从一个未知的分布中得出的,理性的代理人根据一些未知的效用函数购买他最喜欢的捆绑,受到给定的价格和预算约束。我们不仅希望找到一个效用函数,合理化一组有限的观察,但要产生一个假设的价值函数,准确地预测代理人在未来的行为。我们给出了有效的算法与多项式样本复杂性的代理与线性估值函数,以及代理与线性可分,凹估值函数与有界二阶导数。

英文摘要:

In this paper, we consider the revealed preferences problem from a learning perspective. Every day, a price vector and a budget is drawn from an unknown distribution, and a rational agent buys his most preferred bundle according to some unknown utility function, subject to the given prices and budget constraint. We wish not only to find a utility function which rationalizes a finite set of observations, but to produce a hypothesis valuation function which accurately predicts the behavior of the agent in the future. We give efficient algorithms with polynomial sample-complexity for agents with linear valuation functions, as well as for agents with linearly separable, concave valuation functions with bounded second derivative.

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

↑