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

124248372496 · May 202619922001200920172026
48 results for Higher-order structures

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.

GUIDE detects anomalies in attributed networks by reconstructing node attributes and higher-order structures.

problem Lack of effective mechanisms for detecting anomalies in complex network interactions.
method GUIDE uses attribute and structure autoencoders, graph attention, and reconstruction errors to identify anomalies.
result GUIDE significantly outperforms state-of-the-art methods on multiple real-world datasets.

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.

Networks provide a powerful formalism for modeling complex systems by using a model of pairwise interactions. But much of the structure within these systems involves interactions that take place among more than two nodes at once; for example, communication within a group rather than person-to person, collaboration amon…

2018-02-20abs ↗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 ↗

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.

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.

We present an introduction to the geometry of higher order vector and co--vector bundles (including higher order generalizations of the Finsler geometry and Kaluza--Klein gravity) and review the basic results on Clifford and spinor structures on spaces with generic local anisotropy modeled by higher order nonlinear con…

2002-05-17abs ↗pdf ↗

Extends causal additive models to include higher-order interactions.

problem Inferring causal insights from data with higher-order mechanisms.
method Introduces directed acyclic hypergraphs to represent higher-order interactions in causal structure learning.
result Learning more complex hypergraphs can lead to better empirical results.

H-GAT improves stock selection by capturing complex higher-order stock relations and integrating both technical and fundamental analysis.

problem Stock selection difficulty and lack of comprehensive analysis.
method Higher-order Graph Attention Network (H-GAT) that incorporates both technical and fundamental analysis.
result H-GAT outperforms existing methods in stock selection metrics.

Study quantifies how LLMs capture higher-order statistical structure using cumulant expansion.

problem Understanding how LLMs internalize statistical structure during next-token prediction.
method Cumulant-expansion framework treating softmax entropy as perturbation around center distribution.
result Cumulants reveal distinct signatures for mathematical vs. general text prompts, quantifying feature-learning dynamics.

In this paper we derive the symplectic framework for field theories defined by higher-order Lagrangians. The construction is based on the symplectic reduction of suitable spaces of iterated jets. The possibility of reducing a higher-order system of PDEs to a constrained first-order one, the symplectic structures natura…

2014-08-09abs ↗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 ↗

We introduce nonlinear higher-order label spreading for semi-supervised learning.

problem Efficient semi-supervised learning on graphs with complex label spreading.
method We add nonlinearity to label spreading through higher-order graph structures, proving convergence and demonstrating efficiency on various datasets.
result Our nonlinear higher-order label spreading algorithm converges to the global solution and performs favorably compared to classical methods.

This paper describes a general framework for learning Higher-Order Network Embeddings (HONE) from graph data based on network motifs. The HONE framework is highly expressive and flexible with many interchangeable components. The experimental results demonstrate the effectiveness of learning higher-order network represe…

2018-01-28abs ↗pdf ↗

We compare two ways of interpreting higher order connections. The geometric approach lies in the decomposition of higher order tangent space into the horizontal and vertical structures while the jet--like approach considers a higher order connection as the section of a jet prolongation of a fibered manifold. Particular…

2012-06-25abs ↗pdf ↗

Paper introduces models to discover complex structures in large hypergraphs.

problem Understanding dependency structures in complex systems represented as hypergraphs.
method Probabilistic models treating classes of similar units as nodes in a latent hypergraph, using low-rank representations.
result Improves link prediction and discovers interpretable structures in diverse real-world systems.

Paper proposes a new method to identify causal graphs with latent variables using higher-order cumulants.

problem Estimating causal directed acyclic graphs with latent confounders.
method Uses higher-order cumulants to identify causal structures among observed and latent variables.
result Validates the proposed algorithm through simulations and real-world data.

