Optimal prediction with resource constraints using the information bottleneck

被引:5
|
作者
Sachdeva, Vedant [1 ]
Mora, Thierry [2 ,3 ,4 ,5 ]
Walczak, Aleksandra M. [2 ,3 ,4 ,5 ]
Palmer, Stephanie E. [6 ,7 ]
机构
[1] Univ Chicago, Grad Program Biophys Sci, Chicago, IL 60637 USA
[2] Ctr Natl Rech Sci, Lab Phys, Ecole Normale Super, Paris, France
[3] Univ Paris, Paris Sci & Lettres, Paris, France
[4] Sorbonne Univ Paris, Paris, France
[5] Univ Paris, Paris, France
[6] Univ Chicago, Dept Organismal Biol & Anat, 1025 E 57Th St, Chicago, IL 60637 USA
[7] Univ Chicago, Dept Phys, Chicago, IL 60637 USA
基金
美国国家科学基金会; 欧洲研究理事会; 美国国家卫生研究院;
关键词
CAPACITY; IMAGES; MODEL;
D O I
10.1371/journal.pcbi.1008743
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Author summary From catching a ball to building immunity, we rely on the ability of biological systems to incorporate past observations to make predictions about the future state of the environment. However, the success of these predictions is limited by environmental parameters and encoding capacities of the predictors. We explore these trade-offs in three systems: simple intertial motion, more complex motion with long-tailed temporal correlations, and mutating viral strains. We show that the velocity and position of a moving object should not be equally well-remembered in the biological systems internal representation, and identify the flexible "best-compromise" representations that are not optimal but remain predictable in a wide range of parameters regimes. In the evolutionary context, we find that the optimal predictive representations are discrete, reminiscent of immune strategies that cover the space of potential viruses. Responding to stimuli requires that organisms encode information about the external world. Not all parts of the input are important for behavior, and resource limitations demand that signals be compressed. Prediction of the future input is widely beneficial in many biological systems. We compute the trade-offs between representing the past faithfully and predicting the future using the information bottleneck approach, for input dynamics with different levels of complexity. For motion prediction, we show that, depending on the parameters in the input dynamics, velocity or position information is more useful for accurate prediction. We show which motion representations are easiest to re-use for accurate prediction in other motion contexts, and identify and quantify those with the highest transferability. For non-Markovian dynamics, we explore the role of long-term memory in shaping the internal representation. Lastly, we show that prediction in evolutionary population dynamics is linked to clustering allele frequencies into non-overlapping memories.
引用
收藏
页数:27
相关论文
共 50 条
  • [1] Optimal information storage in noisy synapses under resource constraints
    Varshney, Lav R.
    Sjostrom, Per Jesper
    Chklovskii, Dmitri B.
    [J]. NEURON, 2006, 52 (03) : 409 - 423
  • [2] THE INFORMATION BOTTLENECK METHOD FOR OPTIMAL PREDICTION OF MULTILEVEL AGENT-BASED SYSTEMS
    Lamarche-Perrin, Robin
    Banisch, Sven
    Olbrich, Eckehard
    [J]. ADVANCES IN COMPLEX SYSTEMS, 2016, 19 (1-2):
  • [3] A HEURISTIC SCHEDULING OF INDEPENDENT TASKS WITH BOTTLENECK RESOURCE CONSTRAINTS
    WANG, QZ
    LEISS, EL
    [J]. SIAM JOURNAL ON COMPUTING, 1995, 24 (02) : 235 - 241
  • [4] Value of Information in the Deterministic Optimal Resource Extraction Problem with Terminal Constraints
    Gromova, Ekaterina
    Bolatbek, Aisana
    [J]. APPLIED SCIENCES-BASEL, 2023, 13 (02):
  • [5] Inductive relation prediction with information bottleneck
    Yu, Han
    Chen, Kai
    Liu, Ziniu
    Tu, Hongkui
    Li, Aiping
    [J]. NEUROCOMPUTING, 2024, 609
  • [6] Determine the optimal parameter for Information Bottleneck method
    Li, Gang
    Liu, Dong
    Ye, Yangdong
    Rong, Jia
    [J]. PRICAI 2006: TRENDS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4099 : 1005 - 1009
  • [8] Dynamic programming and solvability of bottleneck routing problem with resource constraints
    Chentsov, A. G.
    Chentsov, A. A.
    [J]. VESTNIK UDMURTSKOGO UNIVERSITETA-MATEMATIKA MEKHANIKA KOMPYUTERNYE NAUKI, 2022, 32 (04): : 569 - 592
  • [9] Enhancing Adversarial Transferability via Information Bottleneck Constraints
    Qi, Biqing
    Gao, Junqi
    Liu, Jianxing
    Wu, Ligang
    Zhou, Bowen
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2024, 31 : 1414 - 1418
  • [10] Learning Optimal Primary Capsules by Information Bottleneck
    Hu, Ming-fei
    Liu, Jian-wei
    Li, Wei-min
    [J]. ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2021, PT I, 2021, 12891 : 519 - 528