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

23477093 · Jun 202019922001200920172026
48 results for Higher-order norms

Recently twisted and higher order Alexander polynomials were used by Cochran, Harvey, Friedl--Kim and Turaev to give lower bounds on the Thurston norm. We first show how Reidemeister torsion relates to these Alexander polynomials. We then give lower bounds on the Thurston norm in terms of the Reidemeister torsion which…

2005-08-31abs ↗pdf ↗

We show that the spectral norm of a random n1×n2××nKn_1\times n_2\times \cdots \times n_K tensor (or higher-order array) scales as O((k=1Knk)log(K))O\left(\sqrt{(\sum_{k=1}^{K}n_k)\log(K)}\right) under some sub-Gaussian assumption on the entries. The proof is based on a covering number argument. Since the spectral norm is dual to the tensor…

2014-07-07abs ↗pdf ↗

Study on tensor nuclear norm's decomposability and subdifferential.

problem Understanding tensor nuclear norm in higher-order tensors.
method Showed decomposability over specific subspaces, derived subdifferential inclusions, and studied subgradients.
result Established the statistical performance of tensor robust principal component analysis.

The paper extends inequalities for convex bodies to higher dimensions and various norms.

problem Extending inequalities for convex bodies to higher dimensions and various norms.
method Developed new operators and inequalities for higher-order LpL^p norms.
result Established mmth-order LpL^p isoperimetric inequalities.

The higher order singular value decomposition (HOSVD) of tensors is a generalization of matrix SVD. The perturbation analysis of HOSVD under random noise is more delicate than its matrix counterpart. Recently, polynomial time algorithms have been proposed where statistically optimal estimates of the singular subspaces …

2017-07-05abs ↗pdf ↗

Neural networks can learn from higher-order cumulants efficiently, requiring quadratic samples.

problem Learning from higher-order cumulants in high-dimensional data.
method Spiked cumulant model, polynomial time algorithms, neural networks, random features.
result Neural networks require quadratic samples to learn from higher-order cumulants efficiently, while random features require more samples.

Many problems can be formulated as recovering a low-rank tensor. Although an increasingly common task, tensor recovery remains a challenging problem because of the delicacy associated with the decomposition of higher order tensors. To overcome these difficulties, existing approaches often proceed by unfolding tensors i…

2014-05-07abs ↗pdf ↗

Sharp inequalities for radial functions on hyperbolic spaces without boundary conditions.

problem Establishing inequalities for radial functions on hyperbolic spaces without zero boundary conditions.
method Novel approach considering both bounded and unbounded domains, focusing on weighted Sobolev and Adams-Trudinger-Moser embeddings.
result Theorems 1.2, 1.3, and 1.4 for weighted Sobolev embedding theorems, and Theorems 1.5 and 1.6 for Adams-Trudinger-Moser type embedding theorems.

This paper begins to study the limiting behavior of a family of Hermitian Yang-Mills (HYM for brevity) metrics on a class of rank two slope stable vector bundles over a product of two elliptic curves with Kähler metrics ωεω_ε when ε0ε\to 0. Here ωεω_ε are flat and have areas εε and ε1ε^{-1} on the two elliptic curves …

2012-03-14abs ↗pdf ↗

Unified normative modeling for neuroimaging phenotypes using denoising diffusion models.

problem Discarding multivariate dependence in neuroimaging pipelines.
method Denoising diffusion probabilistic models (DDPMs) with FiLM and SAINT backbones.
result Unified multivariate normative modeling with better calibration and dependence preservation.

Given a finitely presented group G and an epimorphism G to the group of integers Cochran and Harvey defined a sequence of integral invariants, which can be viewed as the degrees of higher--order Alexander polynomials. Cochran and Harvey showed that (up to a minor modification) this is a never decreasing sequence of num…

2005-10-21abs ↗pdf ↗

New PINNs method improves accuracy in computing Mean Escape Time from bounded domains.

problem Computing Mean Escape Time from bounded domains with high accuracy.
method Boundary-adapted Physics-Informed Neural Networks (PINNs) with exact Dirichlet boundary enforcement.
result Derivation of H2(Ω)H^2(Ω) a priori error bounds for PINNs with normalized distance approximations.

