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

13.4%26.8%40.3%53.7% · Jun 202019922001200920172026
48 results for recurrent data sampling

New algorithm guarantees optimal convergence rate for stochastic optimization.

problem Optimal convergence rate for stochastic optimization algorithms.
method Regularized versions of Minimization by Incremental Surrogate Optimization (MISO) with arbitrary recurrent data sampling.
result Expected optimality gap converges at O(n1/2)O(n^{-1/2}) under general recurrent sampling schemes.

Recurrent-DBN models dynamic relational data with interpretable latent structures.

problem Interpreting dynamic relational data with hidden structures.
method Recurrent Dirichlet Belief Network framework with hierarchical latent structures and efficient inference strategy.
result Recurrent-DBN discovers interpretable latent structures and improves link prediction.

In a recurrent setting, conventional approaches to neural architecture search find and fix a general model for all data samples and time steps. We propose a novel algorithm that can dynamically search for the structure of cells in a recurrent neural network model. Based on a combination of recurrent and recursive neura…

2019-05-25abs ↗pdf ↗

Transformers can outperform feedforward and recurrent networks due to dynamic sparsity.

problem Understanding when and why Transformers outperform other neural network architectures.
method Analyzing a sequence-to-sequence data generating model with dynamic sparsity, proving sample complexity differences between feedforward, recurrent, and Transformers.
result Transformers can learn dynamic sparsity models with lower sample complexity than feedforward and recurrent networks.

Unrolled neural networks emerged recently as an effective model for learning inverse maps appearing in image restoration tasks. However, their generalization risk (i.e., test mean-squared-error) and its link to network design and train sample size remains mysterious. Leveraging the Stein's Unbiased Risk Estimator (SURE…

2019-06-10abs ↗pdf ↗

New algorithm for robust circular coordinates in recurrent time series data.

problem Inefficient and sensitive methods for finding circular coordinates on recurrent data.
method Subsampling, aligning, and averaging to correct uneven sampling density.
result More robust and efficient circular coordinates for neuronal recordings.

Recurrent models can produce infinite sequences, causing bias; new methods prevent this.

problem Inconsistency in decoding infinite-length sequences from recurrent language models.
method Defined and proved inconsistency of common decoding algorithms; proposed remedies.
result Proposed methods prevent inconsistency in practice.

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.

Scalable verifier for recurrent neural networks using polyhedral abstractions.

problem Certifying the correctness of recurrent neural networks.
method Combining sampling, optimization, and Fermat's theorem for polyhedral abstractions; gradient descent for refinement.
result Successfully verified challenging recurrent models in various domains.

The verification problem for neural networks is verifying whether a neural network will suffer from adversarial samples, or approximating the maximal allowed scale of adversarial perturbation that can be endured. While most prior work contributes to verifying feed-forward networks, little has been explored for verifyin…

2018-11-14abs ↗pdf ↗

Survey on learning models for irregularly sampled time series data.

problem Challenges in learning from non-uniformly sampled time series data.
method Survey of recent models and architectures based on temporal discretization, interpolation, recurrence, attention, and structural invariance.
result Significant progress in machine learning for irregularly sampled time series data.

We propose a formulation for nonlinear recurrent models that includes simple parametric models of recurrent neural networks as a special case. The proposed formulation leads to a natural estimator in the form of a convex program. We provide a sample complexity for this estimator in the case of stable dynamics, where th…

2019-08-26abs ↗pdf ↗

In this paper we propose a model that combines the strengths of RNNs and SGVB: the Variational Recurrent Auto-Encoder (VRAE). Such a model can be used for efficient, large scale unsupervised learning on time series data, mapping the time series data to a latent vector representation. The model is generative, such that …

2014-12-20abs ↗pdf ↗

Method generates joint posterior samples of source and foreground mass distributions for gravitational lensing.

problem Challenging inference problem for high-resolution, high signal-to-noise ratio gravitational lensing.
method Combines diffusion-based generative modeling and recurrent inference machines.
result Can model realistic gravitational lensing simulations down to the noise level.

Study shows exponential gap in sample complexity between noisy and non-noisy recurrent neural networks.

problem Understanding the impact of noise on the sample complexity of recurrent neural networks.
method Analyzing noisy multi-layered sigmoid recurrent neural networks with independent noise and proving lower bounds.
result Exponential gap in sample complexity between noisy and non-noisy networks, even for small noise values.

Stochastic recurrent neural networks with latent random variables of complex dependency structures have shown to be more successful in modeling sequential data than deterministic deep models. However, the majority of existing methods have limited expressive power due to the Gaussian assumption of latent variables. In t…

