Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,181 papers · 148 categories

Trend · papers per month

138276414552 · Jun 202019922001200920182026
48 results for reservoir distribution

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.

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.

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.

Proposes a method to propagate uncertainty through tanh activation in reservoir computing.

problem Computing output distribution for neural networks with tanh activation when given a probability distribution.
method Moment-based approach to propagate uncertainty through Echo State Network (ESN).
result Probabilistic Echo State Network (PESN) shows better performance than deterministic ESNs.

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.

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.

DeepFlow uses deep generative models to solve history matching problems.

problem Calibrating reservoir models with transient fluid data.
method Generative adversarial network for property distribution, gradient descent on latent variables, and additional well constraints.
result Solves history matching problems for synthetic reservoir models.

The paper tackles infinite-armed bandits with general reservoirs, providing necessary and sufficient conditions for ε-good arm selection.

problem Characterizing conditions for selecting ε-good arms with high probability in infinite-armed bandits.
method The approach is based on successive halving with early discarding of arms after a single pull, analyzing the reservoir distribution without assuming its form.
result The algorithm provably returns an ε-good arm with high probability, explaining the effectiveness of Hyperband's aggressive bracketing.

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.

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.

This paper proposes a new method to quantify uncertainty in reservoir characterization using invertible neural networks.

problem Quantifying uncertainty in reservoir characterization models.
method Training an invertible neural network to represent the posterior distribution of model parameters.
result The proposed method provides a more efficient and direct way to sample from the posterior distribution.

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.

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.

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.

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.

This research tackles imbalanced continual learning with a new sampling strategy.

problem Long-tailed distribution in multi-label datasets.
method Partitioning Reservoir Sampling (PRS) for balanced knowledge of head and tail classes.
result The proposed PRS strategy maintains a balanced knowledge of both head and tail classes.

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.

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.

Reservoir computing minimizes prediction error in a spectral radius interval.

problem Lack of guiding principles for neural network parameters.
method Model-free prediction of spatiotemporal dynamical systems using recurrent neural networks.
result A spectral radius interval minimizes prediction error for nonlinear dynamical systems.

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.

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.

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.

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.

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.

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.

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.

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.

Reservoir subspace injection improves online ICA by preserving injected features.

problem Discarding injected features in top-nn 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.

Reservoir Computing (RC) refers to a Recurrent Neural Networks (RNNs) framework, frequently used for sequence learning and time series prediction. The RC system consists of a random fixed-weight RNN (the input-hidden reservoir layer) and a classifier (the hidden-output readout layer). Here we focus on the sequence lear…

2017-06-24abs ↗pdf ↗