arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.01264cs.LGmath.OCstat.ML
收藏

泊松似然模型的快速简单优化

Fast and Simple Optimization for Poisson Likelihood Models

University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-尚佩恩分校);Courant Institute, New York University(纽约大学库朗研究所);Georgia Institute of Technology(佐治亚理工学院)

Niao He, Zaid Harchaoui, Yichen Wang, Le Song

摘要:

泊松似然模型已被广泛应用于成像、社交网络和时间序列分析。我们提出了快速,简单,理论基础,和通用的,泊松似然建模的优化算法。泊松对数似然是凹的,但不是Lipschitz连续的。由于几乎所有基于梯度的优化算法都依赖于Lipschitz连续性,因此在保证收敛的情况下优化泊松似然模型可能具有挑战性,特别是对于大规模问题。我们提出了一个新的视角,允许有效地优化范围广泛的惩罚泊松似然目标。我们证明了一个适当的鞍点重构享有良好的几何和光滑的结构。因此,我们可以设计一个新的基于梯度的优化算法与$O(1/t)$收敛速度,在对比通常的$O(1/\sqrt{t})$速度的非光滑最小化的替代品。此外,为了解决大样本问题,我们还开发了一种随机块分解变体,它具有相同的收敛速度,但更有效的迭代成本。在社会网络估计和时态推荐等多个点过程应用上的实验结果表明,该算法及其随机块变体在合成数据集和真实数据集上的性能均优于现有方法.

英文摘要:

Poisson likelihood models have been prevalently used in imaging, social networks, and time series analysis. We propose fast, simple, theoretically-grounded, and versatile, optimization algorithms for Poisson likelihood modeling. The Poisson log-likelihood is concave but not Lipschitz-continuous. Since almost all gradient-based optimization algorithms rely on Lipschitz-continuity, optimizing Poisson likelihood models with a guarantee of convergence can be challenging, especially for large-scale problems. We present a new perspective allowing to efficiently optimize a wide range of penalized Poisson likelihood objectives. We show that an appropriate saddle point reformulation enjoys a favorable geometry and a smooth structure. Therefore, we can design a new gradient-based optimization algorithm with $O(1/t)$ convergence rate, in contrast to the usual $O(1/\sqrt{t})$ rate of non-smooth minimization alternatives. Furthermore, in order to tackle problems with large samples, we also develop a randomized block-decomposition variant that enjoys the same convergence rate yet more efficient iteration cost. Experimental results on several point process applications including social network estimation and temporal recommendation show that the proposed algorithm and its randomized block variant outperform existing methods both on synthetic and real-world datasets.

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

↑