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

7152229 · Jun 202019922001200920172026
48 results for Hessian Eigenspectrum

Analyzes Hessian spectrum for neural networks near optimal learning.

problem Understanding learning dynamics near optimal points in neural networks.
method Characterizes Hessian eigenspectrum for teacher-student problems, using analytical and numerical methods.
result The rank of the Hessian matrix determines effective number of parameters for non-linear networks.

A new mutual information optimization method using self-supervised binary contrastive learning.

problem Improving self-supervised contrastive learning for better model performance.
method Proposes a novel loss function for contrastive learning that optimizes mutual information in positive and negative pairs.
result The proposed method outperforms state-of-the-art self-supervised contrastive frameworks on various benchmark datasets.

Lower bounds on eigenspectrum show rich action spaces force polynomial regret in linear bandits.

problem Understanding the minimum eigenvalue growth in linear bandits with rich action sets.
method Non-asymptotic lower bound on eigenspectrum of design matrix.
result Minimum eigenvalue of expected design matrix grows as Ω(n)Ω(\sqrt{n}) for sub-linear regret.

Self-attention networks localize when eigenspectrum variance is small.

problem Self-attention mechanisms can lead to rank and entropy collapses, reducing model expressivity and trainability.
method Characterized attention localization using query-key eigenspectrum variance.
result Small eigenspectrum variance prevents both rank and entropy collapses, improving model performance.

SAT improves adversarial training by smoothing the loss landscape through curriculum learning.

problem Adversarial training sacrifices clean accuracy for robustness and suffers from large generalization error.
method SAT uses curriculum learning to smooth the adversarial loss landscape, improving both clean and robust accuracy.
result SAT models improve clean and robust accuracy significantly compared to adversarial training and other baselines.

This article investigates the eigenspectrum of the inner product-type kernel matrix pK={f(xiTxj/p)}i,j=1n\sqrt{p} \mathbf{K}=\{f( \mathbf{x}_i^{\sf T} \mathbf{x}_j/\sqrt{p})\}_{i,j=1}^n under a binary mixture model in the high dimensional regime where the number of data nn and their dimension pp are both large and comparable. Based on…

2019-09-15abs ↗pdf ↗

New method preserves spectral clustering performance under aggressive sparsification and quantization.

problem Maintaining spectral clustering performance with sparse and quantized data.
method Random matrix theory applied to eigenspectrum changes under sparsification and quantization.
result Spectral clustering performance is preserved even with aggressive sparsification and quantization.

The study proves that certain noncompact Hessian manifolds are diffeomorphic to R^n.

problem Characterizing complete noncompact Hessian manifolds with nonnegative Hessian sectional curvature.
method Using a geometric flow on noncompact affine Riemannian manifolds, constructing Hessian metrics, and proving diffeomorphism.
result Complete noncompact Hessian manifolds with nonnegative Hessian sectional curvature are diffeomorphic to R^n if their tangent bundle has maximal volume growth.

New Hessian estimates for heat equations on manifolds.

problem Estimating Hessian matrices for heat-type equations on Riemannian manifolds.
method Using Bismut-Stroock Hessian formula, with explicit coefficients and delay/growth rate functions.
result Novel backward weak Harnack inequality and precise pointwise Hessian estimates for eigenfunctions.

SGD in linear regression overfits but performs well due to bias-variance trade-off.

problem Understanding overfitting in SGD for linear regression.
method Constant-stepsize SGD with iterate averaging or tail averaging, analyzing full eigenspectrum of data covariance matrix.
result Sharp excess risk bounds revealing bias-variance decomposition for SGD in linear regression.

We prove that, in dimensions greater than 2, the generic metric is not a Hessian metric and find a curvature condition on Hessian metrics in dimensions greater than 3. In particular we prove that the forms used to define the Pontryagin classes in terms of the curvature vanish on a Hessian manifold. By contrast all anal…

2013-12-04abs ↗pdf ↗

Curved Frobenius manifolds link to Hessian metrics in geometry.

