Physics-informed features in supervised machine learning

• URL: http://arxiv.org/abs/2504.17112v1
• Date: Wed, 23 Apr 2025 21:45:49 GMT
• Title: Physics-informed features in supervised machine learning
• Authors: Margherita Lampani, Sabrina Guastavino, Michele Piana, Federico Benvenuto,
• Abstract summary: Supervised machine learning involves approximating an unknown functional relationship from a limited dataset of features and corresponding labels.<n>This study proposes a physics-informed approach to feature-based machine learning that constructs non-linear feature maps informed by physical laws and dimensional analysis.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Supervised machine learning involves approximating an unknown functional relationship from a limited dataset of features and corresponding labels. The classical approach to feature-based machine learning typically relies on applying linear regression to standardized features, without considering their physical meaning. This may limit model explainability, particularly in scientific applications. This study proposes a physics-informed approach to feature-based machine learning that constructs non-linear feature maps informed by physical laws and dimensional analysis. These maps enhance model interpretability and, when physical laws are unknown, allow for the identification of relevant mechanisms through feature ranking. The method aims to improve both predictive performance in regression tasks and classification skill scores by integrating domain knowledge into the learning process, while also enabling the potential discovery of new physical equations within the context of explainable machine learning.

Related papers

• Understanding Machine Learning Paradigms through the Lens of Statistical Thermodynamics: A tutorial [0.0]
  The tutorial delves into advanced techniques like entropy, free energy, and variational inference which are utilized in machine learning. We show how an in-depth comprehension of physical systems' behavior can yield more effective and dependable machine learning models.
  arXiv  Detail & Related papers  (2024-11-24T18:20:05Z)
• Data-Driven Computing Methods for Nonlinear Physics Systems with Geometric Constraints [0.7252027234425334]
  This paper introduces a novel, data-driven framework that synergizes physics-based priors with advanced machine learning techniques. Our framework showcases four algorithms, each embedding a specific physics-based prior tailored to a particular class of nonlinear systems. The integration of these priors also enhances the expressive power of neural networks, enabling them to capture complex patterns typical in physical phenomena.
  arXiv  Detail & Related papers  (2024-06-20T23:10:41Z)
• Mechanistic Neural Networks for Scientific Machine Learning [58.99592521721158]
  We present Mechanistic Neural Networks, a neural network design for machine learning applications in the sciences. It incorporates a new Mechanistic Block in standard architectures to explicitly learn governing differential equations as representations. Central to our approach is a novel Relaxed Linear Programming solver (NeuRLP) inspired by a technique that reduces solving linear ODEs to solving linear programs.
  arXiv  Detail & Related papers  (2024-02-20T15:23:24Z)
• Binding Dynamics in Rotating Features [72.80071820194273]
  We propose an alternative "cosine binding" mechanism, which explicitly computes the alignment between features and adjusts weights accordingly. This allows us to draw direct connections to self-attention and biological neural processes, and to shed light on the fundamental dynamics for object-centric representations to emerge in Rotating Features.
  arXiv  Detail & Related papers  (2024-02-08T12:31:08Z)
• Nature-Inspired Local Propagation [68.63385571967267]
  Natural learning processes rely on mechanisms where data representation and learning are intertwined in such a way as to respect locality. We show that the algorithmic interpretation of the derived "laws of learning", which takes the structure of Hamiltonian equations, reduces to Backpropagation when the speed of propagation goes to infinity. This opens the doors to machine learning based on full on-line information that are based the replacement of Backpropagation with the proposed local algorithm.
  arXiv  Detail & Related papers  (2024-02-04T21:43:37Z)
• Unraveling Feature Extraction Mechanisms in Neural Networks [10.13842157577026]
  We propose a theoretical approach based on Neural Tangent Kernels (NTKs) to investigate such mechanisms. We reveal how these models leverage statistical features during gradient descent and how they are integrated into final decisions. We find that while self-attention and CNN models may exhibit limitations in learning n-grams, multiplication-based models seem to excel in this area.
  arXiv  Detail & Related papers  (2023-10-25T04:22:40Z)
• Physics-Inspired Interpretability Of Machine Learning Models [0.0]
  The ability to explain decisions made by machine learning models remains one of the most significant hurdles towards widespread adoption of AI. We propose a novel approach to identify relevant features of the input data, inspired by methods from the energy landscapes field.
  arXiv  Detail & Related papers  (2023-04-05T11:35:17Z)
• Mechanism of feature learning in deep fully connected networks and kernel machines that recursively learn features [15.29093374895364]
  We identify and characterize the mechanism through which deep fully connected neural networks learn gradient features. Our ansatz sheds light on various deep learning phenomena including emergence of spurious features and simplicity biases. To demonstrate the effectiveness of this feature learning mechanism, we use it to enable feature learning in classical, non-feature learning models.
  arXiv  Detail & Related papers  (2022-12-28T15:50:58Z)
• Privacy-preserving machine learning with tensor networks [37.01494003138908]
  We show that tensor network architectures have especially prospective properties for privacy-preserving machine learning. First, we describe a new privacy vulnerability that is present in feedforward neural networks, illustrating it in synthetic and real-world datasets. We rigorously prove that such conditions are satisfied by tensor-network architectures.
  arXiv  Detail & Related papers  (2022-02-24T19:04:35Z)
• Hessian-based toolbox for reliable and interpretable machine learning in physics [58.720142291102135]
  We present a toolbox for interpretability and reliability, extrapolation of the model architecture. It provides a notion of the influence of the input data on the prediction at a given test point, an estimation of the uncertainty of the model predictions, and an agnostic score for the model predictions. Our work opens the road to the systematic use of interpretability and reliability methods in ML applied to physics and, more generally, science.
  arXiv  Detail & Related papers  (2021-08-04T16:32:59Z)
• Transforming Feature Space to Interpret Machine Learning Models [91.62936410696409]
  This contribution proposes a novel approach that interprets machine-learning models through the lens of feature space transformations. It can be used to enhance unconditional as well as conditional post-hoc diagnostic tools. A case study on remote-sensing landcover classification with 46 features is used to demonstrate the potential of the proposed approach.
  arXiv  Detail & Related papers  (2021-04-09T10:48:11Z)
• Using Data Assimilation to Train a Hybrid Forecast System that Combines Machine-Learning and Knowledge-Based Components [52.77024349608834]
  We consider the problem of data-assisted forecasting of chaotic dynamical systems when the available data is noisy partial measurements. We show that by using partial measurements of the state of the dynamical system, we can train a machine learning model to improve predictions made by an imperfect knowledge-based model.
  arXiv  Detail & Related papers  (2021-02-15T19:56:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.