Knowledge bases contribute to many web search and mining tasks, yet they are often incomplete. To add missing facts to a given knowledge base, various embedding models have been proposed in the recent literature. Perhaps surprisingly, relatively simple models with limited expressiveness often performed remarkably well …
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
48 results for “knowledge-based models”
Knowledge bases are employed in a variety of applications from natural language processing to semantic web search; alas, in practice their usefulness is hurt by their incompleteness. Embedding models attain state-of-the-art accuracy in knowledge base completion, but their predictions are notoriously hard to interpret. …
Link prediction in large knowledge graphs has received a lot of attention recently because of its importance for inferring missing relations and for completing and improving noisily extracted knowledge graphs. Over the years a number of machine learning researchers have presented various models for predicting the prese…
The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem. In this light, the Canonical Tensor Decomposition (CP) (Hitchcock, 1927) seems like a natural solution; however, current implementations of CP on standard Knowledge Base Completion benchmarks are lagging behind their…
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…
New neural KB representation speeds up reasoning with large symbolic knowledge bases.
problem Efficiently reasoning with large symbolic knowledge bases.
method Sparse-matrix reified knowledge base, enabling fully differentiable, scalable neural modules.
result Competitive performance on KB completion and semantic parsing benchmarks.
This paper compares deep learning and knowledge-based methods for pedestrian trajectory prediction.
problem Predicting pedestrian trajectories in crowded scenes is challenging due to external factors.
method Comprehensive comparison of deep learning and knowledge-based models.
result Deep learning models outperform knowledge-based models in local trajectory prediction.
Exploiting the appropriate inductive bias based on the knowledge of data is essential for achieving good performance in statistical machine learning. In practice, however, the domain knowledge of interest often provides information on the relationship of data attributes only distantly, which hinders direct utilization …
This paper reviews deep learning and knowledge-based methods for molecular design.
problem Optimizing molecular properties for scientific advances and process performance.
method Survey of deep learning and knowledge-based methods for molecular design.
result Deep learning models show promise in overcoming computational challenges.
A new tensor-based method for predicting temporal relationships in knowledge bases.
problem Predicting temporal relationships in evolving knowledge bases.
method Tensor decomposition of order 4 with new regularization schemes.
result Achieves state-of-the-art performance in temporal link prediction.
Representing entities and relations in an embedding space is a well-studied approach for machine learning on relational data. Existing approaches, however, primarily focus on simple link structure between a finite set of entities, ignoring the variety of data types that are often used in knowledge bases, such as text, …
Gaussian Attention Model and Its Application to Knowledge Base Embedding and Question Answeringstat.ML
We propose the Gaussian attention model for content-based neural memory access. With the proposed attention model, a neural network has the additional degree of freedom to control the focus of its attention from a laser sharp attention to a broad attention. It is applicable whenever we can assume that the distance in t…
Most of previous work in knowledge base (KB) completion has focused on the problem of relation extraction. In this work, we focus on the task of inferring missing entity type instances in a KB, a fundamental task for KB competition yet receives little attention. Due to the novelty of this task, we construct a large-sca…
Combines ML and KB modeling for large chaotic systems.
problem Predicting large, complex, spatiotemporal systems with limited data.
method Parallel ML prediction and hybrid approach combining ML and KB.
result Excellent performance and reduced training data needed.
QuantAgent learns trading signals through self-improvement.
problem Building domain-specific knowledge for LLMs in quantitative investment.
method Two-layer loop approach: inner loop refines responses, outer loop tests and learns.
result QuantAgent approximates optimal trading behavior with provable efficiency.
The study of linguistic typology is rooted in the implications we find between linguistic features, such as the fact that languages with object-verb word ordering tend to have post-positions. Uncovering such implications typically amounts to time-consuming manual processing by trained and experienced linguists, which p…
State-of-the-art approaches for Knowledge Base Completion (KBC) exploit deep neural networks trained with both false and true assertions: positive assertions are explicitly taken from the knowledge base, whereas negative ones are generated by random sampling of entities. In this paper, we argue that random sampling is …
Grade prediction for future courses not yet taken by students is important as it can help them and their advisers during the process of course selection as well as for designing personalized degree plans and modifying them based on their performance. One of the successful approaches for accurately predicting a student'…
Prevalent efforts have been put in automatically inferring genres of musical items. Yet, the propose solutions often rely on simplifications and fail to address the diversity and subjectivity of music genres. Accounting for these has, though, many benefits for aligning knowledge sources, integrating data and enriching …
A model-based approach to forecasting chaotic dynamical systems utilizes knowledge of the physical processes governing the dynamics to build an approximate mathematical model of the system. In contrast, machine learning techniques have demonstrated promising results for forecasting chaotic systems purely from past time…
Path queries on a knowledge graph can be used to answer compositional questions such as "What languages are spoken by people living in Lisbon?". However, knowledge graphs often have missing facts (edges) which disrupts path queries. Recent models for knowledge base completion impute missing facts by embedding knowledge…
A new query embedding method improves KB performance on complex queries.
problem QE systems disagree with deductive reasoning on some queries.
method A novel QE method more faithful to deductive reasoning.
result Better performance on complex queries to incomplete KBs.
Proposes new models to predict student grades more accurately.
problem Accurately predicting future grades considering prior and concurrent courses.
method Context-aware, non-linear, and neural attentive models.
result Models outperform existing methods in predicting student grades.
In this paper we propose and study the novel problem of explaining node embeddings by finding embedded human interpretable subspaces in already trained unsupervised node representation embeddings. We use an external knowledge base that is organized as a taxonomy of human-understandable concepts over entities as a guide…
Knowledge graphs enable a wide variety of applications, including question answering and information retrieval. Despite the great effort invested in their creation and maintenance, even the largest (e.g., Yago, DBPedia or Wikidata) remain incomplete. We introduce Relational Graph Convolutional Networks (R-GCNs) and app…
New SMC algorithm reduces memory usage for online clustering.
problem Uncertainty in online clustering with complex distributions.
method Decomposes clustering into independent subproblems using SMC.
result Accurately and efficiently solves clustering problems.
Machine learning constructs problem-based medical records from electronic health records.
problem Difficulty in finding relevant medical information for clinical questions.
method Knowledge base completion using machine learning on electronic health records.
result Automatic construction of problem-based groupings of medications, procedures, and lab tests.
Knowledge base (KB) completion adds new facts to a KB by making inferences from existing facts, for example by inferring with high likelihood nationality(X,Y) from bornIn(X,Y). Most previous methods infer simple one-hop relational synonyms like this, or use as evidence a multi-hop relational path treated as an atomic f…
This paper shows that a simple baseline based on a Bag-of-Words (BoW) representation learns surprisingly good knowledge graph embeddings. By casting knowledge base completion and question answering as supervised classification problems, we observe that modeling co-occurences of entities and relations leads to state-of-…
Embedding models for entities and relations are extremely useful for recovering missing facts in a knowledge base. Intuitively, a relation can be modeled by a matrix mapping entity vectors. However, relations reside on low dimension sub-manifolds in the parameter space of arbitrary matrices---for one reason, compositio…
Machine learning refactors knowledge to improve learning efficiency.
problem Inductive program synthesis efficiency through knowledge restructuring.
method Introduces Knorf, a system that refactors knowledge bases using constraint optimization.
result Learning from refactored knowledge improves predictive accuracy fourfold and reduces learning time by half.
Multi-way Clustering and Discordance Analysis through Deep Collective Matrix Tri-Factorizationstat.ML
Advances neural tri-factorization for clustering and discordance analysis of multi-typed data.
problem Challenges in analyzing heterogeneous, multimodal relational data.
method Deep collective matrix tri-factorization for spectral clustering and cluster association learning.
result Demonstrates efficacy over previous non-neural approaches in clustering and discordance analysis.
Embedding-based methods for knowledge base completion (KBC) learn representations of entities and relations in a vector space, along with the scoring function to estimate the likelihood of relations between entities. The learnable class of scoring functions is designed to be expressive enough to cover a variety of real…
We introduce a conceptually simple and scalable framework for continual learning domains where tasks are learned sequentially. Our method is constant in the number of parameters and is designed to preserve performance on previously encountered tasks while accelerating learning progress on subsequent problems. This is a…
Language models learn automotive complaints, improving defect detection.
problem Detecting technical quality issues in customer feedback.
method Continual pre-training on ODI Complaints data set.
result Models achieve high precision in identifying technical terms.
In this paper, we consider advancing web-scale knowledge extraction and alignment by integrating OpenIE extractions in the form of (subject, predicate, object) triples with Knowledge Bases (KB). Traditional techniques from universal schema and from schema mapping fall in two extremes: either they perform instance-level…
We consider the problem of structure learning for Gaifman models and learn relational features that can be used to derive feature representations from a knowledge base. These relational features are first-order rules that are then partially grounded and counted over local neighborhoods of a Gaifman model to obtain the …
We present efficient differentiable implementations of second-order multi-hop reasoning using a large symbolic knowledge base (KB). We introduce a new operation which can be used to compositionally construct second-order multi-hop templates in a neural model, and evaluate a number of alternative implementations, with d…
Embedding-based Knowledge Base Completion models have so far mostly combined distributed representations of individual entities or relations to compute truth scores of missing links. Facts can however also be represented using pairwise embeddings, i.e. embeddings for pairs of entities and relations. In this paper we ex…
GenIE extracts structured text with fewer errors and more entities.
problem Closed information extraction with errors and limited entities.
method End-to-end autoregressive generation with bi-level constraints.
result State-of-the-art performance on closed information extraction.
Machine learning improves model forecasts by correcting errors.
problem Improving short- to mid-range forecasts by correcting model errors.
method Iterative method combining data assimilation and machine learning.
result Hybrid models outperform original models in forecasts.
Flashback Learning balances model stability and plasticity in continual learning.
problem Balancing model stability and plasticity in continual learning.
method Flashback Learning (FL) uses a bidirectional regularization approach to balance stability and plasticity.
result FL improves model accuracy by up to 4.91% in Class-Incremental and 3.51% in Task-Incremental settings.
Deep learning models learn chaotic system dynamics from real and simulated data.
problem Training deep learning models for chaotic systems requires big data.
method Jointly train deep neural networks on real and simulated data, enforcing physical laws.
result Proposes knowledge-based deep learning (KDL) for accurate forecasting of chaotic systems.
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…
Knowledge bases (KBs) are the backbone of many ubiquitous applications and are thus required to exhibit high precision. However, for KBs that store subjective attributes of entities, e.g., whether a movie is "kid friendly", simply estimating precision is complicated by the inherent ambiguity in measuring subjective phe…
I consider how to influence CycleGAN, image-to-image translation, by using additional constraints from a neural network trained on art composition attributes. I show how I trained the the Art Composition Attributes Network (ACAN) by incorporating domain knowledge based on the rules of art evaluation and the result of a…
We developed a caching method to speed up concept learning in complex knowledge bases.
problem Complex concept learning requires many instance retrieval calls, increasing runtime.
method Semantics-aware caching that links concepts to instances via crisp set operations.
result Our cache reduces concept retrieval and learning runtime by an order of magnitude.
Deep reinforcement learning has been successful in a variety of tasks, such as game playing and robotic manipulation. However, attempting to learn \textit{tabula rasa} disregards the logical structure of many domains as well as the wealth of readily available knowledge from domain experts that could help "warm start" t…