Towards a Knowledge Graph for Models and Algorithms in Applied Mathematics

• URL: http://arxiv.org/abs/2408.10003v1
• Date: Mon, 19 Aug 2024 13:57:49 GMT
• Title: Towards a Knowledge Graph for Models and Algorithms in Applied Mathematics
• Authors: Björn Schembera, Frank Wübbeling, Hendrik Kleikamp, Burkhard Schmidt, Aurela Shehu, Marco Reidelbach, Christine Biedinger, Jochen Fiedler, Thomas Koprucki, Dorothea Iglezakis, Dominik Göddeke,
• Abstract summary: We aim to represent models and algorithms as well as their relationship semantically to make this research data FAIR. The link between the two algorithmic tasks is established, as they occur in modeling corresponding to corresponding tasks. Subject-specific metadata is relevant here, such as the symmetry of a matrix or the linearity of a mathematical model.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Mathematical models and algorithms are an essential part of mathematical research data, as they are epistemically grounding numerical data. In order to represent models and algorithms as well as their relationship semantically to make this research data FAIR, two previously distinct ontologies were merged and extended, becoming a living knowledge graph. The link between the two ontologies is established by introducing computational tasks, as they occur in modeling, corresponding to algorithmic tasks. Moreover, controlled vocabularies are incorporated and a new class, distinguishing base quantities from specific use case quantities, was introduced. Also, both models and algorithms can now be enriched with metadata. Subject-specific metadata is particularly relevant here, such as the symmetry of a matrix or the linearity of a mathematical model. This is the only way to express specific workflows with concrete models and algorithms, as the feasible solution algorithm can only be determined if the mathematical properties of a model are known. We demonstrate this using two examples from different application areas of applied mathematics. In addition, we have already integrated over 250 research assets from applied mathematics into our knowledge graph.

Related papers

• Integrating Arithmetic Learning Improves Mathematical Reasoning in Smaller Models [0.0]
  Large models pre-trained on high-quality data exhibit excellent performance across various reasoning tasks. Smaller student models learn from teacher models, and data augmentation, such as rephrasing questions. Despite these efforts, smaller models struggle with arithmetic computations, leading to errors in mathematical reasoning.
  arXiv  Detail & Related papers  (2025-02-18T13:43:06Z)
• MathFimer: Enhancing Mathematical Reasoning by Expanding Reasoning Steps through Fill-in-the-Middle Task [49.355810887265925]
  We introduce MathFimer, a novel framework for mathematical reasoning step expansion. We develop a specialized model, MathFimer-7B, on our carefully curated NuminaMath-FIM dataset. We then apply these models to enhance existing mathematical reasoning datasets by inserting detailed intermediate steps into their solution chains.
  arXiv  Detail & Related papers  (2025-02-17T11:22:24Z)
• Data for Mathematical Copilots: Better Ways of Presenting Proofs for Machine Learning [85.635988711588]
  We argue that enhancing the capabilities of large language models requires a paradigm shift in the design of mathematical datasets. We advocate for mathematical dataset developers to consider the concept of "motivated proof", introduced by G. P'olya in 1949, which can serve as a blueprint for datasets that offer a better proof learning signal. We provide a questionnaire designed specifically for math datasets that we urge creators to include with their datasets.
  arXiv  Detail & Related papers  (2024-12-19T18:55:17Z)
• Graph-Dictionary Signal Model for Sparse Representations of Multivariate Data [49.77103348208835]
  We define a novel Graph-Dictionary signal model, where a finite set of graphs characterizes relationships in data distribution through a weighted sum of their Laplacians. We propose a framework to infer the graph dictionary representation from observed data, along with a bilinear generalization of the primal-dual splitting algorithm to solve the learning problem. We exploit graph-dictionary representations in a motor imagery decoding task on brain activity data, where we classify imagined motion better than standard methods.
  arXiv  Detail & Related papers  (2024-11-08T17:40:43Z)
• Ontologies for Models and Algorithms in Applied Mathematics and Related Disciplines [0.0]
  The Mathematical Research Initiative has developed, merged and implemented crucial knowledge graphs. This contributes to making mathematical research data by introducing semantic technology and documenting the mathematical foundations.
  arXiv  Detail & Related papers  (2023-10-31T13:24:28Z)
• Geometry of EM and related iterative algorithms [8.228889210180268]
  The Expectation--Maximization (EM) algorithm is a simple meta-algorithm that has been used for many years as a methodology for statistical inference. In this paper, we introduce the $em$ algorithm, an information geometric formulation of the EM algorithm, and its extensions and applications to various problems.
  arXiv  Detail & Related papers  (2022-09-03T00:23:23Z)
• Model-agnostic multi-objective approach for the evolutionary discovery of mathematical models [55.41644538483948]
  In modern data science, it is more interesting to understand the properties of the model, which parts could be replaced to obtain better results. We use multi-objective evolutionary optimization for composite data-driven model learning to obtain the algorithm's desired properties.
  arXiv  Detail & Related papers  (2021-07-07T11:17:09Z)
• Learning ODE Models with Qualitative Structure Using Gaussian Processes [0.6882042556551611]
  In many contexts explicit data collection is expensive and learning algorithms must be data-efficient to be feasible. We propose an approach to learning a vector field of differential equations using sparse Gaussian Processes. We show that this combination improves extrapolation performance and long-term behaviour significantly, while also reducing the computational cost.
  arXiv  Detail & Related papers  (2020-11-10T19:34:07Z)
• Connecting actuarial judgment to probabilistic learning techniques with graph theory [0.0]
  It is argued that the formalism is very useful for applications in the modelling of non-life insurance claims data. It is also shown that actuarial models in current practice can be expressed graphically to exploit the advantages of the approach.
  arXiv  Detail & Related papers  (2020-07-29T13:24:40Z)
• The data-driven physical-based equations discovery using evolutionary approach [77.34726150561087]
  We describe the algorithm for the mathematical equations discovery from the given observations data. The algorithm combines genetic programming with the sparse regression. It could be used for governing analytical equation discovery as well as for partial differential equations (PDE) discovery.
  arXiv  Detail & Related papers  (2020-04-03T17:21:57Z)
• Learning Gaussian Graphical Models via Multiplicative Weights [54.252053139374205]
  We adapt an algorithm of Klivans and Meka based on the method of multiplicative weight updates. The algorithm enjoys a sample complexity bound that is qualitatively similar to others in the literature. It has a low runtime $O(mp2)$ in the case of $m$ samples and $p$ nodes, and can trivially be implemented in an online manner.
  arXiv  Detail & Related papers  (2020-02-20T10:50:58Z)

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.