Multi-Excitation Projective Simulation with a Many-Body Physics Inspired Inductive Bias

• URL: http://arxiv.org/abs/2402.10192v2
• Date: Thu, 29 Feb 2024 11:22:28 GMT
• Title: Multi-Excitation Projective Simulation with a Many-Body Physics Inspired Inductive Bias
• Authors: Philip A. LeMaitre, Marius Krumm, and Hans J. Briegel
• Abstract summary: We introduce Multi-Excitation Project Simulationive (mePS), a generalization that considers a chain-of-thought to be a random walk of several particles on a hypergraph. An inductive bias inspired by the remarkably successful few-body interaction models used in quantum many-body physics is formalized for our classical mePS framework. We prove that our inductive bias reduces the complexity from exponential to numerically, with the exponent representing the cutoff on how many particles can interact.
• Score: 0.6554326244334868
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: With the impressive progress of deep learning, applications relying on machine learning are increasingly being integrated into daily life. However, most deep learning models have an opaque, oracle-like nature making it difficult to interpret and understand their decisions. This problem led to the development of the field known as eXplainable Artificial Intelligence (XAI). One method in this field known as Projective Simulation (PS) models a chain-of-thought as a random walk of a particle on a graph with vertices that have concepts attached to them. While this description has various benefits, including the possibility of quantization, it cannot be naturally used to model thoughts that combine several concepts simultaneously. To overcome this limitation, we introduce Multi-Excitation Projective Simulation (mePS), a generalization that considers a chain-of-thought to be a random walk of several particles on a hypergraph. A definition for a dynamic hypergraph is put forward to describe the agent's training history along with applications to AI and hypergraph visualization. An inductive bias inspired by the remarkably successful few-body interaction models used in quantum many-body physics is formalized for our classical mePS framework and employed to tackle the exponential complexity associated with naive implementations of hypergraphs. We prove that our inductive bias reduces the complexity from exponential to polynomial, with the exponent representing the cutoff on how many particles can interact. We numerically apply our method to two toy environments and a more complex scenario modelling the diagnosis of a broken computer. These environments demonstrate the resource savings provided by an appropriate choice of inductive bias, as well as showcasing aspects of interpretability. A quantum model for mePS is also briefly outlined and some future directions for it are discussed.

Related papers

• Learning Extremely High Density Crowds as Active Matters [15.443916758415057]
  High-density crowd analysis and prediction has been a long-standing topic in computer vision. It is notoriously difficult due to, but not limited to, the lack of high-quality data and complex crowd dynamics. We propose a new approach that aims to learn from in-the-wild videos, often with low quality where it is difficult to track individuals or count heads.
  arXiv  Detail & Related papers  (2025-03-15T15:14:26Z)
• Conditional Distribution Quantization in Machine Learning [83.54039134248231]
  Conditional expectation mathbbE(Y mid X) often fails to capture the complexity of multimodal conditional distributions mathcalL(Y mid X) We propose using n-point conditional quantizations--functional mappings of X that are learnable via gradient descent--to approximate mathcalL(Y mid X)
  arXiv  Detail & Related papers  (2025-02-11T00:28:24Z)
• Learnable Infinite Taylor Gaussian for Dynamic View Rendering [55.382017409903305]
  This paper introduces a novel approach based on a learnable Taylor Formula to model the temporal evolution of Gaussians. The proposed method achieves state-of-the-art performance in this domain.
  arXiv  Detail & Related papers  (2024-12-05T16:03:37Z)
• Bond Graphs for multi-physics informed Neural Networks for multi-variate time series [6.775534755081169]
  Existing methods are not adapted to tasks with complex multi-physical and multi-domain phenomena. We propose a Neural Bond graph (NBgE) producing multi-physics-informed representations that can be fed into any task-specific model.
  arXiv  Detail & Related papers  (2024-05-22T12:30:25Z)
• MinT: Boosting Generalization in Mathematical Reasoning via Multi-View Fine-Tuning [53.90744622542961]
  Reasoning in mathematical domains remains a significant challenge for small language models (LMs) We introduce a new method that exploits existing mathematical problem datasets with diverse annotation styles. Experimental results show that our strategy enables a LLaMA-7B model to outperform prior approaches.
  arXiv  Detail & Related papers  (2023-07-16T05:41:53Z)
