New model estimates higher-order interactions in stochastic processes using lower-dimensional projections.
problem Estimating higher-order interaction effects in stochastic processes with limited data.
method Additive Poisson Process (APP) combines information geometry and generalized additive models to model intensity functions in lower dimensions.
result The model can estimate higher-order intensity functions with sparse data.
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.
Method provides formal guarantees for decomposing model uncertainty.
problem Decomposing model uncertainty into aleatoric and epistemic components.
method Higher-order calibration using k-snapshots.
result Formal guarantees for aleatoric uncertainty matching real-world distribution.
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…
Hierarchical probabilistic models are able to use a large number of parameters to create a model with a high representation power. However, it is well known that increasing the number of parameters also increases the complexity of the model which leads to a bias-variance trade-off. Although it is a classical problem, t…
Topo-MLP learns network representations without message passing.
problem Lack of efficient higher-order network modeling methods.
method Proposes Topo-MLP, a simplicial neural network algorithm using MLP and HONC loss.
result Demonstrates improved robustness and efficiency in representation learning.
GENIE accelerates DDM synthesis with higher-order solvers.
problem Efficiently solving the differential equation for high-quality generation.
method Higher-order Taylor methods, utilizing Jacobian-vector products.
result GENIE significantly accelerates synthesis compared to previous solvers.
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…
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.
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.
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.
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…
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.
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.
A new method for higher-order co-occurrences in hypergraphs.
problem Computing higher-order co-occurrences in hypergraphs.
method Face-splitting product or transpose Khatri-Rao product for higher order tuple co-occurrences.
result Demonstrates the utility of the higher order co-occurrence tensor in NLP and hypergraph models.
Users form information trails as they browse the web, checkin with a geolocation, rate items, or consume media. A common problem is to predict what a user might do next for the purposes of guidance, recommendation, or prefetching. First-order and higher-order Markov chains have been widely used methods to study such se…
New neural networks model complex phenomena with fewer parameters.
problem Challenges in studying higher-order interactions in neural networks.
method Introducing curved neural networks using the maximum entropy principle.
result Curved neural networks accelerate memory retrieval and exhibit explosive phase transitions.
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…
Estimates hypergraphons for modeling complex interactions efficiently.
problem Modeling higher-order interactions using hypergraphons.
method Restricted class of Simple Lipschitz Hypergraphons (SLH) for efficient estimation.
result Optimal rates of convergence for SLH estimator.
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.
The paper identifies causal effects in latent variable models using higher-order cumulants.
problem Challenges in identifying causal effects in latent variable models with latent confounders.
method Using higher-order cumulants, the paper addresses two challenging setups: a single proxy variable and underspecified instrumental variables.
result Causal effects are identifiable with a single proxy or instrument.
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.
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.
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…
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…
With higher-order neighborhood information of graph network, the accuracy of graph representation learning classification can be significantly improved. However, the current higher order graph convolutional network has a large number of parameters and high computational complexity. Therefore, we propose a Hybrid Lower …
Stability of capillary hypersurfaces with higher order mean curvature.
problem Stability of capillary hypersurfaces with constant higher order mean curvature.
method Generalization of classical stability theory for capillary hypersurfaces.
result Results on stability for capillary hypersurfaces with higher order mean curvature.
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.
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.
We consider higher-order linear-chain conditional random fields (HO-LC-CRFs) for sequence modelling, and use sum-product networks (SPNs) for representing higher-order input- and output-dependent factors. SPNs are a recently introduced class of deep models for which exact and efficient inference can be performed. By com…
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…
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.
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…
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.
The paper improves CR Sobolev inequalities and classifies minimizers.
problem Higher-order CR Sobolev inequalities on the CR sphere.
method Improvement through vanishing higher order moments of the volume element.
result New direct proof of minimizers' classification and existence of minimizers in C2k(N). Diffusion models learn simple statistics before complex ones, revealing a sample complexity exponent.
problem Understanding the learning dynamics of diffusion models.
method Empirical observations and theoretical analysis of diffusion models and denoisers.
result Diffusion models learn simple statistics (pair-wise correlations) at linear sample complexity, while higher-order statistics (e.g., fourth cumulant) require cubic sample complexity.
Higher-order motif structures and multi-vertex interactions are becoming increasingly important in studies that aim to improve our understanding of functionalities and evolution patterns of networks. To elucidate the role of higher-order structures in community detection problems over complex networks, we introduce the…
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…
We develop a theory of higher-order feature attribution for complex models.
problem Interpreting feature contributions in models with interactions is challenging.
method We extend Integrated Gradients (IG) to higher-order feature attributions.
result We establish natural connections to statistics and topological signal processing.
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…
A general approach to formulation of supergravity in higher order anisotropic superspaces (containing as particular cases different supersymmetric extensions and prolongations of Riemann, Finsler, Lagrange and Kaluza--Klein spaces) is given. We analyze three models of locally anisotropic supergravity.
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…
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.
HOTCAKE compresses CNNs by decomposing kernels into smaller parts.
problem Compressing deep CNNs without significant accuracy loss.
method Input channel decomposition, guided Tucker rank selection, higher order Tucker decomposition, fine-tuning.
result HOTCAKE produces highly compressed CNN models with good accuracy.
Neural network learns from higher-order connections in molecules.
problem Graph neural networks fail to account for local and hidden structures in graphs.
method Developed a neural network that can pass messages and aggregate information across higher-order paths.
result The model improves molecular property prediction.
Enhances stock movement prediction using Higher Order Transformers for multimodal time-series data.
problem Predicting stock movements in financial markets with complex dynamics.
method Introduced Higher Order Transformers, extending self-attention and transformer architecture to capture complex market dynamics. Employed low-rank tensor decomposition and kernel attention to manage computational complexity. Integrated technical and fundamental analysis from historical prices and tweets.
result Demonstrated effectiveness of the method on the Stocknet dataset, improving stock movement prediction.
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.