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

Trend · papers per month

3469103137 · Jun 202019922001200920172026
48 results for entity interactions

Enhances machine learning for dynamic, interconnected entities.

problem Lack of systematic feature engineering for dynamic, interconnected entities.
method Augments current graph machine learning with comprehensive feature engineering in space and time.
result Improves supervised learning on heterogeneous, attributed entities interacting over time.

Neural production systems learn visual dynamics by applying rule templates to entities.

problem Modeling interactions among entities in structured visual environments.
method Inspired by production systems, the paper uses rule templates to bind placeholder variables to specific entities, scoring and applying the best fitting rules to update entity properties.
result The architecture achieves robust future-state prediction and extrapolation from simple to complex environments, outperforming GNNs.

This paper tests the hypothesis that modeling a scene in terms of entities and their local interactions, as opposed to modeling the scene globally, provides a significant benefit in generalizing to physical tasks in a combinatorial space the learner has not encountered before. We present object-centric perception, pred…

2019-10-28abs ↗pdf ↗

Study reveals self-attention's role in learning and generalizing interactions.

problem Understanding self-attention's theoretical role in neural architectures.
method Interacting entities analysis, including multi-agent RL and genetic sequences.
result Self-attention efficiently represents, learns, and generalizes pairwise interactions.

We develop a general framework to analyze the distribution functions of wealth and income. Within this framework we study wealth distribution in a society by using a model which turns on two-party trading for poor people while for rich people interaction with wealthy entities (huge reservoir) is relevant. At equilibriu…

2003-10-15abs ↗pdf ↗

We develop a general framework, based on Boltzmann transport theory, to analyze the distribution of wealth in societies. Within this framework we derive the distribution function of wealth by using a two-party trading model for the poor people while for the rich people a new model is proposed where interaction with wea…

2004-09-13abs ↗pdf ↗

In a given scenario, simultaneously and accurately predicting every possible interaction of traffic participants is an important capability for autonomous vehicles. The majority of current researches focused on the prediction of an single entity without incorporating the environment information. Although some approache…

2018-10-30abs ↗pdf ↗

A semi-parametric, non-linear regression model in the presence of latent variables is applied towards learning network graph structure. These latent variables can correspond to unmodeled phenomena or unmeasured agents in a complex system of interacting entities. This formulation jointly estimates non-linearities in the…

2018-06-28abs ↗pdf ↗

Bi-GNN models drug interactions using a bi-level graph approach.

problem Predicting drug-drug interactions using machine learning.
method Bi-level graph neural networks that consider both interaction graph and representation graphs of drugs.
result Bi-GNN model improves DDI prediction accuracy compared to existing methods.

Transposable data represents interactions among two sets of entities, and are typically represented as a matrix containing the known interaction values. Additional side information may consist of feature vectors specific to entities corresponding to the rows and/or columns of such a matrix. Further information may also…

2014-04-27abs ↗pdf ↗

Previous models for learning entity and relationship embeddings of knowledge graphs such as TransE, TransH, and TransR aim to explore new links based on learned representations. However, these models interpret relationships as simple translations on entity embeddings. In this paper, we try to learn more complex connect…

2017-10-23abs ↗pdf ↗

MEI model improves knowledge graph completion by efficiently modeling interactions between embeddings.

problem Efficiently modeling interactions between knowledge graph embeddings to predict missing links.
method MEI divides embeddings into partitions and uses Tucker and block term formats to model interactions efficiently.
result Achieves state-of-the-art performance on link prediction tasks.

mGENRE improves multilingual entity linking with autoregressive sequence prediction.

problem Multilingual Entity Linking (MEL) task of resolving language-specific mentions to a multilingual Knowledge Base.
method Autoregressive sequence-to-sequence system that cross-encodes mention strings and entity names.
result Over 50% improvement in average accuracy in zero-shot settings.

REFIL learns from imagined sub-group interactions to improve multi-agent reinforcement learning.

problem Learning efficiency in multi-agent reinforcement learning settings.
method Randomized Entity-wise Factorization (REFIL) approach.
result REFIL outperforms all strong baselines in challenging multi-task StarCraft settings.

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.

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.

