Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multiplier

Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multiplier pdf epub mobi txt 电子书 下载 2025

出版者:Now Publishers Inc
作者:Stephen Boyd
出品人:
页数:128
译者:
出版时间:2011
价格:0
装帧:
isbn号码:9781601984609
丛书系列:Foundations and Trends® in Machine Learning
图书标签:
  • Optimization
  • Statistics
  • Machine_Learning
  • Clustering
  • ADMM
  • 优化
  • ADMM
  • 分布式优化
  • 统计学习
  • 机器学习
  • 数值优化
  • 算法
  • 模型
  • 凸优化
  • 增广拉格朗日乘子法
想要找书就要到 小美书屋
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

具体描述

https://web.stanford.edu/~boyd/papers/admm_distr_stats.html

Many problems of recent interest in statistics and machine learning can be posed in the framework of convex optimization. Due to the explosion in size and complexity of modern datasets, it is increasingly important to be able to solve problems with a very large number of features or training examples. As a result, both the decentralized collection or storage of these datasets as well as accompanying distributed solution methods are either necessary or at least highly desirable. In this review, we argue that the alternating direction method of multipliers is well suited to distributed convex optimization, and in particular to large-scale problems arising in statistics, machine learning, and related areas. The method was developed in the 1970s, with roots in the 1950s, and is equivalent or closely related to many other algorithms, such as dual decomposition, the method of multipliers, Douglas–Rachford splitting, Spingarn's method of partial inverses, Dykstra's alternating projections, Bregman iterative algorithms for ℓ1 problems, proximal methods, and others. After briefly surveying the theory and history of the algorithm, we discuss applications to a wide variety of statistical and machine learning problems of recent interest, including the lasso, sparse logistic regression, basis pursuit, covariance selection, support vector machines, and many others. We also discuss general distributed optimization, extensions to the nonconvex setting, and efficient implementation, including some details on distributed MPI and Hadoop Map Reduce implementations.

作者简介

目录信息

1 Introduction
2 Precursors
3 Alternating Direction Method of Multipliers
4 General Patterns
5 Constrained Convex Optimization
6 ℓ1-Norm Problems
7 Consensus and Sharing
8 Distributed Model Fitting
9 Nonconvex Problems
10 Implementation
11 Numerical Examples
12 Conclusions
Acknowledgments
A Convergence Proof
References
· · · · · · (收起)

读后感

评分

评分

评分

评分

评分

用户评价

评分

评分

评分

评分

评分

相关图书

本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

© 2025 book.quotespace.org All Rights Reserved. 小美书屋 版权所有