Conformal Predictive Programming for Chance Constrained Optimization

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Zhao, Yiqi, Yu, Xinyi, Sesia, Matteo, Deshmukh, Jyotirmoy V., Lindemann, Lars
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913817556942848
author Zhao, Yiqi
Yu, Xinyi
Sesia, Matteo
Deshmukh, Jyotirmoy V.
Lindemann, Lars
author_facet Zhao, Yiqi
Yu, Xinyi
Sesia, Matteo
Deshmukh, Jyotirmoy V.
Lindemann, Lars
contents We propose conformal predictive programming (CPP), a framework to solve chance constrained optimization problems, i.e., optimization problems with constraints that are functions of random variables. CPP utilizes samples from these random variables along with the quantile lemma - central to conformal prediction - to transform the chance constrained optimization problem into a deterministic problem with a quantile reformulation. CPP inherits a priori guarantees on constraint satisfaction from existing sample average approximation approaches for a class of chance constrained optimization problems, and it provides a posteriori guarantees that are of conditional and marginal nature otherwise. The strength of CPP is that it can easily support different variants of conformal prediction which have been (or will be) proposed within the conformal prediction community. To illustrate this, we present robust CPP to deal with distribution shifts in the random variables and Mondrian CPP to deal with class conditional chance constraints. To enable tractable solutions to the quantile reformulation, we present a mixed integer programming method (CPP-MIP) encoding, a bilevel optimization strategy (CPP-Bilevel), and a sampling-and-discarding optimization strategy (CPP-Discarding). We also extend CPP to deal with joint chance constrained optimization (JCCO). In a series of case studies, we show the validity of the aforementioned approaches, empirically compare CPP-MIP, CPP-Bilevel, as well as CPP-Discarding, and illustrate the advantage of CPP as compared to scenario approach.
format Preprint
id arxiv_https___arxiv_org_abs_2402_07407
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Conformal Predictive Programming for Chance Constrained Optimization
Zhao, Yiqi
Yu, Xinyi
Sesia, Matteo
Deshmukh, Jyotirmoy V.
Lindemann, Lars
Systems and Control
Machine Learning
Optimization and Control
We propose conformal predictive programming (CPP), a framework to solve chance constrained optimization problems, i.e., optimization problems with constraints that are functions of random variables. CPP utilizes samples from these random variables along with the quantile lemma - central to conformal prediction - to transform the chance constrained optimization problem into a deterministic problem with a quantile reformulation. CPP inherits a priori guarantees on constraint satisfaction from existing sample average approximation approaches for a class of chance constrained optimization problems, and it provides a posteriori guarantees that are of conditional and marginal nature otherwise. The strength of CPP is that it can easily support different variants of conformal prediction which have been (or will be) proposed within the conformal prediction community. To illustrate this, we present robust CPP to deal with distribution shifts in the random variables and Mondrian CPP to deal with class conditional chance constraints. To enable tractable solutions to the quantile reformulation, we present a mixed integer programming method (CPP-MIP) encoding, a bilevel optimization strategy (CPP-Bilevel), and a sampling-and-discarding optimization strategy (CPP-Discarding). We also extend CPP to deal with joint chance constrained optimization (JCCO). In a series of case studies, we show the validity of the aforementioned approaches, empirically compare CPP-MIP, CPP-Bilevel, as well as CPP-Discarding, and illustrate the advantage of CPP as compared to scenario approach.
title Conformal Predictive Programming for Chance Constrained Optimization
topic Systems and Control
Machine Learning
Optimization and Control
url https://arxiv.org/abs/2402.07407