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.

169,051 papers · 148 categories

Trend · papers per month

2.5%5.0%7.5%9.9% · Apr 202019922001200920182026
48 results for Semantic knowledge

Semantic TrueLearn uses semantic graphs to improve educational recommendation systems.

problem Challenges in handling semantic and hierarchical structure in knowledge areas.
method Introduces a novel learner model that exploits semantic relatedness between knowledge components using a Wikipedia link graph.
result Achieves statistically significant improvements in predictive performance for educational engagement.

This work benchmarks neural embeddings for link prediction in evolving knowledge graphs.

problem Evaluating the robustness of neural embeddings in changing knowledge graphs.
method Proposes an open-source evaluation pipeline using relation-centric connectivity measures.
result Demonstrates the importance of simulating embedding accuracy for frequently updated knowledge graphs.

Paper tackles zero-shot learning for semantic image interpretation.

problem Extracting structured semantic descriptions from images requires complete training sets, which are often unavailable.
method Uses Logic Tensor Networks to leverage logical constraints and similarities among relationships in the training set.
result Background knowledge can alleviate the incompleteness of training sets, improving zero-shot learning performance.

Semantic embeddings improve safety-critical classifier performance.

problem Improving interpretability and error detection in safety-critical neural networks.
method Created embeddings from symbolic domain knowledge, used for misprediction interpretation and error detection, introduced semantic distance for confidence measurement.
result Semantic distance achieves near state-of-the-art performance in a traffic sign classifier, faster than other methods.

HAKE embeds entities in polar coordinates to model semantic hierarchies in knowledge graphs.

problem Lack of modeling semantic hierarchies in knowledge graph embeddings.
method HAKE embeds entities in a polar coordinate system, where the radial coordinate represents hierarchy levels and the angular coordinate distinguishes entities at the same level.
result HAKE significantly outperforms existing methods on link prediction tasks in knowledge graphs.

Service robots learn new tasks more efficiently with ISI, improving query performance and reducing training time.

problem Incremental learning of semantic concepts in multi-relational embeddings for service robots.
method Incremental Semantic Initialization (ISI) that allows new semantic concepts to be initialized in relation to previously learned embeddings.
result ISI improves immediate query performance by 41.4% and reduces the number of epochs to approach model convergence by 78.2%.

The abstract explains how word and relation representations capture semantic meaning.

problem Understanding how word and relation representations capture semantic meaning.
method Theoretical justification and extension of geometric relationships between word embeddings and knowledge graph representations.
result The geometric relationships between word embeddings correspond to semantic relations between words and entities in knowledge graphs.

Paper proposes a new approach to unify and compare knowledge graph embedding methods.

problem Lack of understanding and comparison of existing knowledge graph embedding methods.
method Introduces a multi-embedding interaction mechanism to unify and generalize existing models.
result Proposes a new multi-embedding model based on quaternion algebra.

OTSeg uses multi-prompt Sinkhorn attention to improve zero-shot semantic segmentation.

problem Leveraging pre-trained CLIP knowledge to align text embeddings with pixel embeddings.
method OTSeg employs Multi-Prompts Sinkhorn (MPS) and Multi-Prompts Sinkhorn Attention (MPSA) to enhance semantic feature matching.
result OTSeg achieves state-of-the-art performance in zero-shot semantic segmentation tasks.

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.

In this thesis, we study the problem of feature learning on heterogeneous knowledge graphs. These features can be used to perform tasks such as link prediction, classification and clustering on graphs. Knowledge graphs provide rich semantics encoded in the edge and node types. Meta-paths consist of these types and abst…

2018-09-07abs ↗pdf ↗

Paper proves impossible for large language models to control hallucinations without sacrificing other properties.

problem Achieving truthful knowledge representation, semantic information conservation, and knowledge-constrained optimality simultaneously in large language models.
method Modeling inference as an auction of ideas, using mechanism design, proper scoring rules, and transformer architecture analysis.
result No LLM can simultaneously achieve all four essential properties without violating at least one.

ZSL-KG learns class representations from common sense knowledge graphs.

problem Predicting classes without labeled examples using semantic class representations.
method TrGCN, a novel transformer graph convolutional network, embeds nodes from common sense knowledge graphs in a vector space.
result ZSL-KG improves over existing methods on five out of six zero-shot benchmark datasets.

Statsformer validates and adapts LLM-derived semantic priors for improved supervised learning.

