Chance-Constrained Active Inference

被引:1
作者
van de Laar, Thijs [1 ]
Senoz, Ismail [1 ]
Ozcelikkale, Ayca [2 ]
Wymeersch, Henk [3 ]
机构
[1] Eindhoven Univ Technol, NL-5612 AP Eindhoven, Netherlands
[2] Uppsala Univ, S-75237 Uppsala, Sweden
[3] Chalmers Univ Technol, S-41296 Gothenburg, Sweden
基金
瑞典研究理事会;
关键词
FREE-ENERGY PRINCIPLE;
D O I
10.1162/neco_a_01427
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Active inference (ActInf) is an emerging theory that explains perception and action in biological agents in terms of minimizing a free energy bound on Bayesian surprise. Goal-directed behavior is elicited by introducing prior beliefs on the underlying generative model. In contrast to prior beliefs, which constrain all realizations of a random variable, we propose an alternative approach through chance constraints, which allow for a (typically small) probability of constraint violation, and demonstrate how such constraints can be used as intrinsic drivers for goal-directed behavior in ActInf. We illustrate how chance-constrained ActInf weights all imposed (prior) constraints on the generative model, allowing, for example, for a trade-off between robust control and empirical chance constraint violation. Second, we interpret the proposed solution within a message passing framework. Interestingly, the message passing interpretation is not only relevant to the context of ActInf, but also provides a general-purpose approach that can account for chance constraints on graphical models. The chance constraint message updates can then be readily combined with other prederived message update rules without the need for custom derivations. The proposed chance-constrained message passing framework thus accelerates the search for workable models in general and can be used to complement message-passing formulations on generative neural models.
引用
收藏
页码:2710 / 2735
页数:26
相关论文
共 45 条
[1]  
Baltieri M., 2019, P 2019 C COGN COMP N
[2]  
Baltieri M, 2018, 2018 CONFERENCE ON ARTIFICIAL LIFE (ALIFE 2018), P121
[3]  
Bishop C.M., 2006, Pattern Recognition and Machine Learning
[4]   Chance-Constrained Optimal Path Planning With Obstacles [J].
Blackmore, Lars ;
Ono, Masahiro ;
Williams, Brian C. .
IEEE TRANSACTIONS ON ROBOTICS, 2011, 27 (06) :1080-1094
[5]   Build, Compute, Critique, Repeat: Data Analysis with Latent Variable Models [J].
Blei, David M. .
ANNUAL REVIEW OF STATISTICS AND ITS APPLICATION, VOL 1, 2014, 1 :203-232
[6]  
Borrelli F., 2017, P 40 IEEE C DECISION, V1st
[7]  
Boyd S., 2014, Convex Optim
[8]  
Cox M, 2018, EUR SIGNAL PR CONF, P2583, DOI 10.23919/EUSIPCO.2018.8553490
[9]   A factor graph approach to automated design of Bayesian signal processing algorithms [J].
Cox, Marco ;
van de Laar, Thijs ;
de Vries, Bert .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2019, 104 :185-204
[10]   On variational message passing on factor graphs [J].
Dauwels, Justin .
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, :2546-2550