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,291 papers · 148 categories

Trend · papers per month

128255383510 · Jun 202019922001200920182026
48 results for recurrent analysis

Unified recurrent networks reveal differences in complexity levels of grammars.

problem Understanding the complexity and behavior of recurrent networks.
method Connecting recurrent networks with deterministic finite automata and formal grammars.
result Unified recurrent networks improve performance and match grammars from different complexity levels.

Bayesian sparsification reduces memory usage in RNNs without significant loss of accuracy.

problem High memory usage in RNNs for text analysis tasks.
method Apply Sparse Variational Dropout and Binary Variational Dropout to sparsify RNNs.
result Achieve 99.5% sparsity on sentiment analysis with no quality drop and up to 87% on language modeling with slight loss of accuracy.

Enhanced speech emotion recognition using nonlinear recurrence dynamics.

problem Improving speech emotion recognition accuracy.
method Phase space reconstruction, Recurrence Plot, Recurrence Quantification Analysis, statistical functionals, feature fusion, Bidirectional Recurrent Neural Network.
result State-of-the-art performance on IEMOCAP with up to 10.7% improvement in accuracy.

We study the statistical properties of the recurrence intervals ττ between successive trading volumes exceeding a certain threshold qq. The recurrence interval analysis is carried out for the 20 liquid Chinese stocks covering a period from January 2000 to May 2009, and two Chinese indices from January 2003 to April 2…

2010-02-06abs ↗pdf ↗

Recurrence Plot (RP) and Recurrence Quantification Analysis RQA) are signal numerical analysis methodologies able to work with non linear dynamical systems and non stationarity. Moreover they well evidence changes in the states of a dynamical system. It is shown that RP and RQA detect the critical regime in financial i…

2005-05-24abs ↗pdf ↗

Study compares LSTM, Transformer, and Mamba for bladder cancer recurrence analysis.

problem Complex time-dependent data in bladder cancer recurrence analysis.
method Evaluation of LSTM, Transformer, and Mamba models using Cox proportional hazards model.
result LSTM-Cox model outperforms Transformer-Cox and Mamba-Cox models in prediction accuracy.

Improved sentiment analysis explanations using LRP for RNNs.

problem Creating understandable explanations for recurrent neural network predictions.
method Extending Layer-wise Relevance Propagation (LRP) to recurrent neural networks (RNNs), specifically to multiplicative connections in LSTMs and GRUs.
result Better explanation quality for sentiment analysis tasks using LRP compared to gradient-based methods.

New approach predicts stock price synchronization using RNNs and LSTMs.

problem Forecasting synchronization of stock prices in the Indian market.
method Utilizing recurrence plots and CRQA for non-linear analysis, RNNs and LSTMs for prediction.
result Accuracy of 0.98 and F1 score of 0.83 in predicting stock price synchronization.

Two new methods improve forecasting of functional time series data.

problem Forecasting of functional time-dependent data.
method Functional Singular Spectrum Analysis (FSFA) based forecasting methods.
result Our methods outperform existing algorithms for periodic stochastic processes.

Gradient descent optimally trains RNNs without overparameterization.

problem Training recurrent neural networks (RNNs) with gradient descent.
method Nonasymptotic analysis of gradient descent for RNNs with diagonal weight matrices.
result Gradient descent can achieve optimality in RNNs with a network size scaling logarithmically with the number of samples.

Improved stable RNNs trained faster with less expressibility trade-off.

problem Stable recurrent neural networks are hard to train without sacrificing expressibility.
method Implicit model structure with contraction analysis for stable models.
result Significant increase in training speed and model performance.

Used to investigate the presence of distinctive recurrent behaviours in natural processes, the recurrence plots can be applied to the analysis of economic data, and, in particular, to the characterization of exchange rates of currencies too. In this paper, we will show that these plots are able to characterize the peri…

2014-07-27abs ↗pdf ↗

Study predicts colorectal polyp recurrence using medical records and statistical models.

problem Identifying patient characteristics influencing colorectal polyp recurrence.
method Natural language processing for extracting polyp characteristics, Kaplan-Meier curves, Cox proportional hazards modeling, random survival forest models.
result Polyp size, number, location, and patient smoking status significantly influence recurrence risk.

Paper proposes RMFN for multimodal language analysis.

problem Modeling interactions between language, visual, and acoustic modalities.
method Recurrent Multistage Fusion Network (RMFN) decomposes fusion into stages focusing on subsets of multimodal signals.
result RMFN achieves state-of-the-art performance across multimodal sentiment analysis, emotion recognition, and speaker traits recognition datasets.

Analyzes dependencies in sequential datasets to improve deep neural architectures.

problem Improving deep recurrent neural architectures by understanding long distance dependencies.
method Detailed analysis of dependency decay curves in various datasets, testing factors affecting decay, generating synthesized datasets.
result Factors influencing dependency decay curves (number of unique symbols, dataset size, interacting symbols, distance between symbols) can inform optimal hyper-parameters.

New kernel-based models improve on traditional neural methods in sequence modeling.

problem Sequence modeling challenges in natural language processing and neuroscience.
method Kernel-based recurrent neural networks and convolutional neural networks.
result Kernel-based models perform on par or better than traditional neural methods.

Reverse engineered RNNs reveal line attractor dynamics for sentiment classification.

