Path Signatures for Feature Extraction. An Introduction to the Mathematics Underpinning an Efficient Machine Learning Technique

• URL: http://arxiv.org/abs/2506.01815v1
• Date: Mon, 02 Jun 2025 15:55:26 GMT
• Title: Path Signatures for Feature Extraction. An Introduction to the Mathematics Underpinning an Efficient Machine Learning Technique
• Authors: Stephan Sturm,
• Abstract summary: We provide an introduction to the topic of path signatures as means of feature extraction for machine learning from data streams.<n>The article stresses the mathematical theory underlying the signature methodology, highlighting the conceptual character without plunging into the technical details of rigorous proofs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We provide an introduction to the topic of path signatures as means of feature extraction for machine learning from data streams. The article stresses the mathematical theory underlying the signature methodology, highlighting the conceptual character without plunging into the technical details of rigorous proofs. These notes are based on an introductory presentation given to students of the Research Experience for Undergraduates in Industrial Mathematics and Statistics at Worcester Polytechnic Institute in June 2024.

Related papers

• Partial Label Learning for Automated Theorem Proving [0.0]
  We formulate learning guided Automated Theorem Proving as Partial Label Learning.<n>We use the plCoP theorem prover to demonstrate that methods from the Partial Label Learning literature tend to increase the performance of learning assisted theorem provers.
  arXiv  Detail & Related papers  (2025-07-04T05:54:27Z)
• Machine Learning: a Lecture Note [51.31735291774885]
  This lecture note is intended to prepare early-year master's and PhD students in data science or a related discipline with foundational ideas in machine learning.<n>It starts with basic ideas in modern machine learning with classification as a main target task.<n>Based on these basic ideas, the lecture note explores in depth the probablistic approach to unsupervised learning.
  arXiv  Detail & Related papers  (2025-05-06T16:03:41Z)
• Causal Inference Tools for a Better Evaluation of Machine Learning [0.0]
  We introduce key statistical methods such as Ordinary Least Squares (OLS) regression, Analysis of Variance (ANOVA) and logistic regression. The document serves as a guide for researchers and practitioners, detailing how these techniques can provide deeper insights into model behavior, performance, and fairness.
  arXiv  Detail & Related papers  (2024-10-02T10:03:29Z)
• Automated conjecturing in mathematics with \emph{TxGraffiti} [0.0]
  emphTxGraffiti is a data-driven computer program developed to automate the process of generating conjectures. We present the design and core principles of emphTxGraffiti, including its roots in the original emphGraffiti program.
  arXiv  Detail & Related papers  (2024-09-28T15:06:31Z)
• Artificial intelligence and machine learning generated conjectures with TxGraffiti [0.0]
  We outline the machine learning and techniques implemented by TxGraffiti. We also announce a new online version of the program available for anyone curious to explore conjectures in graph theory.
  arXiv  Detail & Related papers  (2024-07-03T01:03:09Z)
• Contextual Semantic Embeddings for Ontology Subsumption Prediction [37.61925808225345]
  We present a new prediction method for contextual embeddings of classes of Web Ontology (OWL) named BERTSubs. It exploits the pre-trained language model BERT to compute embeddings of a class, where customized templates are proposed to incorporate the class context and the logical existential restriction.
  arXiv  Detail & Related papers  (2022-02-20T11:14:04Z)
• Computing Rule-Based Explanations of Machine Learning Classifiers using Knowledge Graphs [62.997667081978825]
  We use knowledge graphs as the underlying framework providing the terminology for representing explanations for the operation of a machine learning classifier. In particular, we introduce a novel method for extracting and representing black-box explanations of its operation, in the form of first-order logic rules expressed in the terminology of the knowledge graph.
  arXiv  Detail & Related papers  (2022-02-08T16:21:49Z)
• Deep Learning Schema-based Event Extraction: Literature Review and Current Trends [60.29289298349322]
  Event extraction technology based on deep learning has become a research hotspot. This paper fills the gap by reviewing the state-of-the-art approaches, focusing on deep learning-based models.
  arXiv  Detail & Related papers  (2021-07-05T16:32:45Z)
• Training a First-Order Theorem Prover from Synthetic Data [50.23600875138756]
  A major challenge in applying machine learning to automated theorem proving is the scarcity of training data. We propose an approach that relies on training purely with synthetically generated theorems, without any human data aside from axioms. Our neural prover outperforms the state-of-the-art E-prover on this synthetic data in both time and search steps.
  arXiv  Detail & Related papers  (2021-03-05T17:01:34Z)
• On Learning Text Style Transfer with Direct Rewards [101.97136885111037]
  Lack of parallel corpora makes it impossible to directly train supervised models for the text style transfer task. We leverage semantic similarity metrics originally used for fine-tuning neural machine translation models. Our model provides significant gains in both automatic and human evaluation over strong baselines.
  arXiv  Detail & Related papers  (2020-10-24T04:30:02Z)
• A Diagnostic Study of Explainability Techniques for Text Classification [52.879658637466605]
  We develop a list of diagnostic properties for evaluating existing explainability techniques. We compare the saliency scores assigned by the explainability techniques with human annotations of salient input regions to find relations between a model's performance and the agreement of its rationales with human ones.
  arXiv  Detail & Related papers  (2020-09-25T12:01:53Z)
• A Primer on the Signature Method in Machine Learning [2.3020018305241337]
  We provide an introduction to the signature method, focusing on its theoretical properties and machine learning applications.<n>In the first part, we present the definition and fundamental properties of the signature of a path.<n>As a sequence of numbers, the signature serves as a compact description (dimension reduction) of a path.<n>In the second part, we present practical applications of the signature to the area of machine learning.
  arXiv  Detail & Related papers  (2016-03-11T21:24:42Z)

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.