東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Communication-Efficient Algorithms F...

Mota, Joao F. C.

FindBook

Google Book

Amazon

博客來

Communication-Efficient Algorithms For Distributed Optimization.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Communication-Efficient Algorithms For Distributed Optimization./
作者:	Mota, Joao F. C.
面頁冊數:	157 p.
附註:	Source: Dissertation Abstracts International, Volume: 75-04(E), Section: B.
Contained By:	Dissertation Abstracts International75-04B(E).
標題:	Engineering, Electronics and Electrical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3577895
ISBN:	9781303657504

Communication-Efficient Algorithms For Distributed Optimization.
Mota, Joao F. C.

Communication-Efficient Algorithms For Distributed Optimization. - 157 p.

Source: Dissertation Abstracts International, Volume: 75-04(E), Section: B.

Thesis (Ph.D.)--Carnegie Mellon University, 2013.

This thesis is concerned with the design of distributed algorithms for solving optimization problems. The particular scenario we consider is a network with P compute nodes, where each node p has exclusive access to a cost function fp. We design algorithms in which all the nodes cooperate to find the minimum of the sum of all the cost functions, f1 + ··· + fP. Several problems in signal processing, control, and machine learning can be posed as such optimization problems. Given that communication is often the most energy-consuming operation in networks and, many times, also the slowest one, it is important to design distributed algorithms with low communication requirements, that is, communication-efficient algorithms. The two main contributions of this thesis are a classification scheme for distributed optimization problems of the kind explained above and a set of corresponding communication-efficient algorithms.

ISBN: 9781303657504Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Communication-Efficient Algorithms For Distributed Optimization.
LDR:03256nam a2200313 4500 001 1960564
005 20140623111235.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9781303657504
035 $a (MiAaPQ)AAI3577895
035 $a AAI3577895
040 $a MiAaPQ $c MiAaPQ
100 1 $a Mota, Joao F. C. $3 2096250
245 1 0 $a Communication-Efficient Algorithms For Distributed Optimization.
300 $a 157 p.
500 $a Source: Dissertation Abstracts International, Volume: 75-04(E), Section: B.
500 $a Adviser: Markus Piischel.
502 $a Thesis (Ph.D.)--Carnegie Mellon University, 2013.
520 $a This thesis is concerned with the design of distributed algorithms for solving optimization problems. The particular scenario we consider is a network with P compute nodes, where each node p has exclusive access to a cost function fp. We design algorithms in which all the nodes cooperate to find the minimum of the sum of all the cost functions, f1 + ··· + fP. Several problems in signal processing, control, and machine learning can be posed as such optimization problems. Given that communication is often the most energy-consuming operation in networks and, many times, also the slowest one, it is important to design distributed algorithms with low communication requirements, that is, communication-efficient algorithms. The two main contributions of this thesis are a classification scheme for distributed optimization problems of the kind explained above and a set of corresponding communication-efficient algorithms.
520 $a The class of optimization problems we consider is quite general, since we allow that each function may depend on arbitrary components of the optimization variable, and not necessarily on all of them. In doing so, we go beyond the commonly used assumption in distributed optimization and create additional structure that can be explored to reduce the total number of communications. This structure is captured by our classification scheme, which identifies particular instances of the problem that are easier to solve. One example is the standard distributed optimization problem, in which all the functions depend on all the components of the variable.
520 $a All our algorithms are distributed in the sense that no central node coordinates the network, all the communications occur exclusively between neighboring nodes, and the data associated with each node is always processed locally. We show several applications of our algorithms, including average consensus, support vector machines, network flows, and several distributed scenarios for compressed sensing. We also propose a new framework for distributed model predictive control, which can be solved with our algorithms. Through extensive numerical experiments, we show that our algorithms outperform prior distributed algorithms in terms of communication-efficiency, even some that were specifically designed for a particular application.
590 $a School code: 0041.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Computer Science. $3 626642
650 4 $a Applied Mathematics. $3 1669109
690 $a 0544
690 $a 0984
690 $a 0364
710 2 $a Carnegie Mellon University. $3 1018096
773 0 $t Dissertation Abstracts International $g 75-04B(E).
790 $a 0041
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3577895