problem Unreliable semantic priors from LLMs can degrade supervised learning performance.
method Adapts LLM-derived feature scores into a family of learner-specific prior-injection mechanisms, calibrating their influence using out-of-fold validation.
result Improves prediction performance by adaptively downweighting unreliable LLM priors, ensuring a guardrailed statistical learning system.

Proposes a method to generate semantically meaningful adversarial examples.

problem Challenges in creating semantically meaningful adversarial examples.
method Captures semantics via manifold learning, perturbs using Gram-Schmidt process, and imposes adversarial constraints.
result Effectively generates adversarial examples that evade existing defenses.

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.

New diffusion models improve counterfactual image generation with semantic control.

problem Challenges in preserving identity, maintaining quality, and ensuring causal model faithfulness in counterfactual image generation.
method Integrates semantic representations into diffusion models through Pearlian causality, introducing spatial, semantic, and dynamic abduction.
result Demonstrates high-level semantic identity preservation and principled trade-offs between faithful causal control and identity preservation.

In a real-world setting, visual recognition systems can be brought to make predictions for images belonging to previously unknown class labels. In order to make semantically meaningful predictions for such inputs, we propose a two-step approach that utilizes information from knowledge graphs. First, a knowledge-graph r…

2017-08-28abs ↗pdf ↗

Deep RL learns driving decisions from compact scene descriptions.

problem Learning consistent driving behavior from varying environments.
method Compact semantic state representation for reinforcement learning.
result Agent adapts behavior online without re-training.

Enhances hand gesture recognition with separate networks and shared features.

problem Improving recognition accuracy of unimodal 3D-CNNs for dynamic hand gestures.
method Separate networks for each modality, collaborative learning, spatiotemporal semantic alignment loss, focal regularization.
result Improves test time recognition accuracy and state-of-the-art performance.

Paper proposes using logic networks to inject prior knowledge for better reinforcement learning.

problem Improving reinforcement learning agents with prior knowledge of object and event semantics.
method Integrates first-order logic grounded in deep neural networks as prior knowledge into reinforcement learning algorithms.
result Demonstrates that combining symbolic and image layers in a single decision module improves learning efficiency.

KEEN Universe provides reproducible and transferable knowledge graph embeddings.

problem Lack of reproducibility and transferability in KGE experiments.
method Developed an ecosystem with Python packages for reproducible and transferable KGEs.
result KEEN Universe facilitates sharing of trained KGE models across different fields.

This paper develops a novel methodology for using symbolic knowledge in deep learning. From first principles, we derive a semantic loss function that bridges between neural output vectors and logical constraints. This loss function captures how close the neural network is to satisfying the constraints on its output. An…

2017-11-29abs ↗pdf ↗

Proposes AMS-SFE to improve zero-shot learning by aligning semantic feature spaces.

problem Domain shift problem in zero-shot learning due to disjoint seen and unseen data.
method Expands semantic features using an autoencoder and aligns them with visual feature manifold.
result Remarkable performance improvement over existing methods.

Enhances image classification by integrating semantic hierarchy into CNN models.

problem Limited use of external guidance in image classification.
method Integrates label-hierarchy knowledge into CNN-based classifiers and uses order-preserving embeddings.
result Boosts image classification performance through semantic hierarchy integration.

Neural language models are a powerful tool to embed words into semantic vector spaces. However, learning such models generally relies on the availability of abundant and diverse training examples. In highly specialised domains this requirement may not be met due to difficulties in obtaining a large corpus, or the limit…

2015-10-01abs ↗pdf ↗

In accessibility tests for digital preservation, over time we experience drifts of localized and labelled content in statistical models of evolving semantics represented as a vector field. This articulates the need to detect, measure, interpret and model outcomes of knowledge dynamics. To this end we employ a high-perf…

2016-08-03abs ↗pdf ↗

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.

LLMs show surprising confidence in their answers, beyond just tokens.

problem LLMs lack meaningful confidence estimates for their responses.
method Semantic calibration test based on local loss optimality and equivalence classes.
result Base LLMs are semantically calibrated across tasks, contrary to expectations.

Optimizes contrastive learning with individualized temperatures for better performance on imbalanced datasets.

problem The common practice of using a global temperature parameter ignores the varying semantic similarity across different anchor data.
method Proposes a new robust contrastive loss inspired by distributionally robust optimization (DRO) and an efficient stochastic algorithm for automatic temperature individualization.
result Our method automatically learns a suitable temperature for each sample, improving performance on imbalanced datasets.