Learning dynamical systems with hit-and-run random feature maps

• URL: http://arxiv.org/abs/2501.06661v1
• Date: Sat, 11 Jan 2025 23:19:58 GMT
• Title: Learning dynamical systems with hit-and-run random feature maps
• Authors: Pinak Mandal, Georg A. Gottwald,
• Abstract summary: We show how random feature maps can be used to forecast dynamical systems with excellent forecasting skill. We introduce skip connections and construct a deep variant of random feature maps by combining several units. Our modified random feature maps provide excellent forecasting skill for both single trajectory forecasts as well as long-time estimates of statistical properties.
• Score: 0.0
• License:
• Abstract: We show how random feature maps can be used to forecast dynamical systems with excellent forecasting skill. We consider the tanh activation function and judiciously choose the internal weights in a data-driven manner such that the resulting features explore the nonlinear, non-saturated regions of the activation function. We introduce skip connections and construct a deep variant of random feature maps by combining several units. To mitigate the curse of dimensionality, we introduce localization where we learn local maps, employing conditional independence. Our modified random feature maps provide excellent forecasting skill for both single trajectory forecasts as well as long-time estimates of statistical properties, for a range of chaotic dynamical systems with dimensions up to 512. In contrast to other methods such as reservoir computers which require extensive hyperparameter tuning, we effectively need to tune only a single hyperparameter, and are able to achieve state-of-the-art forecast skill with much smaller networks.

Related papers

• On the choice of the non-trainable internal weights in random feature maps [0.0]
  We address the task of how to best select the internal weights for random feature maps. We show that the number of good features is the main factor controlling the forecasting skill of random feature maps. We find that random feature maps have superior forecasting capabilities whilst having several orders of magnitude lower computational cost.
  arXiv  Detail & Related papers  (2024-08-07T08:37:23Z)
• Asynchronously Trained Distributed Topographic Maps [0.0]
  We present an algorithm that uses $N$ autonomous units to generate a feature map by distributed training. Unit autonomy is achieved by sparse interaction in time & space through the combination of a distributed search, and a cascade-driven weight updating scheme.
  arXiv  Detail & Related papers  (2023-01-20T01:15:56Z)
• PRISM: Probabilistic Real-Time Inference in Spatial World Models [52.878769723544615]
  PRISM is a method for real-time filtering in a probabilistic generative model of agent motion and visual perception. The proposed solution runs at 10Hz real-time and is similarly accurate to state-of-the-art SLAM in small to medium-sized indoor environments.
  arXiv  Detail & Related papers  (2022-12-06T13:59:06Z)
• Physics Informed Shallow Machine Learning for Wind Speed Prediction [66.05661813632568]
  We analyze a massive dataset of wind measured from anemometers located at 10 m height in 32 locations in Italy. We train supervised learning algorithms using the past history of wind to predict its value at a future time. We find that the optimal design as well as its performance vary with the location.
  arXiv  Detail & Related papers  (2022-04-01T14:55:10Z)
• Scaling Structured Inference with Randomization [64.18063627155128]
  We propose a family of dynamic programming (RDP) randomized for scaling structured models to tens of thousands of latent states. Our method is widely applicable to classical DP-based inference. It is also compatible with automatic differentiation so can be integrated with neural networks seamlessly.
  arXiv  Detail & Related papers  (2021-12-07T11:26:41Z)
• Combining machine learning and data assimilation to forecast dynamical systems from noisy partial observations [0.76146285961466]
  We present a supervised learning method to learn the propagator map of a dynamical system from partial and noisy observations. We show that the combination of random feature maps and data assimilation, called RAFDA, outperforms standard random feature maps for which the dynamics is learned using batch data.
  arXiv  Detail & Related papers  (2021-08-08T03:38:36Z)
• MFGNet: Dynamic Modality-Aware Filter Generation for RGB-T Tracking [72.65494220685525]
  We propose a new dynamic modality-aware filter generation module (named MFGNet) to boost the message communication between visible and thermal data. We generate dynamic modality-aware filters with two independent networks. The visible and thermal filters will be used to conduct a dynamic convolutional operation on their corresponding input feature maps respectively. To address issues caused by heavy occlusion, fast motion, and out-of-view, we propose to conduct a joint local and global search by exploiting a new direction-aware target-driven attention mechanism.
  arXiv  Detail & Related papers  (2021-07-22T03:10:51Z)
• Deep Multi-Task Learning for Joint Localization, Perception, and Prediction [68.50217234419922]
  This paper investigates the issues that arise in state-of-the-art autonomy stacks under localization error. We design a system that jointly performs perception, prediction, and localization. Our architecture is able to reuse computation between both tasks, and is thus able to correct localization errors efficiently.
  arXiv  Detail & Related papers  (2021-01-17T17:20:31Z)
• Stochastically forced ensemble dynamic mode decomposition for forecasting and analysis of near-periodic systems [65.44033635330604]
  We introduce a novel load forecasting method in which observed dynamics are modeled as a forced linear system. We show that its use of intrinsic linear dynamics offers a number of desirable properties in terms of interpretability and parsimony. Results are presented for a test case using load data from an electrical grid.
  arXiv  Detail & Related papers  (2020-10-08T20:25:52Z)
• Multioutput Gaussian Processes with Functional Data: A Study on Coastal Flood Hazard Assessment [0.0]
  We introduce a surrogate model that accounts for time-varying inputs and provides information on spatially varying inland flooding. In several experiments, we demonstrate the versatility of the model for both learning maps and inferring unobserved maps. We conclude that our framework is a promising approach for forecast and early-warning systems.
  arXiv  Detail & Related papers  (2020-07-28T08:15:17Z)
• Supervised learning from noisy observations: Combining machine-learning techniques with data assimilation [0.6091702876917281]
  We show how to optimally combine forecast models and their inherent uncertainty with incoming noisy observations. We show that the obtained forecast model has remarkably good forecast skill while being computationally cheap once trained. Going beyond the task of forecasting, we show that our method can be used to generate reliable ensembles for probabilistic forecasting as well as to learn effective model closure in multi-scale systems.
  arXiv  Detail & Related papers  (2020-07-14T22:29:37Z)

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.