非参数选择模型的动态数据驱动估计
Dynamic Data-Driven Estimation of Non-Parametric Choice Models
摘要:
本文研究了选择模型的非参数估计,它是为了减轻传统参数模型中的不合理假设而引入的,在许多应用领域都很流行。现有的文献只集中在静态的观测设置,所有的观察是预先给定的,他们没有配备明确的收敛速度保证,因此,他们不能提供一个先验分析的模型精度与稀疏性权衡的实际估计模型返回的算法。与此相反,我们专注于从\emph{dynamic}设置中的观测数据估计非参数选择模型,其中观测是随着时间的推移获得的。我们发现,选择模型估计可以铸造作为一个凸凹鞍点(SP)联合估计和优化(JEO)的问题,我们提供了一个原始-对偶框架推导算法来解决这个基于在线凸优化。通过调整我们的框架仔细选择模型估计问题,我们得到易于处理的算法,可证明的收敛保证和估计模型的稀疏性的明确界限。我们的数值实验证实了从我们的框架派生的算法的有效性。
英文摘要:
We study non-parametric estimation of choice models, which were introduced to alleviate unreasonable assumptions in traditional parametric models, and are prevalent in several application areas. Existing literature focuses only on the static observational setting where all of the observations are given upfront, they are not equipped with explicit convergence rate guarantees, and consequently they cannot provide an a priori analysis for the model accuracy vs sparsity trade-off on the actual estimated model returned by their algorithms. As opposed to this, we focus on estimating a non-parametric choice model from observational data in a \emph{dynamic} setting, where observations are obtained over time. We show that choice model estimation can be cast as a convex-concave saddle-point (SP) joint estimation and optimization (JEO) problem, and we provide a primal-dual framework for deriving algorithms to solve this based on online convex optimization. By tailoring our framework carefully to the choice model estimation problem, we obtain tractable algorithms with provable convergence guarantees and explicit bounds on the sparsity of the estimated model. Our numerical experiments confirm the effectiveness of the algorithms derived from our framework.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。