SPARTAN learns sparse interaction graphs between objects in scenes.

problem Capturing structured interactions between entities in complex settings remains challenging.
method SPARTAN is a Transformer-based world model that learns sparse, context-dependent interaction graphs through sparsity regularization on attention patterns.
result SPARTAN achieves significantly improved few-shot adaptation to dynamics changes and robustness against distractors.

As the availability and importance of temporal interaction data--such as email communication--increases, it becomes increasingly important to understand the underlying structure that underpins these interactions. Often these interactions form a multigraph, where we might have multiple interactions between two entities.…

2019-10-11abs ↗pdf ↗

In this work, we move beyond the traditional complex-valued representations, introducing more expressive hypercomplex representations to model entities and relations for knowledge graph embeddings. More specifically, quaternion embeddings, hypercomplex-valued embeddings with three imaginary components, are utilized to …

2019-04-23abs ↗pdf ↗

Many real world tasks such as reasoning and physical interaction require identification and manipulation of conceptual entities. A first step towards solving these tasks is the automated discovery of distributed symbol-like representations. In this paper, we explicitly formalize this problem as inference in a spatial m…

2017-08-11abs ↗pdf ↗

Model learns collective and individual dynamics in time series data.

problem Lack of models capturing system-level collective behavior in individual time series.
method Hierarchical switching-state model with latent system-level and entity-level Markov chains.
result Model improves interpretability and forecasting accuracy compared to larger models.

Cosmos models scenes using neural encodings and symbolic attributes for compositional generalization.

problem Modeling scenes with high performance on unseen input scenes composed of known visual elements.
method Neurosymbolic grounding with neurosymbolic scene encodings and attention mechanisms.
result Establishes a new state-of-the-art for compositional generalization in world modeling.

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.

GEN tackles few-shot out-of-graph link prediction in evolving multi-relational graphs.

problem Predicting links between unseen nodes in evolving multi-relational graphs with few edges per node.
method Transductive meta-learning framework (GEN) for inductive and transductive inference.
result GEN significantly outperforms relevant baselines for out-of-graph link prediction tasks.

Model improves email-based conversational agents' ability to extract relevant information.

problem Asynchronous email communication makes it hard for agents to detect intents and extract relevant entities.
method Neural model for scoping relevant information from large queries.
result Improves performance of intent detection and entity extraction tasks by 35% in precision.

While multi-agent interactions can be naturally modeled as a graph, the environment has traditionally been considered as a black box. We propose to create a shared agent-entity graph, where agents and environmental entities form vertices, and edges exist between the vertices which can communicate with each other. Agent…

2019-06-04abs ↗pdf ↗

Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities. However, an open challenge in this area is developing techniques that can go beyond simple edge prediction and handle more complex logical queries, which might involve multiple un…

2018-06-05abs ↗pdf ↗

We propose a latent self-exciting point process model that describes geographically distributed interactions between pairs of entities. In contrast to most existing approaches that assume fully observable interactions, here we consider a scenario where certain interaction events lack information about participants. Ins…

2013-02-12abs ↗pdf ↗

Generative Adversarial Networks (GANs) can produce images of remarkable complexity and realism but are generally structured to sample from a single latent source ignoring the explicit spatial interaction between multiple entities that could be present in a scene. Capturing such complex interactions between different ob…

2018-07-19abs ↗pdf ↗

Graphs can model interactions between vertices, but how well depends on graph structure.

problem Lack of formal characterization of GNNs' ability to model interactions between vertices.
method Formalized interaction strength using separation rank and quantified it for different partitions of vertices.
result GNNs' ability to model interactions is primarily determined by the partition's walk index.

Chinese NER is a challenging task. As pictographs, Chinese characters contain latent glyph information, which is often overlooked. In this paper, we propose the FGN, Fusion Glyph Network for Chinese NER. Except for adding glyph information, this method may also add extra interactive information with the fusion mechanis…

2020-01-15abs ↗pdf ↗

Many prediction problems can be phrased as inferences over local neighborhoods of graphs. The graph represents the interaction between entities, and the neighborhood of each entity contains information that allows the inferences or predictions. We present an approach for applying machine learning directly to such graph…

2016-11-21abs ↗pdf ↗