Unified framework for Sobolev spaces on vector bundles, including explicit integration by parts.

problem Developing a comprehensive theory for Sobolev spaces on vector bundles.
method Explicit higher-order geometric integration by parts formula on arbitrary Riemannian manifolds.
result Direct proofs of classical theorems in Sobolev spaces on vector bundles.

Algorithm finds adversarial examples for k-NN classifiers using Voronoi diagrams.

problem Ensuring robustness of k-NN classifiers against adversarial attacks.
method Geometric approach expanding outwards from input points to find minimum-norm adversarial examples.
result Our method outperforms existing approaches on various datasets.

This work analyzes the maximum-margin bias in quasi-homogeneous neural networks.

problem Analyzing the maximum-margin bias in quasi-homogeneous neural networks.
method Geometric analysis of gradient dynamics for quasi-homogeneous models.
result Gradient flow implicitly favors a subset of parameters, leading to asymmetric norm minimization.

Paper proves Simon's third gap conjecture for minimal surfaces in spheres.

problem Investigating the third gap problem in Simon's conjecture for minimal surfaces in unit spheres.
method Developed refined third-order Simons-type integral identities and established new lower bounds for curvature terms.
result Obtained positive gap results for the squared norm of the second fundamental form throughout the interval \(\left[\frac{5}{3},\frac{9}{5} ight]\).

For certain classes of knots we define geometric invariants called higher-order genera. Each of these invariants is a refinement of the slice genus of a knot. We find lower bounds for the higher-order genera in terms of certain von Neumann ρρ-invariants, which we call higher-order signatures. The higher-order genera o…

2008-07-02abs ↗pdf ↗

A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a triangle in the network. However, higher-order cliques beyond triangles are crucia…

2017-04-12abs ↗pdf ↗

Low-rank tensor completion recovers missing entries based on different tensor decompositions. Due to its outstanding performance in exploiting some higher-order data structure, low rank tensor ring has been applied in tensor completion. To further deal with its sensitivity to sparse component as it does in tensor princ…

2019-03-31abs ↗pdf ↗

A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically, we extend meta-interpretive learning (MIL) to support learning higher…

2019-07-25abs ↗pdf ↗

This paper improves convergence guarantees for gradient clipping in deep learning.

problem Improving convergence guarantees for gradient clipping in deep learning models.
method Analyzes and provides precise convergence guarantees for arbitrary clipping thresholds.
result Shows tight convergence guarantees for clipped stochastic gradient descent.

The paper explores how close two Lipschitz functions can be without their difference exceeding a certain bound.

problem Understanding the closeness of two Lipschitz functions and their difference.
method Investigates the relationship between two Lip(γ)(\gamma) functions being close throughout a subset of their domain and the bound on the difference's Lipschitz norm.
result The Lipschitz norm of the difference between two functions is bounded by a small value when the distance to a subset is small.

In this paper we develop a geometric approach to higher order mechanics on graded bundles in both, the Lagrangian and Hamiltonian formalism, via the recently discovered weighted algebroids. We present the corresponding Tulczyjew triple for this higher order situation and derive in this framework the phase equations fro…

2014-12-08abs ↗pdf ↗

This paper presents the first use of graph neural networks (GNNs) for higher-order proof search and demonstrates that GNNs can improve upon state-of-the-art results in this domain. Interactive, higher-order theorem provers allow for the formalization of most mathematical theories and have been shown to pose a significa…

2019-05-24abs ↗pdf ↗

The paper glosses different forms of an introducing of higher order tangent-like functors, especially functors derived from higher order nonholonomic tangent functors. A special attention is devoted to higher order osculating bundles: their identification with higher order tangent bundles is demonstrated as the main re…

2012-02-13abs ↗pdf ↗

A new method predicts higher-order interactions in evolving graphs using simplicial complexes.

problem Predicting higher-order interactions in dynamic graphs with theoretical guarantees.
method Capturing higher-order interactions as simplices, modeling neighborhoods with face-vectors, and developing a nonparametric kernel estimator.
result Our method outperforms existing higher-order prediction methods and is theoretically consistent.

