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

66133199265 · Jun 202019922001200920172026
48 results for higher-order domains

The paper introduces new boundary operators and proves higher order CR Sobolev trace inequalities for Siegel domain and complex ball.

problem Establishing higher order CR Sobolev trace inequalities for Siegel domain and complex ball.
method Introducing conformally covariant boundary operators, proving extension theorems, and establishing trace inequalities.
result Generalized CR Sobolev trace inequalities for all γ ∈ (0, n+1) \mathbb{N}.

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 ↗

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 ↗

We initiate the study of the higher-order Escobar constants Ik(M)I_k(M), k3k\geq 3, on bounded planar domains MM. The Escobar constants IkI_k of the unit disk and a family of polygons are provided.

2019-05-18abs ↗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 ↗

The CGMY model's ATM call-price asymptotics are derived using characteristic function.

problem Deriving short-time asymptotics for the CGMY model's ATM call prices.
method Using the characteristic function, derived short-time asymptotics for the CGMY model's ATM call prices. Extracted higher-order coefficients by dynamic cutoff partitioning.
result Higher-order coefficients are derived for the CGMY model's ATM call prices.

Combines neural networks and probabilistic graphical models for efficient higher-order inference.

problem Lack of efficient higher-order relational information in graph neural networks and probabilistic graphical models.
method Derives efficient approximate sum-product loopy belief propagation for higher-order PGMs, embeds into neural network, proposes methods for constructing higher-order factors.
result Substantially outperforms state-of-the-art k-order graph neural networks in molecular datasets.

We consider the higher order buckling eigenvalues of the following Dirichlet poly-Laplacian in the unit sphere (Δ)pu=Λ(Δ)u(-Δ)^p u=Λ(-Δ) u with order p(2)p(\geq2). We obtain universal bounds on the (k+1)(k+1)th eigenvalue in terms of the first kkth eigenvalues independent of the domains. In particular, for p=2p=2, our result is shar…

2009-08-31abs ↗pdf ↗

Paper develops a new method for solving IBVPs on star-shaped domains.

problem Solving Inverse Boundary Value Problems (IBVP) for parallel transport equations.
method Covariant tomography, integrating geometric decomposition with specific interior extensions.
result Formal solvability criterion for higher-order IBVPs, validated through examples.

Study compares hypergraph and graph-level models for higher-order relational learning.

problem Evaluating effectiveness of hypergraph-level vs. graph-level models in relational learning.
method Systematic evaluation of various hypergraph and graph-level architectures.
result Graph-level models applied to hypergraph expansions outperform hypergraph-level models.

Advances combinatorial complexes for better modeling of hierarchical and set-type relations.

problem Lack of effective modeling for complex hierarchical and set-type relations in high-dimensional data.
method Introduces combinatorial complexes as a bridge between cell complexes and hypergraphs, emphasizing their different types of relations.
result Combining set-type and hierarchical relations in a single model can be advantageous in learning tasks.

Cochran defined the nth-order integral Alexander module of a knot in the three sphere as the first homology group of the knot's (n+1)th-iterated abelian cover. The case n=0 gives the classical Alexander module (and polynomial). After a localization, one can get a finitely presented module over a principal ideal domain,…

2013-03-06abs ↗pdf ↗

Proposes DWMD for better matching of hidden representations across domains.

problem Measuring data distribution discrepancy between semantically related domains for feature representation matching.
method DWMD, a moment-based probability distribution metric that explicitly orders and weights higher-order moments.
result DWMD is error-free and can strictly reflect distribution differences without feature distribution assumptions.

Paper introduces a framework for diagnosing Alzheimer's disease using higher-order topological features from fMRI.

problem Diagnosing Alzheimer's disease using brain network topology.
method Persistent homology to extract higher-order features (cycles, cavities) from fMRI data.
result Framework significantly outperforms existing methods in AD classification.

