Sequential Learning under Probabilistic Constraints

被引:0
|
作者
Meisami, Amirhossein [1 ]
Lam, Henry [2 ]
Dong, Chen [1 ]
Pani, Abhishek [1 ]
机构
[1] Adobe Inc, San Jose, CA 95110 USA
[2] Columbia Univ, New York, NY 10027 USA
关键词
RANDOMIZED SOLUTIONS; OPTIMIZATION; FEASIBILITY; ALGORITHM; PROGRAMS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We provide the first study on online learning problems under stochastic constraints that are "soft", i.e., need to be satisfied with high probability. These constraints are imposed on all or some stages of the time horizon so that the stage decisions probabilistically satisfy some given safety conditions. The distributions that govern these conditions are learned through the collected observations. Under a Bayesian framework, we introduce a scheme that provides statistical feasibility guarantees through the time horizon, by using posterior Monte Carlo samples to form sampled constraints which leverage the scenario generation approach in chance-constrained programming. We demonstrate how our scheme can be integrated into Thompson sampling and illustrate it with an application in online advertisement.
引用
下载
收藏
页码:621 / 631
页数:11
相关论文
共 50 条