• PAC-NeRF: Physics Augmented Continuum Neural Radiance Fields for Geometry-Agnostic System Identification [64.61198351207752]
  Existing approaches to system identification (estimating the physical parameters of an object) from videos assume known object geometries. In this work, we aim to identify parameters characterizing a physical system from a set of multi-view videos without any assumption on object geometry or topology. We propose "Physics Augmented Continuum Neural Radiance Fields" (PAC-NeRF), to estimate both the unknown geometry and physical parameters of highly dynamic objects from multi-view videos.
  arXiv  Detail & Related papers  (2023-03-09T18:59:50Z)
• Deep learning applied to computational mechanics: A comprehensive review, state of the art, and the classics [77.34726150561087]
  Recent developments in artificial neural networks, particularly deep learning (DL), are reviewed in detail. Both hybrid and pure machine learning (ML) methods are discussed. History and limitations of AI are recounted and discussed, with particular attention at pointing out misstatements or misconceptions of the classics.
  arXiv  Detail & Related papers  (2022-12-18T02:03:00Z)
• Geometric multimodal representation learning [13.159512679346687]
  Multimodal learning methods fuse multiple data modalities while leveraging cross-modal dependencies to address this challenge. We put forward an algorithmic blueprint for multimodal graph learning based on this categorization. This effort can pave the way for standardizing the design of sophisticated multimodal architectures for highly complex real-world problems.
  arXiv  Detail & Related papers  (2022-09-07T16:59:03Z)
• Learning Differential Operators for Interpretable Time Series Modeling [34.32259687441212]
  We propose a learning framework that can automatically obtain interpretable PDE models from sequential data. Our model can provide valuable interpretability and achieve comparable performance to state-of-the-art models.
  arXiv  Detail & Related papers  (2022-09-03T20:14:31Z)
• Multiscale Neural Operator: Learning Fast and Grid-independent PDE Solvers [0.0]
  We propose a hybrid, flexible surrogate model that exploits known physics for simulating large-scale dynamics. We are the first to learn grid-independent, non-local, and flexible parametrizations.
  arXiv  Detail & Related papers  (2022-07-23T05:01:03Z)
• Interfacing Finite Elements with Deep Neural Operators for Fast Multiscale Modeling of Mechanics Problems [4.280301926296439]
  In this work, we explore the idea of multiscale modeling with machine learning and employ DeepONet, a neural operator, as an efficient surrogate of the expensive solver. DeepONet is trained offline using data acquired from the fine solver for learning the underlying and possibly unknown fine-scale dynamics. We present various benchmarks to assess accuracy and speedup, and in particular we develop a coupling algorithm for a time-dependent problem.
  arXiv  Detail & Related papers  (2022-02-25T20:46:08Z)
• Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs [65.18780403244178]
  We propose a continuous model to forecast Multivariate Time series with dynamic Graph neural Ordinary Differential Equations (MTGODE) Specifically, we first abstract multivariate time series into dynamic graphs with time-evolving node features and unknown graph structures. Then, we design and solve a neural ODE to complement missing graph topologies and unify both spatial and temporal message passing.
  arXiv  Detail & Related papers  (2022-02-17T02:17:31Z)
• Spin many-body phases in standard and topological waveguide QED simulators [68.8204255655161]
  We study the many-body behaviour of quantum spin models using waveguide QED setups. We find novel many-body phases different from the ones obtained in other platforms.
  arXiv  Detail & Related papers  (2021-06-22T09:44:20Z)
• Learning to Simulate Complex Physics with Graph Networks [68.43901833812448]
  We present a machine learning framework and model implementation that can learn to simulate a wide variety of challenging physical domains. Our framework---which we term "Graph Network-based Simulators" (GNS)--represents the state of a physical system with particles, expressed as nodes in a graph, and computes dynamics via learned message-passing. Our results show that our model can generalize from single-timestep predictions with thousands of particles during training, to different initial conditions, thousands of timesteps, and at least an order of magnitude more particles at test time.
  arXiv  Detail & Related papers  (2020-02-21T16:44:28Z)

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.