2026-09-20T10:01:59Zhttps://repository.rice.edu/server/oai/request

oai:repository.rice.edu:1911/163792024-01-11T20:59:03Zcom_1911_8315com_1911_8303com_1911_75172com_1911_8299col_1911_8316col_1911_13110

Aazhang, Behnaam Orsak, Geoffrey Charles 2009-06-04T00:24:59Z 2009-06-04T00:24:59Z 1990 Orsak, Geoffrey Charles. "Performance evaluation and optimization of stochastic systems via importance sampling." (1990) Diss., Rice University. <a href="https://hdl.handle.net/1911/16379">https://hdl.handle.net/1911/16379</a>. https://hdl.handle.net/1911/16379 OrsakG Thesis E.E. 1990 Orsak Analytic solutions to determining the optimal set of system parameters and the associated performance of random input systems are typically intractable. One often only has access to the system's output under a variety of inputs, thereby requiring the optimization routine to be insensitive to the noise inherent in estimating the performance. The well known algorithms of Robbins-Monro and Kiefer-Wolfowitz asymptotically eliminate the effects of noise by effectively averaging the estimated performance over a sequence of system parameters. The convergence rate of the parameters is shown to depend on the performance estimator's variance. Consequently, implementing variance reduction techniques will greatly enhance the convergence properties of these algorithms. The Importance Sampling technique is employed to minimize the variance in estimating the system performance. A class of Importance Sampling biasing distributions is derived in this thesis for the specific use in analyzing single-user communication systems. This class is extended for use in estimating the performance of multiple-access systems. Additionally, a more general method of determining biasing densities for estimating arbitrary functionals of random vectors is obtained by using ideas from robust statistics. All of the above mentioned methods render substantial improvements over standard Monte Carlo simulations when estimating system performance. By incorporating these techniques into both the Robbins-Monro and Kiefer-Wolfowitz algorithms, we show that the stopping times for these algorithms can be significantly reduced. Moreover, the computational savings over the traditional implementation of these algorithms are unbounded when optimizing systems whose performance criteria are diminishing probabilities of a set of events. These techniques can be directly applied to enhance more specific optimization routines such as training algorithms in neural networks and recursive algorithms in system identification. 155 p. application/pdf eng Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. Electronics Electrical engineering Statistics Performance evaluation and optimization of stochastic systems via importance sampling Thesis Text Electrical Engineering Engineering Rice University Doctoral Doctor of Philosophy open.access