文章基本信息

标题：Learning Time Dependent Choice
本地全文：下载
作者：Zachary Chase ; Siddharth Prasad
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2018
卷号：124
页码：1-19
DOI：10.4230/LIPIcs.ITCS.2019.62
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We explore questions dealing with the learnability of models of choice over time. We present a large class of preference models defined by a structural criterion for which we are able to obtain an exponential improvement over previously known learning bounds for more general preference models. This in particular implies that the three most important discounted utility models of intertemporal choice - exponential, hyperbolic, and quasi-hyperbolic discounting - are learnable in the PAC setting with VC dimension that grows logarithmically in the number of time periods. We also examine these models in the framework of active learning. We find that the commonly studied stream-based setting is in general difficult to analyze for preference models, but we provide a redeeming situation in which the learner can indeed improve upon the guarantees provided by PAC learning. In contrast to the stream-based setting, we show that if the learner is given full power over the data he learns from - in the form of learning via membership queries - even very naive algorithms significantly outperform the guarantees provided by higher level active learning algorithms.
关键词：Intertemporal Choice; Discounted Utility; Preference Recovery; PAC Learning; Active Learning