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.

168,742 papers · 148 categories

Trend · papers per month

2.4%4.9%7.3%9.7% · Jun 201219922001200920172026
48 results for Bayesian RNNs

RNN-HAR model improves VaR forecasting with long-memory and non-linear dynamics.

problem Efficiently forecasting Value at Risk (VaR) with long-memory and non-linear realized volatility.
method Loss-based generalized Bayesian inference with Sequential Monte Carlo for model estimation and prediction.
result RNN-HAR model consistently outperforms other VaR forecasting models.

Improved neural network predicts tropical storm trajectories and Bayesian intervals.

problem Accurately predicting the trajectories of tropical storms to prevent damage.
method Developed an improved RNN model with dropout to predict Bayesian intervals.
result Neural network dropout values significantly affect prediction accuracy and intervals.

In natural language processing, a lot of the tasks are successfully solved with recurrent neural networks, but such models have a huge number of parameters. The majority of these parameters are often concentrated in the embedding layer, which size grows proportionally to the vocabulary length. We propose a Bayesian spa…

2018-10-25abs ↗pdf ↗

In this work we explore a straightforward variational Bayes scheme for Recurrent Neural Networks. Firstly, we show that a simple adaptation of truncated backpropagation through time can yield good quality uncertainty estimates and superior regularisation at only a small extra computational cost during training, also re…

2017-04-10abs ↗pdf ↗

Frequentist method estimates uncertainty in RNNs without altering architecture.

problem Uncertainty quantification in RNNs for decision-making.
method Jackknife resampling and influence functions to estimate variability.
result The method provides theoretical coverage guarantees on uncertainty intervals.

Bayesian model predicts sequences better than LSTMs by identifying underlying rules.

problem Current RNNs struggle to generalize from limited training data and identify underlying rules in sequences.
method Bayesian model that learns underlying concepts from sequences and generalizes to new data.
result Bayesian model predicts sequences better than traditional LSTMs.

In medicine, both ethical and monetary costs of incorrect predictions can be significant, and the complexity of the problems often necessitates increasingly complex models. Recent work has shown that changing just the random seed is enough for otherwise well-tuned deep neural networks to vary in their individual predic…

2019-06-10abs ↗pdf ↗

Proposes ECLSTM for more accurate RUL estimation from time series data.

problem Predicting Remaining Useful Life (RUL) from multivariate time series data.
method Embedded Convolutional LSTM (ECLSTM) with automated hyperparameter optimization.
result ECLSTM outperforms state-of-the-art approaches on benchmark data sets.

We define Recurrent Gaussian Processes (RGP) models, a general family of Bayesian nonparametric models with recurrent GP priors which are able to learn dynamical patterns from sequential data. Similar to Recurrent Neural Networks (RNNs), RGPs can have different formulations for their internal states, distinct inference…

2015-11-20abs ↗pdf ↗

NAS for financial time series forecasts using chain-structured architectures.

problem Optimizing neural architectures for financial time series forecasting.
method Comparison of three NAS strategies (Bayesian optimization, hyperband, reinforcement learning) on chain-structured search spaces for simple and complex architectures.
result Bayesian optimization and hyperband outperform other strategies, and RNN and 1D CNN perform best among architectures.

Exponentially smoothed RNNs improve industrial forecasting.

problem Complexity and non-stationarity in industrial time series data.
method Exponential smoothed recurrent neural networks (RNNs) for modeling non-linear dynamics.
result Exponentially smoothed RNNs outperform traditional models in multi-step forecasting.

In this paper, we explore different ways to extend a recurrent neural network (RNN) to a \textit{deep} RNN. We start by arguing that the concept of depth in an RNN is not as clear as it is in feedforward neural networks. By carefully analyzing and understanding the architecture of an RNN, however, we find three points …

2013-12-20abs ↗pdf ↗

Lyapunov analysis improves RNN performance prediction.

problem Uncertainty in RNN performance prediction due to hyperparameters and architecture.
method Lyapunov spectral analysis of RNNs and Autoencoder-Lyapunov Embedding Learning (AeLLE).
result AeLLE successfully correlates RNN Lyapunov spectrum with accuracy and predicts performance.

