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

21426283 · Jun 202619922001200920172026
48 results for Jacobian algebras

We prove some value of the harmonic volume for the Klein quartic CC is nonzero modulo ${1/2}\{mathbb Z}$, using special values of the generalized hypergeometric function 3F2{}_3F_2. This result tells us the algebraic cycle CCC-C^- is not algebraically equivalent to zero in the Jacobian variety J(C)J(C).

2005-08-23abs ↗pdf ↗

Paper discusses conditions for global injectivity of semi-algebraic local diffeomorphisms.

problem Conditions for global injectivity of semi-algebraic local diffeomorphisms in higher dimensions.
method Analyzes foliations and simply connectedness of leaves, relates to fibrations and Jacobian conjecture.
result Relates simply connectedness of foliation leaves to locally trivial fibrations and provides computable regularity conditions.

This study connects Jacobian regularization to adversarial robustness and improves generalization.

problem Adversarial attacks make deep neural networks vulnerable.
method Developed a connection between Jacobian regularization and adversarial training, and established robust generalization gaps.
result Jacobian norms are related to both standard and robust generalization.

We prove that affine invariant manifolds in strata of flat surfaces are algebraic varieties. The result is deduced from a generalization of a theorem of Möller. Namely, we prove that the image of a certain twisted Abel-Jacobi map lands in the torsion of a factor of the Jacobians. This statement can be viewed as a split…

2013-11-11abs ↗pdf ↗

This work proves the asymptotic freeness of layerwise Jacobians in MLPs with Haar orthogonal matrices.

problem Proving the asymptotic freeness of layerwise Jacobians in multilayer perceptrons (MLPs).
method Replacing each layer's parameter matrix with itself multiplied by a Haar orthogonal matrix, and using the invariance of the MLP.
result Proves the asymptotic freeness of layerwise Jacobians in MLPs with Haar orthogonal matrices.

Efficiently regularizes deep learning models using Jacobian nuclear norm.

problem Regularizing deep learning models to prevent overfitting and improve generalization.
method Proposes a denoising-style approximation to penalize the Jacobian nuclear norm without computing the Jacobian matrix.
result Demonstrates that penalizing the average squared Frobenius norm of JgJg and JhJh is equivalent to penalizing the Jacobian nuclear norm for function compositions.

We compute the formal Poisson cohomology of a broken Lefschetz fibration by calculating it at fold and Lefschetz singularities. Near a fold singularity the computation reduces to that for a point singularity in 3 dimensions. For the Poisson cohomology around singular points we adapt techniques developed for the Sklyani…

2018-05-11abs ↗pdf ↗

Paper tackles Hessian/Jacobian-free stochastic bilevel optimization with O(ε1.5){O}(ε^{-1.5}) complexity.

problem Nonconvex-strongly-convex bilevel optimization problem.
method FdeHBO optimizer with finite-difference Hessian/Jacobian-vector approximation and momentum.
result FdeHBO achieves O(ε1.5){O}(ε^{-1.5}) iterations for εε-accurate stationary point.

Recent work (Pennington et al, 2017) suggests that controlling the entire distribution of Jacobian singular values is an important design consideration in deep learning. Motivated by this, we study the distribution of singular values of the Jacobian of the generator in Generative Adversarial Networks (GANs). We find th…

2018-02-23abs ↗pdf ↗

The paper discusses fractional Sobolev immersions of flat domains into 3D space.

problem Developing C1C^1 regularity and isometric immersions of flat domains with fractional Sobolev regularity.
method Analysis of weak Codazzi-Mainardi equations, study of $W^{2, rac2s}$ planar deformations, and properties of the distributional Jacobian determinant.
result Generalization of isometric immersions with local fractional Sobolev regularity.

We derive an analytic formula for the dual Jacobian matrix of a generalised hyperbolic tetrahedron. Two cases are considered: a mildly truncated and a prism truncated tetrahedron. The Jacobian for the latter arises as an analytic continuation of the former, that falls in line with a similar behaviour of the correspondi…

2014-09-11abs ↗pdf ↗

New algorithms estimate Jacobian matrices for large-scale machine learning.

problem Efficiently computing search directions for large nonlinear least squares.
method Exploit low-rank structure in Hessian to estimate Jacobian matrices.
result Two algorithms perform well compared to state-of-the-art methods.

The paper extends infinite-width analysis to neural network Jacobians, revealing convergence to Gaussian processes and linear ODEs.

problem Understanding the training dynamics of neural networks in the infinite-width limit.
method Extending infinite-width analysis to Jacobians, characterizing convergence to Gaussian processes and linear ODEs.
result The evolution of MLPs under robust training in the infinite-width limit is described by a linear ODE.

GrokAlign aligns Jacobians to accelerate grokking in deep networks.

