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

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for vanishing dependency

We study the simplicial {\ell} q,p cohomology of Carnot groups G. We show vanishing and non-vanishing results depending of the range of the (p, q) gap with respect to the weight gaps in the Lie algebra cohomology of G.

2018-02-21abs ↗pdf ↗

The paper proves a vanishing identity for twist knots using character varieties.

problem Proving a vanishing identity for adjoint Reidemeister torsions of twist knots.
method Using Jacobi's residue theorem on the SL2(C)-character variety.
result The conjecture about vanishing identities for twist knots is proven.

A new RNN model tackles long-time dependencies with fast, invertible, and memory-efficient hidden states.

problem Challenges in processing sequential inputs with long-time dependencies in RNNs.
method A novel RNN architecture based on a Hamiltonian system of oscillators.
result The proposed RNN mitigates exploding and vanishing gradient problems, providing state-of-the-art performance.

Tautological classes, or generalised Miller-Morita-Mumford classes, are basic characteristic classes of smooth fibre bundles, and have recently been used to describe the rational cohomology of classifying spaces of diffeomorphism groups for several types of manifolds. We show that rationally tautological classes depend…

2017-05-17abs ↗pdf ↗

Study categorizes Vaisman manifolds with vanishing first Chern class and finds canonical metrics.

problem Characterizing Vaisman manifolds with vanishing first Chern class.
method Categorization into three types based on Bott-Chern class sign, showing canonical metrics, quasi-regularity, stability, and automorphism group behavior.
result Vaisman manifolds with non-positive Bott-Chern class admit canonical metrics and are stable under deformations.

n this paper we define an invariant of a pair of 6 dimensional symplectic %optional manifold with vanishing 1st Chern class and its Lagrangian submanifold with vanishing Maslov index. This invariant is a function on the set of the path connected components of the bounding cochains (solution of A infinity version of Mau…

2009-08-02abs ↗pdf ↗

ERNNs evolve hidden states on an ODE's equilibrium manifold to mitigate vanishing and exploding gradients.

problem Vanishing and exploding gradients in RNNs.
method Develop a novel family of RNNs (ERNNs) that evolve hidden states on the equilibrium manifold of an ODE.
result ERNNs achieve state-of-the-art accuracy with 3-10x speedups and 1.5-3x model size reduction.

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.

Infinitely deep neural networks can be modeled as diffusion processes to avoid undesirable properties.

problem Desirable properties are lost as neural networks increase in depth.
method Parameter distributions shrink as depth increases, leading to well-behaved stochastic processes.
result Limiting processes do not suffer from vanishing dependency and restrictive function families issues.

Maxout networks study gradients and propose initialization strategies.

problem Complexity in input-output Jacobian distribution complicates stable parameter initialization.
method Obtained bounds on moments of gradients and formulated initialization strategies.
result Parameter initialization strategies improve training of deep maxout networks.

Paper introduces a new GG^\star regret measure for online convex optimization with smooth losses.

problem Online convex optimization with smooth losses.
method Introduces a new GG^\star regret measure that depends on the cumulative squared gradient norm.
result The GG^\star regret can be arbitrarily sharper than existing measures when losses have vanishing curvature.

In this paper, we prove that there exists a universal constant CC, depending only on positive integers n3n\geq 3 and pn1p\leq n-1, such that if MnM^n is a compact free boundary submanifold of dimension nn immersed in the Euclidean unit ball Bn+k\mathbb{B}^{n+k} whose size of the traceless second fundamental form is less…

2018-07-18abs ↗pdf ↗

In an adaptive population which models financial markets and distributed control, we consider how the dynamics depends on the diversity of the agents' initial preferences of strategies. When the diversity decreases, more agents tend to adapt their strategies together. This change in the environment results in dynamical…

2006-09-26abs ↗pdf ↗

Analyzes self-attention in recurrent networks, proving it mitigates vanishing gradients.

problem Vanishing gradients in recurrent networks when capturing long-term dependencies.
method Formal analysis of self-attention's effect on gradient propagation, proposing a relevancy screening mechanism.
result Self-attention mitigates vanishing gradients in recurrent networks, providing guarantees.

Hamiltonian RNN controls hidden states gradient for long-term dependencies.

problem Challenges in learning long-term dependencies in RNNs.
method Symplectic discretization of Hamiltonian system to control gradient.
result Hamiltonian RNN outperforms other RNNs without hyperparameter optimization.

We study relations between the Alexander-Conway polynomial L\nabla_L and Milnor higher linking numbers of links from the point of view of finite-type (Vassiliev) invariants. We give a formula for the first non-vanishing coefficient of L\nabla_L of an m-component link L all of whose Milnor numbers μi1...ipμ_{i_1... i_p} van…

2001-11-08abs ↗pdf ↗

Recent empirical results on long-term dependency tasks have shown that neural networks augmented with an external memory can learn the long-term dependency tasks more easily and achieve better generalization than vanilla recurrent neural networks (RNN). We suggest that memory augmented neural networks can reduce the ef…

2017-01-30abs ↗pdf ↗

LCW reduces activation shift in neural networks, improving training efficiency and generalization.

problem Activation shift in neural networks leading to non-zero mean preactivation values.
method Linearly constrained weights (LCW) to reduce activation shift in fully connected and convolutional layers.
result LCW resolves the vanishing gradient problem and improves generalization of neural networks.

The aim of the current paper is to explore the implications on the group GG of the non-vanishing of the cohomology in degree one of one of its representation ππ, given some mixing conditions on ππ. In one direction, harmonic cocycles are used to show that the FC-centre should be finite (for mildly mixing unitary rep…

2016-07-18abs ↗pdf ↗

Functional determinant for mixed signature sphere products depends on sphere dimensions and parity.

problem Determining the functional determinant for scalar fields on mixed signature sphere products.
method Analyzing the GJMS operator on Sqimes^q imesSp^p to derive the functional determinant.
result The functional determinant depends only on the total dimension and parity of the sphere dimensions.

We compute the bi-Hamiltonian cohomology of an arbitrary dispersionless Poisson pencil in a single dependent variable using a spectral sequence method. As in the KdV case, we obtain that BHdp(F^,d1,d2)BH^p_d(\hat{F}, d_1,d_2) is isomorphic to R\mathbb{R} for (p,d)=(0,0)(p,d)=(0,0), to C(R)C^\infty (\mathbb{R}) for (p,d)=(1,1)(p,d)=(1,1), (2,1)(2,1), $(…

2015-05-14abs ↗pdf ↗

The vanishing of reduced 2\ell^2-cohomology for amenable groups can be traced to the work of Cheeger & Gromov. The subject matter here is reduced p\ell^p-cohomology for p]1,[p \in ]1,\infty[, particularly its vanishing. Results showing its triviality are obtained, for example: when p]1,2]p \in ]1,2] and GG is amenable; whe…

