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

2745478211,094 · Jun 202019922001200920172026
48 results for relational networks

New method improves graph neural networks by considering different types of relations in sampling.

problem Current graph neural networks ignore relation types in biomedical graphs, leading to suboptimal performance.
method Proposes relation-dependent sampling for multi-relational graphs to balance relation frequency and importance.
result State-of-the-art graph neural networks achieve better accuracy and efficiency with relation-dependent sampling.

Bayesian weight priors improve neural network learning of identity relations.

problem Neural networks struggle to learn abstract and systematic relations, especially identity relations.
method Extended RBP approach using Bayesian weight priors as a regularization term.
result Bayesian weight priors lead to perfect generalization for identity relations and do not hinder standard neural network learning.

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…

2019-04-11abs ↗pdf ↗

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…

2018-11-01abs ↗pdf ↗

Deep neural networks solve Raven's Progressive Matrices with high accuracy.

problem Testing relational reasoning in machine learning systems.
method Combining Wild Relation Networks with Multi-Layer Relation Networks and introducing Magnitude Encoding.
result Deep neural networks achieve 98.0 percent accuracy, significantly improving over previous methods.

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.

We investigate graph neural networks for multi-relational data.

problem Understanding and improving graph neural networks for multi-relational data.
method Aligning Relational GCN and Compositional GCN with the Weisfeiler-Leman test to understand their expressive power and introduce a new kk-RN architecture.
result The kk-RN architecture overcomes the expressiveness limitations of Relational GCN and Compositional GCN.

Relational Networks (RN) as introduced by Santoro et al. (2017) have demonstrated strong relational reasoning capabilities with a rather shallow architecture. Its single-layer design, however, only considers pairs of information objects, making it unsuitable for problems requiring reasoning across a higher number of fa…

2018-11-05abs ↗pdf ↗

Bayesian approach improves network lasso for multi-task learning.

problem Improving the determination of relational coefficients in network lasso.
method Proposes a Bayesian approach to solve multi-task learning problems using network lasso.
result Objective determination of relational coefficients through Bayesian estimation.

Paper improves Bayesian network learning from related data sets.

problem Learning from heterogeneous data sets with different probabilistic structures.
method Mixed-effects models to pool information across related data sets.
result Mixed-effects models outperform traditional methods in accuracy.

This paper studies semi-supervised object classification in relational data, which is a fundamental problem in relational data modeling. The problem has been extensively studied in the literature of both statistical relational learning (e.g. relational Markov networks) and graph neural networks (e.g. graph convolutiona…

2019-05-15abs ↗pdf ↗

A new method detects communities in multi-relational networks.

problem Detect communities in heterogeneous multi-relational networks.
method Message passing based algorithm on a hierarchical structure of homogeneous networks.
result Effectiveness of the proposed method confirmed on synthetic and real-world networks.

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.

Nodes in a multiplex network are connected by multiple types of relations. However, most existing network embedding methods assume that only a single type of relation exists between nodes. Even for those that consider the multiplexity of a network, they overlook node attributes, resort to node labels for training, and …

2019-11-15abs ↗pdf ↗

Relational learning deals with data that are characterized by relational structures. An important task is collective classification, which is to jointly classify networked objects. While it holds a great promise to produce a better accuracy than non-collective classifiers, collective classification is computational cha…

2016-09-15abs ↗pdf ↗

DanSmp predicts stock movement using a hybrid-relational MKG and dual attention networks.

problem Predicting stock price trends in volatile financial markets.
method Constructs a bi-typed MKG with hybrid-relations and uses DanSmp, a dual attention network, to learn momentum spillover signals.
result DanSmp improves stock prediction accuracy using the MKG.

Study L2L_2 regularization in deep networks, uncovering performance relations and proposing a training schedule.

problem Understanding and optimizing L2L_2 regularization in deep learning models.
method Empirical observations and theoretical analysis of gradient flow dynamics in infinitely wide networks.
result Empirical relations between model performance, L2L_2 coefficient, learning rate, and training steps; optimal regularization parameter prediction; improved training schedule.

DAM with MRL improves relational reasoning in MANNs.

problem Limited performance of associative memory networks on complex relational reasoning tasks.
method Distributed Associative Memory architecture with Memory Refreshing Loss.
result Enhanced relation reasoning performance of MANNs on long temporal sequence data.

This study approximates neural network features for modeling relations and attention mechanisms.

problem Approximating neural network features for modeling relations and attention mechanisms.
method Analyzes inner products of multi-layer perceptrons for universal approximation of symmetric and asymmetric relation functions.
result Universal approximation of relation functions and attention mechanisms using inner products of neural networks.

We analyze oversquashing in topological message-passing using relational structures.

problem Oversquashing in topological message-passing remains understudied.
method A unifying axiomatic framework that bridges graph and topological message-passing.
result Potential to advance topological deep learning.

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…

2017-06-14abs ↗pdf ↗

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.

A new model predicts network events with improved accuracy and interpretability.

problem Predicting and understanding complex dynamic relational data in networks.
method Mutually Exciting Latent Space Hawkes (LSH) model for continuous-time networks.
result The LSH model outperforms existing models in prediction accuracy and interpretability.

TGCN learns from multi-relational graphs, improving SSL performance.

problem Scalable semi-supervised learning from multi-relational data.
method Tensor-graph convolutional network with dynamic weights and graph-based regularizers.
result Significantly improved SSL performance over standard GCNs.

Attention mechanisms have been boosting the performance of deep learning models on a wide range of applications, ranging from speech understanding to program induction. However, despite experiments from psychology which suggest that attention plays an essential role in visual reasoning, the full potential of attention …

2019-11-14abs ↗pdf ↗

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 majority of data scientists and machine learning practitioners use relational data in their work [State of ML and Data Science 2017, Kaggle, Inc.]. But training machine learning models on data stored in relational databases requires significant data extraction and feature engineering efforts. These efforts are not …

2020-02-06abs ↗pdf ↗

Bayesian meta-learning on relation graphs improves few-shot relation extraction.

problem Predicting relations in sentences with limited labeled examples.
method Bayesian meta-learning on a global relation graph, using graph neural networks and Langevin dynamics.
result Framework effectively learns and generalizes to new relations.

Study challenges neural models in compositional learning tasks.

problem Challenges in neural models for compositional and relational learning.
method Introduced ConceptWorld environment for generating images from compositional concepts, tested various neural architectures.
result Neural models struggle with longer compositional chains and substitutivity tests.

ENN neural network learns logical syllogisms using Euler diagrams.

problem Traditional neural networks struggle with logical reasoning, especially syllogisms.
method ENN represents logical relations as Euler diagrams, optimizing syllogism structures with a novel back-propagation algorithm.
result ENN can precisely represent and reason with all 24 syllogism structures.

Many approaches have been proposed to discover clusters within networks. Community finding field encompasses approaches which try to discover clusters where nodes are tightly related within them but loosely related with nodes of other clusters. However, a community network configuration is not the only possible latent …

2019-07-27abs ↗pdf ↗

Investigates how neural network graph structure impacts predictive performance.

problem Lack of understanding between neural network graph structure and predictive performance.
method Developed relational graph representation to analyze neural networks, identifying a 'sweet spot' for improved performance.
result Identified a 'sweet spot' in relational graph structure that significantly improves neural network predictive performance.