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

Trend · papers per month

10.4%20.8%31.2%41.7% · May 201919922001200920172026
48 results for Neural Markov Logic Networks

Graph neural networks improve logic reasoning for large datasets.

problem Combining logic reasoning and probabilistic inference for large datasets.
method Exploring Graph Neural Networks (GNNs) for Markov Logic Networks (MLN) to improve probabilistic logic inference.
result ExpressGNN, a more expressive variant of GNN, can perform effective probabilistic logic inference and scale to large datasets.

pLogicNet combines logic rules and embeddings for efficient knowledge graph reasoning.

problem Efficiently predicting missing facts in knowledge graphs.
method Combines Markov Logic Networks with knowledge graph embeddings using variational EM algorithm.
result pLogicNet outperforms traditional methods on multiple knowledge graphs.

Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference …

2016-11-24abs ↗pdf ↗

Combining logic and probability has been a long stand- ing goal of AI research. Markov Logic Networks (MLNs) achieve this by attaching weights to formulas in first-order logic, and can be seen as templates for constructing features for ground Markov networks. Most techniques for learning weights of MLNs are domain-size…

2018-07-03abs ↗pdf ↗

NLN learns logical reasoning from neural networks.

problem Lack of logical reasoning in deep neural networks.
method Dynamic neural architecture that builds computational graph based on logical expressions, learns logical operations as neural modules, conducts propositional logical reasoning.
result NLN significantly outperforms state-of-the-art models on collaborative filtering and personalized recommendation tasks.

Combines neural networks and logic circuits for interpretable, accurate, and cost-effective learning.

problem Lack of generalizability and interpretability in neural networks and high hardware cost in logic circuits.
method Trains a neural network, then translates it to random forests, and finally to AND-Inverter logic.
result The pipeline maintains greater accuracy and minimizes logic complexity.

Graph neural networks struggle with proving unsatisfiability in complex logical formulas.

problem Proving unsatisfiability in complex logical formulas.
method Investigating the limitations of graph neural networks in logical reasoning tasks.
result Graph neural networks may fail in certifying unsatisfiability in Boolean formulae.

Neural Logic Reasoning integrates deep learning and symbolic logic for better prediction tasks.

problem Lack of cognitive reasoning in deep neural networks limits their ability to solve complex prediction tasks.
method Proposes Logic-Integrated Neural Network (LINN) that learns logical operations and conducts propositional logical reasoning.
result LINN significantly outperforms state-of-the-art recommendation models in Top-K recommendation.

Paper improves robustness certification by integrating ML and logical reasoning.

problem Limited robustness certification under perturbation radius.
method Integrates statistical ML models with logical reasoning using Markov logic networks.
result First certified robustness bound for MLN derived and experimentally validated.

ENN neural network learns logical syllogisms using Euler diagrams.

problem Traditional neural networks struggle with logical reasoning, especially syllogisms.
method ENN represents logical relations as Euler diagrams, optimizing syllogism structures with a novel back-propagation algorithm.
result ENN can precisely represent and reason with all 24 syllogism structures.

Combining deep neural networks with structured logic rules is desirable to harness flexibility and reduce uninterpretability of the neural models. We propose a general framework capable of enhancing various types of neural networks (e.g., CNNs and RNNs) with declarative first-order logic rules. Specifically, we develop…

2016-03-21abs ↗pdf ↗

Explaining neural network computation in terms of probabilistic/fuzzy logical operations has attracted much attention due to its simplicity and high interpretability. Different choices of logical operators such as AND, OR and XOR give rise to another dimension for network optimization, and in this paper, we study the o…

2019-01-20abs ↗pdf ↗

Logical neural networks solve mazes by filling dead ends, but not all methods generalize well.

problem Understanding how logical neural networks extrapolate solutions to mazes.
method Examined recurrent and implicit neural networks trained on maze-solving tasks.
result Models fail to generalize well to diverse maze sizes, suggesting limitations in learning scalable algorithms.

Paper augments neural nets with logic for improved performance.

problem Training neural networks with declarative knowledge without extra parameters.
method Systematically compiles logical statements into computation graphs that augment neural networks.
result Knowledge-augmented networks significantly improve performance, especially in low-data scenarios.

Transformers learn to predict temporal logic solutions from classical solver outputs.

problem Training neural networks on logic problem solutions for verification.
method Training a Transformer on generated training data from classical solvers, focusing on one solution per formula.
result Transformers can predict correct solutions to temporal logic problems, even to unseen benchmarks.

Improves deep learning interpretability through logical network construction.

problem Difficulty in understanding and explaining deep neural networks, especially convolution neural networks.
method Proposes a method to construct a logical network based on fully connected layers to improve interpretability.
result Improves the interpretability of deep learning processes and models.

We propose a method for efficient training of Q-functions for continuous-state Markov Decision Processes (MDPs) such that the traces of the resulting policies satisfy a given Linear Temporal Logic (LTL) property. LTL, a modal logic, can express a wide range of time-dependent logical properties (including "safety") that…

