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,657 papers · 148 categories

Trend · papers per month

2515037541,005 · Jun 202019922001200920172026
48 results for hypergraph neural network

Paper introduces a noise-robust classification method using hypergraph neural networks.

problem Noisy label learning problem in image datasets.
method PCA for dimensionality reduction, then applies graph-based semi-supervised learning methods including hypergraph neural network.
result Our proposed hypergraph neural network achieves the best performance when noise level increases.

Recently, graph neural networks have attracted great attention and achieved prominent performance in various research fields. Most of those algorithms have assumed pairwise relationships of objects of interest. However, in many real applications, the relationships between objects are in higher-order, beyond a pairwise …

2019-01-23abs ↗pdf ↗

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.

Sparse hypergraph neural networks improve reasoning in large knowledge graphs.

problem Reasoning about relationships in large, real-world domains using sparse and local inferences.
method Sparse and local hypergraph neural networks (SpaLoc) exploiting relational inferences that are usually local and sparse.
result State-of-the-art performance on real-world knowledge graph reasoning benchmarks.

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.

In this paper, we present a hypergraph neural networks (HGNN) framework for data representation learning, which can encode high-order data correlation in a hypergraph structure. Confronting the challenges of learning representation for complex data in real practice, we propose to incorporate such data structure in a hy…

2018-09-25abs ↗pdf ↗

Study on HyperGNNs' expressiveness and structural generalization.

problem Understanding HyperGNNs' ability to solve graph problems and generalize to larger graphs.
method Fine-grained analysis of expressiveness and learning properties, with theoretical and empirical support.
result HyperGNNs can solve a hierarchy of graph problems defined by hyperparameters.

New method detects communities in hypergraphs by embedding them into a vector space.

problem Detecting communities in hypergraphs with multi-way interactions.
method Augmenting non-uniform hypergraphs, embedding into a vector space, using an alternative updating scheme.
result Asymptotic consistencies in community detection and hypergraph estimation established.

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.

Perfect clustering achieved in hypergraphs with enough interactions.

problem Complexity and lack of tractable models for analyzing hypergraphs.
method Introduced an interaction hypergraph model for analyzing hypergraphs, defined latent embeddings, and analyzed spectral estimators.
result A spectral estimate of interaction latent positions can achieve perfect clustering with enough interactions.

Develops numerical methods for PDEs on hypergraphs and networks.

problem Solving PDEs on complex geometric structures like hypergraphs and networks.
method Hybrid finite element methods, focusing on hybrid discontinuous Galerkin methods.
result Derives numerical approximations for PDEs on hypergraphs and networks.

During the last two decades, we easilly see that the World Wide Web's link structure is modeled as the directed graph. In this paper, we will model the World Wide Web's link structure as the directed hypergraph. Moreover, we will develop the PageRank algorithm for this directed hypergraph. Due to the lack of the World …

2019-08-29abs ↗pdf ↗

HyperSAGE learns node representations in hypergraphs without losing information.

problem Learning node representations in hypergraphs is complex due to higher-order relations.
method Two-level neural message passing strategy for accurate information propagation.
result HyperSAGE outperforms state-of-the-art methods on benchmark datasets.

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.

HYVINT generates hypergraphs with intensity-driven incidence formation and variational learning.

problem Challenges in generating hypergraphs with mechanistic interpretation and limited latent space.
method HYVINT uses intensity-driven incidence formation and a lower-bound variational estimator for latent representations.
result HYVINT achieves strong fidelity and novelty on synthetic and real-world hypergraphs.

In this article we show the duality between tensor networks and undirected graphical models with discrete variables. We study tensor networks on hypergraphs, which we call tensor hypernetworks. We show that the tensor hypernetwork on a hypergraph exactly corresponds to the graphical model given by the dual hypergraph. …

2017-10-04abs ↗pdf ↗

HLRC offers a new curvature metric for hypergraphs that balances interpretability and efficiency.

