0


L1正则线性回归和逻辑回归的乘法更新

Multiplicative Updates for L1-Regularized Linear and Logistic Regression
课程网址: http://videolectures.net/ida07_saul_mufl1/  
主讲教师: Lawrence Saul
开课单位: 加州大学圣地亚哥分校
开课时间: 2007-10-08
课程语种: 英语
中文简介:
事实证明,乘法更新规则在许多机器学习领域都很有用。它们易于实现,保证收敛,它们部分地解释了非负矩阵分解和期望最大化等算法的广泛普及。在本文中,我们展示了如何导出L1正则化线性和逻辑回归中的问题的乘法更新。对于L1正则化线性回归,通过将所需优化重新构造为非负二次规划(NQP)中的问题来导出更新。这个问题的双重性本身就是NQP的一个实例,也可以使用乘法更新来解决;此外,观察到的二元性差距可用于约束中间解的误差。对于L1正则化逻辑回归,我们使用迭代重加权最小二乘方法得出类似的更新。我们提供了说明性的实验结果,并描述了感兴趣的大规模问题的有效实现(例如,具有数万个示例和超过一百万个特征)。
课程简介: Multiplicative update rules have proven useful in many areas of machine learning. Simple to implement, guaranteed to converge, they account in part for the widespread popularity of algorithms such as nonnegative matrix factorization and Expectation-Maximization. In this paper, we show how to derive multiplicative updates for problems in L1-regularized linear and logistic regression. For L1–regularized linear regression, the updates are derived by reformulating the required optimization as a problem in nonnegative quadratic programming (NQP). The dual of this problem, itself an instance of NQP, can also be solved using multiplicative updates; moreover, the observed duality gap can be used to bound the error of intermediate solutions. For L1–regularized logistic regression, we derive similar updates using an iteratively reweighted least squares approach. We present illustrative experimental results and describe efficient implementations for large-scale problems of interest (e.g., with tens of thousands of examples and over one million features).
关 键 词: 机器学习领域; 乘法更新规则; 正则化
课程来源: 视频讲座网
最后编审: 2019-04-27:lxf
阅读次数: 192