The paper discusses fractional Sobolev immersions of flat domains into 3D space.
problem Developing C1 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.
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.
A new method speeds up training of deep models by avoiding Jacobian determinant computation.
problem Efficiently training deep neural networks with complex log-determinant terms.
method Relative gradients to compute Jacobian updates efficiently.
result Training neural networks with Jacobian log-determinant objectives becomes feasible.
Injective flows for star-like manifolds improve variational inference efficiency.
problem Efficiently modeling densities on star-like manifolds with exact Jacobian computation.
method Proposed injective flows for star-like manifolds with exact Jacobian computation.
result Exact Jacobian computation for star-like manifolds reduces computational cost to NFs.
Self Normalizing Flows improve normalizing flows by reducing computational complexity.
problem Efficient gradient computation in normalizing flows, especially in Jacobian determinant terms.
method Introducing Self Normalizing Flows that replace expensive terms with learned approximate inverses.
result Models can be trained more quickly and perform better than functionally constrained counterparts.
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.
We prove two-sided inequalities for the Lp-norm of a pushforward or pullback (with respect to an orientation-preserving diffeomorphism) on oriented volume and Riemannian manifolds. For a function or density on a volume manifold, these bounds depend only on the Jacobian determinant, which arises through the change of…
The Jacobian matrix (or the gradient for single-output networks) is directly related to many important properties of neural networks, such as the function landscape, stationary points, (local) Lipschitz constants and robustness to adversarial attacks. In this paper, we propose a recursive algorithm, RecurJac, to comput…
For any quiver mutation sequence, we define a pair of matrices that describe a fixed point equation of a cluster transformation determined from the mutation sequence. We give an explicit relationship between this pair of matrices and the Jacobian matrix of the cluster transformation. Furthermore, we show that this rela…
Training avoids edge of stability by aligning Jacobian matrices.
problem Training neural networks on the edge of stability causes inaccuracies.
method Used an exponential Euler solver to prevent entering the edge of stability.
result Alignment of Jacobian matrices causes sharpness increase in Hessian.
The Goeritz matrix of a link is obtained from the Jacobian matrix of a modified Dehn presentation associated to a diagram using Fox's free differential calculus. When the diagram is special the Seifert matrix can also be determined from the presentation.
New comparison theorem for submanifolds with geometric inequalities.
problem Geometric inequalities for submanifolds in ambient spaces.
method Explicit Jacobian determinant formula for normal exponential map.
result Establishes new comparison theorem related to Heintze-Karcher's.
The Jacobian Conjecture is proven for all Jacobian maps.
problem Proving the Jacobian Conjecture for all Jacobian maps.
method Using the Weyl algebra and holonomic modules, the paper shows that the Jacobian module is 1-generated and has finite length.
result The Jacobian Conjecture is true for all Jacobian maps.
NODEs can approximate a wide range of diffeomorphisms with strong guarantees.
problem The approximation power of NODEs under certain conditions.
method Leveraging a structure theorem of the diffeomorphism group.
result NODEs can approximate a large class of diffeomorphisms with a stronger guarantee.
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.
OT-Flow uses optimal transport to improve CNFs for faster and more accurate density estimation.
problem Computational challenges in continuous normalizing flows.
method OT-Flow leverages optimal transport to regularize CNFs and uses exact trace computation.
result OT-Flow achieves competitive performance with one-fourth the number of weights and significant speedups.
A promising class of generative models maps points from a simple distribution to a complex distribution through an invertible neural network. Likelihood-based training of these models requires restricting their architectures to allow cheap computation of Jacobian determinants. Alternatively, the Jacobian trace can be u…
Geometrically represents the Jacobian for a mechanical system with symmetry.
problem Path integral reduction for a mechanical system with symmetry.
method Geometric representation using scalar curvature and adapted coordinates.
result Obtained geometric representation of the Jacobian.
In the field of optimal transport theory, an optimal map is known to be a gradient map of a potential function satisfying cost-convexity. In this paper, the Jacobian determinant of a gradient map is shown to be log-concave with respect to a convex combination of the potential functions when the underlying manifold is t…
Study shows connections between Jacobian torsors and Fermat curves.
problem Understanding torsors of Jacobian of universal Fermat curves.
method Analyzes torsors of Jacobian of universal family of degree-m Fermat curves. result Every torsor is a connected component of the Picard scheme.
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.
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 Jg and Jh is equivalent to penalizing the Jacobian nuclear norm for function compositions. The Seiberg-Witten family of elliptic curves defines a Jacobian rational elliptic surface Z over CP1. We show that for the ∂ˉ-operator along the fiber the logarithm of the regularized determinant −1/2logdet′(∂ˉ∗∂ˉ) satisfies the anomaly equation of the …
Abstract: Unknown status of Jacobian Conjecture, proof has a gap.
problem Status of Jacobian Conjecture
method Analysis of proof of theorem 2.1
result Proof of theorem 2.1 contains a gap
A well-conditioned Jacobian spectrum has a vital role in preventing exploding or vanishing gradients and speeding up learning of deep neural networks. Free probability theory helps us to understand and handle the Jacobian spectrum. We rigorously show almost sure asymptotic freeness of layer-wise Jacobians of deep neura…
The Jacobian conjecture is simplified using polynomial mappings.
problem Simplifying the Jacobian conjecture over the real field.
method Using polynomial mappings to restrict transitions on manifolds.
result An equivalent statement of the Jacobian conjecture.
Paper tackles Hessian/Jacobian-free stochastic bilevel optimization with 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) iterations for ε-accurate stationary point. The paper connects complex normalizing flows to Kähler-Ricci flows using geometric and statistical perspectives.
problem Understanding the relationship between complex normalizing flows and Kähler-Ricci flows.
method Develops connections between complex normalizing flows and Kähler-Ricci flows by relating the log determinant to Ricci curvature and using a Bayesian perspective.
result Reconciles the complex normalizing flow and Kähler-Ricci flow, showing they are related under certain conditions.
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…
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…
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 calculates the Saito determinant for Coxeter discriminant strata.
problem Calculating the Saito determinant for specific geometric strata.
method Using the Saito flat metric and Lie derivatives, the paper finds the determinant of the metric restricted to Coxeter discriminant strata.
result The determinant of the Saito metric on Coxeter discriminant strata is proportional to a product of linear factors in flat coordinates.
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 provide a characterization for complex analytic curves among two-dimensional minimal graphs in R4 via the Jacobian
We extend the well-known result that any f∈W1,n(Ω,Rn), Ω⊂Rn with strictly positive Jacobian is actually continuous: it is also true for fractional Sobolev spaces Ws,sn(Ω) for any s≥n+1n, where the sign condition on the Jacobian is understood in a distr…
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.
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.
The aim here is to continue the investigation in \cite{AB} of Jacobians of a Klein surface and also to correct an error in \cite{AB}.
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 …
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.
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…
Generative adversarial networks (GANs) are notoriously difficult to train and the reasons underlying their (non-)convergence behaviors are still not completely understood. By first considering a simple yet representative GAN example, we mathematically analyze its local convergence behavior in a non-asymptotic way. Furt…
Recovering hidden influence networks from cascade data using Jacobian-based machine learning.
problem Recovering influence networks behind dynamic cascades.
method CascadeNet, a Jacobian-based machine learning framework.
result CascadeNet achieves high accuracy in network recovery.
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.
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.
We compute some value of the harmonic volume for the Fermat sextic. Using this computation, we prove that some special algebraic cycle in the Jacobian variety of the Fermat sextic is not algebraically equivalent to zero.
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.