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

Trend · papers per month

3637261,0881,451 · Jun 202019922001200920182026
48 results for semantic path model

The paper improves semantic interpolation in latent spaces of implicit models.

problem Interpolating between latent points in implicit models requires careful distributional matching.
method Proposes modifying the prior code distribution to concentrate more probability mass near the origin.
result Linear interpolation paths are shortest and pass through high-density regions, improving sample quality and semantics.

We develop meta-path embeddings to improve feature learning in heterogeneous knowledge graphs.

problem Redundant and unsuitable categorical features in meta-paths for machine learning models.
method Skipgram model with meta-path extension for learning semantical and compact vector representations.
result Meta-path embeddings improve link prediction on Wikidata.

ManifoldMind uses adaptive-curvature probabilistic spheres for trustworthy recommendations in semantic hierarchies.

problem Sparse and abstract recommendation domains where users explore diverse conceptual paths.
method Adaptive-curvature probabilistic spheres, soft multi-hop inference, and curvature-aware semantic kernel.
result Superior NDCG, calibration, and diversity compared to baselines on public benchmarks.

This research improves DNN defense by profiling and analyzing effective paths.

problem Defending against adversarial attacks on deep neural networks.
method Profiling DNN models into functional blocks and aggregating per-image effective paths to class-level effective paths.
result Adversarial images activate different effective paths from normal images.

HawkesLLM models text generation with temporal influence, improving semantic alignment under limited memory.

problem Path-dependent uncertainty in agentic text-simulation systems.
method HawkesLLM framework separates temporal influence modeling from text generation, using a multivariate Hawkes process and a language model.
result HawkesLLM improves late-stage semantic alignment under a compact prompt-memory budget.

Model converts code snippets into vectors for predicting method names.

problem Representing code as vectors for semantic analysis.
method Decomposes code into abstract syntax tree paths, learns atomic representations simultaneously with aggregation.
result Code vectors trained on 14M methods can predict method names from unseen files.

New method for learning on heterogeneous graphs without meta-paths.

problem Learning on heterogeneous graphs is sensitive to meta-paths choice, leading to poor performance.
method Decompose heterogeneous graph into homogeneous relation-type graphs, combine higher-order representations, use attention mechanisms.
result Our model outperforms state-of-the-art baselines in vertex classification tasks on heterogeneous graph datasets.

Paper introduces a new loss function for deep learning with symbolic knowledge.

problem Learning structured objects like rankings and paths from semi-supervised data.
method Developed a semantic loss function that integrates neural outputs with logical constraints.
result Significantly improves deep learning's ability to predict structured objects.

We establish causal semantics for SDEs and develop methods to reason about them.

problem Understanding causal relationships in systems modeled by stochastic differential equations.
method We introduce a causal graph framework, Markov properties, and do-calculus for SDEs.
result We prove the σσ-separation Markov property and do-calculus for causal SDEs.

COSET benchmarks neural program embeddings using diverse source-code datasets.

problem Evaluating neural program embeddings is challenging due to lack of straightforward metrics.
method COSET framework with labeled programs, transformations, and a pilot study.
result COSET identifies strengths and weaknesses of neural models and program characteristics.

Proposes a neural network model for embedding knowledge bases and answering questions.

problem Handling uncertainty and conjunction in neural question answering.
method Gaussian attention model for neural memory access and scoring function.
result Demonstrates model's effectiveness on soccer player dataset for path and conjunctive queries.

Proposes a method to improve graph neural networks on heterogeneous graphs using meta-paths.

problem Improving graph neural networks on heterogeneous graphs with auxiliary tasks.
method Self-supervised auxiliary learning with meta-paths for heterogeneous graphs.
result Consistently improves link prediction and node classification on heterogeneous graphs.

Unified approach to path planning using probabilistic inference on factor graphs.

problem Path planning problems using probabilistic inference.
method Unified framework using probabilistic factor graphs and message composition rules.
result Unified approach includes various algorithms like Sum-product, Max-product, Dynamic programming, and mixed criteria.

SAM adds semantic attributes to language models for better interpretation and style variation.

problem Improving text interpretation and style variation in language models.
method SAM includes document attributes, scores them, and embeds them into the model's input space.
result SAM generates interpretable texts and shows superior performance on various datasets.

