Frequency-based reservoir improves prediction accuracy and optimizes short-term forecasts.
problem Lack of precise explanation and optimization methods for reservoir computing.
method Inspired by brain's oscillatory dynamics, frequency-based reservoir uses an ensemble of independent oscillatory units.
result Frequency-based reservoir performs as well as or better than random reservoirs and can predict complex spatiotemporal dynamics.
New methods improve Reservoir Computing for chaotic time series prediction.
problem Chaotic time series prediction in Reservoir Computing.
method Established Recurrent Kernel limit, introduced Structured Reservoir Computing.
result Structured Reservoir Computing is faster and more memory-efficient.
Bayesian approach estimates sub-resolution reservoir properties from seismic data.
problem Estimating sub-resolution reservoir properties from seismic data.
method Bayesian evidential learning approach, direct relation between seismic data and reservoir properties.
result Efficient estimation of reservoir properties with uncertainty quantification.
Stochastic reservoir computing is shown to be a universal approximator.
problem Theoretical justification for using stochastic reservoirs in machine learning.
method Investigated stochastic reservoir computing using probabilities of reservoir states as readout.
result Stochastic reservoir computers are universal approximating classes.
Deep learning speeds up pressure prediction in carbon storage reservoirs.
problem Accurately forecasting reservoir pressure in geologic carbon storage projects with sparse well data.
method Combining InSAR surface displacement data with deep learning and data assimilation techniques.
result Workflow can predict reservoir pressure with high efficiency and uncertainty quantification.
Local reservoir model explains decision consistency in learning.
problem Understanding decision consistency in learning processes.
method Proposes a local reservoir model to explain decision consistency.
result Size of local reservoir affects decision consistency.
A new method predicts oil movement in reservoirs using deep learning.
problem Assessing dynamics of multiphase fluid flow in oil reservoirs.
method Metamodel based on Variational Autoencoder and Recurrent Neural Network.
result The Metamodel accurately predicts flow rates, pressure, and fluid saturations.
The paper introduces reservoir computing models for complex systems.
problem Modeling complex engineering systems using nonlinear autoregression.
method Introduces reservoir computing with output feedback as stationary and ergodic infinite-order nonlinear autoregressive models.
result Demonstrates versatility of classical and quantum reservoir computers in modeling synthetic and real data.
A new Latent Diffusion Model generates realistic reservoir facies.
problem Creating accurate reservoir facies from limited measurements.
method Proposes a Latent Diffusion Model for conditional facies generation.
result Significantly outperforms GAN-based alternatives in fidelity and realism.
GANs improve 3D petrophysical model generation.
problem Generating accurate 3D petrophysical models for reservoir studies.
method Differentiable neural networks, content and perceptual losses.
result GANs effectively generate conditioned 3D pore and reservoir-scale models.
Low-connectivity reservoirs outperform standard designs in chaotic system forecasting.
problem Forecasting chaotic systems with high accuracy and low computational resources.
method Used Bayesian optimization to find optimal reservoir configurations, focusing on global system climate rather than short-term prediction.
result Optimized reservoirs with very low connectivity perform well in forecasting chaotic systems, challenging existing design heuristics.
Study on deep and wide echo state networks for forecasting complex time series.
problem Performance analysis of deep reservoir computing models.
method Investigates the impact of partitioning neurons and parallel pathways on forecasting accuracy.
result Wide and deep networks outperform shallow models in forecasting multiscale spatiotemporal data.
Reduced reservoir size for faster edge computing.
problem Efficiently reducing computational resources for reservoir computing.
method Concatenating past or drifting states of the reservoir to the output layer.
result Reduced reservoir size up to one tenth without significant error increase.
Reservoir computer dimensions estimated using three methods.
problem Estimating the dimension of reservoir computer signals.
method Used three dimension estimation methods: false nearest neighbor, covariance, and Kaplan-Yorke.
result Signals in reservoir system exist on a low dimensional surface.
Quantum reservoir computing improves volatility forecasting.
problem Forecasting realized volatility in finance.
method Quantum reservoir computing with Ising Hamiltonian and feature selection.
result Quantum reservoir computing outperforms benchmarks in volatility forecasting.
Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.
problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.
This work improves Recursive Neural Gas (RNG) for reservoir computing.
problem Improving performance of fully-trainable reservoirs in Recurrent Neural Networks (RNN).
method Describes an accurate model of RNG and shows comparative results on three datasets.
result RNG-based reservoirs can achieve better performance under specific circumstances.
Deep learning speeds up oil reservoir simulations by 2000x.
problem Accelerating oil reservoir simulations using physics-based methods.
method Developed a neural network proxy model for oil reservoirs.
result Achieved a speedup of more than 2000X with an average sequence error of 10%.
Study shows structured reservoirs improve deep ESN performance.
problem Improving performance of deep reservoir computing networks.
method Investigated structured reservoir topologies in deep ESNs.
result Structured reservoirs significantly enhance predictive performance.
Reservoir computing's success depends on mapping different input time series to separable states.
problem Quantifying the ability of random linear reservoirs to map different input time series.
method Mathematical framework using spectral properties of the connectivity matrix.
result Separation capacity is fully characterized by the spectral properties of the connectivity matrix.
Quantum reservoir computing tackles noisy quantum computers for temporal tasks.
problem Efficiently process input sequences on noisy quantum computers.
method Quantum reservoir computing using dissipative quantum dynamics.
result Small and noisy quantum reservoirs can handle high-order nonlinear temporal tasks.
New method combines long-memory reservoirs for accurate dengue forecasting from short data.
problem Accurate dengue forecasting from short, noisy, non-stationary, and nonlinear data.
method Fractional ESN and Wavelet ESN frameworks integrating long-term memory.
result fESN and wESN outperform baselines in multiple dengue datasets and forecasting horizons.
New empirical index reveals wider validity of Echo State Property in input-driven reservoirs.
problem Lack of proper input consideration in Echo State Property conditions.
method Introduced an empirical Echo State Property index to analyze stability of reservoirs with input signals.
result The actual domain of Echo State Property validity is wider than literature conditions suggest.
A hardware-based reservoir computing system predicts time series with high speed and accuracy.
problem Processing time-dependent signals with high speed and accuracy.
method A hardware-based reservoir computing system using a field-programmable gate array (FPGA) for both the reservoir and output layers.
result Achieves comparable accuracy to software approaches but with a superior real-time prediction rate up to 160 MHz.
New explanation of reservoir computing using random projections.
problem Understanding the randomness in reservoir computing.
method Constructing strongly universal reservoir systems as random projections of state-space systems.
result Approximation of any fading memory filters class by training a linear readout for each filter.
New insights on stability in reservoir computing for better performance.
problem Stability in reservoir computing networks.
method Using the recurrent kernel limit for large reservoir sizes.
result Quantitative characterization of stability and chaos frontier.
The study provides risk bounds for reservoir computing systems.
problem Analyzing the generalization error of reservoir computing systems.
method Deriving finite sample upper bounds for generalization error using statistical learning theory.
result Explicit bounds on the number of observations needed for estimation accuracy.
Study characterizes memory capacity of quantum reservoirs using transmon qubits.
problem Understanding the memory capacity of quantum reservoirs built with transmon qubits.
method Characterized memory capacity of quantum reservoirs using transmon qubits from IBM, focusing on NMSE and topology complexity.
result Found a peak in memory capacity for configurations with n-1 self-loops, suggesting optimal design for forecasting tasks.
The paper analyzes the performance of delay-based reservoir computing using eigenvalue analysis.
problem Quantifying the performance of delay-based reservoir computing.
method Eigenvalue analysis of the dynamical system to predict reservoir computing performance.
result The performance of a reservoir computing system can be predicted by analyzing the small signal response and eigenvalue spectrum.
ResCP uses reservoir computing to create efficient, scalable time series prediction intervals.
problem Building distribution-free prediction intervals for time series data with small sample sizes and changing distributions.
method Reservoir Conformal Prediction (ResCP) leverages reservoir computing to dynamically reweight conformity scores based on similarity among reservoir states.
result ResCP achieves asymptotic conditional coverage and is effective across diverse forecasting tasks.
This paper provides a mathematical framework for time-delay reservoir computing.
problem Lack of rigorous mathematical foundations for reservoir computing properties.
method Control-theoretic framework, formal definitions of separation and fading memory, explicit lower bound derivation.
result Established formal definitions and connections to stability notions for time-delay systems.
Quantum ELMs use a quantum reservoir to learn from data, with limits on expressivity and scalability.
problem Understanding the limits of quantum ELMs for machine learning tasks.
method Decomposed QELM predictions into Fourier series to analyze expressivity and scalability.
result Expressivity of QELMs is limited by the number of Fourier frequencies and observables, and scalability is hindered by hardware noise and entanglement.
Ring-reservoir networks simplify graph embeddings efficiently.
problem Efficient graph embeddings using deep neural networks.
method Progressive simplification of Reservoir Computing models to ring topology.
result Ring-reservoir networks show consistent advantages in predictive performance.
BNNs enhance reservoir computing by acting as generalization filters.
problem Understanding how BNNs integrate with reservoir computing.
method Optogenetics and calcium imaging to record BNNs, reservoir computing framework.
result BNNs improve reservoir computing performance through generalization.
Quantum reservoirs risk bounds are analyzed using Rademacher complexity.
problem Bounding generalization errors of quantum reservoirs.
method Using Rademacher complexity, specific bounds are derived for quantum reservoir classes.
result Risk bounds converge with increasing training samples and qubits.
Quantum Reservoir Computing classifies complex probability distributions and identifies volatility regimes.
problem Statistical and financial classification problems with heavy-tailed distributions and correlated time series.
method Implemented QRC in a superconducting quantum circuit with Josephson junctions.
result QRC outperforms classical methods in limited information scenarios.
Reservoir Memory Machines solve benchmark tasks faster than Neural Turing Machines.
problem Training Neural Turing Machines is hard and limits their applicability.
method Proposes Reservoir Memory Machines, combining neural network flexibility with Turing machine capabilities, but with faster training via alignment and linear regression.
result Reservoir Memory Machines solve benchmark tasks as well as Neural Turing Machines but are much faster to train.
EuSN uses Euler discretization for stable, non-dissipative reservoir computing.
problem Designing stable and efficient reservoir computing models.
method Forward Euler discretization and antisymmetric recurrent matrices.
result EuSN outperforms standard RC models in long-term memory tasks and time-series classification.
This paper presents a stochastic logic time delay reservoir design. The reservoir is analyzed using a number of metrics, such as kernel quality, generalization rank, performance on simple benchmarks, and is also compared to a deterministic design. A novel re-seeding method is introduced to reduce the adverse effects of…
Proposes a new method combining Reservoir Computing and Normalizing Flow for predicting stochastic dynamical systems.
problem Predicting and capturing long-term behaviors of stochastic dynamical systems.
method Data-driven framework combining Reservoir Computing and Normalizing Flow, integrating error modeling and both approaches virtues.
result Successfully predicts the long-term evolution of stochastic dynamical systems and replicates dynamical behaviors.
Study reveals optimal scaling conditions for photonic neural networks.
problem Impact of reservoir size and learning routines on convergence-speed during learning.
method Used a greedy algorithm to train a photonic neural network for chaotic signals prediction.
result Determined convergence speed of learning as a function of reservoir size and found close to linear scaling.
The paper proposes a machine learning approach for production forecasting without model calibration.
problem Generating accurate production forecasts for reservoir development.
method Sequential model aggregation using machine learning algorithms without model calibration.
result The proposed method provides robust multi-step-ahead production forecasts.
New definitions of ESP for quantum reservoir computing handle non-stationary systems.
problem Traditional ESP does not apply to non-stationary systems.
method Introduce two new categories of ESP: non-stationary ESP and subset/subspace ESP.
result Demonstrates correspondence between non-stationary ESP and QRC with NARMA tasks.
Predicting unobserved bifurcations in time series with unsupervised parameter extraction.
problem Predicting system behavior with unknown parameters from time series data.
method Reservoir computing framework for unsupervised extraction of slowly varying system parameters.
result Model predicts unknown bifurcations not present in training data.
Reservoir computing predicts chaotic systems for long horizons with sparse updates.
problem Predicting chaotic systems with long horizons using limited data.
method Sparse, time-dependent data inputs into reservoir computing.
result Achieves arbitrarily long prediction horizons for chaotic systems.
New method uses randomised signatures for generating financial time series data.
problem Generating synthetic financial time series data accurately.
method Introduced a Wasserstein-type distance based on discrete-time randomised signatures.
result Demonstrated universal approximation for randomised signatures on continuous functions.
Reservoir subspace injection improves online ICA by preserving injected features.
problem Discarding injected features in top-n whitening can degrade performance. method Formalized reservoir subspace injection (RSI) and developed diagnostics (IER, SSO, ρ_x) to identify and mitigate the failure mode.
result RSI controller preserves passthrough retention, improving performance by up to 2.2 dB.
SpaRCe optimizes reservoir computing by learning neuron thresholds to improve performance and prevent forgetting.
problem Improving performance and preventing forgetting in reservoir computing networks.
method Integrates neuron-specific learnable thresholds to optimize sparsity without altering dynamics, learning read-out weights and thresholds via gradient rule.
result Threshold learning improves performance and alleviates catastrophic forgetting.