Recurrent neural networks (RNNs) have been extraordinarily successful for prediction with sequential data. To tackle highly variable and noisy real-world data, we introduce Particle Filter Recurrent Neural Networks (PF-RNNs), a new RNN family that explicitly models uncertainty in its internal structure: while an RNN re…

2019-05-30abs ↗pdf ↗

In this work, we propose a novel recurrent neural network (RNN) architecture. The proposed RNN, gated-feedback RNN (GF-RNN), extends the existing approach of stacking multiple recurrent layers by allowing and controlling signals flowing from upper recurrent layers to lower layers using a global gating unit for each pai…

2015-02-09abs ↗pdf ↗

RNNs struggle with in-context retrieval, while Transformers excel.

problem In-context retrieval capability of RNNs.
method Theoretical analysis and experimental techniques (CoT, RAG, Transformer layer).
result Enhancing RNNs with techniques improves their in-context retrieval capability, closing the representation gap with Transformers.

Time series with non-uniform intervals occur in many applications, and are difficult to model using standard recurrent neural networks (RNNs). We generalize RNNs to have continuous-time hidden dynamics defined by ordinary differential equations (ODEs), a model we call ODE-RNNs. Furthermore, we use ODE-RNNs to replace t…

2019-07-08abs ↗pdf ↗

To understand the fundamental trade-offs between training stability, temporal dynamics and architectural complexity of recurrent neural networks~(RNNs), we directly analyze RNN architectures using numerical methods of ordinary differential equations~(ODEs). We define a general family of RNNs--the ODERNNs--by relating t…

2019-04-29abs ↗pdf ↗

Recurrent Neural Networks (RNNs) have long been recognized for their potential to model complex time series. However, it remains to be determined what optimization techniques and recurrent architectures can be used to best realize this potential. The experiments presented take a deep look into Hessian free optimization…

2015-10-16abs ↗pdf ↗

Study proves deep narrow RNNs can approximate any function, with minimum width independent of data length.

problem Proving universality of deep narrow RNNs with bounded widths.
method Analyzing RNNs as dynamical systems, proving universality for deep narrow structures with specific widths.
result Minimum width for universality of deep narrow RNNs is independent of data length.

Hamiltonian RNN controls hidden states gradient for long-term dependencies.

problem Challenges in learning long-term dependencies in RNNs.
method Symplectic discretization of Hamiltonian system to control gradient.
result Hamiltonian RNN outperforms other RNNs without hyperparameter optimization.

RNNs struggle with chaotic dynamics due to exploding gradients, but we found a way to optimize training.

problem Challenging training of RNNs with chaotic dynamics due to exploding gradients.
method Relating loss gradients to Lyapunov spectrum to optimize training on chaotic data.
result RNNs with chaotic dynamics always have diverging gradients, while stable ones have bounded gradients.

Recurrent Neural Networks (RNNs), which are a powerful scheme for modeling temporal and sequential data need to capture long-term dependencies on datasets and represent them in hidden layers with a powerful model to capture more information from inputs. For modeling long-term dependencies in a dataset, the gating mecha…

2017-06-07abs ↗pdf ↗

Study shows challenges in converting RNNs to FSMs due to computational complexity.

problem Understanding the equivalence and distance between RNNs and FSMs.
method Computational proofs for equivalence and distance problems between RNNs and FSMs.
result Undecidability and hardness of approximation problems between RNNs and FSMs.

Recurrent neural networks (RNNs) are powerful models of sequential data. They have been successfully used in domains such as text and speech. However, RNNs are susceptible to overfitting; regularization is important. In this paper we develop Noisin, a new method for regularizing RNNs. Noisin injects random noise into t…

2018-05-03abs ↗pdf ↗

Mathematical methods characterize RNNs' asymptotics as hidden units and data grow.

problem Characterize recurrent neural networks' behavior as hidden units and data grow.
method Developed mathematical methods to analyze RNNs' convergence to an infinite-dimensional ODE coupled with a fixed point of a random algebraic equation.
result RNNs converge to an infinite-dimensional ODE coupled with a fixed point of a random algebraic equation.