Study proves spectral determination of triangles and quadrilaterals, with restrictions on higher-order polygons.

problem Determining the geometry of convex polygons from their Steklov spectra.
method Analysis of characteristic polynomial and spectral properties of Steklov spectrum.
result Almost all triangles and certain quadrilaterals are uniquely determined by their Steklov spectra.

Study higher-order spin glass models for social network behavior with peer-group effects.

problem Modeling correlation phenomena on social networks with peer-group effects.
method Inference in higher-order Ising models to recover coefficients and peer-group effects.
result Strong concavity of log pseudo-likelihood implies statistical error rate of sqrt(d/n) for MPLE.

Hybrid LLM and quantum optimization improve CSA collateral management by 9-10%.

problem Finance-native collateral optimization under ISDA CSAs with legal constraints.
method Hybrid pipeline combining LLM, quantum-inspired exploration, and CP-SAT.
result Improves a strong classical baseline by 9.1-10.7% across different scenarios.

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.

Study soap bubbles with almost constant higher-order mean curvature, proving unique limits under certain conditions.

problem Understanding the asymptotic behavior of soap bubbles with almost constant higher-order mean curvature.
method Analyzing sequences of bounded C2C^2-domains in Rn+1 \mathbb{R}^{n+1} converging in volume and perimeter, with kk-th mean curvature functions converging in L1L^1.
result Finite unions of mutually tangent balls are the only possible limits under natural mean convexity and LL^\infty-control on the mean curvature outside a set of vanishing area.

The paper studies elliptic operators on manifolds with boundary.

problem Characterizing boundary conditions for elliptic operators on manifolds.
method Using Calderón projectors and mixed order Sobolev spaces, the paper describes the space of boundary values and characterizes Fredholm and regular realisations.
result Characterization of boundary conditions for elliptic operators leading to Fredholm and regular realisations.

Given a regular bounded domain ΩR2mΩ\subset\R{2m}, we describe the limiting behavior of sequences of solutions to the mean field equation of order 2m2m, m1m\geq 1, (Δ)mu=ρe2muΩe2mudxinΩ,(-Δ)^m u=ρ\frac{e^{2mu}}{\int_Ωe^{2mu}dx}\quad\text{in}Ω, under the Dirichlet boundary condition and the bound 0<ρC0<ρ\leq C. We emphasize the connection wi…

2009-04-21abs ↗pdf ↗

New hypergraph neural network learns variable-sized hyperedges.

problem Learning representations for non-uniform hypergraphs with variable cardinalities.
method Developed a hypergraph neural network exploiting incidence structure.
result Significant improvement in accuracy on real-world hypergraph datasets.

We prove some sharp isoperimetric type inequalities for domains with smooth boundary on Riemannian manifolds. For example, using generalized convexity, we show that among all domains with a lower bound ll for the cut distance and Ricci curvature lower bound (n1)k(n-1)k, the geodesic ball of radius ll in the space form o…

2019-10-05abs ↗pdf ↗

Let E be a natural operator associated to the curvature tensor of a pseudo-Riemannian manifold. This survey article studies when the spectrum, or more generally the real Jordan normal form, of E is constant on the natural domain of definition. It deals with results for the Jacobi operator, the higher order Jacobi opera…

2002-06-12abs ↗pdf ↗

We develop a technique for generalising from data in which models are samplers represented as program text. We establish encouraging empirical results that suggest that Markov chain Monte Carlo probabilistic programming inference techniques coupled with higher-order probabilistic programming languages are now sufficien…

2014-07-09abs ↗pdf ↗

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 ↗

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 ↗

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.

A new framework optimizes model transfer across domains with labeled data.

problem Distributional heterogeneity across domains in multi-source learning.
method Conditional Group Distributionally Robust Optimization (CG-DRO) framework with Mirror Prox algorithm and double machine learning.
result Established fast statistical convergence rates and uniformly valid inference for CG-DRO.

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.