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

Trend · papers per month

135270405540 · Jun 202019922001200920182026
48 results for recurrence quantification analysis

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.

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 ↗

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.

Quantification is a supervised learning task that consists in predicting, given a set of classes C and a set D of unlabelled items, the prevalence (or relative frequency) p(c|D) of each class c in C. Quantification can in principle be solved by classifying all the unlabelled items and counting how many of them have bee…

2018-09-04abs ↗pdf ↗

Proposes a new model for time-to-event prediction with uncertainty quantification.

problem Lack of uncertainty in time-to-event predictions using recurrent neural networks.
method Deep Kernel Accelerated Failure Time models combining RNN and sparse Gaussian Process.
result Model delivers better uncertainty estimates compared to related methods.

Proposes POPQORN to quantify robustness of RNNs, including LSTMs and GRUs.

problem Vulnerability to adversarial attacks in recurrent neural networks.
method Develops POPQORN, a general algorithm to quantify robustness of RNNs.
result Demonstrates effectiveness on different network architectures and shows insights from robustness quantification on individual steps.

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.

Recursive KalmanNet combines neural networks with Kalman filters for precise state estimation.

problem State estimation in systems with noisy measurements and non-Gaussian noise.
method Recursive KalmanNet uses a recurrent neural network to estimate states with consistent error covariance, optimizing for Gaussian negative log-likelihood.
result Recursive KalmanNet outperforms conventional Kalman filters and deep learning-based estimators in non-Gaussian noise conditions.

Sparse deep learning improves prediction uncertainty for time series data.

problem Uncertainty quantification for dependent data like time series.
method Sparse recurrent neural networks (RNNs) for time series data.
result Sparse deep learning can consistently estimate and predict time series data with correct uncertainty quantification.

This research assesses uncertainty quantification and sensitivity analysis for DTs in nuclear fuel performance.

problem Understanding the reliability and performance of advanced nuclear fuels using DTs.
method Introduces ML-based uncertainty quantification and sensitivity analysis methods applied to BISON fuel performance code.
result Demonstrates the effectiveness of DTs in multi-criteria decision-making for nuclear fuel performance.

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.

Paper develops formulas for shape derivatives in wave scattering.

problem Computing high order shape derivatives for wave scattering is challenging.
method Introduces elegant recurrence formulas using differential forms and Lie derivatives.
result Unified framework for computing high order shape perturbations in scattering problems.

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 ↗

DeepONet accelerates reliability analysis of stochastic nonlinear systems.

problem Time-dependent reliability analysis of systems with stochastic forcing.
method DeepONet, a novel operator network, learns function-to-function mappings.
result DeepONet efficiently and accurately predicts system responses.

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.

Recurrent neural networks show state-of-the-art results in many text analysis tasks but often require a lot of memory to store their weights. Recently proposed Sparse Variational Dropout eliminates the majority of the weights in a feed-forward neural network without significant loss of quality. We apply this technique …

2017-07-31abs ↗pdf ↗

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.

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.

The paper develops a neural network to predict wind speed from visual observations.

problem Accurate wind speed prediction for renewable energy and weather forecasting.
method Coupled Convolutional and Recurrent Neural Network architecture trained on visual flow-structure interactions.
result The model accurately predicts wind speeds with low error compared to cup anemometer measurements.

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.

The paper tackles inverse uncertainty quantification in neutron noise analysis.

problem Uncertainty in estimating material properties from noisy neutron correlation measurements.
method Surrogate models and inverse uncertainty quantification to account for measurement error and model bias.
result Improved prediction of neutron correlations and quantification of uncertainties.

Essential principal components simplify spectral analysis with minimal training data.

problem Accurate spectral quantification from complex mixtures.
method Identifying essential principal components and using molar extinction coefficients.
result Near one-to-one projection from principal components to mixture constituents.

The paper proposes a new method for modeling and quantifying uncertainty in multiple closed curves.

problem Modeling and uncertainty quantification of multiple closed curves.
method A multiple-output, multi-dimensional Gaussian process modeling framework.
result The proposed method provides meaningful uncertainty quantification for curve and shape-related tasks.

Generative models improve image reconstruction and uncertainty quantification.

problem Bayesian inverse problems, especially image reconstruction from noisy and incomplete data.
method Data-driven priors and computationally tractable posterior analysis.
result Efficient uncertainty quantification without retraining for different corruption types.

This paper tackles high-dimensional uncertainty quantification with semi-supervised learning.

problem High-dimensional uncertainty quantification due to the curse of dimensionality.
method Autoencoder for dimension reduction, DFN for mapping and reconstruction, GP for surrogate modeling, semi-supervised learning for accuracy.
result The framework effectively reduces uncertainty quantification and reliability analysis for high-dimensional problems.

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.

The estimation of class prevalence, i.e., the fraction of a population that belongs to a certain class, is a very useful tool in data analytics and learning, and finds applications in many domains such as sentiment analysis, epidemiology, etc. For example, in sentiment analysis, the objective is often not to estimate w…

2016-05-13abs ↗pdf ↗

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.

Geometry-aware KDE model improves multiclass quantification.

problem Accurately estimating class prevalence for label shift adaptation.
method Log-ratio representations and Aitchison geometry for compositional data, shrinkage regularization.
result Competitive with state-of-the-art quantifiers, often improving over standard KDE-based baselines.

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.

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.

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.