Search arXivSearch

arXiv · 2609.01651

Parameter inference from a non-stationary unknown process using statistical feature-based slow feature analysis

Abstract

Non-stationary phenomena are ubiquitous, with examples to be found in climatological measurements, brain activity, and the behavior of financial markets. Starting with a time series from a non-stationary process, a key challenge is to infer the time-varying parameters that underlie the non-stationarity in these systems, without requiring a generative model of the dynamics to be learned. This problem is referred to as Parameter Inference from a Non-stationary Unknown Process (PINUP). Here we introduce a PINUP method called feature-based Slow Feature Analysis (f -SFA) comprising the computation of time-series features across sliding windows, followed by dimension reduction using slow feature analysis (SFA). This allows us to detect slow variation in a potentially wide range of statistical properties of the measured dynamics on a timescale determined by the window length. Crucially, using a comprehensive time-series feature set avoids the subjectivity of feature selection, while the SFA slowness constraint overcomes the bias towards irrelevant correlated features seen with variance-based dimension reduction. The performance of f -SFA surpasses that of four benchmark PINUP methods across a diverse range of non-stationary chaotic processes, and we explore the impact of various parameters on performance, including observation noise, parameter timescales, parameter amplitudes, and unseen parameter values. Further, applying f -SFA to sleep polysomnography data, we show that it is able to infer a time-varying parameter underlying the non-stationary sleep recordings that closely tracks depth of sleep. To our knowledge, this work presents the first comparative study of PINUP methods, and we demonstrate that f -SFA is a simple, effective, and noise-robust approach for quantifying non-stationarity from time series, that can be applied in a range of fields.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kieran S. Owens, Masako Tamaki, Ben D. Fulcher. 2026-08-31. Parameter inference from a non-stationary unknown process using statistical feature-based slow feature analysis. https://arxiv.org/abs/2609.01651

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Comparison of Image Processing Models in Quark Gluon Jet Classification

Quark-gluon discrimination provides a useful test case for studying how different machine-learning architectures learn the spatial structure of QCD radiation. In this work, we compare convolutional neural network (CNN), Vision Transformers (ViT), and hierarchical Swin Transformers using the same three-channel jet-image representation, consisting of charged-particle momentum, neutral-particle momentum, and charged-particle multiplicity from PYTHIA 8 jets. We study their performance for different training-set sizes and fine-tuning configurations, with particular attention to the role of local and global information in the jet images. CNN and Swin models consistently perform better than ViT in the cases studied. Since both CNN and Swin retain a strong local component in their architectures, this suggests that local jet substructure plays an important role in quark-gluon discrimination. The performance of the hierarchical Swin model also suggests that combining local features over larger spatial scales is useful. Block-wise fine-tuning improves the performance of the Transformer models, although the improvement becomes smaller and the training less stable as more blocks are unfrozen. We also find that self-supervised Momentum Contrast (MoCo) pretraining improves the model initialization, particularly when the amount of labeled training data is limited. Based on these observations, we developed a smaller Swin model adopted to the jet-image representation used in this study. It achieves comparable performance with substantially fewer parameters. The results show that it is important to adapt the model architecture and training procedure to the specific input characteristics of High Energy Physics (HEP) data when applying vision models in HEP.

physics.data-an

Online local learning for generative thermodynamic computing

Generative thermodynamic computers turn thermal noise into structured data through Langevin dynamics. We train these systems with a local update at each integration step. The reverse-path Onsager-Machlup objective yields a coupling gradient that is a symmetric sum of local residual-state correlations. We apply this gradient immediately rather than accumulating it over a full trajectory. In digital simulations using MNIST prototypes, online and trajectory-batch training reach similar validation losses on fixed noising paths. Models trained online release less heat on average in all five independently seeded pairs, with both models' parameters held fixed during sampling. Auxiliary classifier and nearest-prototype measures change modestly, while pairwise diversity decreases. The response to noise depends strongly on where the errors enter: independent zero-mean errors in the formed updates produce little heat change over a finite range of noise amplitudes, whereas residual offset and temporal correlation have much larger effects. Storing trained couplings requires substantially less precision than resolving deterministic updates during training. Together, these results establish a local online training method and show how update timing, noise structure, and precision affect generative thermodynamic computing.

physics.data-an

Information-Loss Location Estimation and Curvature-Scale Analysis of Physical Measurements: A Gaussian, Cauchy, and Logistic Neutron-Lifetime Benchmark

We develop and implement a two-step location-scale analysis for repeated physical measurements when the underlying distribution is not known. For a chosen substitute distribution, stationarity of population Kullback-Leibler information loss at fixed scale motivates the location score, which we apply to the observed measurements through empirical cross-entropy. Steiner's curvature rule then defines a companion scale separately. We place Gaussian, Cauchy, and logistic substitutes in one common construction and implement them reproducibly on a physics benchmark. For the logistic substitute, we pair the established bounded location score with a scale defined by the curvature rule rather than by a fitted tuning constant or a scale-likelihood equation. For Gaussian measurements with different quoted uncertainties, an experiment-level curvature convention and a stated variance mapping give an exact algebraic connection to a standard residual-based variance estimate for a weighted fit. Applied to a published 21-measurement neutron-lifetime compilation, the inverse-variance weighted, most frequent value, and logistic locations are 878.689, 881.164, and 882.835 s, respectively. These values are benchmark results of the compared constructions and are not proposed as a new recommended neutron lifetime.

physics.data-an