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

81161242322 · Jun 202019922001200920172026
48 results for strong positive recurrence

The study examines entropy and pressure at infinity in negatively curved manifolds, linking them to strong positive recurrence.

problem Investigating strong positive recurrence in negatively curved manifolds.
method Defining and comparing entropy and pressure at infinity through different measures.
result Strong positive recurrence potentials admit finite Gibbs measures.

It is a known fact that training recurrent neural networks for tasks that have long term dependencies is challenging. One of the main reasons is the vanishing or exploding gradient problem, which prevents gradient information from propagating to early layers. In this paper we propose a simple recurrent architecture, th…

2018-03-17abs ↗pdf ↗

Linear recurrent networks explain reinforcement learning performance in partially observable settings.

problem Understanding why linear recurrent networks work in reinforcement learning with partial observability.
method Constructed and studied two linear filters for HMMs and action-controlled HMMs.
result Linear filters serve as sufficient statistics and reduce state ambiguity, explaining empirical reinforcement learning success.

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.

In this work, we present the Grounded Recurrent Neural Network (GRNN), a recurrent neural network architecture for multi-label prediction which explicitly ties labels to specific dimensions of the recurrent hidden state (we call this process "grounding"). The approach is particularly well-suited for extracting large nu…

2017-05-23abs ↗pdf ↗

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.

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.

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.

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 ↗

mGRN improves multivariate time series prediction by managing marginal and joint memories.

problem Extracting dependencies in multivariate sequential data with strong serial and cross-sectional dependencies.
method Developed a novel recurrent network architecture, Memory-Gated Recurrent Networks (mGRN), with gates for marginal and joint memories.
result mGRN consistently outperforms state-of-the-art architectures on various public datasets.

ManifoldFlow relaxes fixed-spectrum Stiefel layers to learn a positive spectrum.

problem Fixed-spectrum Stiefel layers impose rigid spectral constraints.
method Introduces ManifoldFlow, a relaxation that learns a positive spectrum while keeping the basis on the Stiefel manifold.
result Learnable SPD spectrum improves performance in various settings.

This paper proposes recurrent neuron networks (RNNs) for a fingerprinting indoor localization using WiFi. Instead of locating user's position one at a time as in the cases of conventional algorithms, our RNN solution aims at trajectory positioning and takes into account the relation among the received signal strength i…

2019-03-27abs ↗pdf ↗

Paper forecasts financial trading durations using a new point process model.

problem Forecasting limit order book durations in high-frequency financial data.
method Self-exciting flexible residual point process incorporating empirical distributional features.
result The model achieves strong predictive performance compared to alternative approaches.

This study uses neural networks to approximate Bayesian filtering problems.

problem Estimating latent time-series signal statistics from observation sequences.
method Formulated a generic recurrent neural network framework to learn recursive mappings directly.
result Approximation error bounds for filtering in non-compact domains and strong time-uniform bounds.

We discuss relations among various positivities of knots and links, such as strong quasipositivity and quasipositivity. We give several pieces of supporting evidence for conjectural statements concerning these positivities and the defect of Bennequin inequality. Finally, we determine strong quasipositivity and quasipos…

2018-09-28abs ↗pdf ↗

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.

Recurrent neural networks (RNNs) are powerful architectures to model sequential data, due to their capability to learn short and long-term dependencies between the basic elements of a sequence. Nonetheless, popular tasks such as speech or images recognition, involve multi-dimensional input features that are characteriz…

2018-06-12abs ↗pdf ↗

Acoustic scenes are rich and redundant in their content. In this work, we present a spatio-temporal attention pooling layer coupled with a convolutional recurrent neural network to learn from patterns that are discriminative while suppressing those that are irrelevant for acoustic scene classification. The convolutiona…

2019-04-06abs ↗pdf ↗

Modeling the distribution of natural images is challenging, partly because of strong statistical dependencies which can extend over hundreds of pixels. Recurrent neural networks have been successful in capturing long-range dependencies in a number of problems but only recently have found their way into generative image…

2015-06-10abs ↗pdf ↗

This paper proposes grid cells encode position via a conformal isometric embedding of 2D physical space.

problem Hexagonal grid firing patterns in grid cells.
method Learning a distance-preserving position embedding in neural space using a recurrent neural network.
result The conformal isometric embedding of 2D physical space into neural space explains hexagonal grid firing patterns.

Cascades of information-sharing are a primary mechanism by which content reaches its audience on social media, and an active line of research has studied how such cascades, which form as content is reshared from person to person, develop and subside. In this paper, we perform a large-scale analysis of cascades on Faceb…

2016-02-02abs ↗pdf ↗

We show that a properly immersed minimal hypersurface in M x R_+ equals some M x {c} when M is a complete, recurrent n-dimensional Riemannian manifold with bounded curvature. If on the other hand, M has nonnegative Ricci curvature with curvature bounded below, the same result holds for any positive entire minimal graph…

2012-06-15abs ↗pdf ↗

A simple baseline outperforms deep learning methods in transportation forecasting.

problem The importance of stationarity and recurrent patterns in transportation data.
method A naive baseline based on average weekly patterns and linear regression.
result The baseline method achieves comparable or better results than state-of-the-art deep learning approaches.

Recurrent neural network grammars (RNNG) are generative models of language which jointly model syntax and surface structure by incrementally generating a syntax tree and sentence in a top-down, left-to-right order. Supervised RNNGs achieve strong language modeling and parsing performance, but require an annotated corpu…

2019-04-07abs ↗pdf ↗

Study solves a mathematical problem related to elliptic Schroedinger-to-Neumann maps.

problem Solving a Cherrier-Escobar problem for elliptic Schroedinger-to-Neumann maps.
method Using algebraic topological argument of Bahri-Coron, assuming positive eigenvalue and Green function.
result Solvability of the extended problem under specified conditions.

Recurrent neural networks (RNNs) have been successfully used on a wide range of sequential data problems. A well known difficulty in using RNNs is the \textit{vanishing or exploding gradient} problem. Recently, there have been several different RNN architectures that try to mitigate this issue by maintaining an orthogo…

2018-11-09abs ↗pdf ↗

Extends NAS to learn both intra-cell and inter-cell architectures for language modeling.

problem Limited NAS systems restrict search to recurrent or convolutional cells.
method Designs a joint learning method to perform intra-cell and inter-cell NAS simultaneously.
result Significantly outperforms a strong baseline on PTB and WikiText data.

Traditional sequential multi-object attention models rely on a recurrent mechanism to infer object relations. We propose a relational extension (R-SQAIR) of one such attention model (SQAIR) by endowing it with a module with strong relational inductive bias that computes in parallel pairwise interactions between inferre…

2019-10-11abs ↗pdf ↗