arXiv research

New algebraic rules for 5D shapes based on 3D cocycles.

We establish a necessary and sufficient condition for a heptagonal knot to be figure-8 knot. The condition is described by a set of Radon partitions formed by vertices of the heptagon. In addition we relate this result to the number of nontrivial heptagonal knots in linear embeddings of the complete graph $K_7$ into $\…

Study finds central points of double heptagon surface are not connection points.

The paper calculates gap distributions for translation surfaces, focusing on the double heptagon.

The space of n-sided polygons embedded in three-space consists of a smooth manifold in which points correspond to piecewise linear or ``geometric'' knots, while paths correspond to isotopies which preserve the geometric structure of these knots. The topology of these spaces for the case n = 6 and n = 7 is described. In…

We recall the construction of the Kontsevich graph orientation morphism $γ\mapsto {\rm O\vec{r}}(γ)$ which maps cocycles $γ$ in the non-oriented graph complex to infinitesimal symmetries $\dot{\mathcal{P}} = {\rm O\vec{r}}(γ)(\mathcal{P})$ of Poisson bi-vectors on affine manifolds. We reveal in particular why there alw…

We consider the expected value for the total curvature of a random closed polygon. Numerical experiments have suggested that as the number of edges becomes large, the difference between the expected total curvature of a random closed polygon and a random open polygon with the same number of turning angles approaches a …

Defines relations between Dirac structures and spinors using Courant algebroid relations.

Unsupervised relation discovery aims to discover new relations from a given text corpus without annotated data. However, it does not consider existing human annotated knowledge bases even when they are relevant to the relations to be discovered. In this paper, we study the problem of how to use out-of-relation knowledg…

Abstractor enhances Transformers for relational reasoning, improving sample efficiency and performance.

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

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…

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

Proves one-relator groups with negative immersions are hyperbolic and virtually special.

HIRM models noisy, sparse, heterogeneous relational data using hierarchical clustering and Dirichlet processes.

Introduces Relational Privacy (RP) to control relation memorization in question answering models.

Enhances social spam detection using multi-level dependency of relational sequences.

The paper explores the pentagon relation and its algebraic forms.

In this article, we extend the conventional framework of convolutional-Restricted-Boltzmann-Machine to learn highly abstract features among abitrary number of time related input maps by constructing a layer of multiplicative units, which capture the relations among inputs. In many cases, more than two maps are strongly…

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…

Identifying the underlying directional relations from observational time series with nonlinear interactions and complex relational structures is key to a wide range of applications, yet remains a hard problem. In this work, we introduce a novel minimum predictive information regularization method to infer directional r…

We consider the problem of learning causal relationships from relational data. Existing approaches rely on queries to a relational conditional independence (RCI) oracle to establish and orient causal relations in such a setting. In practice, queries to a RCI oracle have to be replaced by reliable tests for RCI against …

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…

Despite their impressive performance in many tasks, deep neural networks often struggle at relational reasoning. This has recently been remedied with the introduction of a plug-in relational module that considers relations between pairs of objects. Unfortunately, this is combinatorially expensive. In this extended abst…

This work proposes a method to compose visual relations more faithfully.

A new quantum relation connects exceptional Lie algebras and knots.

Traditional sequential multi-object attention models rely on a recurrent mechanism to infer object relations. We propose a relational extension (R-SQAIR) of one such attention model (SQAIR) by endowing it with a module with strong relational inductive bias that computes in parallel pairwise interactions between inferre…

Relation extraction aims to extract relational facts from sentences. Previous models mainly rely on manually labeled datasets, seed instances or human-crafted patterns, and distant supervision. However, the human annotation is expensive, while human-crafted patterns suffer from semantic drift and distant supervision sa…

We study a bordism relation for stable 3-forms on a 6-manifold, which is a binary relation on the set of closed $SL(3;\mathbb{C})$-structures on a 6-manifold via closed $G_2$-structures. Under $SO(3)$-symmetry and a co-associative condition the relation is reduced to a relation for geometric structures on a 3-manifold.…

RelEx explains relational models without gradient access.

Knowledge graph completion aims to predict missing relations between entities in a knowledge graph. In this work, we propose a relational message passing method for knowledge graph completion. Different from existing embedding-based methods, relational message passing only considers edge features (i.e., relation types)…

Improves neural relational inference for dynamic multi-agent trajectories.

Study super cluster algebras from super Plücker and Ptolemy relations.

Proves a categorified relation in Khovanov homology.

Introduces new algebraic structures for relational groupoids and proves a reduction theorem.

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…

Relation extraction models suffer from limited qualified training data. Using human annotators to label sentences is too expensive and does not scale well especially when dealing with large datasets. In this paper, we use Auxiliary Classifier Generative Adversarial Networks (AC-GANs) to generate high-quality relational…

Bayesian weight priors improve neural network learning of identity relations.

Proves divisibility relations for symplectic curve polynomials.

Strict partial order is a mathematical structure commonly seen in relational data. One obstacle to extracting such type of relations at scale is the lack of large-scale labels for building effective data-driven solutions. We develop an active learning framework for mining such relations subject to a strict order. Our a…

The study classifies polynomial relation tubular surfaces in 3-spaces.

Relational Structural Causal Models enable causal reasoning about unseen object combinations.

The paper extends graph embedding models to handle multiple relations.

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…

Driven by a large number of potential applications in areas like bioinformatics, information retrieval and social network analysis, the problem setting of inferring relations between pairs of data objects has recently been investigated quite intensively in the machine learning community. To this end, current approaches…

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…

CURE extracts relations without supervision by clustering similar entity pairs.

We show that if $M$ is a fibered, orientable 3-manifold, and if $π_1 M$ has 1-relator presentation, then the presentation is induced by a Heegaard splitting of $M$. A corollary is that, for these manifolds, the rank of $π_1 M$ is equal to the "restricted" Heegaard genus of $M$. We also explore the analogy between 1-rel…