SIAM Review, Volume 67, Issue 1, Page 206-207, March 2025. This is a bold book! Professor Zhu wants to provide the basic statistical knowledge needed by data scientists in a super-short volume. It reminds me a bit of Larry Wasserman’s All of Statistics (Springer, 2014), but is aimed at Masters students (often from fields other than statistics) or advanced undergraduates (also often from other fields). As an attendee at far too many faculty meetings, I applaud brevity and focus. As an amateur stylist, I admire strong technical writing. And as an applied statistician who has taught basic statistics to Masters and Ph.D. students from other disciplines, I appreciate the need for a book of this kind. For the right course I would happily use this book, although I would need to supplement it with other material.
SIAM评论，第67卷，第1期，第206-207页，2025年3月。这是一本大胆的书！朱教授希望以极短的篇幅提供数据科学家所需的基本统计知识。它让我想起了Larry Wasserman的All of Statistics (b施普林格，2014)，但它针对的是硕士生（通常来自统计以外的领域）或高级本科生（也通常来自其他领域）。作为参加过太多教师会议的人，我赞赏简洁和专注。作为一名业余发型师，我欣赏强烈的技术写作。作为一名应用统计学家，我曾向来自其他学科的硕士和博士教授基础统计学，我很欣赏这样一本书的必要性。对于正确的课程，我很乐意使用这本书，尽管我需要用其他材料补充它。
{"title":"Book Review:; Essential Statistics for Data Science: A Concise Crash Course","authors":"David Banks","doi":"10.1137/24m167562x","DOIUrl":"https://doi.org/10.1137/24m167562x","url":null,"abstract":"SIAM Review, Volume 67, Issue 1, Page 206-207, March 2025. <br/> This is a bold book! Professor Zhu wants to provide the basic statistical knowledge needed by data scientists in a super-short volume. It reminds me a bit of Larry Wasserman’s All of Statistics (Springer, 2014), but is aimed at Masters students (often from fields other than statistics) or advanced undergraduates (also often from other fields). As an attendee at far too many faculty meetings, I applaud brevity and focus. As an amateur stylist, I admire strong technical writing. And as an applied statistician who has taught basic statistics to Masters and Ph.D. students from other disciplines, I appreciate the need for a book of this kind. For the right course I would happily use this book, although I would need to supplement it with other material.","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":"79 1","pages":""},"PeriodicalIF":10.2,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143258247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nina M. Gottschling, Vegard Antun, Anders C. Hansen, Ben Adcock
SIAM Review, Volume 67, Issue 1, Page 73-104, March 2025. Abstract.Methods inspired by artificial intelligence (AI) are starting to fundamentally change computational science and engineering through breakthrough performance on challenging problems. However, the reliability and trustworthiness of such techniques is a major concern. In inverse problems in imaging, the focus of this paper, there is increasing empirical evidence that methods may suffer from hallucinations, i.e., false, but realistic-looking artifacts; instability, i.e., sensitivity to perturbations in the data; and unpredictable generalization, i.e., excellent performance on some images, but significant deterioration on others. This paper provides a theoretical foundation for these phenomena. We give mathematical explanations for how and when such effects arise in arbitrary reconstruction methods, with several of our results taking the form of “no free lunch” theorems. Specifically, we show that (i) methods that overperform on a single image can wrongly transfer details from one image to another, creating a hallucination; (ii) methods that overperform on two or more images can hallucinate or be unstable; (iii) optimizing the accuracy-stability tradeoff is generally difficult; (iv) hallucinations and instabilities, if they occur, are not rare events and may be encouraged by standard training; and (v) it may be impossible to construct optimal reconstruction maps for certain problems. Our results trace these effects to the kernel of the forward operator whenever it is nontrivial, but also apply to the case when the forward operator is ill-conditioned. Based on these insights, our work aims to spur research into new ways to develop robust and reliable AI-based methods for inverse problems in imaging.
{"title":"The Troublesome Kernel: On Hallucinations, No Free Lunches, and the Accuracy-Stability Tradeoff in Inverse Problems","authors":"Nina M. Gottschling, Vegard Antun, Anders C. Hansen, Ben Adcock","doi":"10.1137/23m1568739","DOIUrl":"https://doi.org/10.1137/23m1568739","url":null,"abstract":"SIAM Review, Volume 67, Issue 1, Page 73-104, March 2025. <br/> Abstract.Methods inspired by artificial intelligence (AI) are starting to fundamentally change computational science and engineering through breakthrough performance on challenging problems. However, the reliability and trustworthiness of such techniques is a major concern. In inverse problems in imaging, the focus of this paper, there is increasing empirical evidence that methods may suffer from hallucinations, i.e., false, but realistic-looking artifacts; instability, i.e., sensitivity to perturbations in the data; and unpredictable generalization, i.e., excellent performance on some images, but significant deterioration on others. This paper provides a theoretical foundation for these phenomena. We give mathematical explanations for how and when such effects arise in arbitrary reconstruction methods, with several of our results taking the form of “no free lunch” theorems. Specifically, we show that (i) methods that overperform on a single image can wrongly transfer details from one image to another, creating a hallucination; (ii) methods that overperform on two or more images can hallucinate or be unstable; (iii) optimizing the accuracy-stability tradeoff is generally difficult; (iv) hallucinations and instabilities, if they occur, are not rare events and may be encouraged by standard training; and (v) it may be impossible to construct optimal reconstruction maps for certain problems. Our results trace these effects to the kernel of the forward operator whenever it is nontrivial, but also apply to the case when the forward operator is ill-conditioned. Based on these insights, our work aims to spur research into new ways to develop robust and reliable AI-based methods for inverse problems in imaging.","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":"123 1","pages":""},"PeriodicalIF":10.2,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143258252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SIAM Review, Volume 67, Issue 1, Page 204-205, March 2025. Numerical Methods in Physics with Python by Alex Gezerlis is an excellent example of a textbook built on long and established teaching experience. The goals are clearly defined in the preface: Gezerlis aims to gently introduce undergraduate physics students to the branch of numerical methods and their concrete implementation in Python. To this end, the author considers a physics-applications-first approach. Every chapter begins with a motivation section on real physics problems (simple but adequate for undergraduate students), ends with a concrete project on a physics application, and is completed by a rich list of exercises often designed with a physics appeal.
{"title":"Book Review:; Numerical Methods in Physics with Python. Second Edition","authors":"Gabriele Ciaramella","doi":"10.1137/24m1650466","DOIUrl":"https://doi.org/10.1137/24m1650466","url":null,"abstract":"SIAM Review, Volume 67, Issue 1, Page 204-205, March 2025. <br/> Numerical Methods in Physics with Python by Alex Gezerlis is an excellent example of a textbook built on long and established teaching experience. The goals are clearly defined in the preface: Gezerlis aims to gently introduce undergraduate physics students to the branch of numerical methods and their concrete implementation in Python. To this end, the author considers a physics-applications-first approach. Every chapter begins with a motivation section on real physics problems (simple but adequate for undergraduate students), ends with a concrete project on a physics application, and is completed by a rich list of exercises often designed with a physics appeal.","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":"140 1","pages":""},"PeriodicalIF":10.2,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143258249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SIAM Review, Volume 67, Issue 1, Page 107-137, March 2025. Abstract.A dynamical system is a transformation of a phase space, and the transformation law is the primary means of defining as well as identifying the dynamical system and is the object of focus of many learning techniques. However, there are many secondary aspects of dynamical systems—invariant sets, the Koopman operator, and Markov approximations—that provide alternative objectives for learning techniques. Crucially, while many learning methods are focused on the transformation law, we find that forecast performance can depend on how well these other aspects of the dynamics are approximated. These different facets of a dynamical system correspond to objects in completely different spaces—namely, interpolation spaces, compact Hausdorff sets, unitary operators, and Markov operators, respectively. Thus, learning techniques targeting any of these four facets perform different kinds of approximations. We examine whether an approximation of any one of these aspects of the dynamics could lead to an approximation of another facet. Many connections and obstructions are brought to light in this analysis. Special focus is placed on methods of learning the primary feature—the dynamics law itself. The main question considered is the connection between learning this law and reconstructing the Koopman operator and the invariant set. The answers are tied to the ergodic and topological properties of the dynamics, and they reveal how these properties determine the limits of forecasting techniques.
{"title":"Limits of Learning Dynamical Systems","authors":"Tyrus Berry, Suddhasattwa Das","doi":"10.1137/24m1696974","DOIUrl":"https://doi.org/10.1137/24m1696974","url":null,"abstract":"SIAM Review, Volume 67, Issue 1, Page 107-137, March 2025. <br/> Abstract.A dynamical system is a transformation of a phase space, and the transformation law is the primary means of defining as well as identifying the dynamical system and is the object of focus of many learning techniques. However, there are many secondary aspects of dynamical systems—invariant sets, the Koopman operator, and Markov approximations—that provide alternative objectives for learning techniques. Crucially, while many learning methods are focused on the transformation law, we find that forecast performance can depend on how well these other aspects of the dynamics are approximated. These different facets of a dynamical system correspond to objects in completely different spaces—namely, interpolation spaces, compact Hausdorff sets, unitary operators, and Markov operators, respectively. Thus, learning techniques targeting any of these four facets perform different kinds of approximations. We examine whether an approximation of any one of these aspects of the dynamics could lead to an approximation of another facet. Many connections and obstructions are brought to light in this analysis. Special focus is placed on methods of learning the primary feature—the dynamics law itself. The main question considered is the connection between learning this law and reconstructing the Koopman operator and the invariant set. The answers are tied to the ergodic and topological properties of the dynamics, and they reveal how these properties determine the limits of forecasting techniques.","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":"47 1","pages":""},"PeriodicalIF":10.2,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143258457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SIAM Review, Volume 67, Issue 1, Page 197-204, March 2025. The book under review was originally published under the auspices of the National Research Council in 1933 (the year John was born), and it was republished as a Dover edition in 1956 (three years before Rob was born). At 108 pages—including title page, preface, table of contents, and index—it’s very short. Even so, it contains a significant amount of information that was of technical importance for its time and is of historical importance now.
{"title":"Featured Review:; Numerical Integration of Differential Equations","authors":"John C. Butcher, Robert M. Corless","doi":"10.1137/24m1678684","DOIUrl":"https://doi.org/10.1137/24m1678684","url":null,"abstract":"SIAM Review, Volume 67, Issue 1, Page 197-204, March 2025. <br/> The book under review was originally published under the auspices of the National Research Council in 1933 (the year John was born), and it was republished as a Dover edition in 1956 (three years before Rob was born). At 108 pages—including title page, preface, table of contents, and index—it’s very short. Even so, it contains a significant amount of information that was of technical importance for its time and is of historical importance now.","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":"14 1","pages":""},"PeriodicalIF":10.2,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143258250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nicholas S. Moore, Eric C. Cyr, Peter Ohm, Christopher M. Siefert, Raymond S. Tuminaro
SIAM Review, Volume 67, Issue 1, Page 141-175, March 2025. Abstract.Sparse matrix computations are ubiquitous in scientific computing. Given the recent interest in scientific machine learning, it is natural to ask how sparse matrix computations can leverage neural networks (NNs). Unfortunately, multilayer perceptron (MLP) NNs are typically not natural for either graph or sparse matrix computations. The issue lies with the fact that MLPs require fixed-sized inputs, while scientific applications generally generate sparse matrices with arbitrary dimensions and a wide range of different nonzero patterns (or matrix graph vertex interconnections). While convolutional NNs could possibly address matrix graphs where all vertices have the same number of nearest neighbors, a more general approach is needed for arbitrary sparse matrices, e.g., those arising from discretized partial differential equations on unstructured meshes. Graph neural networks (GNNs) are one such approach suitable to sparse matrices. The key idea is to define aggregation functions (e.g., summations) that operate on variable-size input data to produce data of a fixed output size so that MLPs can be applied. The goal of this paper is to provide an introduction to GNNs for a numerical linear algebra audience. Concrete GNN examples are provided to illustrate how many common linear algebra tasks can be accomplished using GNNs. We focus on iterative and multigrid methods that employ computational kernels such as matrix-vector products, interpolation, relaxation methods, and strength-of-connection measures. Our GNN examples include cases where parameters are determined a priori as well as cases where parameters must be learned. The intent of this paper is to help computational scientists understand how GNNs can be used to adapt machine learning concepts to computational tasks associated with sparse matrices. It is hoped that this understanding will further stimulate data-driven extensions of classical sparse linear algebra tasks.
{"title":"Graph Neural Networks and Applied Linear Algebra","authors":"Nicholas S. Moore, Eric C. Cyr, Peter Ohm, Christopher M. Siefert, Raymond S. Tuminaro","doi":"10.1137/23m1609786","DOIUrl":"https://doi.org/10.1137/23m1609786","url":null,"abstract":"SIAM Review, Volume 67, Issue 1, Page 141-175, March 2025. <br/> Abstract.Sparse matrix computations are ubiquitous in scientific computing. Given the recent interest in scientific machine learning, it is natural to ask how sparse matrix computations can leverage neural networks (NNs). Unfortunately, multilayer perceptron (MLP) NNs are typically not natural for either graph or sparse matrix computations. The issue lies with the fact that MLPs require fixed-sized inputs, while scientific applications generally generate sparse matrices with arbitrary dimensions and a wide range of different nonzero patterns (or matrix graph vertex interconnections). While convolutional NNs could possibly address matrix graphs where all vertices have the same number of nearest neighbors, a more general approach is needed for arbitrary sparse matrices, e.g., those arising from discretized partial differential equations on unstructured meshes. Graph neural networks (GNNs) are one such approach suitable to sparse matrices. The key idea is to define aggregation functions (e.g., summations) that operate on variable-size input data to produce data of a fixed output size so that MLPs can be applied. The goal of this paper is to provide an introduction to GNNs for a numerical linear algebra audience. Concrete GNN examples are provided to illustrate how many common linear algebra tasks can be accomplished using GNNs. We focus on iterative and multigrid methods that employ computational kernels such as matrix-vector products, interpolation, relaxation methods, and strength-of-connection measures. Our GNN examples include cases where parameters are determined a priori as well as cases where parameters must be learned. The intent of this paper is to help computational scientists understand how GNNs can be used to adapt machine learning concepts to computational tasks associated with sparse matrices. It is hoped that this understanding will further stimulate data-driven extensions of classical sparse linear algebra tasks.","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":"40 1","pages":""},"PeriodicalIF":10.2,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143258251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SIAM Review, Volume 67, Issue 1, Page 205-206, March 2025. The first look at Probability Adventures brought back memories of a conference in Ubatuba, Brazil, in 2001, where as a young Master’s student I worried that true science had to be deadly serious. Fortunately, several inspiring teachers came to the rescue. Andrei Toom’s words resonated deeply with me when he began his lecture by saying, “Every mathematician is a big child.” The esteemed audience beamed with approval. Today, I look at Probability Adventures and applaud Mark Huber for honoring the child in all of us and offering a reading that is both fun and mathematically rigorous.
{"title":"Book Review:; Probability Adventures","authors":"Nevena Marić","doi":"10.1137/24m1646108","DOIUrl":"https://doi.org/10.1137/24m1646108","url":null,"abstract":"SIAM Review, Volume 67, Issue 1, Page 205-206, March 2025. <br/> The first look at Probability Adventures brought back memories of a conference in Ubatuba, Brazil, in 2001, where as a young Master’s student I worried that true science had to be deadly serious. Fortunately, several inspiring teachers came to the rescue. Andrei Toom’s words resonated deeply with me when he began his lecture by saying, “Every mathematician is a big child.” The esteemed audience beamed with approval. Today, I look at Probability Adventures and applaud Mark Huber for honoring the child in all of us and offering a reading that is both fun and mathematically rigorous.","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":"45 1","pages":""},"PeriodicalIF":10.2,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143258248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SIAM Review, Volume 67, Issue 1, Page 3-70, March 2025. Abstract.Uncertainty is prevalent in engineering design and data-driven problems and, more broadly, in decision making. Due to inherent risk-averseness and ambiguity about assumptions, it is common to address uncertainty by formulating and solving conservative optimization models expressed using measures of risk and related concepts. We survey the rapid development of risk measures over the last quarter century. From their beginning in financial engineering, we recount their spread to nearly all areas of engineering and applied mathematics. Solidly rooted in convex analysis, risk measures furnish a general framework for handling uncertainty with significant computational and theoretical advantages. We describe the key facts, list several concrete algorithms, and provide an extensive list of references for further reading. The survey recalls connections with utility theory and distributionally robust optimization, points to emerging applications areas such as fair machine learning, and defines measures of reliability.
{"title":"Risk-Adaptive Approaches to Stochastic Optimization: A Survey","authors":"Johannes O. Royset","doi":"10.1137/22m1538946","DOIUrl":"https://doi.org/10.1137/22m1538946","url":null,"abstract":"SIAM Review, Volume 67, Issue 1, Page 3-70, March 2025. <br/> Abstract.Uncertainty is prevalent in engineering design and data-driven problems and, more broadly, in decision making. Due to inherent risk-averseness and ambiguity about assumptions, it is common to address uncertainty by formulating and solving conservative optimization models expressed using measures of risk and related concepts. We survey the rapid development of risk measures over the last quarter century. From their beginning in financial engineering, we recount their spread to nearly all areas of engineering and applied mathematics. Solidly rooted in convex analysis, risk measures furnish a general framework for handling uncertainty with significant computational and theoretical advantages. We describe the key facts, list several concrete algorithms, and provide an extensive list of references for further reading. The survey recalls connections with utility theory and distributionally robust optimization, points to emerging applications areas such as fair machine learning, and defines measures of reliability.","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":"128 1","pages":""},"PeriodicalIF":10.2,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143258254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号