HIRM models noisy, sparse, heterogeneous relational data using hierarchical clustering and Dirichlet processes.
problem Modeling noisy, sparse, and heterogeneous relational data.
method Hierarchical Chinese restaurant process and Dirichlet process mixture for clustering and modeling relation values.
result HIRM generalizes standard models and discovers relational structure in real-world datasets.
RelEx explains relational models without gradient access.
problem Lack of explainability for relational models like GNNs and SRL.
method Model-agnostic explainer for relational models using only outputs.
result Comparable or better performance compared to GNN-Explainer.
R-SQAIR adds relational bias to sequential object attention models for better object interactions.
problem Traditional sequential multi-object attention models struggle with relational inferences.
method Proposes R-SQAIR, a relational extension of SQAIR with a parallel pairwise interaction module.
result Demonstrates gains in object relations and combinatorial generalization over sequential mechanisms.
Method learns relational features for Gaifman models from knowledge bases.
problem Structure learning for Gaifman models.
method Relational tree distances to learn relational features.
result Empirical evaluation shows superiority over classical rule-learning.
Introduces Relational Privacy (RP) to control relation memorization in question answering models.
problem Relation memorization in question answering models can lead to privacy issues.
method Formalizes Relational Privacy (RP) and Differential Relational Privacy (DrP), providing bounds on relation memorization.
result DrP allows effective learning of general properties of underlying concepts while preventing relation memorization.
A new model improves relation extraction accuracy through relation-gated adversarial learning.
problem Relation extraction from sentences is challenging due to expensive human annotation and noisy distant supervision.
method Proposes relation-gated adversarial learning for relation extraction, extending domain adaptation methods.
result The model outperforms previous domain adaptation methods and improves accuracy of distance supervised relation extraction.
Relational Structural Causal Models enable causal reasoning about unseen object combinations.
problem Developing a model that can reason about causal and combinatorial aspects of unseen object combinations.
method Relational Structural Causal Models extend structural causal models to include relational variables and define identification criteria.
result Proposed relational neural causal models outperform non-relational baselines on simulated traffic scenes.
Python library for boosting statistical relational models.
problem Expressing learning and inference problems in statistical relational models.
method Adapting scikit-learn interface for boosted statistical relational models.
result Provides examples for using srlearn.
HighwayGraph models long-distance node relations in GNNs with improved performance.
problem Limited-layer information propagation in GNNs hinders long-distance node relation modeling.
method Proposes two solutions: implicit and explicit modeling of long-distance node relations using shallow GNN architectures and a self-training framework.
result HighwayGraph achieves consistent and significant improvements over four GNNs on three benchmark datasets.
This work proposes a method to compose visual relations more faithfully.
problem Composing relations between objects in images is challenging due to their entanglement.
method Represent each relation as an unnormalized density (energy-based model) to compose relations factorizedly.
result The proposed method generates and edits scenes with multiple sets of relations more faithfully.
Improves neural relational inference for dynamic multi-agent trajectories.
problem Limited accuracy of NRI in short output sequences for relational inference in multi-agent trajectories.
method Proposes DYnamic multi-AgentRelational Inference (DYARI) model to handle changing interactions over time.
result DYARI model outperforms NRI in dynamic relational inference tasks.
In many supervised learning tasks, the entities to be labeled are related to each other in complex ways and their labels are not independent. For example, in hypertext classification, the labels of linked pages are highly correlated. A standard approach is to classify each entity independently, ignoring the correlation…
The paper extends graph embedding models to handle multiple relations.
problem Link prediction in multi-relational networks.
method Generalized pseudo-Riemannian embedding models to multi-relational networks, considering relations as submanifolds.
result Validation of the approach in link prediction tasks, including knowledge graph completion and biological domain analysis.
Existing relation classification methods that rely on distant supervision assume that a bag of sentences mentioning an entity pair are all describing a relation for the entity pair. Such methods, performing classification at the bag level, cannot identify the mapping between a relation and a sentence, and largely suffe…
We investigate Relational Graph Attention Networks, a class of models that extends non-relational graph attention mechanisms to incorporate relational information, opening up these methods to a wider variety of problems. A thorough evaluation of these models is performed, and comparisons are made against established be…
Develops a fair relational model learning algorithm.
problem Fairness in machine learning models for relational data.
method Fair-A3SL, a fairness-aware structure learning algorithm for relational structures.
result Demonstrates effectiveness in learning fair, interpretable, and expressive structures.
CURE extracts relations without supervision by clustering similar entity pairs.
problem Extracting relations unsupervised without considering sentence correlations.
method CURE uses Encoder-Decoder architecture for self-supervised learning and clustering similar relations.
result CURE outperforms state-of-the-art models on NYT and UNPC datasets.
ProbE model improves relational implication detection to 0.8143.
problem Improving inference of relational data to extract more useful information.
method Formal probabilistic model of relational implication using estimators based on empirical distribution.
result ProbE model outperforms existing approaches, achieving 0.8143 AUC on evaluation dataset.
Proposes a new tensor factorization model for better link prediction in knowledge graphs.
problem Lack of information in treating missing and non-existing relations equally in tensor factorization models.
method Introduces a binary tensor factorization model with probit link to address the issue.
result Shows improved prediction accuracy and interpretability compared to existing models.
Paper uses AC-GAN to generate high-quality relational sentences for relation extraction.
problem Limited training data for relation extraction models.
method Auxiliary Classifier Generative Adversarial Networks (AC-GANs).
result Significantly improved performance of relation extraction.
This paper characterizes projective models in statistical relational learning.
problem Projectivity in statistical relational models is beneficial for inference and learning.
method Representation theorems for infinite exchangeable arrays to characterize projective models.
result A class of directed graphical latent variable models correspond to projective relational models.
Hi-RES framework extracts medical relations from articles and EHRs.
problem Manual annotation bottleneck in relation extraction.
method Labeling sentences, creating improved negative samples, using pretrained language models, and combining EHR embeddings.
result Significant accuracy increases in relation extraction, up to 0.998 for disorder-location relations.
Transformers model contextual relations using probabilistic measures, revealing their expressive power.
problem Lack of clear understanding of Transformer's ability to model contextual relations.
method Introduced a measure-theoretic framework connecting softmax attention and entropy-regularized optimal transport.
result Transformer architectures can approximate arbitrary contextual relations, and the choice of normalization affects how these relations are represented.
We propose the Relational Tucker3 (RT) decomposition for multi-relational link prediction in knowledge graphs. We show that many existing knowledge graph embedding models are special cases of the RT decomposition with certain predefined sparsity patterns in its components. In contrast to these prior models, RT decouple…
Hybrid continuous-discrete models naturally represent many real-world applications in robotics, finance, and environmental engineering. Inference with large-scale models is challenging because relational structures deteriorate rapidly during inference with observations. The main contribution of this paper is an efficie…
Attention-based embeddings improve relation prediction in incomplete KGs.
problem Incomplete or missing relations in knowledge graphs.
method Attention-based feature embedding that captures entity and relation features in local neighborhoods.
result Marked performance gains on all datasets compared to state-of-the-art methods.
Temporal networks are ubiquitous and evolve over time by the addition, deletion, and changing of links, nodes, and attributes. Although many relational datasets contain temporal information, the majority of existing techniques in relational learning focus on static snapshots and ignore the temporal dynamics. We propose…
We study the problem of learning representations of entities and relations in knowledge graphs for predicting missing links. The success of such a task heavily relies on the ability of modeling and inferring the patterns of (or between) the relations. In this paper, we present a new approach for knowledge graph embeddi…
HARMLESS meta-learning method models short event sequences with relational information.
problem Learning heterogeneous point process models from short event sequence data.
method Hierarchical Bayesian mixture Hawkes process model with stochastic variational meta expectation maximization.
result HARMLESS outperforms existing methods in predicting future events.
Paper proposes a novel model to improve n-ary cross-sentence relation extraction by addressing noisy data and non-consecutive sentences.
problem Noisy labeled data and non-consecutive sentences in n-ary cross-sentence relation extraction.
method Two-level agent reinforcement learning model and hybrid attention mechanism/PCNN approach.
result The model reduces the impact of noisy data and achieves better performance.
Enhances social spam detection using multi-level dependency of relational sequences.
problem Social spam detection in multi-relation social networks.
method Developed the Multi-level Dependency Model (MDM) to exploit long-term and short-term dependencies in user relational sequences.
result MDM improves social spam detection accuracy on a real-world multi-relational social network.
Method discovers nonlinear relations from time series data.
problem Identifying directional relations from nonlinear interactions in time series.
method Minimum predictive information regularization method for deep learning.
result Substantially outperforms other methods for learning nonlinear relations.
Statistical relational AI (StarAI) aims at reasoning and learning in noisy domains described in terms of objects and relationships by combining probability with first-order logic. With huge advances in deep learning in the current years, combining deep networks with first-order logic has been the focus of several recen…
Hyperbolic embeddings have recently gained attention in machine learning due to their ability to represent hierarchical data more accurately and succinctly than their Euclidean analogues. However, multi-relational knowledge graphs often exhibit multiple simultaneous hierarchies, which current hyperbolic models do not c…
This paper presents a novel latent variable recurrent neural network architecture for jointly modeling sequences of words and (possibly latent) discourse relations between adjacent sentences. A recurrent neural network generates individual words, thus reaping the benefits of discriminatively-trained vector representati…
This paper proposes an attention module augmented relational network called SARN(Sequential Attention Relational Network) that can carry out relational reasoning by extracting reference objects and making efficient pairing between objects. SARN greatly reduces the computational and memory requirements of the relational…
The study categorizes knowledge graph relations and explains their embedding representations.
problem Understanding how knowledge graph relation representations capture semantic information.
method Categorizing knowledge graph relations into three types and deriving explicit requirements for their representations.
result Empirical properties of relation representations and the performance of methods are justified by the analysis.
TGG improves zero-shot and few-shot learning by explicitly modeling and utilizing seen-unseen domain relations.
problem Lack of data in unseen domains hinders generalization in zero-shot and few-shot learning.
method TGG generates explicit instance-level graphs to model and utilize seen-unseen domain relations, addressing domain shift.
result TGG outperforms existing methods in zero-shot, generalized zero-shot, and few-shot learning.
We propose Macau, a powerful and flexible Bayesian factorization method for heterogeneous data. Our model can factorize any set of entities and relations that can be represented by a relational model, including tensors and also multiple relations for each entity. Macau can also incorporate side information, specificall…
Multi-label network classification is a well-known task that is being used in a wide variety of web-based and non-web-based domains. It can be formalized as a multi-relational learning task for predicting nodes labels based on their relations within the network. In sparse networks, this prediction task can be very chal…
DREAM model improves computational efficiency for non-linear effects in relational event models.
problem Efficiently modeling non-linear effects in dynamic relational networks.
method Introduces Deep Relational Event Additive Model (DREAM) using Neural Additive Models.
result Demonstrates superior computational efficiency compared to traditional REM approaches.
Defines relations between Dirac structures and spinors using Courant algebroid relations.
problem Defines relations between Dirac structures and spinors using Courant algebroid relations.
method Uses Courant algebroid relations to define relations between Dirac structures and spinors.
result Proves existence results for T-dual structures and demonstrates compatibility with Type II supergravity equations.
In this paper we present a unified framework for modeling multi-relational representations, scoring, and learning, and conduct an empirical study of several recent multi-relational embedding models under the framework. We investigate the different choices of relation operators based on linear and bilinear transformatio…
Diffusion models' speed-accuracy relations derived from thermodynamics.
problem Understanding the trade-off between model speed and accuracy.
method Connecting diffusion models to thermodynamics and optimal transport.
result Speed-accuracy relations derived, providing insights into optimal learning protocols.
With the expeditious advancement of information technologies, health-related data presented unprecedented potentials for medical and health discoveries but at the same time significant challenges for machine learning techniques both in terms of size and complexity. Those challenges include: the structured data with var…
Relational data are usually highly incomplete in practice, which inspires us to leverage side information to improve the performance of community detection and link prediction. This paper presents a Bayesian probabilistic approach that incorporates various kinds of node attributes encoded in binary form in relational m…
New benchmarks improve model performance by accounting for isomorphism classes in multi-relational datasets.
problem Synthetic multi-relational datasets lack isomorphism class awareness, leading to overestimation of model performance.
method Proposed isomorphism-aware synthetic benchmarks and a prioritisation scheme to improve model performance and stability.
result Isomorphism classes can be utilised to improve model performance, stability during training, and reduce training time.
The mathematical relations between certain classical Non-Riemannian gravity models and Einstein-Proca theories are discussed in details. We also show some relations with theories with scalar fields.