LEAPS uses semantic models to improve reinforcement learning in diverse environments.

problem Generalizing and adapting to unseen environments in reinforcement learning.
method Hybrid model-based and model-free approach with a multi-target sub-policy and a Bayesian semantic model.
result LEAPS outperforms baselines in visual navigation tasks using diverse indoor scenes.

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.

HDGI learns node representations for heterogeneous graphs.

problem Challenges in learning node representations for heterogeneous graphs.
method HDGI uses meta-path structure, graph convolution, and semantic-level attention to maximize local-global mutual information.
result HDGI outperforms state-of-the-art methods on graph-related tasks.

Paper proposes PP-GCN for fine-grained social event categorization.

problem Challenges in mining social events due to heterogeneous event elements and social network structures.
method Design an event meta-schema, build an HIN, propose PP-GCN, and use KIES.
result PP-GCN outperforms other techniques in social event detection and clustering.

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.

Semantify-NN verifies neural network robustness against semantic perturbations.

problem Verifying robustness of neural networks against semantic adversarial attacks.
method Inserting semantic perturbation layers (SP-layers) into neural networks to verify robustness.
result Semantify-NN significantly improves robustness verification performance over p\ell_p-norm-based methods.

New approach uses SPG for semantic communication without a known channel model.

problem Designing efficient semantic communication systems without a known channel model.
method Applying Stochastic Policy Gradient (SPG) for reinforcement learning.
result Achieves comparable performance to model-aware approaches with a decreased convergence rate.

IdBench benchmarks semantic representations of identifiers, revealing strengths and weaknesses.

problem Evaluating semantic representations of identifiers in source code.
method Created a benchmark using developer ratings, evaluated natural language and source code embeddings, and compared lexical string distance functions.
result No single technique provides a satisfactory representation of semantic similarities, but ensemble models can improve performance.

Proposes CSG model to separate semantic and variation factors for OOD prediction.

problem Out-of-distribution examples cause conventional models to mix semantic and variation factors, leading to poor performance.
method Causal Semantic Generative model (CSG) based on causal reasoning, using variational Bayes for efficient learning and prediction.
result CSG can identify semantic factor and improve OOD prediction performance.

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%.

This paper explores the Riemannian geometry of deep generative models.

problem Understanding the geometry of high-dimensional, nonlinear manifolds learned by deep generative models.
method Developed algorithms for computing geodesic curves and parallel translation on generated manifolds.
result Generated manifolds are surprisingly close to zero curvature, suggesting linear paths in latent space approximate geodesics.

SPAT improves adversarial robustness by preserving semantics in adversarial training.

problem Adversarial examples often have different semantics than original data, introducing unintended biases.
method Semantics-preserving adversarial training (SPAT) that encourages pixel perturbation shared among all classes.
result SPAT improves adversarial robustness and achieves state-of-the-art results in CIFAR-10 and CIFAR-100.

This work provides uncertainty intervals for semantic latent variables in disentangled latent spaces.

problem Challenges in providing meaningful uncertainty quantification for semantic information in disentangled latent spaces.
method Uses quantile regression to output heuristic uncertainty intervals, calibrates these intervals to contain true latent values, and propagates them through the generator.
result Reliably communicates semantically meaningful, principled, and instance-adaptive uncertainty in image super-resolution and image completion.

Protocol for constructing tailored evaluation datasets for semantic models.

problem Evaluation of domain-specific semantic models, focusing on top ranks.
method Adaptive pairwise comparisons, relatedness-based evaluation dataset, metrics, stochastic transitivity model.
result Effectiveness of the proposed dataset construction protocol confirmed.

The paper measures semantic information production in generative models using information theory.

problem Measuring when semantic decisions are made during generative model training.
method Using an online formula for the optimal Bayesian classifier, the paper estimates conditional entropy and determines time intervals for highest information transfer.
result Semantic information transfer is highest in intermediate stages of diffusion, with different classes making decisions at different times.

The paper uses differentiable rendering to generate semantic counterexamples for improving neural network robustness.

problem Neural networks' brittleness to semantic transformations.
method Differentiable rendering for generating realistic images that model semantic changes, combined with adversarial machine learning attacks.
result Semantic counterexamples improve generalization, robustness, and transferability of neural networks.