2019-10-28abs ↗pdf ↗

This paper presents the recurrent estimation of distributions (RED) for modeling real-valued data in a semiparametric fashion. RED models make two novel uses of recurrent neural networks (RNNs) for density estimation of general real-valued data. First, RNNs are used to transform input covariates into a latent space to …

2017-05-30abs ↗pdf ↗

A semi-recurrent hybrid VAE-GAN model for generating sequential data is introduced. In order to consider the spatial correlation of the data in each frame of the generated sequence, CNNs are utilized in the encoder, generator, and discriminator. The subsequent frames are sampled from the latent distributions obtained b…

2018-06-01abs ↗pdf ↗

TriTPP models enable faster and more flexible event data modeling.

problem Inflexibility and slow sampling in traditional TPP models.
method Triangular Maps and Normalizing Flows for parallel sampling and likelihood computation.
result TriTPP models achieve orders of magnitude faster sampling while maintaining flexibility.

The Teacher Forcing algorithm trains recurrent networks by supplying observed sequence values as inputs during training and using the network's own one-step-ahead predictions to do multi-step sampling. We introduce the Professor Forcing algorithm, which uses adversarial domain adaptation to encourage the dynamics of th…

2016-10-27abs ↗pdf ↗

New RNN model handles long-term dependencies in irregularly-sampled time series.

problem Handling long-term dependencies in irregularly-sampled time series data.
method Designing ODE-LSTMs that separate memory from continuous-time state.
result ODE-LSTMs outperform other RNN-based models on non-uniformly sampled data with long-term dependencies.

This paper uses ODE to improve RNN models for time series data.

problem Improving RNN models for irregularly sampled time series data.
method Extending RNNs with Neural Ordinary Differential Equations (ODEs).
result New ODE-based RNN models reduce training and evaluation time.

Recurrent Neural Networks (RNNs) are among the most popular models in sequential data analysis. Yet, in the foundational PAC learning language, what concept class can it learn? Moreover, how can the same recurrent unit simultaneously learn functions from different input tokens to different output tokens, without affect…

2019-02-04abs ↗pdf ↗

A new approach learns to represent context for nonstationary bandits.

problem Nonstationary contextual bandits where patterns change over time.
method Combines recurrent neural networks with contextual linear bandit algorithm.
result Consistently outperforms handcrafted historical contexts and other methods.

This paper tackles data-efficient nonlinear control in Hamiltonian systems using symplectic geometry.

problem Data-efficient nonlinear control in Hamiltonian systems.
method Combines symplectic geometry, recurrence on energy level sets, and chain policies to solve target reachability problems.
result Data requirements depend on geometric and recurrence properties of the Hamiltonian, not the state dimension.

We analyze generalization in deep learning models using random matrix theory.

problem Understanding the generalization error in deep learning models with random feature representations.
method Applying Random Matrix Theory to derive asymptotic generalization error formulas for various architectures.
result Linear ESNs are equivalent to ridge regression with exponentially time-weighted input covariance, revealing an inductive bias towards recent inputs.

Develops a deep generative model for radar target recognition using HRRP data.

problem Automatic target recognition in radar systems using high-resolution range profiles.
method Recurrent gamma belief network (rGBN) with hybrid stochastic-gradient MCMC and variational inference.
result Efficient and accurate classification with interpretable latent structure.

Model predicts COVID-19 spread with better accuracy than existing methods.

problem Limited daily samples in time for data-driven methods.
method Integrated spatiotemporal model combining epidemic differential equations and RNN.
result Model outperforms existing methods in forecasting cases.

Study evaluates CL methods in RNNs, highlighting differences from feedforward networks.

problem Preventing catastrophic forgetting in RNNs processing sequential data.
method Comprehensive evaluation of CL methods, including elastic weight consolidation and hypernetworks.
result Weight-importance methods perform similarly regardless of sequence length but require more stability for high working memory demands.

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.

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.

RAN model recognizes multiple activities from unlabeled sensor data.

problem Handling weakly labeled multi-activity data from wearable sensors.
method Recurrent Attention Networks (RAN) for sequential multi-activity recognition and localization.
result RAN model can infer multiple activities and determine activity locations from unlabeled data.

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.

Leveraging advances in variational inference, we propose to enhance recurrent neural networks with latent variables, resulting in Stochastic Recurrent Networks (STORNs). The model i) can be trained with stochastic gradient methods, ii) allows structured and multi-modal conditionals at each time step, iii) features a re…

2014-11-27abs ↗pdf ↗