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

Trend · papers per month

18365371 · Jun 202019922001200920172026
48 results for recurrent parameterisation

New approach improves linear-time attention for language models.

problem Challenges of quadratic attention in long-sequence modelling, especially for discrete data.
method Reinterpreting linear attention through latent probabilistic graphical models, introducing asymmetric structure and recurrent parameterisation.
result Our model achieves competitive performance and outperforms existing linear attention variants on language modelling benchmarks.

Neural GARCH models financial time series with time-varying coefficients.

problem Modeling conditional heteroskedasticity in financial time series.
method Neural network adaptation of GARCH and BEKK models with time-varying coefficients parameterized by a recurrent neural network.
result Neural Students t model consistently outperforms other models on financial time series.

Wide neural networks with asymmetrical node scaling converge globally and learn features.

problem Global convergence and feature learning in over-parameterised shallow networks.
method Gradient-based optimisation of wide, shallow neural networks with asymmetrical node scaling.
result Gradient flow and gradient descent converge to a global minimum and learn features, unlike in the NTK parameterisation.

UNIPoint universally approximates point process intensities.

problem How to precisely describe the flexibility of point process models.
method Proof using Stone-Weierstrass Theorem, transfer functions, and recurrent neural networks.
result UNIPoint performs better than other models on synthetic and real-world datasets.

In this article we propose a generalisation of the recent work of Gatheral and Jacquier on explicit arbitrage-free parameterisations of implied volatility surfaces. We also discuss extensively the notion of arbitrage freeness and Roger Lee's moment formula using the recent analysis by Roper. We further exhibit an arbit…

2012-10-26abs ↗pdf ↗

Probabilistic programming has emerged as a powerful paradigm in statistics, applied science, and machine learning: by decoupling modelling from inference, it promises to allow modellers to directly reason about the processes generating data. However, the performance of inference algorithms can be dramatically affected …

2019-06-07abs ↗pdf ↗

Just as an explicit parameterisation of system dynamics by state, i.e., a choice of coordinates, can impede the identification of general structure, so it is too with an explicit parameterisation of system dynamics by control. However, such explicit and fixed parameterisation by control is commonplace in control theory…

2013-12-23abs ↗pdf ↗

Extends hyperparameter transfer across model sizes and modules, improving training speed.

problem Training stability and performance of large-scale models with optimal hyperparameters.
method Complete(d)^{(d)} Parameterisation, per-module hyperparameter optimisation and transfer.
result Hyperparameter transfer holds even in the per-module hyperparameter regime, improving training speed.

The Gaussian process state space model (GPSSM) is a non-linear dynamical system, where unknown transition and/or measurement mappings are described by GPs. Most research in GPSSMs has focussed on the state estimation problem, i.e., computing a posterior of the latent state given the model. However, the key challenge in…

2017-05-30abs ↗pdf ↗

Wide stochastic networks show Gaussian behavior and improve training with PAC-Bayesian methods.

problem Analyzing and training over-parameterised neural networks with large width.
method Establishing Gaussian behavior for a stochastic architecture, applying PAC-Bayesian training.
result PAC-Bayesian training on large but finite-width networks outperforms standard methods.

Study constant mean curvature tori in R^3 using spectral data and Whitham deformations.

problem Parameterize spectral data of constant mean curvature tori in R^3.
method Use Whitham deformations, blowups, and spectral data analysis.
result Prove the Wente family is parameterized by the bisector of the right angle.

PRZI traders adapt their quote-prices based on a strategy parameter s, affecting market dynamics.

problem Understanding the dynamics of continuous double auction markets with adaptive traders.
method Introduced a new zero-intelligence trader PRZI that uses a parameterised probability distribution to generate quote-prices. Used a stochastic hill-climber algorithm to adapt strategies based on market conditions.
result The co-evolutionary dynamics of PRZI traders can lead to rich and complex market behaviors, including periods of stability and change.

InfoNCE objective is equivalent to ELBO in RPM, linking to self-supervised learning.

problem Improving self-supervised learning methods by connecting them to variational inference.
method Recognizing RPM and showing InfoNCE as a simplified lower bound on MI, equal to ELBO in infinite sample limit.
result The actual InfoNCE objective is equal to the ELBO (up to a constant) in the infinite sample limit.

