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

21416282 · Jun 202019922001200920172026
48 results for Recurrent Expansion

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.

In this paper, we first give a direct proof for two recurrence relations of the heat kernels for hyperbolic spaces in \cite{DM}. Then, by similar computation, we give two similar recurrence relations of the heat kernels for spheres. Finally, as an application, we compute the diagonal of heat kernels for odd dimensional…

2018-07-16abs ↗pdf ↗

Using a simple recurrence relation we give a new method to compute Jones polynomials of closed braids: we find a general expansion formula and a rational generating function for Jones polynomials. The method is used to estimate degree of Jones polynomials for some families of braids and to obtain general qualitative re…

2010-02-19abs ↗pdf ↗

Turning the skein relation for HOMFLY into a Fibonacci recurrence, we prove that there are only three rational specializations of HOMFLY polynomial: Alexander-Conway, Jones, and a new one. Using the recurrence relation, we find general and relative expansion formulae and rational generating functions for Alexander-Conw…

2010-03-04abs ↗pdf ↗

RE enhances DL by learning model behavior, enabling iterative self-improvement.

problem Static data representations limit DL's potential for evolving models.
method RE uses multiple mappings of data through identical deep architectures, analyzing internal representations and performance signals.
result Models can gain insight from predecessors, leading to iterative self-improvement.

We study the near diagonal asymptotic expansion of the generalized Bergman kernel of the renormalized Bochner-Laplacian on high tensor powers of a positive line bundle over a compact symplectic manifold. We show how to compute the coefficients of the expansion by recurrence and give a closed formula for the first two o…

2004-11-24abs ↗pdf ↗

We study power expansions of the characteristic function of a linear operator AA in a pqp|q-dimensional superspace VV. We show that traces of exterior powers of AA satisfy universal recurrence relations of period qq. `Underlying' recurrence relations hold in the Grothendieck ring of representations of $\GL(V)$. The…

2003-09-10abs ↗pdf ↗

Catastrophic forgetting and capacity saturation are the central challenges of any parametric lifelong learning system. In this work, we study these challenges in the context of sequential supervised learning with an emphasis on recurrent neural networks. To evaluate the models in the lifelong learning setting, we propo…

2018-11-16abs ↗pdf ↗

Enhanced ECCD speeds up elastic net model training.

problem Efficiently solving generalized linear models with elastic net constraints.
method Redesigned cyclic coordinate descent with Taylor expansion and batched computations.
result Empirically shows consistent 3imes3 imes performance improvement over state-of-the-art solvers.

We use the explicit relation between genus filtrated ss-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich--Penner matrix model (KPMM), which is the generating function for volumes of discretized (open) moduli spaces Mg,sdiscM_{g,s}^{disc} (discrete volumes), to express Gaussian means…

2015-12-31abs ↗pdf ↗

A natural generalization of interval exchange maps are linear involutions, first introduced by Danthony and Nogueira. Recurrent train tracks with a single switch provide a subclass of linear involutions. We call such linear involutions non-classical interval exchanges. They are related to measured foliations on orienta…

2009-06-14abs ↗pdf ↗

Unified theory for deep and recurrent networks using Gaussian processes.

problem Understanding capabilities and limitations of different network architectures.
method Unified derivation of mean-field theory from statistical physics of disordered systems.
result Gaussian processes yield identical Gaussian kernels for both architectures at a single time point or layer.

MFNs parameterize non-local interactions through matrix equivariant functions, improving graph neural network performance.

problem Challenges in modeling non-local interactions in graphs, such as oversmoothing and oversquashing.
method Matrix Function Neural Networks (MFNs) using resolvent expansions for non-local interactions.
result Achieves state-of-the-art performance in graph benchmarks and captures intricate non-local interactions.

Closed formulas for η-corrections in the once-punctured torus identified.

problem Identifying η-corrections in the Kauffman bracket skein algebra of the once-punctured torus.
method Explicit closed formulas for Chebyshev-threaded families and η-corrections.
result Explicit Chebyshev expansions and coefficients for η-corrections.

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 ↗

The paper derives expansions for Green's operators and resolvents using Hadamard methods.

problem Analyzing normally hyperbolic operators and their Green's functions.
method Hadamard expansions for powers of Green's operators and resolvents.
result Derives expansions involving Hadamard coefficients for advanced/retarded Green's operators.

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.

2017-07-15abs ↗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 ↗

Analytic torsion expansions for symmetric and complex homogeneous spaces.

problem Calculating the full asymptotic expansion of analytic torsion for various spaces.
method Explicit calculation and comparison with existing results.
result Explicit full asymptotic expansions for symmetric and complex homogeneous spaces.

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 ↗

A new hypergraph expansion method treats vertices and hyperedges equally, improving node classification.

problem Information loss in hypergraph expansions on either vertex or hyperedge level.
method Proposes a new hypergraph formulation named line expansion (LE) that treats vertices and hyperedges symmetrically.
result The proposed line expansion method outperforms state-of-the-art baselines on five hypergraph datasets.

The effectiveness of deep neural architectures has been widely supported in terms of both experimental and foundational principles. There is also clear evidence that the activation function (e.g. the rectifier and the LSTM units) plays a crucial role in the complexity of learning. Based on this remark, this paper discu…

2018-07-17abs ↗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.

The paper calculates asymptotic expansions for specific types of oscillatory integrals.

problem Analyzing oscillatory integrals with complex phase functions.
method Using asymptotic expansions of simpler phase functions to derive results for more complex cases.
result Explicit computation of coefficients in asymptotic expansions for certain integrals.

We propose a new formulation for pruning convolutional kernels in neural networks to enable efficient inference. We interleave greedy criteria-based pruning with fine-tuning by backpropagation - a computationally efficient procedure that maintains good generalization in the pruned network. We propose a new criterion ba…

2016-11-19abs ↗pdf ↗

This work explores functional expansions to handle path dependence in various fields.

problem Path dependence and infinite-dimensional problems in non-Markovian systems.
method Generalizes Wiener series and functional Taylor expansion to handle static and dynamic functionals.
result Elegant separation of functionals from future trajectories in dynamic cases.

In the planar limit of the 't Hooft expansion, the Wilson-loop average in 3d Chern-Simons theory (i.e. the HOMFLY polynomial) depends in a very simple way on representation (the Young diagram), so that the (knot-dependent) Ooguri-Vafa partition function becomes a trivial KP tau-function. We study higher genus correctio…

2013-03-05abs ↗pdf ↗

New explanation of reservoir computing using random projections.

problem Understanding the randomness in reservoir computing.
method Constructing strongly universal reservoir systems as random projections of state-space systems.
result Approximation of any fading memory filters class by training a linear readout for each filter.

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 AA, there exists a unique horizontally recurrent Finsler connection whose hh-recurrence form is AA. This result generalizes the existence and u…

2017-06-19abs ↗pdf ↗