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

4897145193 · Jun 202019922001200920172026
48 results for logical operators

Paper studies a universal logical operator for deep networks, improving interpretability.

problem Learning a universal logical operator for deep convolution networks without manual prescription.
method Exploration of different logical operators (AND, OR, XOR) and learning a universal one.
result Insightful observations lead to a novel logical interpretation of deep convolution networks.

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.

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 ↗

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.

Designing effective and efficient classifier for pattern analysis is a key problem in machine learning and computer vision. Many the solutions to the problem require to perform logic operations such as `and', `or', and `not'. Classification and regression tree (CART) include these operations explicitly. Other methods s…

2014-05-27abs ↗pdf ↗

New fault-tolerant quantum gates for homological LDPC codes with constant or almost-constant rate.

problem Fault-tolerant quantum computing for homological LDPC codes with constant or almost-constant encoding rate.
method Derive generic formula for transversal and logical gates acting on 3-manifolds, using higher symmetries and cup product cohomology.
result Parallelizable logical gates for homological LDPC codes with constant or almost-constant rate.

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 ↗

New protocols implement logical gates on encoded qubits with minimal overhead.

problem Efficiently performing universal logical gates on encoded qubits with minimal overhead.
method Using topological codes associated to hyperbolic surfaces, we introduce protocols to implement Dehn twists through constant depth unitary circuits.
result Demonstrated the possibility of applying universal logical gate sets on encoded qubits through constant depth unitary circuits and with constant space overhead.

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.

Query2box embeds complex queries as boxes to handle logical operations in large KGs.

problem Handling complex logical queries on large-scale incomplete knowledge graphs.
method Embed KG entities and queries into a vector space as boxes, handling conjunctions as intersections and disjunctions through Disjunctive Normal Form.
result Query2box achieves up to 25% relative improvement over state-of-the-art methods.

Neuro-symbolic agent learns systematic generalisation from formal instructions.

problem Achieving zero-shot generalisation of formally specified tasks.
method Combines deep reinforcement learning with temporal logic.
result Systematic learning emerges with convolutional layers and abstract operators.

Unified model learns concepts across domains like left and right.

problem Limited generalization of language concepts in inference-only models.
method Logic-Enhanced Foundation Model (LEFT) with a differentiable, domain-independent program executor.
result LEFT flexibly learns and reasons with concepts across 2D images, 3D scenes, human motions, and robotic manipulation.

AlphaLogics mines market logic to generate interpretable alpha factors.

problem Complex, opaque alpha factors from factor mining overlook market logic.
method Market Logic Mining, Factor Generation and Optimization, Market Logic Generation and Optimization.
result AlphaLogics improves predictive metrics and risk-adjusted returns over baselines.

The paper explains how continuous language models can produce discrete, interpretable meanings.

problem Semantic collapse in continuous systems of large language models.
method Formalizing large language models as Continuous State Machines (CSMs) and analyzing the associated transfer operator.
result The leading eigenfunctions of the transfer operator induce a finite number of invariant meaning basins, explaining how continuous computation can produce discrete, interpretable semantics.

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.

Polyhedral semantics for intermediate logics; Nerve Criterion ensures completeness.

problem Characterize polyhedrally-complete intermediate logics.
method Developed Nerve Criterion to characterize polyhedrally-complete logics combinatorially.
result Nerve Criterion provides a necessary and sufficient condition for polyhedrally-completeness.

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.

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.

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.

GraIL predicts relations by reasoning over subgraphs, outperforming embeddings.

problem Relation prediction in knowledge graphs using latent representations is limited.
method Graph neural network with inductive bias to learn entity-independent relational semantics.
result GraIL outperforms existing rule-induction baselines in the inductive setting.

FPGA-based logic architecture speeds up GBDT training 259x.

problem Training efficiency and power consumption in GBDT models.
method Implemented logic architecture on FPGA, compared with software libraries.
result Training speed 26-259x faster, power efficiency 90-1,104x higher.

The purpose of this paper is to discuss how topology and geometry provide, in many instances, the connective tissue that enables logical comprehension. We illustrate this theme with many examples including Venn diagrams, knot diagrams, knot-logical diagrams and an arrow of reference that elucidates self-reference and G…

2015-08-25abs ↗pdf ↗

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.

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.

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.

Approach for modeling EHR data with rare features, improving prediction and interpretation.

problem Challenges in modeling rare binary features in EHR data.
method Tree-guided feature selection and logic aggregation for large-scale regression.
result Improved prediction and model interpretation of suicide risk in EHR data.

Paper introduces a new framework combining deep learning and logic for relational data.

problem Scalability and flexibility of deep learning methods for relational data.
method Combines auto-encoding principle with first-order logic and logic programs.
result Latent representations are more accurate, flexible, and interpretable.

Responds to comments on Bayesian Logic Regression algorithm, provides extensions and tutorial.

problem Improving Bayesian Logic Regression algorithm and its applications.
method Summarizes and responds to discussants' comments, provides extensions and tutorial.
result Extensions and tutorial for the Bayesian Logic Regression algorithm.

Better neural arithmetic logic units improve cell counting model generalization.

problem Neural networks struggle with high cell counts outside training data range.
method Introduced Neural Arithmetic Logic Units (NALU) for arithmetic operations in existing architectures.
result Improved cell counting accuracy for higher numeric ranges with better generalization.

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.