problem Accelerating the training dynamics of deep networks to avoid delayed generalisation and robustness.
method Aligning the Jacobians of a deep network with the training data to ensure grokking under a low-rank assumption.
result GrokAlign regularizes Jacobians to induce grokking sooner than conventional methods.

We extend the well-known result that any fW1,n(Ω,Rn)f \in W^{1,n}(Ω,\mathbb{R}^n), ΩRnΩ\subset \mathbb{R}^n with strictly positive Jacobian is actually continuous: it is also true for fractional Sobolev spaces Ws,ns(Ω)W^{s,\frac{n}{s}}(Ω) for any snn+1s \geq \frac{n}{n+1}, where the sign condition on the Jacobian is understood in a distr…

2019-05-17abs ↗pdf ↗

New method reduces deep learning training costs by approximating vector-jacobian products.

problem Efficiently training deep neural networks with reduced computational and memory costs.
method Randomized, unbiased approximations of vector-jacobian products during backpropagation.
result Validated potential for reducing deep learning training costs through unbiased estimates.

Normalizing flows optimize Jacobian determinant for unique likelihood objective.

problem Optimizing normalizing flows for unique likelihood.
method Showed Jacobian determinant is unique for given distributions, leading to a unique global optimum. Used eigenvalues of auto-correlation matrix for explicit likelihood expression.
result Explicit expression of likelihood for flows, independent of neural network parameterization, with theoretical optimal value.

The Jacobian of Douady-Earle extension equals 1 only for isometries.

problem Investigating the Jacobian of Douady-Earle extension maps.
method Analyzing the Jacobian of the Douady-Earle extension map and constructing sequences of hyperbolic surfaces.
result The Jacobian of the Douady-Earle extension map is 1 only when the map is an isometry, and it can grow arbitrarily large for certain sequences of surfaces.

To a compact Riemann surface of genus g can be assigned a principally polarized abelian variety (PPAV) of dimension g, the Jacobian of the Riemann surface. The Schottky problem is to discern the Jacobians among the PPAVs. Buser and Sarnak showed, that the square of the first successive minimum, the squared norm of the …

2010-08-12abs ↗pdf ↗

We show that the Goldman flows preserve the holomorphic structure on the moduli space of homomorphisms of the fundamental group of a Riemann surface into U(1), in other words the Jacobian.

2008-02-24abs ↗pdf ↗

Design of reliable systems must guarantee stability against input perturbations. In machine learning, such guarantee entails preventing overfitting and ensuring robustness of models against corruption of input data. In order to maximize stability, we analyze and develop a computationally efficient implementation of Jac…

2019-08-07abs ↗pdf ↗

The paper identifies magnetic ground states and their role in determining the conformal class of a surface.

problem Understanding the magnetic ground states and their relation to the conformal class of a surface.
method Analyzing the magnetic Laplacian and its eigenvalues on a Riemannian surface.
result The ground state spectrum uniquely determines the volume and conformal class of the metric.

New approach approximates c-space geometry of multi-loop linkages.

problem Higher-order mobility analysis of multi-loop linkages.
method Higher-order Taylor series expansion of geometric constraint mapping using joint screws.
result Local approximation of c-space and configurations with certain rank.

The paper analyzes privacy leakage in federated learning using linear algebra and optimization theory.

problem Privacy leakage in federated learning despite its promise for data privacy.
method Theoretical analysis from linear algebra and optimization theory perspectives.
result Derives sufficient conditions to prevent data reconstruction attacks and establishes an upper bound on privacy leakage.

Geometrically represents path integral reduction Jacobian for interacting systems.

problem Quantizing a model mechanical system with dependent coordinates.
method Geometric representation using scalar curvature and Christoffel symbols in a nonholonomic basis.
result Found a geometric representation for the path integral reduction Jacobian.

The paper analyzes the observability of relative pose estimation using dual quaternions.

problem Estimating relative pose in robotics applications.
method Lie algebraic nonlinear observability analysis on a dual quaternion system.
result Dual quaternion representation yields an observability matrix with a simple block triangular structure and full rank.

This work relaxes energy constraints in self-attention layers for a more general analysis.

problem Understanding inherent biases and dynamics in self-attention layers without energy functions.
method Dynamical systems analysis and Jacobian matrix examination.
result Normalized dynamics are close to a critical state, indicating high inference performance.

JacNet learns Jacobians to enforce structure on derivatives for invertibility and Lipschitz functions.

problem Enforcing structure on derivatives of neural network mappings.
method Proposes using a neural network to directly learn the Jacobian of the input-output function, allowing control over derivative structure.
result Demonstrates learning invertible approximations to simple and 1-Lipschitz functions.

The paper studies global invertibility of maps on Finsler manifolds.

problem Global invertibility of locally Lipschitz maps on Finsler manifolds.
method Introduces pseudo-Jacobian and studies its relations with local metric properties of the map.
result Conditions for a map to be globally invertible and covering.