Machine-Learning Solutions for the Analysis of Single-Particle Diffusion
Trajectories
- URL: http://arxiv.org/abs/2308.09414v1
- Date: Fri, 18 Aug 2023 09:29:29 GMT
- Title: Machine-Learning Solutions for the Analysis of Single-Particle Diffusion
Trajectories
- Authors: Henrik Seckler, Janusz Szwabinski, and Ralf Metzler
- Abstract summary: We provide an overview over recently introduced methods in machine-learning for diffusive time series.
We focus on means to include uncertainty estimates and feature-based approaches, both improving interpretability and providing concrete insight into the learning process of the machine.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Single-particle traces of the diffusive motion of molecules, cells, or
animals are by-now routinely measured, similar to stochastic records of stock
prices or weather data. Deciphering the stochastic mechanism behind the
recorded dynamics is vital in understanding the observed systems. Typically,
the task is to decipher the exact type of diffusion and/or to determine system
parameters. The tools used in this endeavor are currently revolutionized by
modern machine-learning techniques. In this Perspective we provide an overview
over recently introduced methods in machine-learning for diffusive time series,
most notably, those successfully competing in the
Anomalous-Diffusion-Challenge. As such methods are often criticized for their
lack of interpretability, we focus on means to include uncertainty estimates
and feature-based approaches, both improving interpretability and providing
concrete insight into the learning process of the machine. We expand the
discussion by examining predictions on different out-of-distribution data. We
also comment on expected future developments.
Related papers
- A Mathematical Model of the Hidden Feedback Loop Effect in Machine Learning Systems [44.99833362998488]
We introduce a repeated learning process to jointly describe several phenomena attributed to unintended hidden feedback loops.
A distinctive feature of such repeated learning setting is that the state of the environment becomes causally dependent on the learner itself over time.
We present a novel dynamical systems model of the repeated learning process and prove the limiting set of probability distributions for positive and negative feedback loop modes.
arXiv Detail & Related papers (2024-05-04T17:57:24Z) - Gramian Angular Fields for leveraging pretrained computer vision models
with anomalous diffusion trajectories [0.9012198585960443]
We present a new data-driven method for working with diffusive trajectories.
This method utilizes Gramian Angular Fields (GAF) to encode one-dimensional trajectories as images.
We leverage two well-established pre-trained computer-vision models, ResNet and MobileNet, to characterize the underlying diffusive regime.
arXiv Detail & Related papers (2023-09-02T17:22:45Z) - Explainable classification of astronomical uncertain time series [0.0]
We propose an uncertaintyaware subsequence based model which achieves a classification comparable to that of state-of-the-art methods.
Our approach is explainable-by-design, giving domain experts the ability to inspect the model and explain its predictions.
The dataset, the source code of our experiment, and the results are made available on a public repository.
arXiv Detail & Related papers (2022-09-28T09:06:42Z) - Symbolic Knowledge Extraction from Opaque Predictors Applied to
Cosmic-Ray Data Gathered with LISA Pathfinder [0.0]
Several techniques exist to combine the impressive predictive performance of opaque machine learning models with human-intelligible prediction explanations.
In this paper are reported the results of different knowledge extractors applied to an ensemble predictor capable of reproducing cosmic-ray data gathered on board the LISA Pathfinder space mission.
arXiv Detail & Related papers (2022-09-10T15:35:40Z) - On Contrastive Representations of Stochastic Processes [53.21653429290478]
Learning representations of processes is an emerging problem in machine learning.
We show that our methods are effective for learning representations of periodic functions, 3D objects and dynamical processes.
arXiv Detail & Related papers (2021-06-18T11:00:24Z) - Beyond Trivial Counterfactual Explanations with Diverse Valuable
Explanations [64.85696493596821]
In computer vision applications, generative counterfactual methods indicate how to perturb a model's input to change its prediction.
We propose a counterfactual method that learns a perturbation in a disentangled latent space that is constrained using a diversity-enforcing loss.
Our model improves the success rate of producing high-quality valuable explanations when compared to previous state-of-the-art methods.
arXiv Detail & Related papers (2021-03-18T12:57:34Z) - Contrastive learning of strong-mixing continuous-time stochastic
processes [53.82893653745542]
Contrastive learning is a family of self-supervised methods where a model is trained to solve a classification task constructed from unlabeled data.
We show that a properly constructed contrastive learning task can be used to estimate the transition kernel for small-to-mid-range intervals in the diffusion case.
arXiv Detail & Related papers (2021-03-03T23:06:47Z) - 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) - Deducing neighborhoods of classes from a fitted model [68.8204255655161]
In this article a new kind of interpretable machine learning method is presented.
It can help to understand the partitioning of the feature space into predicted classes in a classification model using quantile shifts.
Basically, real data points (or specific points of interest) are used and the changes of the prediction after slightly raising or decreasing specific features are observed.
arXiv Detail & Related papers (2020-09-11T16:35:53Z) - Focus of Attention Improves Information Transfer in Visual Features [80.22965663534556]
This paper focuses on unsupervised learning for transferring visual information in a truly online setting.
The computation of the entropy terms is carried out by a temporal process which yields online estimation of the entropy terms.
In order to better structure the input probability distribution, we use a human-like focus of attention model.
arXiv Detail & Related papers (2020-06-16T15:07:25Z)
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.