Novel higher-order group synchronization for noisy local measurements on hypergraphs.

problem Synchronizing higher-order local measurements on hyperedges to global estimates on nodes.
method Message passing algorithm for global synchronization of higher-order measurements.
result Higher-order method outperforms standard pairwise synchronization methods in certain applications.

Higher-order tangent bundles have geometric structures compatible with their iterated bundle structure.

problem Connection towers and Sasaki metrics on higher-order tangent bundles
method Introduce the notion of a connection tower and study the geometric structures induced by such towers.
result Connection towers determine multiconnections, adapted splittings, and canonical vector bundle structures.

Reasoning based on causality, instead of association has been considered as a key ingredient towards real machine intelligence. However, it is a challenging task to infer causal relationship/structure among variables. In recent years, an Independent Mechanism (IM) principle was proposed, stating that the mechanism gene…

2019-09-02abs ↗pdf ↗

We construct new examples of algebraic curvature tensors so that the Jordan normal form of the higher order Jacobi operator is constant on the Grassmannian of subspaces of type (r,s)(r,s) in a vector space of signature (p,q)(p,q). We then use these examples to establish some results concerning higher order Osserman and highe…

2002-05-07abs ↗pdf ↗

State-of-the-art methods in convex and non-convex optimization employ higher-order derivative information, either implicitly or explicitly. We explore the limitations of higher-order optimization and prove that even for convex optimization, a polynomial dependence on the approximation guarantee and higher-order smoothn…

2017-10-27abs ↗pdf ↗

Introduce Collapsed Effective Operators for higher-order structures.

problem Existing spectral operators decompose topology into separate ranks, leaving practitioners to fuse information back to vertices.
method Introduce Collapsed Effective Operators via Schur complementation of a graded Laplacian.
result Preserves positive semi-definiteness, lowers system energy under higher-order connectivity.

Given a closed, oriented, connected 3-manifold, M, we define higher-order linking forms on the higher-order Alexander modules of M. These higher-order linking forms generalize similar linking forms for knots previously studied by the author, which were themselves generalizations of the classical Blanchfield linking for…

2012-04-23abs ↗pdf ↗

A generalized optimistic method for saddle point problems with improved complexity.

problem Solving convex-concave saddle point problems efficiently.
method Proposes a generalized optimistic method that includes the optimistic gradient method as a special case, handling constrained saddle point problems with composite objective functions and arbitrary norms.
result Best-known global iteration complexity bounds for first-, second-, and higher-order methods.

The paper connects higher order risk measures and stochastic dominance, showing their equivalence and integrating them with optimization.

problem Comparing and characterizing random outcomes in risk assessment.
method Exploring the equivalence between higher order risk measures and stochastic dominance, using stochastic optimization and expectiles as examples.
result Higher order risk measures and stochastic dominance are equivalent and can be used to characterize random outcomes.

New estimator stabilizes higher-order influence functions for stable statistical inference.

problem Numerical instability in estimating inverse population Gram matrix.
method Proposes a new stabilized higher-order estimator without sample splitting.
result Stabilized estimator exhibits more stable performance and similar statistical guarantees.

This work explores higher-order algebroids via vector bundle comorphisms.

problem Generalizing concepts of higher-order tangent bundles and Lie algebroids.
method Introduces a vector bundle comorphism approach to describe higher-order algebroids.
result Establishes a one-to-one correspondence between higher-order Lie algebroids and specific algebraic structures.

New estimator stabilizes higher-order influence functions for bilinear forms.

problem Stability issues in estimating bilinear forms using higher-order influence functions.
method Proposes a new stabilized higher-order estimator for a class of bilinear forms without sample splitting.
result New estimator exhibits more stable finite-sample performance compared to the empirical higher-order estimator.

We present a geometric approach to the field theory with higher order anisotropic interactions. The concepts of higher order space, or locally anisotropic, space (in brief, h-space, or la-space) are introduced as general ones for various types of higher order extensions of Lagrange and Finsler geometry and higher dimen…

1996-11-09abs ↗pdf ↗