{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T03:03:30Z","timestamp":1760151810830,"version":"build-2065373602"},"reference-count":59,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>A general framework is introduced to estimate how much external information has been infused into a search algorithm, the so-called active information. This is rephrased as a test of fine-tuning, where tuning corresponds to the amount of pre-specified knowledge that the algorithm makes use of in order to reach a certain target. A function f quantifies specificity for each possible outcome x of a search, so that the target of the algorithm is a set of highly specified states, whereas fine-tuning occurs if it is much more likely for the algorithm to reach the target as intended than by chance. The distribution of a random outcome X of the algorithm involves a parameter \u03b8 that quantifies how much background information has been infused. A simple choice of this parameter is to use \u03b8f in order to exponentially tilt the distribution of the outcome of the search algorithm under the null distribution of no tuning, so that an exponential family of distributions is obtained. Such algorithms are obtained by iterating a Metropolis\u2013Hastings type of Markov chain, which makes it possible to compute their active information under the equilibrium and non-equilibrium of the Markov chain, with or without stopping when the targeted set of fine-tuned states has been reached. Other choices of tuning parameters \u03b8 are discussed as well. Nonparametric and parametric estimators of active information and tests of fine-tuning are developed when repeated and independent outcomes of the algorithm are available. The theory is illustrated with examples from cosmology, student learning, reinforcement learning, a Moran type model of population genetics, and evolutionary programming.<\/jats:p>","DOI":"10.3390\/e24101323","type":"journal-article","created":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T21:22:23Z","timestamp":1663795343000},"page":"1323","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Assessing, Testing and Estimating the Amount of Fine-Tuning by Means of Active Information"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6281-1720","authenticated-orcid":false,"given":"Daniel Andr\u00e9s","family":"D\u00edaz-Pach\u00f3n","sequence":"first","affiliation":[{"name":"Division of Biostatistics, University of Miami, Miami, FL 33136, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2767-8818","authenticated-orcid":false,"given":"Ola","family":"H\u00f6ssjer","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Stockholm University, 114 19 Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"key":"ref_1","first-page":"173","article-title":"\u00dcber Formal Unentscheidbare S\u00e4tze der Principia Mathematica und Verwandter Systeme, I","volume":"38","year":"1931","journal-title":"Monatshefte Math. Phys."},{"key":"ref_2","unstructured":"Hofstadter, D.R. (1999). G\u00f6del, Escher, Bach: An Ethernal Golden Braid, Basic Books."},{"key":"ref_3","unstructured":"Whitehad, A.N., and Russell, B. (1927). Principia Mathematica, Cambridge University Press."},{"key":"ref_4","unstructured":"Wolpert, D.H., and MacReady, W.G. (1995). No Free Lunch Theorems for Search, Technical Report SFI-TR-95-02-010; Santa Fe Institute."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No Free Lunch Theorems for Optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Rasskazova, V., and Vrahatis, M.N. (2021). What is important about the No Free Lunch theorems?. Black Box Optimization, Machine Learning and No-Free Lunch Theorems, Springer.","DOI":"10.1007\/978-3-030-66515-9"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Dembski, W.A., and Marks, R.J. (2009, January 11\u201314). Bernoulli\u2019s Principle of Insufficient Reason and Conservation of Information in Computer Search. Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics, San Antonio, TX, USA.","DOI":"10.1109\/ICSMC.2009.5346119"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1109\/TSMCA.2009.2025027","article-title":"Conservation of Information in Search: Measuring the Cost of Success","volume":"5","author":"Dembski","year":"2009","journal-title":"IEEE Trans. Syst. Man, Cybern. Part Syst. Hum."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"8574","DOI":"10.1073\/pnas.0701744104","article-title":"Functional information and the emergence of biocomplexity","volume":"104","author":"Hazen","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1038\/423689a","article-title":"Functional information: Molecular messages","volume":"423","author":"Szostak","year":"2003","journal-title":"Nature"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5048\/BIO-C.2020.3","article-title":"Generalized active information: Extensions to unbounded domains","volume":"2020","author":"Marks","year":"2020","journal-title":"BIO-Complexity"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1002\/asmb.2430","article-title":"Mode hunting through active information","volume":"35","author":"Rao","year":"2019","journal-title":"Appl. Stoch. Model. Bus. Ind."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Liu, T., D\u00edaz-Pach\u00f3n, D.A., Rao, J.S., and Dazard, J.E. (2022). High Dimensional Mode Hunting Using Pettiest Component Analysis. IEEE Trans. Pattern Anal. Mach. Intell., accepted.","DOI":"10.1109\/TPAMI.2022.3195462"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Monta\u00f1ez, G.D. (2017, January 5\u20138). The famine of forte: Few search problems greatly favor your algorithm. Proceedings of the 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC), Banff, AB, Canada.","DOI":"10.1109\/SMC.2017.8122651"},{"key":"ref_15","first-page":"1","article-title":"A Unified Model of Complex Specified Information","volume":"2018","year":"2018","journal-title":"BIO-Complexity"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"108742","DOI":"10.1016\/j.spl.2020.108742","article-title":"Hypothesis testing with active information","volume":"161","author":"Rao","year":"2020","journal-title":"Stati. Probab. Lett."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Longhair, M.S. (1974). Large Number Coincidences and the Anthropic Principle in Cosmology. Confrontation of Cosmological Theories with Observational Data, D. Reidel.","DOI":"10.1007\/978-94-010-2220-0"},{"key":"ref_18","unstructured":"Barrow, J.D., and Tipler, F.J. (1988). The Anthropic Cosmological Principle, Oxford University Press."},{"key":"ref_19","unstructured":"Davies, P. (1982). The Accidental Universe, Cambridge University Press."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Lewis, G.F., and Barnes, L.A. (2016). A Fortunate Universe: Life In a Finely Tuned Cosmos, Cambridge University Press.","DOI":"10.1017\/CBO9781316661413"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Rees, M.J. (2000). Just Six Numbers: The Deep Forces That Shape The Universe, Basic Books.","DOI":"10.1063\/1.1341923"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2019.02.001","article-title":"The degree of fine-tuning in our universe\u2014Furthermore, others","volume":"807","author":"Adams","year":"2019","journal-title":"Phys. Rep."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1071\/AS12015","article-title":"The Fine Tuning of the Universe for Intelligent Life","volume":"29","author":"Barnes","year":"2012","journal-title":"Publ. Astron. Soc. Aust."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1086\/305673","article-title":"Why is the cosmic microwave background fluctuation level 10\u22125","volume":"499","author":"Tegmark","year":"1998","journal-title":"Astrophys. J."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"023505","DOI":"10.1103\/PhysRevD.73.023505","article-title":"Dimensionless constants, cosmology, and other dark matters","volume":"73","author":"Tegmark","year":"2006","journal-title":"Phys. Rev. D"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"020","DOI":"10.1088\/1475-7516\/2021\/07\/020","article-title":"Is Cosmological Tuning Fine or Coarse?","volume":"2021","author":"Marks","year":"2021","journal-title":"J. Cosmol. Astropart. Phys."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"D\u00edaz-Pach\u00f3n, D.A., H\u00f6ssjer, O., and Marks, R.J. (2022). Sometimes size does not matter. Found. Phys., under revision.","DOI":"10.1007\/s10701-022-00650-1"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"e2100021","DOI":"10.1002\/bies.202100021","article-title":"The fine-tuning of cell membrane lipid bilayers accentuates their compositional complexity","volume":"43","author":"Dingjan","year":"2021","journal-title":"BioEssays"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"183701","DOI":"10.1016\/j.bbamem.2021.183701","article-title":"The role of the `sphingoid motif\u2019 in shaping the molecular interactions of sphingolipids in biomembranes","volume":"1863","author":"Dingjan","year":"2021","journal-title":"Biochim. Biophys. Acta BBA Biomembr."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"110352","DOI":"10.1016\/j.jtbi.2020.110352","article-title":"Using statistical methods to model the fine-tuning of molecular machines and systems","volume":"501","author":"Thorvaldsen","year":"2020","journal-title":"J. Theor. Biol."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Asmussen, S., and Glynn, P.W. (2007). Stochastic Simulation: Algorithms and Analysis, Springer.","DOI":"10.1007\/978-0-387-69033-9"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1214\/aos\/1176343541","article-title":"Importance Sampling in the Monte Carlo Study of Sequential Tests","volume":"4","author":"Siegmund","year":"1976","journal-title":"Ann. Stat."},{"key":"ref_33","unstructured":"Lehmann, E.L., and Casella, G. (1998). Theory of Point Estimation, Springer. [2nd ed.]."},{"key":"ref_34","unstructured":"Robert, C.P., and Casella, G. (2010). Monte Carlo Statistical Methods, Springer."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","article-title":"Monte Carlo sampling methods using Markov chains and their applications","volume":"57","author":"Hastings","year":"1970","journal-title":"Biometrika"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of State Calculations by Fast Computing Machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"J. Chem. Phys."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by Simulated Annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref_38","unstructured":"Ross, S. (2003). Introduction to Probability Models, Academic Press. [8th ed.]."},{"key":"ref_39","first-page":"419","article-title":"Fitting Phase-type Distributions via the EM Algorithm","volume":"23","author":"Asmussen","year":"1996","journal-title":"Scand. J. Stat."},{"key":"ref_40","unstructured":"Neuts, M.F. (1981). Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach, Johns Hopkins University Press."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"110657","DOI":"10.1016\/j.jtbi.2021.110657","article-title":"On the waiting time until coordinated mutations get fixed in regulatory sequences","volume":"524","author":"Bechly","year":"2021","journal-title":"J. Theor. Biol."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Varadhan, S.R.S. (1984). Large Deviations and Applications, SIAM.","DOI":"10.1137\/1.9781611970241"},{"key":"ref_43","unstructured":"H\u00f6ssjer, O., D\u00edaz-Pach\u00f3n, D.A., Chen, Z., and Rao, J.S. (2022). Active information, missing data, and prevalence estimation. arXiv."},{"key":"ref_44","unstructured":"H\u00f6ssjer, O., D\u00edaz-Pach\u00f3n, D.A., and Rao, J.S. (2022). Active Information, Learning, and Knowledge Acquisition. PsyArXiv."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","article-title":"Reinforcement Learning: A Survey","volume":"4","author":"Kaelbling","year":"1996","journal-title":"J. Artif. Intell. Res."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Durrett, R. (2008). Probability Models for DNA Sequence Evolution. Springer.","DOI":"10.1007\/978-0-387-78168-6"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1017\/S0305004100033193","article-title":"Random processes in genetics","volume":"54","author":"Moran","year":"1958","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1098\/rspb.1958.0054","article-title":"A general theory of the distribution of gene frequencies\u2014I. Overlapping generations","volume":"149","author":"Moran","year":"1958","journal-title":"Proc. Roy. Soc. Lond. B"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Mitchell, M. (1996). An Introduction to Genetic Algorithms, MIT Press.","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Vikhar, P.A. (2016, January 22\u201324). Evolutionary algorithms: A critical review and its future prospects. Proceedings of the 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC), Jalgaon, India.","DOI":"10.1109\/ICGTSPICC.2016.7955308"},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1186\/1742-4682-2-29","article-title":"Three subsets of sequence complexity and their relevance to biopolymeric information","volume":"2","author":"Abel","year":"2005","journal-title":"Theor. Biol. Med. Model"},{"key":"ref_52","unstructured":"Liu, X. (2005, January 27\u201329). A functional entropy model for biological sequences. Dynamics of Continuous, Discrete & Impulsive Systems, Series B: Applications & Algorithms, Supplement. Proceedings of the International Conference on Engineering Applications and Compuational Algorithms, Guelph, ON, Canada."},{"key":"ref_53","unstructured":"Abel, D.L. (2011). Functional Sequence Complexity in Biopolymers. The First Gene: The Birth of Programming, Messaging and Formal Control, LongView Press."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1186\/1742-4682-4-47","article-title":"Measuring the functional sequence complexity of proteins","volume":"4","author":"Durston","year":"2007","journal-title":"Theor. Biol. Med. Model"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5048\/BIO-C.2020.4","article-title":"Active Information Requirements for Fixation on the Wright-Fisher Model of Population Genetics","volume":"2020","author":"Marks","year":"2020","journal-title":"BIO-Complexity"},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Kallenberg, O. (2021). Foundations of Modern Probability, Springer. [3rd ed.].","DOI":"10.1007\/978-3-030-61871-1"},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Popov, S. (2021). Two-Dimensional Random Walk: From Path Counting to Random Interlacements, Cambridge University Press.","DOI":"10.1017\/9781108680134"},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Grimmett, G., and Stirzaker, D. (2001). Probability and Random Processes, Oxford Univeristy Press. [3rd ed.].","DOI":"10.1093\/oso\/9780198572237.001.0001"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0022-5193(03)00120-6","article-title":"Mutation-selection networks of cancer initiation: Tumor suppressor genes and chromosomal instability","volume":"223","author":"Komarova","year":"2003","journal-title":"J. Theor. Biol."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/10\/1323\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:36:14Z","timestamp":1760142974000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/10\/1323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,21]]},"references-count":59,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["e24101323"],"URL":"https:\/\/doi.org\/10.3390\/e24101323","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2022,9,21]]}}}