Sample reuse techniques have significantly reduced the numerical complexity of probabilistic robustness analysis. Existing results show that for a nested collection of hyper-spheres the complexity of the problem of performing $N$ equivalent i.i.d. (identical and independent) experiments for each sphere is absolutely bounded, independent of the number of spheres and depending only on the initial and final radii.
In this chapter we elevate sample reuse to a new level of generality and establish that the numerical complexity of performing $N$ equivalent i.i.d. experiments for a chain of sets is absolutely bounded if the sets are nested. Each set does not even have to be connected, as long as the nested property holds. Thus, for example, the result permits the integration of deterministic and probabilistic analysis to eliminate regions from an uncertainty set and reduce even further the complexity of some problems. With a more general view, the result enables the analysis of complex decision problems mixing real-valued and discrete-valued random variables.
Sequential Randomized Algorithms for Convex Optimization in the Presence of Uncertainty
Data Storage Institute, Singapore(新加坡数据存储研究所);CNR-IEIIT Torino, Italy(意大利都灵国家研究委员会信息与电子工程研究所);Department of Electrical and Computer Engineering, National University of Singapore(新加坡国立大学电气与计算机工程系)
Randomized Solutions to Convex Programs with Multiple Chance Constraints
Automatic Control Laboratory, Swiss Federal Institute of Technology, Zurich, Switzerland(苏黎世联邦理工学院自动控制实验室);Polytecnico di Torino, Torino, Italy(都灵理工大学);Department of Mechanical Engineering, University of California at Santa Barbara, Santa Barbara (CA), United States(加州大学圣塔芭芭拉分校机械工程系)
Nonparametric adaptive control and prediction: theory and randomized algorithms
Courant Institute of Mathematical Sciences, New York University(纽约大学柯朗数学科学研究所);Google Brain Robotics(谷歌大脑机器人部门);Massachusetts Institute of Technology(麻省理工学院)