Debates: Does Information Theory Provide a New Paradigm for Earth Science? Sharper Predictions Using Occam's Digital Razor

Occam's Razor is a bedrock principle of science philosophy, stating that the simplest hypothesis (or model) is preferred, at any given level of model predictive performance. A modern restatement often attributed to Einstein explains, “Everything should be made as simple as possible, but not sim...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Water resources research 2020-02, Vol.56 (2), p.n/a
Hauptverfasser: Weijs, Steven. V., Ruddell, Benjamin. L.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page n/a
container_issue 2
container_start_page
container_title Water resources research
container_volume 56
creator Weijs, Steven. V.
Ruddell, Benjamin. L.
description Occam's Razor is a bedrock principle of science philosophy, stating that the simplest hypothesis (or model) is preferred, at any given level of model predictive performance. A modern restatement often attributed to Einstein explains, “Everything should be made as simple as possible, but not simpler.” Using principles from (algorithmic) information theory, both model descriptive performance and model complexity can be quantified in bits. This quantification yields a Pareto‐style trade‐off between model complexity (length of the model program in bits) and model performance (information loss in bits, or the missing information, needed to describe the original observations). Model complexity and performance can be collapsed to one single measure of lossless model size, which, when minimized, leads to optimal model complexity versus loss trade‐off for generalization and prediction. Our view puts both simple data‐driven and complex physical‐process‐based models on a continuum, in the sense that both describe patterns in observed data in compressed form, with different degrees of generality, model complexity, and descriptive performance. Information theory‐based assessment of compression performance with fair and meaningful accounting for model complexity will enable us to best compare and combine the strengths of physics knowledge and data‐driven modeling for a given problem, given the availability of data. “Suppose we draw a set of points on paper in a totally random manner” … “I am saying it is possible to find a geometric line whose notation is constant and uniform, following a certain law, that will pass through all points, and in the same order they were drawn.” … “But if that law is strongly composed, the thing that conforms to it should be seen as irregular”Gottfried Wilhelm Leibniz, 1686: Discours de métaphysique V, VI (from French) Key Points Information theory provides a powerful framework to measure and optimize model complexity versus performance (loss) in the same unit: bits Modeling observed reality is data compression; its success can be measured by single objective: efficiency in compression of observations Quantification of complexity allows fairer comparison of performance between physical process models and data‐driven statistical models
doi_str_mv 10.1029/2019WR026471
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2395337479</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2395337479</sourcerecordid><originalsourceid>FETCH-LOGICAL-a4116-ae4825714befa176dce81e810c5f4b36c8287f90cc2252638a903678bf77fe083</originalsourceid><addsrcrecordid>eNp90E1PAjEQBuDGaCKiN39AEw9eXO3XbrdejAFUEiKEj3DclDILJewW20UCv94lePBkMslcnnlnMgjdUvJICVNPjFA1HRKWCEnPUIMqISKpJD9HDUIEjyhX8hJdhbAihIo4kQ10aMNMVxCecdtBwN0yd77QlXUlHi_B-T0eePdt54A1_oQdHmiv53ZR4NrhjvbVEo-MhdLACx4ttd-Arydgbs0xI-BJsOUC943RxX3AbbuwlV7joT44f40ucr0OcPPbm2jy1hm3PqJe_73beu1FWlCaRBpEymJJxQxyTWUyN5DSuoiJczHjiUlZKnNFjGEsZglPtSI8kekslzIHkvImujvlbrz72kKospXb-rJemTGuYs6lkKpWDydlvAvBQ55tvC2032eUZMfvZn-_W3N-4ju7hv2_NpsOW0MmRH3bD1z2eu4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2395337479</pqid></control><display><type>article</type><title>Debates: Does Information Theory Provide a New Paradigm for Earth Science? Sharper Predictions Using Occam's Digital Razor</title><source>Wiley Online Library Journals Frontfile Complete</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Wiley-Blackwell AGU Digital Library</source><creator>Weijs, Steven. V. ; Ruddell, Benjamin. L.</creator><creatorcontrib>Weijs, Steven. V. ; Ruddell, Benjamin. L.</creatorcontrib><description>Occam's Razor is a bedrock principle of science philosophy, stating that the simplest hypothesis (or model) is preferred, at any given level of model predictive performance. A modern restatement often attributed to Einstein explains, “Everything should be made as simple as possible, but not simpler.” Using principles from (algorithmic) information theory, both model descriptive performance and model complexity can be quantified in bits. This quantification yields a Pareto‐style trade‐off between model complexity (length of the model program in bits) and model performance (information loss in bits, or the missing information, needed to describe the original observations). Model complexity and performance can be collapsed to one single measure of lossless model size, which, when minimized, leads to optimal model complexity versus loss trade‐off for generalization and prediction. Our view puts both simple data‐driven and complex physical‐process‐based models on a continuum, in the sense that both describe patterns in observed data in compressed form, with different degrees of generality, model complexity, and descriptive performance. Information theory‐based assessment of compression performance with fair and meaningful accounting for model complexity will enable us to best compare and combine the strengths of physics knowledge and data‐driven modeling for a given problem, given the availability of data. “Suppose we draw a set of points on paper in a totally random manner” … “I am saying it is possible to find a geometric line whose notation is constant and uniform, following a certain law, that will pass through all points, and in the same order they were drawn.” … “But if that law is strongly composed, the thing that conforms to it should be seen as irregular”Gottfried Wilhelm Leibniz, 1686: Discours de métaphysique V, VI (from French) Key Points Information theory provides a powerful framework to measure and optimize model complexity versus performance (loss) in the same unit: bits Modeling observed reality is data compression; its success can be measured by single objective: efficiency in compression of observations Quantification of complexity allows fairer comparison of performance between physical process models and data‐driven statistical models</description><identifier>ISSN: 0043-1397</identifier><identifier>EISSN: 1944-7973</identifier><identifier>DOI: 10.1029/2019WR026471</identifier><language>eng</language><publisher>Washington: John Wiley &amp; Sons, Inc</publisher><subject>algorithmic information theory ; Bedrock ; Complexity ; Compression ; Compression tests ; Data ; data compression ; data‐driven modeling ; Information theory ; model complexity ; Modelling ; Occam's razor ; Performance prediction ; physically based modeling ; Physics ; Theories</subject><ispartof>Water resources research, 2020-02, Vol.56 (2), p.n/a</ispartof><rights>2020. American Geophysical Union. All Rights Reserved.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a4116-ae4825714befa176dce81e810c5f4b36c8287f90cc2252638a903678bf77fe083</citedby><cites>FETCH-LOGICAL-a4116-ae4825714befa176dce81e810c5f4b36c8287f90cc2252638a903678bf77fe083</cites><orcidid>0000-0003-1311-3867 ; 0000-0003-2967-9339</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1029%2F2019WR026471$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1029%2F2019WR026471$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,11494,27903,27904,45553,45554,46447,46871</link.rule.ids></links><search><creatorcontrib>Weijs, Steven. V.</creatorcontrib><creatorcontrib>Ruddell, Benjamin. L.</creatorcontrib><title>Debates: Does Information Theory Provide a New Paradigm for Earth Science? Sharper Predictions Using Occam's Digital Razor</title><title>Water resources research</title><description>Occam's Razor is a bedrock principle of science philosophy, stating that the simplest hypothesis (or model) is preferred, at any given level of model predictive performance. A modern restatement often attributed to Einstein explains, “Everything should be made as simple as possible, but not simpler.” Using principles from (algorithmic) information theory, both model descriptive performance and model complexity can be quantified in bits. This quantification yields a Pareto‐style trade‐off between model complexity (length of the model program in bits) and model performance (information loss in bits, or the missing information, needed to describe the original observations). Model complexity and performance can be collapsed to one single measure of lossless model size, which, when minimized, leads to optimal model complexity versus loss trade‐off for generalization and prediction. Our view puts both simple data‐driven and complex physical‐process‐based models on a continuum, in the sense that both describe patterns in observed data in compressed form, with different degrees of generality, model complexity, and descriptive performance. Information theory‐based assessment of compression performance with fair and meaningful accounting for model complexity will enable us to best compare and combine the strengths of physics knowledge and data‐driven modeling for a given problem, given the availability of data. “Suppose we draw a set of points on paper in a totally random manner” … “I am saying it is possible to find a geometric line whose notation is constant and uniform, following a certain law, that will pass through all points, and in the same order they were drawn.” … “But if that law is strongly composed, the thing that conforms to it should be seen as irregular”Gottfried Wilhelm Leibniz, 1686: Discours de métaphysique V, VI (from French) Key Points Information theory provides a powerful framework to measure and optimize model complexity versus performance (loss) in the same unit: bits Modeling observed reality is data compression; its success can be measured by single objective: efficiency in compression of observations Quantification of complexity allows fairer comparison of performance between physical process models and data‐driven statistical models</description><subject>algorithmic information theory</subject><subject>Bedrock</subject><subject>Complexity</subject><subject>Compression</subject><subject>Compression tests</subject><subject>Data</subject><subject>data compression</subject><subject>data‐driven modeling</subject><subject>Information theory</subject><subject>model complexity</subject><subject>Modelling</subject><subject>Occam's razor</subject><subject>Performance prediction</subject><subject>physically based modeling</subject><subject>Physics</subject><subject>Theories</subject><issn>0043-1397</issn><issn>1944-7973</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp90E1PAjEQBuDGaCKiN39AEw9eXO3XbrdejAFUEiKEj3DclDILJewW20UCv94lePBkMslcnnlnMgjdUvJICVNPjFA1HRKWCEnPUIMqISKpJD9HDUIEjyhX8hJdhbAihIo4kQ10aMNMVxCecdtBwN0yd77QlXUlHi_B-T0eePdt54A1_oQdHmiv53ZR4NrhjvbVEo-MhdLACx4ttd-Arydgbs0xI-BJsOUC943RxX3AbbuwlV7joT44f40ucr0OcPPbm2jy1hm3PqJe_73beu1FWlCaRBpEymJJxQxyTWUyN5DSuoiJczHjiUlZKnNFjGEsZglPtSI8kekslzIHkvImujvlbrz72kKospXb-rJemTGuYs6lkKpWDydlvAvBQ55tvC2032eUZMfvZn-_W3N-4ju7hv2_NpsOW0MmRH3bD1z2eu4</recordid><startdate>202002</startdate><enddate>202002</enddate><creator>Weijs, Steven. V.</creator><creator>Ruddell, Benjamin. L.</creator><general>John Wiley &amp; Sons, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7QH</scope><scope>7QL</scope><scope>7T7</scope><scope>7TG</scope><scope>7U9</scope><scope>7UA</scope><scope>8FD</scope><scope>C1K</scope><scope>F1W</scope><scope>FR3</scope><scope>H94</scope><scope>H96</scope><scope>KL.</scope><scope>KR7</scope><scope>L.G</scope><scope>M7N</scope><scope>P64</scope><orcidid>https://orcid.org/0000-0003-1311-3867</orcidid><orcidid>https://orcid.org/0000-0003-2967-9339</orcidid></search><sort><creationdate>202002</creationdate><title>Debates: Does Information Theory Provide a New Paradigm for Earth Science? Sharper Predictions Using Occam's Digital Razor</title><author>Weijs, Steven. V. ; Ruddell, Benjamin. L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a4116-ae4825714befa176dce81e810c5f4b36c8287f90cc2252638a903678bf77fe083</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>algorithmic information theory</topic><topic>Bedrock</topic><topic>Complexity</topic><topic>Compression</topic><topic>Compression tests</topic><topic>Data</topic><topic>data compression</topic><topic>data‐driven modeling</topic><topic>Information theory</topic><topic>model complexity</topic><topic>Modelling</topic><topic>Occam's razor</topic><topic>Performance prediction</topic><topic>physically based modeling</topic><topic>Physics</topic><topic>Theories</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Weijs, Steven. V.</creatorcontrib><creatorcontrib>Ruddell, Benjamin. L.</creatorcontrib><collection>CrossRef</collection><collection>Aqualine</collection><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Industrial and Applied Microbiology Abstracts (Microbiology A)</collection><collection>Meteorological &amp; Geoastrophysical Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Water Resources Abstracts</collection><collection>Technology Research Database</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ASFA: Aquatic Sciences and Fisheries Abstracts</collection><collection>Engineering Research Database</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>Aquatic Science &amp; Fisheries Abstracts (ASFA) 2: Ocean Technology, Policy &amp; Non-Living Resources</collection><collection>Meteorological &amp; Geoastrophysical Abstracts - Academic</collection><collection>Civil Engineering Abstracts</collection><collection>Aquatic Science &amp; Fisheries Abstracts (ASFA) Professional</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biotechnology and BioEngineering Abstracts</collection><jtitle>Water resources research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Weijs, Steven. V.</au><au>Ruddell, Benjamin. L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Debates: Does Information Theory Provide a New Paradigm for Earth Science? Sharper Predictions Using Occam's Digital Razor</atitle><jtitle>Water resources research</jtitle><date>2020-02</date><risdate>2020</risdate><volume>56</volume><issue>2</issue><epage>n/a</epage><issn>0043-1397</issn><eissn>1944-7973</eissn><abstract>Occam's Razor is a bedrock principle of science philosophy, stating that the simplest hypothesis (or model) is preferred, at any given level of model predictive performance. A modern restatement often attributed to Einstein explains, “Everything should be made as simple as possible, but not simpler.” Using principles from (algorithmic) information theory, both model descriptive performance and model complexity can be quantified in bits. This quantification yields a Pareto‐style trade‐off between model complexity (length of the model program in bits) and model performance (information loss in bits, or the missing information, needed to describe the original observations). Model complexity and performance can be collapsed to one single measure of lossless model size, which, when minimized, leads to optimal model complexity versus loss trade‐off for generalization and prediction. Our view puts both simple data‐driven and complex physical‐process‐based models on a continuum, in the sense that both describe patterns in observed data in compressed form, with different degrees of generality, model complexity, and descriptive performance. Information theory‐based assessment of compression performance with fair and meaningful accounting for model complexity will enable us to best compare and combine the strengths of physics knowledge and data‐driven modeling for a given problem, given the availability of data. “Suppose we draw a set of points on paper in a totally random manner” … “I am saying it is possible to find a geometric line whose notation is constant and uniform, following a certain law, that will pass through all points, and in the same order they were drawn.” … “But if that law is strongly composed, the thing that conforms to it should be seen as irregular”Gottfried Wilhelm Leibniz, 1686: Discours de métaphysique V, VI (from French) Key Points Information theory provides a powerful framework to measure and optimize model complexity versus performance (loss) in the same unit: bits Modeling observed reality is data compression; its success can be measured by single objective: efficiency in compression of observations Quantification of complexity allows fairer comparison of performance between physical process models and data‐driven statistical models</abstract><cop>Washington</cop><pub>John Wiley &amp; Sons, Inc</pub><doi>10.1029/2019WR026471</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0003-1311-3867</orcidid><orcidid>https://orcid.org/0000-0003-2967-9339</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0043-1397
ispartof Water resources research, 2020-02, Vol.56 (2), p.n/a
issn 0043-1397
1944-7973
language eng
recordid cdi_proquest_journals_2395337479
source Wiley Online Library Journals Frontfile Complete; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Wiley-Blackwell AGU Digital Library
subjects algorithmic information theory
Bedrock
Complexity
Compression
Compression tests
Data
data compression
data‐driven modeling
Information theory
model complexity
Modelling
Occam's razor
Performance prediction
physically based modeling
Physics
Theories
title Debates: Does Information Theory Provide a New Paradigm for Earth Science? Sharper Predictions Using Occam's Digital Razor
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T11%3A25%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Debates:%20Does%20Information%20Theory%20Provide%20a%20New%20Paradigm%20for%20Earth%20Science?%20Sharper%20Predictions%20Using%20Occam's%20Digital%20Razor&rft.jtitle=Water%20resources%20research&rft.au=Weijs,%20Steven.%20V.&rft.date=2020-02&rft.volume=56&rft.issue=2&rft.epage=n/a&rft.issn=0043-1397&rft.eissn=1944-7973&rft_id=info:doi/10.1029/2019WR026471&rft_dat=%3Cproquest_cross%3E2395337479%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2395337479&rft_id=info:pmid/&rfr_iscdi=true