problem Challenges in geometric characterization of hypergraphs with higher-order interactions.
method Hypergraph lower Ricci curvature (HLRC) defined in closed form.
result HLRC consistently reveals meaningful higher-order organization in diverse hypergraph datasets.

A method for trust evaluation of devices in human-device coexistence systems.

problem Efficient trust evaluation of devices in systems with diverse physical and social attributes.
method Canonical correlation analysis-enhanced hypergraph self-supervised learning (HSLCCA).
result The proposed HSLCCA method significantly outperforms baseline algorithms in identifying trusted devices.

The Conant-Ashby theorem is verified for hypergraph observers, leading to unique learning rules.

problem Verifying conditions for hypergraph observers to maintain internal models.
method Formalizing persistent observers, applying the Conant-Ashby theorem, and using natural gradient descent.
result Natural gradient descent is the unique admissible learning rule for hypergraph observers.

Biological and cellular systems are often modeled as graphs in which vertices represent objects of interest (genes, proteins, drugs) and edges represent relational ties among these objects (binds-to, interacts-with, regulates). This approach has been highly successful owing to the theory, methodology and software that …

2017-03-14abs ↗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.

The paper studies inference in hypergraph β-models with multiple layers.

problem Estimating and testing in hypergraph β-models with degree heterogeneity.
method Maximum likelihood estimation and likelihood ratio test for hypergraph β-models with multiple layers.
result The ML estimate and LR test are optimally powerful under the null hypothesis.

Hypergraph partitioning is an important problem in machine learning, computer vision and network analytics. A widely used method for hypergraph partitioning relies on minimizing a normalized sum of the costs of partitioning hyperedges across clusters. Algorithmic solutions based on this approach assume that different p…

2017-09-05abs ↗pdf ↗

Paper studies community detection in censored hypergraphs using information theory.

problem Community detection in censored hypergraphs with missing values.
method Information-theoretic approach, polynomial-time algorithm, spectral algorithm with refinement.
result Derives information-theoretic threshold for exact recovery of community structure.

Most network-based protein (or gene) function prediction methods are based on the assumption that the labels of two adjacent proteins in the network are likely to be the same. However, assuming the pairwise relationship between proteins or genes is not complete, the information a group of genes that show very similar p…

2012-12-03abs ↗pdf ↗

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.

Clustering on hypergraphs has been garnering increased attention with potential applications in network analysis, VLSI design and computer vision, among others. In this work, we generalize the framework of modularity maximization for clustering on hypergraphs. To this end, we introduce a hypergraph null model, analogou…

2018-12-28abs ↗pdf ↗

Spectral algorithm recovers community structure in sparse hypergraphs.

problem Community detection in sparse random hypergraphs with community structure and higher-order interactions.
method Spectral algorithm with three steps: hyperedge selection, spectral partition, and correction/merging.
result Weak consistency achieved for weak signal-to-noise ratio.

In various application areas, networked data is collected by measuring interactions involving some specific set of core nodes. This results in a network dataset containing the core nodes along with a potentially much larger set of fringe nodes that all have at least one interaction with a core node. In many settings, t…

2019-05-14abs ↗pdf ↗

Hypergraphs allow one to encode higher-order relationships in data and are thus a very flexible modeling tool. Current learning methods are either based on approximations of the hypergraphs via graphs or on tensor methods which are only applicable under special conditions. In this paper, we present a new learning frame…

2013-12-18abs ↗pdf ↗

Many problems in machine learning can be cast as learning functions from sets to graphs, or more generally to hypergraphs; in short, Set2Graph functions. Examples include clustering, learning vertex and edge features on graphs, and learning features on triplets in a collection. A natural approach for building Set2Graph…

2020-02-20abs ↗pdf ↗

Develops a Markov Random Field model for hypergraphs to improve machine learning tasks.

problem Modeling data generation processes on hypergraphs for better machine learning.
method Hypergraph Markov Random Field model using multivariate Gaussian distribution.
result Proposed model enhances algorithm design and outperforms existing methods in structure inference and node classification.