The pullback approach to global Finsler geometry is adopted. Three classes of recurrence in Finsler geometry are introduced and investigated: simple recurrence, Ricci recurrence and concircular recurrence. Each of these classes consists of four types of recurrence. The interrelationships between the different types of …
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,695 papers · 148 categories
Trend · papers per month
48 results for “recurrence”
Study on biharmonic hypersurfaces with specific recurrent operators in Euclidean space.
problem Characterizing biharmonic hypersurfaces with recurrent operators.
method Analysis of various recurrent operators and their impact on biharmonic hypersurfaces.
result Some well-known recurrent operators play a significant role in making biharmonic hypersurfaces minimal.
The aim of the present paper is to investigate new types of recurrence in Finsler geometry, namely, hyper-generalized recurrence and generalized conharmonic recurrence. The properties of such recurrences and their relations to other Finsler recurrences are studied.
To generalize the notion of recurrent manifold, there are various recurrent like conditions in the literature. In this paper we present a recurrent like structure, namely, \textit{super generalized recurrent manifold}, which generalizes both the hyper generalized recurrent manifold and weakly generalized recurrent mani…
Two special Finsler spaces have been introduced and investigated, namely -recurrent Finsler space and consircularly recurrent Finsler space. The defining properties of these spaces are formulated in terms of the first curvature tensor of Cartan connection. The following three results constitute the main object of …
The object of the present paper is to obtain the characterization of a warped product semi-Riemannian manifold with a special type of recurrent like structure, called super generalized recurrent. As consequence of this result we also find out the necessary and sufficient conditions for a warped product manifold to sati…
The present paper deals with the proper existence of a generalized class of recurrent manifolds, namely, hyper-generalized recurrent manifolds. We have established the proper existence of various generalized notions of recurrent manifolds. For this purpose we have presented a metric and computed its curvature propertie…
We show that in dimension n>3 the class of simple conformally recurrent space-times coincides with the class of conformally recurrent pp-waves.
Interneurons accelerate learning dynamics in recurrent neural networks for statistical adaptationq-bio.NC
Interneurons improve learning in neural networks by accelerating convergence.
problem Rapid adaptation to changing input statistics in neural networks.
method Two mathematically tractable recurrent linear neural networks were compared: one with direct recurrent connections and the other with interneurons that mediate recurrent communication.
result The network with interneurons converges more quickly than the network with direct recurrent connections, scaling logarithmically with initialization spectrum.
It is proved that every concircularly recurrent manifold must be necessarily a recurrent manifold.
In this paper we adopt the pullback approach to global Finsler geometry. We investigate horizontally recurrent Finsler connections. We prove that for each scalar ()1-form , there exists a unique horizontally recurrent Finsler connection whose -recurrence form is . This result generalizes the existence and u…
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.
Stability is a fundamental property of dynamical systems, yet to this date it has had little bearing on the practice of recurrent neural networks. In this work, we conduct a thorough investigation of stable recurrent models. Theoretically, we prove stable recurrent neural networks are well approximated by feed-forward …
Lipschitz RNNs improve stability and performance in various tasks.
problem Improving stability and performance of RNNs.
method Introduced a Lipschitz recurrent unit with a linear and Lipschitz nonlinear component for stability analysis.
result Lipschitz RNNs outperform existing units on benchmark tasks.
Identifying patient characteristics that influence the rate of colorectal polyp recurrence can provide important insights into which patients are at higher risk for recurrence. We used natural language processing to extract polyp morphological characteristics from 953 polyp-presenting patients' electronic medical recor…
We propose an approach that connects recurrent networks with different orders of hidden interaction with regular grammars of different levels of complexity. We argue that the correspondence between recurrent networks and formal computational models gives understanding to the analysis of the complicated behaviors of rec…
Bayesian units improve speech recognition with minimal parameters.
problem Improving speech recognition models with fewer parameters.
method Derived Bayesian recurrent units integrated into deep learning frameworks.
result Adding Bayesian units improves speech recognition performance.
Several variants of recurrent neural networks (RNNs) with orthogonal or unitary recurrent matrices have recently been developed to mitigate the vanishing/exploding gradient problem and to model long-term dependencies of sequences. However, with the eigenvalues of the recurrent matrix on the unit circle, the recurrent s…
In this paper, we prove that evry 3-dimensional manifold M is a ?- recurrent N(k)-contact metric manifold if and only if it is flat. Then we classify the ?-recurrent contact metric manifolds of constant curvature. This implies that there exists no ?-recurrent N(k)-contact metric manifold, which is neither symmetric nor…
Improved GRU model with weighted time-delay feedback for long-term dependencies.
problem Modeling long-term dependencies in sequential data.
method Introducing a gated recurrent unit (GRU) with a weighted time-delay feedback mechanism.
result τ-GRU outperforms state-of-the-art models on various tasks.
Classification of specific pseudo-Riemannian manifolds.
problem Classifying conformally flat generalized Ricci recurrent pseudo-Riemannian manifolds.
method Complete classification through mathematical analysis.
result Conformally flat generalized Ricci recurrent pseudo-Riemannian manifolds are either de Sitter or anti-de Sitter spacetimes.
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 paper introduces and analyzes pseudo generalized Ricci-recurrent spacetimes in modified gravity.
problem Characterizing and analyzing pseudo generalized Ricci-recurrent spacetimes in modified gravity.
method Introducing and characterizing pseudo generalized Ricci-recurrent spacetimes, proving their properties, and studying their impact under modified gravity scenarios.
result Pseudo generalized Ricci-recurrent spacetimes represent specific spacetime types under modified gravity scenarios.
Energy markets and the associated energy futures markets play a crucial role in global economies. We investigate the statistical properties of the recurrence intervals of daily volatility time series of four NYMEX energy futures, which are defined as the waiting times between consecutive volatilities exceeding a gi…
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.
In this paper, we show that there is no phi-recurrent Sasakian manifold. Then we prove that the only flat 3-dimensional manifolds are phi-recurrent (k, m)-contact metric manifolds.
Causal inference for the expected number of recurrent events in the presence of a terminal eventstat.ME
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.
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…
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.
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.
The architecture of Transformer is based entirely on self-attention, and has been shown to outperform models that employ recurrence on sequence transduction tasks such as machine translation. The superior performance of Transformer has been attributed to propagating signals over shorter distances, between positions in …
Ultra-low latency recurrent neural network inference on FPGAs for physics applications with hls4mlcs.LG
Paper presents FPGA implementation for efficient recurrent neural networks.
problem Implementing recurrent neural networks on FPGAs for low latency.
method Developed hls4ml framework to implement LSTM and GRU layers.
result Demonstrated effective designs for both small and large models.
New framework shows -simplicity for groups without certain subalgebras.
problem Characterizing -simplicity of groups.
method Introducing confined subalgebras and Uniformly Recurrent States.
result A countable discrete group is -simple if it has no non-trivial amenable confined subalgebras.
The article introduces pseudo generalized Ricci-recurrent spacetimes and their applications in modified gravity.
problem Characterizing and understanding pseudo generalized Ricci-recurrent spacetimes.
method Introduced and characterized pseudo generalized Ricci-recurrent spacetimes, provided examples, and studied their implications in modified gravity.
result Pseudo generalized Ricci-recurrent spacetimes represent perfect fluid spacetimes and can model dark energy epochs or static spacetimes.
SnAp approximates RTRL for online training of sparse recurrent networks.
problem Training large sparse recurrent networks online is computationally expensive.
method Sparse n-step Approximation (SnAp) of the RTRL influence matrix.
result SnAp with n=2 remains tractable for highly sparse networks and outperforms backpropagation through time.
Conformally recurrent pseudo-Riemannian manifolds of dimension n>4 are investigated. The Weyl tensor is represented as a Kulkarni-Nomizu product. If the square of the Weyl tensor is nonzero, a covariantly constant symmetric tensor is constructed, that is quadratic in the Weyl tensor. Then, by Grycak's theorem, the expl…
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…
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…
The paper explores properties of affine Szabó manifolds and their metrics.
problem Understanding the properties and metrics of affine Szabó manifolds.
method Analyzes the properties of affine Szabó manifolds and their metrics, proving necessary and sufficient conditions.
result Affine Szabó manifolds have specific properties regarding their Ricci tensor and recurrence covector.
We investigate the probability distributions of the recurrence intervals between consecutive 1-min returns above a positive threshold or below a negative threshold of two indices and 20 individual stocks in China's stock market. The distributions of recurrence intervals for positive and negative thresho…
Paper proposes a faster RAE with sequence-aware encoding.
problem Training recurrent autoencoders is challenging and time-consuming.
method Introduces a recurrent autoencoder with sequence-aware encoding using 1D convolutional layers.
result The proposed autoencoder trains faster than standard RAE.
Recurrent Neural Networks (RNNs) are designed to handle sequential data but suffer from vanishing or exploding gradients. Recent work on Unitary Recurrent Neural Networks (uRNNs) have been used to address this issue and in some cases, exceed the capabilities of Long Short-Term Memory networks (LSTMs). We propose a simp…
In this paper, we introduce Channel-wise recurrent convolutional neural networks (RecNets), a family of novel, compact neural network architectures for computer vision tasks inspired by recurrent neural networks (RNNs). RecNets build upon Channel-wise recurrent convolutional (CRC) layers, a novel type of convolutional …
We study the statistical properties of the recurrence intervals between successive trading volumes exceeding a certain threshold . 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…
Study analyzes stock market dynamics using recurrence measures and transitions.
problem Understanding transitions in stock market dynamics during crises.
method Recurrence plots and networks from nonstationary stock market data.
result Recurrence measures capture transitions in stock market dynamics.
We begin by reiterating that common neural network activation functions have simple Bayesian origins. In this spirit, we go on to show that Bayes's theorem also implies a simple recurrence relation; this leads to a Bayesian recurrent unit with a prescribed feedback formulation. We show that introduction of a context in…
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.
This work combines recurrent models with diffusion for probabilistic time series forecasting.
problem Scalability and capturing high-dimensional distributions and cross-feature dependencies in time series forecasting.
method Combines recurrent neural networks' efficiency with diffusion models' probabilistic modeling, using stochastic interpolants and conditional generation.
result Offers scalable probabilistic time series forecasting methods.