2013-03-17abs ↗pdf ↗

Successful recurrent models such as long short-term memories (LSTMs) and gated recurrent units (GRUs) use ad hoc gating mechanisms. Empirically these models have been found to improve the learning of medium to long term temporal dependencies and to help with vanishing gradient issues. We prove that learnable gates in a…

2018-03-23abs ↗pdf ↗

Study of Brown--York mass for four-dimensional asymptotically flat manifolds.

problem Calculating mass for hypersurfaces in four-dimensional asymptotically flat manifolds.
method Intrinsic definition of mean curvature, expansion analysis for large uniformly convex hypersurfaces.
result Shape-dependent correction to ADM mass for nearly round surfaces vanishes under certain conditions.

Study computes Cheeger constants for specific submanifolds in asymptotically hyperbolic spaces.

problem Computing Cheeger constants for conformally compact asymptotically constant mean curvature submanifolds.
method Analyzes conformally compact asymptotically constant mean curvature submanifolds in asymptotically hyperbolic spaces.
result Identifies conditions for Cheeger constant equality and vanishing mean curvature.

Recurrent neural networks have gained widespread use in modeling sequential data. Learning long-term dependencies using these models remains difficult though, due to exploding or vanishing gradients. In this paper, we draw connections between recurrent networks and ordinary differential equations. A special form of rec…

2019-02-26abs ↗pdf ↗

ST-SAN predicts flow with spatial-temporal dependencies using self-attention.

problem Challenges in predicting flow due to spatial-temporal dependencies.
method Spatial-Temporal Self-Attention Network (ST-SAN) that addresses temporal and spatial dependencies.
result Significant improvement in flow prediction accuracy (9% in inflow, 4% in outflow) compared to state-of-the-art methods.