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.
New method for identifying nearly-optimal arms in bandit models with fixed confidence.
problem Near-optimal arm identification in infinitely armed bandit models with limited prior knowledge.
method PAC-like framework, sample complexity lower bound, algorithm with upper bound on sample complexity.
result Proposed algorithm identifies nearly-optimal arm with high probability and within log factor of lower bound.
The paper tackles a bandit problem with infinitely many arms per group, aiming to identify the group with the highest quantile reward.
problem Max-quantile group bandit problem with infinitely many arms per group.
method Two-step algorithm: first request arms from each group, then apply a finite-arm max-quantile bandit algorithm.
result Characterization of instance-dependent and worst-case regret, with matching lower bounds.
New method tracks shifts in infinite-armed bandits without prior knowledge.
problem Tracking shifts in non-stationary infinite-armed bandits.
method Blackbox conversion of finite-armed MAB to infinite-armed non-stationary, randomized elimination.
result First parameter-free optimal regret bounds for all reservoir regularity regimes.
New reservoir computing approach handles infinite-dimensional systems.
problem Approximating and generalizing complex input/output systems.
method Randomly generated echo state networks with neural networks.
result Proves universal approximation properties for new class of systems.
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.
Infinite arms bandit problem solved with confidence bounds.
problem Optimizing allocation in an infinite arms bandit problem with bounded rewards.
method Constructs confidence bounds for each arm and compares them against a target value to determine sampling.
result Achieves optimality for rewards with bounded means.
Unified meta algorithms estimate various distribution functionals in infinite-armed bandits.
problem Estimating various distribution functionals in infinite-armed bandits.
method Unified meta algorithms for offline and online settings, achieving optimal sample complexities.
result Online estimation offers significant advantage for certain distribution functionals.
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.
We consider a stochastic bandit problem with infinitely many arms. In this setting, the learner has no chance of trying all the arms even once and has to dedicate its limited number of samples only to a certain number of arms. All previous algorithms for this setting were designed for minimizing the cumulative regret o…
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.
Optimal algorithm for selecting high-quality arms from infinite bandit arms.
problem Efficiently choosing the best arm from an infinite set of options.
method Developed algorithms for both fixed confidence and fixed budget settings, achieving optimal or near-optimal sample complexities.
result Optimal sample complexity results for both fixed confidence and fixed budget settings, resolving open questions in the field.
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.
New algorithm reduces regret in infinitely many-armed bandits with decreasing rewards.
problem Infinitely many-armed bandits with rotting rewards.
method UCB index and adaptive threshold for unknown rotting rate, UCB index alone for known rotting rate.
result Matching upper bounds on regret achieved for different scenarios.
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.
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.
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.
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.
The paper optimizes identifying top k arms from a fraction of ρ arms in stochastic bandits.
problem Identifying k distinct arms among the top ρ fraction of arms in stochastic bandits with a PAC tolerance. method The paper considers two cases: known and unknown threshold of top arms' expected rewards. It proves lower bounds and proposes algorithms for each case, showing sample complexity optimality for two algorithms.
result Two algorithms are sample complexity optimal (up to constant factors) and the other two are optimal up to a log factor.
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.
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.
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.
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.
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.
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.
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.
The paper tackles linear bandits with projections, achieving optimal regret.
problem Learning the best arm in a linear bandit model with unobservable projection rewards.
method Developed strategies for both finite and infinite arms, achieving optimal regret bounds.
result Achieved optimal regret bounds for both finite and infinite arms.
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.
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…
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.
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.
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.
Framework combines random features with CDEs for efficient time-series learning.
problem Efficient training of time-series models with strong inductive bias.
method Random Fourier CDEs and Random Rough DEs using continuous-time reservoirs and log-ODE discretization.
result Unified perspective on random-feature reservoirs and path-signature theory.
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.
Study tackles infinitely many-armed bandits with rotting rewards, achieving tight regret bounds.
problem Infinitely many-armed bandits with rotting rewards.
method Adaptive sliding window UCB algorithm for slow and abrupt rotting scenarios.
result Achieves tight regret bounds for both slow and abrupt rotting scenarios.
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.
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 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.