Liu, Xin (2007) Robustness, complexity, validation and risk. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-05272007-214755
A robust design process starts with modeling of the physical system and the uncertainty it faces. Robust design tools are then applied to achieve specified performance criteria. Verification of system properties is crucial as improvements on the modeling and design practices can be made based on results of such verification. In this thesis, we discuss three aspects of this closed-loop process.
First and the most important aspect is the possibility of the feedback from verification to system modeling and design. When verification is hard, what does it tell us about our system? When the system is robust, would it be easy to verify so? We study the relation between robustness of a system property posed as a decision problem and the proof complexity of verifying such property. We examine this relation in two classes of problems: percolation lattices and linear programming problems, and show complexity is upper-bounded by the reciprocal of robustness, i.e. fragility.
The second aspect we study is model validation. More precisely, when given a candidate model and experiment data, how do we rigorously refute the model or gain information about the consistent parameter set? Different methods for model invalidation and parameter inference are demonstrated with the G-protein signaling system in yeast to show the advantages and hurdles in their applications.
While quantification of robustness requirements has been well-studied in engineering, it is just emerging in the field of finance. Robustness specification in finance is closely related to the availability of proper risk measures. We study the estimation of a coherent risk measure, Expected Shortfall (ES). A consistent and asymptotically normal estimator for ES based on empirical likelihood is proposed. Although empirical likelihood based estimators usually involve numerically solving optimization problems that are not necessarily convex, computation of our estimator can be carried out in a sequential manner, avoiding solving non-convex optimization problems.
|Item Type:||Thesis (Dissertation (Ph.D.))|
|Subject Keywords:||Expected Shortfall; maximum empirical likelihood estimation; model validation; percolation lattice; proof complexity; risk assessment; robust parameter inference; robustness|
|Degree Grantor:||California Institute of Technology|
|Division:||Engineering and Applied Science|
|Major Option:||Control and Dynamical Systems|
|Thesis Availability:||Public (worldwide access)|
|Defense Date:||15 February 2007|
|Default Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Imported from ETD-db|
|Deposited On:||30 May 2007|
|Last Modified:||26 Dec 2012 02:47|
- Final Version
See Usage Policy.
Repository Staff Only: item control page