Exploiting the Computation Graph for Large Scale Distributed Machine Learning
Автор: KDD2016 video
Загружено: 2016-11-09
Просмотров: 262
Author:
S.V.N. Vishwanathan, Department of Computer Science, University of California Santa Cruz
Abstract:
Many machine learning algorithms minimize a regularized risk. It is well known that stochastic optimization algorithms are both theoretically and practically well motivated for regularized risk minimization. Unfortunately, stochastic optimization is not easy to parallelize. In this talk, we take a radically new approach and show that working with the saddle-point problem that arises out of the Lagrangian has a very specific computational graph structure which can be exploited to allow for a natural partitioning of the parameters across multiple processors. This allows us to derive a new parallel stochastic optimization algorithm for regularized risk minimization. Joint work with: Inderjit Dhillon, Cho-Jui Hsieh, Shihao Ji, Shin Matsushima, Parameshwaran Raman, Hsiang-Fu Yu, and Hyokun Yun.
More on http://www.kdd.org/kdd2016/
KDD2016 Conference is published on http://videolectures.net/
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
![[2026] Feeling Good Mix - English Deep House, Vocal House, Nu Disco | Emotional / Intimate Mood](https://imager.clipsaver.ru/cxLdtvzf2sI/max.jpg)
