A Kernel Mean Embedding Approach to Reducing Conservativeness in Stochastic Programming and Control
We apply kernel mean embedding methods to sample-based stochastic optimization and control. Specifically, we use the reduced-set expansion method as a way to discard sampled scenarios. The effect of such constraint removal is improved optimality and decreased conservativeness. This is achieved by solving a distributional-distance-regularized optimization problem. We demonstrated this optimization formulation is well-motivated in theory, computationally tractable and effective in numerical algorithms.
Code (1)
Tasks
Stochastic OptimizationSimilar Papers 제목 키워드 기반
Higher Order Kernel Mean Embeddings to Capture Filtrations of Stochastic Processes
Stochastic processes are random variables with values in some space of paths. However, reducing a stochastic process to a path-valued random variable ignores its filtration, i.e. the flow of information carried by the pr…
Causal DiscoveryDistributionally Robust Optimal and Safe Control of Stochastic Systems via Kernel Conditional Mean Embedding
We present a novel distributionally robust framework for dynamic programming that uses kernel methods to design feedback control policies. Specifically, we leverage kernel mean embedding to map the transition probabiliti…
Kernel Mean Embedding Topology: Weak and Strong Forms for Stochastic Kernels and Implications for Model Learning
We introduce a novel topology, called Kernel Mean Embedding Topology, for stochastic kernels, in a weak and strong form. This topology, defined on the spaces of Bochner integrable functions from a signal space to a space…
Iterative Decomposition of Joint Chance Constraints in OPF
In chance-constrained OPF models, joint chance constraints (JCCs) offer a stronger guarantee on security compared to single chance constraints (SCCs). Using Boole's inequality or its improved versions to decompose JCCs i…
Worst-Case Risk Quantification under Distributional Ambiguity using Kernel Mean Embedding in Moment Problem
In order to anticipate rare and impactful events, we propose to quantify the worst-case risk under distributional ambiguity using a recent development in kernel methods -- the kernel mean embedding. Specifically, we form…