It is shown that the non-trivial cocycles on simple Lie algebras may be used to introduce antisymmetric multibrackets which lead to higher-order Lie algebras, the definition of which is given. Their generalised Jacobi identities turn out to be satisfied by the antisymmetric tensors (or higher-order `structure constants…

1996-05-30abs ↗pdf ↗

Bayesian method detects mesoscale structures in pathway data networks.

problem Mesoscale structures in pathway data networks are hard to detect due to dependencies between interactions.
method Bayesian approach modeling optimal partitioning and higher-order dynamics.
result Method can recover both proximity-based and role-based groupings of nodes.

The work proposes a geometric background of the theory of field interactions and strings in spaces with higher order anisotropy. Our approach proceeds by developing the concept of higher order anisotropic superspace which unifies the logical and mathematical aspects of modern Kaluza-Klein theories and generalized Lagra…

1996-11-06abs ↗pdf ↗

This article presents the further steps of the previously done studies taking into consideration the k-th order extensions of a complex manifold. In the previous studies higher order vertical and complete lifts of structures on the complex manifold were introduced. Presently, k-th extended spaces of a product manifold …

2009-02-28abs ↗pdf ↗

Tutorials on signal processing on higher-order networks like simplicial complexes and hypergraphs.

problem Processing complex data structures with polyadic relationships.
method Introduction to simplicial complexes and hypergraphs, Fourier analysis, signal denoising, interpolation, embeddings, neural networks.
result Multi-relational operators like the Hodge Laplacian for simplicial complexes and tensor representations for hypergraphs.

HyperBERT enhances BERT for node classification on text-attributed hypergraphs.

problem Challenges in capturing hypergraph structure and text attributes in node classification.
method Mixing hypergraph-aware layers with BERT for improved node classification.
result HyperBERT achieves state-of-the-art results on text-attributed hypergraph benchmarks.

We define the higher-order Alexander modules An,i(U)A_{n,i}(\mathcal{U}) and higher-order degrees δn,i(U)δ_{n,i}(\mathcal{U}) which are invariants of a complex hypersurface complement U\mathcal{U}. These invariants come from the module structure of the homology of certain solvable covers of the hypersurface complement. Such inv…

2015-10-12abs ↗pdf ↗

Graph Convolution Network (GCN) has been recognized as one of the most effective graph models for semi-supervised learning, but it extracts merely the first-order or few-order neighborhood information through information propagation, which suffers performance drop-off for deeper structure. Existing approaches that deal…

2019-11-11abs ↗pdf ↗

Representation learning on networks offers a powerful alternative to the oft painstaking process of manual feature engineering, and as a result, has enjoyed considerable success in recent years. However, all the existing representation learning methods are based on the first-order network (FON), that is, the network th…

2019-08-15abs ↗pdf ↗

Introduces P-tensors for generalized higher-order message passing in graph neural networks.

problem Expanding the expressive power of graph neural networks through higher-order structures.
method Introduces P-tensors to define the most general form of permutation equivariant message passing.
result Achieves state-of-the-art performance on molecular datasets.

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 ↗

We present an introduction to the geometry of higher order vector and co-vector bundles (including higher order generalizations of the Finsler geometry and Kaluza--Klein gravity) and review the basic results on Clifford and spinor structures on spaces with generic local anisotropy modeled by anholonomic frames with ass…

2004-06-28abs ↗pdf ↗

New method uses information theory to uncover causal relationships in complex systems.

problem Discovering causal relationships in multivariate systems, especially in Bayesian networks and hypergraphs.
method Partial Information Decomposition (PID) to explicitly model higher-order interactions.
result PID components reveal direct causal neighbors and collider relationships in Bayesian networks and multi-tail hyperedges in causal hypergraphs.

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.

New method finds open subsets with trivial holonomy for certain geometries.

problem Finding open subsets with trivial holonomy for Cartan geometries.
method Analyzing the behavior of isotropies in model geometries to generalize properties of isolated higher-order fixed points.
result Existence of open subsets with trivial holonomy for Cartan geometries with certain isotropies.

Networks are a natural representation of complex systems across the sciences, and higher-order dependencies are central to the understanding and modeling of these systems. However, in many practical applications such as online social networks, networks are massive, dynamic, and naturally streaming, where pairwise inter…

2019-08-02abs ↗pdf ↗

Generative model for hypergraph clustering improves detection of higher-order structure.

problem Detecting clusters in complex relational systems modeled as hypergraphs.
method Poisson degree-corrected hypergraph stochastic blockmodel (DCHSBM) and Louvain-type algorithms.
result AON hypergraph Louvain algorithm efficiently detects higher-order structure in large hypergraphs.

A framework infers hyperedges and overlapping communities in hypergraphs.

problem Characterizing the structural organization of hypergraphs with higher-order interactions.
method Statistical inference to infer missing hyperedges and detect overlapping communities.
result Efficient numerical implementation and strong performance on real-world systems.

In recent years, graph neural networks (GNNs) have emerged as a powerful neural architecture to learn vector representations of nodes and graphs in a supervised, end-to-end fashion. Up to now, GNNs have only been evaluated empirically -- showing promising results. The following work investigates GNNs from a theoretical…

2018-10-04abs ↗pdf ↗

New method combines hypergraph structure and node attributes for better community detection.

problem Improving community detection in hypergraphs with node attributes.
method Developed a principled model that learns from data to combine higher-order interactions and node attributes.
result Strong performance in hyperedge prediction and community detection, especially when attributes are informative.

We define new higher-order Alexander modules An(C)\mathcal{A}_n(C) and higher-order degrees δn(C)δ_n(C) which are invariants of the algebraic planar curve CC. These come from analyzing the module structure of the homology of certain solvable covers of the complement of the curve CC. These invariants are in the spirit of th…

2005-09-21abs ↗pdf ↗