English

Conserved active information

Neural and Evolutionary Computing 2026-04-20 v2 Computational Complexity Human-Computer Interaction Information Theory math.IT

Abstract

We introduce conserved active information II^\oplus, a symmetric extension of active information that quantifies net information gain/loss across the entire search space, respecting No-Free-Lunch conservation. Through Bernoulli and uniform-baseline examples, we show II^\oplus reveals regimes hidden from KL divergence, such as when strong knowledge reduces global disorder. Such regimes are proven formally under uniform baseline, distinguishing disorder (increasing mild knowledge from order-imposing strong knowledge. We further illustrate these regimes with examples from Markov chains and cosmological fine-tuning. This resolves a longstanding critique of active information while enabling applications in search, optimization, and beyond.

Keywords

Cite

@article{arxiv.2512.21834,
  title  = {Conserved active information},
  author = {Yanchen Chen and Daniel Andrés Díaz-Pachón},
  journal= {arXiv preprint arXiv:2512.21834},
  year   = {2026}
}

Comments

8 pages, 4 figures

R2 v1 2026-07-01T08:41:09.823Z