2018-09-20abs ↗pdf ↗

Study logical generalization in GNNs using a new benchmark.

problem Understanding how GNNs adapt to new logical tasks.
method Developed GraphLog benchmark suite for logical tasks, evaluated GNNs in supervised, pretraining, and continual learning settings.
result Logical diversity during training affects GNNs' ability to generalize.

The paper explores how neural networks learn logical functions and their generalization error.

problem Learning logical functions with neural networks and understanding generalization error.
method Gradient descent on neural networks, analyzing noise-stability and Boolean influence.
result Gradient descent on certain neural architectures tends to favor low-degree representations, impacting generalization error.

Refines neural network predictions using background knowledge for improved accuracy.

problem Compensate for lack of labeled data in neural networks.
method Introduces differentiable refinement functions and Iterative Local Refinement (ILR) algorithm to refine predictions efficiently and accurately.
result ILR finds competitive results in MNIST addition task and refines predictions on complex SAT formulas.

Graphs improve theorem proving in higher-order logic.

problem Challenges in converting higher-order logic formulas into graph-based representations.
method Used graph neural networks (GNNs) to represent and search higher-order logic.
result GNNs outperform state-of-the-art methods in higher-order theorem proving.

Combines neural networks and STL for multi-class time-series classification.

problem Lack of interpretability in neural networks for time-series data.
method Proposes a method that uses neural networks to classify time-series data using STL specifications, introducing margin for multi-class classification and STL-based attributes for interpretability.
result Evaluations show improved interpretability and performance compared to state-of-the-art baselines.

Deep networks can be understood as logical circuits, improving interpretability and generalization.

problem Lack of interpretability in deep neural networks.
method Hierarchical decomposition of DNN discrete classification map into logical combinations of intermediate classifiers.
result Deep networks can be interpreted as logical circuits with improved generalization.

Deep learning predicts stock prices using CNN and NALUs.

problem Predicting future stock prices accurately.
method Convolutional Neural Network (CNN) for feature extraction and Neural Arithmetic Logic Units (NALUs) for arithmetic operations.
result Improved accuracy in predicting stock prices.

Statistical relational frameworks such as Markov logic networks and probabilistic soft logic (PSL) encode model structure with weighted first-order logical clauses. Learning these clauses from data is referred to as structure learning. Structure learning alleviates the manual cost of specifying models. However, this be…

2018-07-03abs ↗pdf ↗

Paper investigates differentiable fuzzy implications and their suitability for learning.

problem Analyzing differentiable fuzzy implications and their suitability for learning.
method Investigates the properties of fuzzy implications in a differentiable setting and introduces a new family of fuzzy implications.
result Various fuzzy implications are unsuitable for differentiable learning, and a new family of fuzzy implications is introduced.

Synthesizing programs using example input/outputs is a classic problem in artificial intelligence. We present a method for solving Programming By Example (PBE) problems by using a neural model to guide the search of a constraint logic programming system called miniKanren. Crucially, the neural model uses miniKanren's i…

2018-09-08abs ↗pdf ↗

A fundamental challenge in developing high-impact machine learning technologies is balancing the need to model rich, structured domains with the ability to scale to big data. Many important problem areas are both richly structured and large scale, from social and biological networks, to knowledge graphs and the Web, to…

2015-05-17abs ↗pdf ↗

Neural networks learn discrete tasks on continuous data via emergent geometry.

problem Understanding how neural networks perform discrete computations on continuous data.
method Analysis of Riemannian pullback metric across neural network layers.
result Neural networks learn to discretize continuous inputs and perform logical operations on these discretized variables.

A reinforcement learning framework for Mars rover control using temporal logic.

problem Sparse rewards in continuous-state continuous-action MDPs with high-level temporal structures.
method Actor-critic, model-free, online RL framework with modular DDPG architecture.
result Success rate of synthesised policy in Mars rover experiment.

A-NeSI scales approximate inference for probabilistic neurosymbolic learning.

problem Combining neural networks with symbolic reasoning for scalable inference.
method A-NeSI: a new framework for PNL using neural networks for approximate inference.
result A-NeSI achieves scalable approximate inference without semantic changes.

CLUTRR benchmarks NLU systems' ability to infer logical rules from text.

problem NLU models' failure to generalize systematically and robustly.
method CLUTRR suite requires inference of kinship relations from short stories, evaluating generalization and robustness.
result Graph-based models outperform state-of-the-art NLU models in generalization and robustness.

NTP struggles to learn relationships without increased exploration.

problem NTP's performance in extracting true relationships among data is poor.
method Created synthetic logical datasets with injected relationships to test NTP's performance and identify algorithmic issues.
result Increasing exploration in NTP's algorithm improves its performance in recovering relationships.

Deep neural networks have achieved impressive supervised classification performance in many tasks including image recognition, speech recognition, and sequence to sequence learning. However, this success has not been translated to applications like question answering that may involve complex arithmetic and logic reason…

2015-11-16abs ↗pdf ↗