New kernel interprets 3D anisotropic data with rotations and improved predictions.

problem Capturing rotated anisotropy in 3D spatial fields.
method Introduces a Lie-algebraic kernel with three principal length-scales and an explicit rotation.
result Posterior recovers rotated anisotropy and improves prediction over axis-aligned kernels.

A new method for discrete data normalizing flows using latent transformations.

problem Challenges in parameterizing bijective transformations for discrete data.
method Predict a distribution over latent transformations to make the marginal likelihood differentiable.
result Discrete-data normalizing flows can be trained using gradient-based learning with unbiased score function estimation.

Automatically learns flexible symmetry constraints in neural networks using gradients.

problem Fixed hard constraints on neural network functions that cannot be adapted.
method Improves parameterisations of soft equivariance and optimizes marginal likelihood using differentiable Laplace approximations.
result Achieves equivalent or improved performance on image classification tasks compared to baselines with hard-coded symmetry.

Bayesian approach optimizes quantum circuits for noisy hardware.

problem Optimizing parameterized quantum circuits on noisy quantum hardware.
method Reformulate classical optimisation as Bayesian posterior, combining cost function and prior distribution. Apply dimension reduction and posterior sampling strategies.
result Bayesian approach generates faster, less noisy circuits than classical methods.

We study projective structures on a surface having poles of prescribed orders. We obtain a monodromy map from a complex manifold parameterising such structures to the stack of framed PGL2(C)\mathrm{PGL}_2(\mathbb{C}) local systems on the associated marked bordered surface. We prove that the image of this map is contained in…

2018-02-07abs ↗pdf ↗

Let M be a cusped 3-manifold, and let T be an ideal triangulation of M. The deformation variety D(T), a subset of which parameterises (incomplete) hyperbolic structures obtained on M using T, is defined and compactified by adding certain projective classes of transversely measured singular codimension-one foliations of…

2005-08-16abs ↗pdf ↗

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 …

2016-07-25abs ↗pdf ↗

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.

Let ΣΣ be a connected, oriented surface with punctures and negative Euler characteristic. We introduce regular globally hyperbolic anti-de Sitter structures on Σ×RΣ\times \mathbb{R} and provide two parameterisations of their deformation space: as an enhanced product of two copies of the Fricke space of ΣΣ and as the b…

2018-06-21abs ↗pdf ↗

Let ΣΣ be a connected, oriented surface with punctures and negative Euler characteristic. We introduce wild globally hyperbolic anti-de Sitter structures on Σ×RΣ\times \mathbb{R} and provide two parameterisations of their deformation space: as a quotient of the product of two copies of the Teichmüller space of crowned …

2019-01-01abs ↗pdf ↗

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.

2017-07-15abs ↗pdf ↗

We study a networked version of the minority game in which agents can choose to follow the choices made by a neighbouring agent in a social network. We show that for a wide variety of networks a leadership structure always emerges, with most agents following the choice made by a few agents. We find a suitable parameter…

2011-06-02abs ↗pdf ↗

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…

2015-04-10abs ↗pdf ↗

Two special Finsler spaces have been introduced and investigated, namely RhR^h-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 …

2012-05-20abs ↗pdf ↗

Neural differential equations combine deep learning and differential equations for modeling complex systems.

problem Modeling complex systems with high capacity and efficiency.
method Combining neural networks and differential equations, focusing on neural ordinary, controlled, and stochastic differential equations.
result NDEs offer high-capacity function approximation, strong priors, and handle irregular data efficiently.

We study here the large-time behaviour of all continuous affine stochastic volatility models (in the sense of Keller-Ressel) and deduce a closed-form formula for the large-maturity implied volatility smile. Based on refinements of the Gartner-Ellis theorem on the real line, our proof reveals pathological behaviours of …

2012-03-22abs ↗pdf ↗

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…

2015-04-13abs ↗pdf ↗

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…

2015-04-10abs ↗pdf ↗

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.

Many polynomial invariants of knots and links, including the Jones and HOMFLY-PT polynomials, are widely used in practice but #P-hard to compute. It was shown by Makowsky in 2001 that computing the Jones polynomial is fixed-parameter tractable in the treewidth of the link diagram, but the parameterised complexity of th…

2017-12-15abs ↗pdf ↗