problem Understanding curved Frobenius manifolds and their relation to Hessian metrics.
method Analyzing the relationship between curved Frobenius structures and Hessian metrics on spaces with non-vanishing curvature.
result Consistent curved Frobenius structures on constant curvature spaces are linked to Hessian metrics.

Criterion for solvability of complex 2-Hessian equation on compact Kähler manifolds.

problem Solvability of complex 2-Hessian equation on compact Kähler manifolds.
method Nakai--Moishezon-type criterion associated with the complex 2-Hessian equation.
result Criterion equivalent to existence of a smooth 2-admissible representative in complex dimension three.

Constructs homogeneous Kähler structures on tangent bundles of Hessian manifolds.

problem Creating Kähler structures on tangent bundles of Hessian manifolds.
method Endowing Hessian manifolds with Kähler structures using group actions and homothetic vector fields.
result Homogeneous conformally Kähler structures on tangent bundles of selfsimilar Hessian manifolds.

Paper proves inequalities on Hermitian manifolds with applications to bounded solutions.

problem Establishing mixed Hessian inequalities on Hermitian manifolds.
method Weak convergence theorem of complex Hessian operators and general mixed Hessian inequality.
result Existence of bounded solutions of complex Hessian equations.

A selfsimiar manifold is a Riemannian manifold (M,g)\left(M,g\right) endowed with a homothetic vector field ξξ. We characterize global selfsimilar manifolds and describe the structure of local selfsimilar manifolds. We prove that any selfsimilar manifold with a potential homothetic vector field is a conical Riemannian ma…

2019-08-05abs ↗pdf ↗

This paper uncovers the low-rank structure of neural network Hessians.

problem Understanding the structure of Hessians in neural networks.
method Proposes a decoupling conjecture to decompose layer-wise Hessians into Kronecker products of smaller matrices.
result Proves the structure of top eigenspaces in 2-layer networks and shows high overlap in top eigenvectors across different models.

Study confirms Chern's conjecture on compact Hessian manifolds and classifies their topologies.

problem Global topological constraints and structural properties of compact Hessian manifolds.
method Novel fibration and splitting theorems, Chern's conjecture, Hitchin systems, Cheng-Yau solution.
result Topological classification of complete Hessian surfaces and closed orientable Hessian 3-manifolds.

Paper discusses solving generalized Hessian inequalities with various operators.

problem Finding global solutions to generalized Hessian inequalities.
method Analyzes various Hessian operators and provides conditions for global solvability.
result Provides necessary and sufficient conditions for global solvability of generalized Hessian inequalities.

Hessian alignment improves OOD generalization in deep learning.

problem Improving deep learning models' ability to generalize to out-of-distribution data.
method Analyzed Hessian and gradient alignment for domain generalization using recent OOD theory.
result Hessian alignment methods achieve promising performance on various OOD benchmarks.

New perspective on CNNs using Hessian maps reveals their structure.

problem Understanding the nature of Convolutional Neural Networks (CNNs).
method Developed a framework using Toeplitz representation of CNNs to reveal Hessian structure and prove rank bounds.
result Proved that the Hessian rank of CNNs grows as the square root of the number of parameters.

Study the Hessian geometry of an ideal gas in a centrifuge.

problem Understanding the Hessian geometry of an ideal gas in a centrifuge.
method Investigate the Hessian geometry associated with an ideal gas in a spherical centrifuge, using the action of the Euclidean rotation group.
result The Hessian geometry of a spherical rigid body is isometric to a hyperbolic space in the high angular velocity limit.

New Hessian estimators for Riemannian manifolds with reduced bias.

problem Estimating Hessians on Riemannian manifolds with reduced bias and computational efficiency.
method Introducing new stochastic zeroth-order Hessian estimators using O(1)O(1) function evaluations.
result Achieved a bias bound of order O(γδ2)O(γδ^2) for analytic real-valued functions.

New algorithm adds Hessian regularization to improve neural network robustness.

problem Improving neural network robustness against adversarial attacks.
method Proposes an efficient algorithm to train neural networks with Hessian operator-norm regularization.
result Hessian operator-norm regularization increases neural network robustness over input gradient regularization.