problem Understanding how recurrent neural networks solve sequential tasks like sentiment classification.
method Dynamical systems analysis to reverse engineer trained RNNs, identifying fixed points and linearized dynamics.
result Trained RNNs converge to low-dimensional line attractor dynamics, providing interpretable solutions.

Study predicts synchronization state of financial time series using cross-recurrence plots.

problem Predicting the state of synchronization of financial time series.
method Cross-correlation analysis and deep learning framework for predicting synchronization state based on cross-recurrence plots.
result Satisfactory performance in predicting synchronization state for certain pairs of stocks.

Simplified LSTM models improve sentiment analysis on Twitter debate data.

problem Performing sentiment analysis on long sequence data from Twitter debates.
method Developed six parameter-reduced LSTM models (slim LSTM) for faster training and reduced computational cost.
result Slim LSTM models outperform standard LSTM model in sentiment analysis of GOP Debate Twitter dataset.

RNN beats Lee-Carter in forecasting mortality rates.

problem Forecasting mortality rates across different demographics.
method Long Short-Term Memory (LSTM) recurrent neural network trained on multiple countries, ages, and sexes.
result RNN model outperforms the Lee-Carter model in mortality rate forecasting.

Develops a method for causal inference in recurrent event data with terminal failure.

problem Causal inference in recurrent event data with a terminal event.
method Multiply robust estimation framework for causal inference.
result Proposes an estimator for the expected number of recurrent events and failure survival function.

This paper analyzes the generalization risk of unrolled neural networks using Stein's Unbiased Risk Estimator.

problem Analyzing the generalization risk of unrolled neural networks and its relationship to network design and train sample size.
method Using Stein's Unbiased Risk Estimator (SURE), the paper analyzes the generalization risk with bias and variance components for recurrent unrolled networks, focusing on the degrees-of-freedom (DOF) component and the trace of the end-to-end network Jacobian.
result DOF is well-approximated by the weighted path sparsity of the network under incoherence conditions on the trained weights, and DOF increases with train sample size and converges to the generalization risk for both recurrent and non-recurrent schemes.

This work optimizes reservoir computing models by linking recurrence and non-linear dynamics.

problem Understanding how recurrence and non-linear dynamics in cortical networks contribute to their function.
method Transformed time-continuous, recurrent dynamics into an effective feed-forward structure of linear and non-linear temporal kernels.
result Optimal time-series classifiers can be built from random reservoir networks, demonstrating significant performance gains.

Algorithm discovers dynamic cell structures for better neural network performance.

problem Finding optimal neural network architectures for diverse data samples and time steps.
method Combines recurrent and recursive neural networks to dynamically search for customized cell structures.
result Achieves better prediction accuracy compared to existing models.

Stochastic models fail to outperform standard recurrent networks in sequence modeling.

problem Discrepancy in performance between stochastic and standard recurrent models in sequence modeling.
method Re-examine roles of latent variables, remove restriction on fully factorized output distribution, compare auto-regressive models.
result Standard recurrent models consistently outperform stochastic models in sequence modeling.

Generalizes PCA to maximize any convex function of components.

problem Finding a principal vector that maximizes a convex function of components.
method Gradient ascent algorithm for solving the generalized PCA problem; fixed points of neural networks for kernel version.
result Solutions can be obtained as fixed points of simple neural networks.

Optimal stock price prediction model using recurrent neural networks with RMSprop optimizer.

problem Stock price prediction using neural networks.
method Comparison of fully connected, convolutional, and recurrent architectures; inclusion of three optimization techniques.
result Single layer recurrent neural network with RMSprop optimizer produces optimal results with validation and test MAE of 0.0150 and 0.0148 respectively.

Proves local convergence of various online and recurrent optimization algorithms.

problem Proves local convergence of online and recurrent optimization algorithms not covered by standard stochastic gradient descent theory.
method Uses a general set of assumptions for learning dynamical systems online, adopting an 'ergodic' viewpoint.
result Local convergence results for online and recurrent optimization algorithms, including RMSProp, NoBackTrack, UORO, Adam, and RTRL.

New analysis explains pathology of deep Gaussian processes.

problem Pathology of deep Gaussian processes reduces learning capacities with increased layers.
method Study nonlinear dynamic systems corresponding to DGPs, derive recurrence relations.
result Provide tighter bounds and rate of convergence for dynamic systems.

TransformerLSR models longitudinal, recurrent, and survival data jointly.

problem Joint modeling of longitudinal measurements, recurrent events, and survival data with dependencies.
method Transformer-based deep learning framework integrating deep temporal point processes and latent structure representation.
result TransformerLSR effectively models all three components simultaneously, demonstrating necessity and effectiveness through simulations and real-world data.

The recurrence interval of extreme returns can be predicted with high accuracy.

problem Predicting the occurrence of extreme financial returns.
method Recurrence interval analysis of extreme returns, using qq-exponential distribution.
result The recurrence interval of extreme returns follows a qq-exponential distribution, leading to more accurate forecasts.

Analyzes self-attention in recurrent networks, proving it mitigates vanishing gradients.

problem Vanishing gradients in recurrent networks when capturing long-term dependencies.
method Formal analysis of self-attention's effect on gradient propagation, proposing a relevancy screening mechanism.
result Self-attention mitigates vanishing gradients in recurrent networks, providing guarantees.