Randomized algorithms are a useful tool for analyzing the performance of complex uncertain systems. Their implementation requires the generation of a large number N of random samples representing the uncertainty scenarios, and the corresponding evaluation of system performance. When N is very large and/or performance evaluation is costly or time consuming, it can be necessary to distribute the computational burden of such algorithms among many cooperating computing units. This paper studies distributed versions of randomized algorithms for expected value and probability estimation over a network of computing nodes with possibly time-varying communication links. Explicit a-priori bounds are provided for the sample and communication complexity of these algorithms in terms of number of local samples, number of computing nodes and communication iterations.

Randomized Algorithms for Robustness Analysis: A Distributed Approach / Calafiore, Giuseppe Carlo. - STAMPA. - (2009), pp. 7030-7035. (Intervento presentato al convegno 48th IEEE Conference on Decision and Control tenutosi a Shanghai, China nel December 16-18, 2009) [10.1109/CDC.2009.5399948].

Randomized Algorithms for Robustness Analysis: A Distributed Approach

CALAFIORE, Giuseppe Carlo
2009

Abstract

Randomized algorithms are a useful tool for analyzing the performance of complex uncertain systems. Their implementation requires the generation of a large number N of random samples representing the uncertainty scenarios, and the corresponding evaluation of system performance. When N is very large and/or performance evaluation is costly or time consuming, it can be necessary to distribute the computational burden of such algorithms among many cooperating computing units. This paper studies distributed versions of randomized algorithms for expected value and probability estimation over a network of computing nodes with possibly time-varying communication links. Explicit a-priori bounds are provided for the sample and communication complexity of these algorithms in terms of number of local samples, number of computing nodes and communication iterations.
2009
9781424438716
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2284931
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo