Nonparametric Embeddings of Sparse High-Order Interaction Events

• URL: http://arxiv.org/abs/2207.03639v1
• Date: Fri, 8 Jul 2022 01:25:34 GMT
• Title: Nonparametric Embeddings of Sparse High-Order Interaction Events
• Authors: Zheng Wang, Yiming Xu, Conor Tillinghast, Shibo Li, Akil Narayan, Shandian Zhe
• Abstract summary: High-order interaction events are common in real-world applications. We propose Non Embeddings of Sparse High-order interaction events. We develop an efficient, scalable model inference algorithm.
• Score: 21.758306786651772
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High-order interaction events are common in real-world applications. Learning embeddings that encode the complex relationships of the participants from these events is of great importance in knowledge mining and predictive tasks. Despite the success of existing approaches, e.g. Poisson tensor factorization, they ignore the sparse structure underlying the data, namely the occurred interactions are far less than the possible interactions among all the participants. In this paper, we propose Nonparametric Embeddings of Sparse High-order interaction events (NESH). We hybridize a sparse hypergraph (tensor) process and a matrix Gaussian process to capture both the asymptotic structural sparsity within the interactions and nonlinear temporal relationships between the participants. We prove strong asymptotic bounds (including both a lower and an upper bound) of the sparsity ratio, which reveals the asymptotic properties of the sampled structure. We use batch-normalization, stick-breaking construction, and sparse variational GP approximations to develop an efficient, scalable model inference algorithm. We demonstrate the advantage of our approach in several real-world applications.

Related papers

• Interaction Event Forecasting in Multi-Relational Recursive HyperGraphs: A Temporal Point Process Approach [12.142292322071299]
  This work addresses the problem of forecasting higher-order interaction events in multi-relational recursive hypergraphs. The proposed model, textitRelational Recursive Hyperedge Temporal Point Process (RRHyperTPP), uses an encoder that learns a dynamic node representation based on the historical interaction patterns. We have experimentally shown that our models perform better than previous state-of-the-art methods for interaction forecasting.
  arXiv  Detail & Related papers  (2024-04-27T15:46:54Z)
• Multi-Agent Dynamic Relational Reasoning for Social Robot Navigation [50.01551945190676]
  Social robot navigation can be helpful in various contexts of daily life but requires safe human-robot interactions and efficient trajectory planning. We propose a systematic relational reasoning approach with explicit inference of the underlying dynamically evolving relational structures. We demonstrate its effectiveness for multi-agent trajectory prediction and social robot navigation.
  arXiv  Detail & Related papers  (2024-01-22T18:58:22Z)
• Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
  We show that semantic correlations between relations are inherently edge-level and entity-independent. We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations. To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
  arXiv  Detail & Related papers  (2023-09-20T08:11:58Z)
• Interaction Measures, Partition Lattices and Kernel Tests for High-Order Interactions [1.9457612782595313]
  Non-trivial dependencies between groups of more than two variables can play a significant role in the analysis and modelling of such systems. We introduce a hierarchy of $d$-order ($d geq 2$) interaction measures, increasingly inclusive of possible factorisations of the joint probability distribution. We also establish mathematical links with lattice theory, which elucidate the derivation of the interaction measures and their composite permutation tests.
  arXiv  Detail & Related papers  (2023-06-01T16:59:37Z)
• Collective Relational Inference for learning heterogeneous interactions [8.215734914005845]
  We propose a novel probabilistic method for relational inference, which possesses two distinctive characteristics compared to existing methods. We evaluate the proposed methodology across several benchmark datasets and demonstrate that it outperforms existing methods in accurately inferring interaction types. Overall the proposed model is data-efficient and generalizable to large systems when trained on smaller ones.
  arXiv  Detail & Related papers  (2023-04-30T19:45:04Z)
• IPCC-TP: Utilizing Incremental Pearson Correlation Coefficient for Joint Multi-Agent Trajectory Prediction [73.25645602768158]
  IPCC-TP is a novel relevance-aware module based on Incremental Pearson Correlation Coefficient to improve multi-agent interaction modeling. Our module can be conveniently embedded into existing multi-agent prediction methods to extend original motion distribution decoders.
  arXiv  Detail & Related papers  (2023-03-01T15:16:56Z)
• Deep Architecture Connectivity Matters for Its Convergence: A Fine-Grained Analysis [94.64007376939735]
  We theoretically characterize the impact of connectivity patterns on the convergence of deep neural networks (DNNs) under gradient descent training. We show that by a simple filtration on "unpromising" connectivity patterns, we can trim down the number of models to evaluate.
  arXiv  Detail & Related papers  (2022-05-11T17:43:54Z)
• Principled inference of hyperedges and overlapping communities in hypergraphs [0.0]
  We propose a framework based on statistical inference to characterize the structural organization of hypergraphs. We show strong performance in hyperedge prediction tasks, detecting communities well aligned with the information carried by interactions, and robustness against addition of noisy hyperedges.
  arXiv  Detail & Related papers  (2022-04-12T09:13:46Z)
• Unlimited Neighborhood Interaction for Heterogeneous Trajectory Prediction [97.40338982628094]
  We propose a simple yet effective Unlimited Neighborhood Interaction Network (UNIN) which predicts trajectories of heterogeneous agents in multiply categories. Specifically, the proposed unlimited neighborhood interaction module generates the fused-features of all agents involved in an interaction simultaneously. A hierarchical graph attention module is proposed to obtain category-tocategory interaction and agent-to-agent interaction.
  arXiv  Detail & Related papers  (2021-07-31T13:36:04Z)
• Joint Constrained Learning for Event-Event Relation Extraction [94.3499255880101]
  We propose a joint constrained learning framework for modeling event-event relations. Specifically, the framework enforces logical constraints within and across multiple temporal and subevent relations. We show that our joint constrained learning approach effectively compensates for the lack of jointly labeled data.
  arXiv  Detail & Related papers  (2020-10-13T22:45:28Z)
• Efficient Inference of Flexible Interaction in Spiking-neuron Networks [41.83710212492543]
  We use the nonlinear Hawkes process to model excitatory or inhibitory interactions among neurons. We show our algorithm can estimate the temporal dynamics of interaction and reveal the interpretable functional connectivity underlying neural spike trains.
  arXiv  Detail & Related papers  (2020-06-23T09:10:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.