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

Trend · papers per month

9192837 · Jun 202019922001200920172026
48 results for logical inconsistencies

The paper proposes a method to evaluate superhuman models by checking for logical inconsistencies.

problem Evaluating superhuman models when ground truth is hard to obtain.
method A framework using consistency checks to identify logical inconsistencies in model decisions.
result Logical inconsistencies can be discovered in superhuman model decisions across various tasks.

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.

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.

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 ↗

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.

Recent years have witnessed the great success of deep neural networks in many research areas. The fundamental idea behind the design of most neural networks is to learn similarity patterns from data for prediction and inference, which lacks the ability of logical reasoning. However, the concrete ability of logical reas…

2019-10-17abs ↗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.

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.

Many software analysis methods have come to rely on machine learning approaches. Code segmentation - the process of decomposing source code into meaningful blocks - can augment these methods by featurizing code, reducing noise, and limiting the problem space. Traditionally, code segmentation has been done using syntact…

2019-07-18abs ↗pdf ↗

While neural networks are good at learning unspecified functions from training samples, they cannot be directly implemented in hardware and are often not interpretable or formally verifiable. On the other hand, logic circuits are implementable, verifiable, and interpretable but are not able to learn from training data …

2020-02-10abs ↗pdf ↗

Knowledge graph reasoning, which aims at predicting the missing facts through reasoning with the observed facts, is critical to many applications. Such a problem has been widely explored by traditional logic rule-based approaches and recent knowledge graph embedding methods. A principled logic rule-based approach is th…

2019-06-20abs ↗pdf ↗

We propose the Neural Logic Machine (NLM), a neural-symbolic architecture for both inductive learning and logic reasoning. NLMs exploit the power of both neural networks---as function approximators, and logic programming---as a symbolic processor for objects with properties, relations, logic connectives, and quantifier…

2019-04-26abs ↗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.

Deep learning is very effective at jointly learning feature representations and classification models, especially when dealing with high dimensional input patterns. Probabilistic logic reasoning, on the other hand, is capable to take consistent and robust decisions in complex environments. The integration of deep learn…

2019-01-14abs ↗pdf ↗

We describe the concept of logical scaffolds, which can be used to improve the quality of software that relies on AI components. We explain how some of the existing ideas on runtime monitors for perception systems can be seen as a specific instance of logical scaffolds. Furthermore, we describe how logical scaffolds ma…

2019-09-12abs ↗pdf ↗

Effectively combining logic reasoning and probabilistic inference has been a long-standing goal of machine learning: the former has the ability to generalize with small training data, while the latter provides a principled framework for dealing with noisy data. However, existing methods for combining the best of both w…

2019-06-05abs ↗pdf ↗

We study consistency properties of machine learning methods based on minimizing convex surrogates. We extend the recent framework of Osokin et al. (2017) for the quantitative analysis of consistency properties to the case of inconsistent surrogates. Our key technical contribution consists in a new lower bound on the ca…

2018-10-26abs ↗pdf ↗

Study solves HJB equations for time-inconsistent control problems.

problem Time-inconsistent deterministic linear quadratic control problems.
method Characterized solutions using Riccati equations with integral terms, proving uniqueness.
result Uniqueness of solutions to equilibrium HJB equations proved.

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.

Despite their great success in recent years, deep neural networks (DNN) are mainly black boxes where the results obtained by running through the network are difficult to understand and interpret. Compared to e.g. decision trees or bayesian classifiers, DNN suffer from bad interpretability where we understand by interpr…

2019-07-01abs ↗pdf ↗

This paper tackles objective inconsistency in federated optimization with heterogeneous clients.

problem Objective inconsistency due to heterogeneity in clients' datasets and computation speeds.
method General framework for analyzing federated heterogeneous optimization algorithms, including FedAvg and FedProx, and proposing FedNova.
result FedNova eliminates objective inconsistency while preserving fast error convergence.

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.

We introduce neural Markov logic networks (NMLNs), a statistical relational learning system that borrows ideas from Markov logic. Like Markov logic networks (MLNs), NMLNs are an exponential-family model for modelling distributions over possible worlds, but unlike MLNs, they do not rely on explicitly specified first-ord…

2019-05-31abs ↗pdf ↗

In 1938, Tarski proved that a formula is not intuitionistically valid if, and only if, it has a counter-model in the Heyting algebra of open sets of some topological space. In fact, Tarski showed that any Euclidean space R^n with n >= 1 suffices, as does e.g. the Cantor space. In particular, intuitionistic logic cannot…

2017-01-18abs ↗pdf ↗

Study time-inconsistent portfolio optimization for competitive agents with relative performance criteria.

problem Time-inconsistent mean field and n-agent games under relative performance criteria.
method Construct open-loop equilibrium strategies for n-agent games and mean field games.
result Explicit solutions for n-agent games and mean field games, unique in a special class of equilibria.

It is feasible and practically-valuable to bridge the characteristics between graph neural networks (GNNs) and logical reasoning. Despite considerable efforts and successes witnessed to solve Boolean satisfiability (SAT), it remains a mystery of GNN-based solvers for more complex predicate logic formulae. In this work,…

2019-09-25abs ↗pdf ↗

Develops a reinforcement learning algorithm for learning deterministic equilibrium policies in time-inconsistent control problems.

problem Learning equilibrium policies in time-inconsistent control problems.
method Continuous-time model-free reinforcement learning algorithm using deterministic policy gradient approach.
result Learned equilibrium policies in general time-inconsistent control problems.

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 ↗

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 ↗

Paper uses subjective logic to estimate uncertainty in multi-armed bandit problems.

problem Estimating uncertainty in multi-armed bandit problems.
method Formalism of subjective logic applied to multi-armed bandits, proposing new algorithms.
result Subjective logic quantities enable useful assessment of uncertainty.

Paper solves a complex portfolio selection problem with time-inconsistent preferences.

problem Time-inconsistent preferences in portfolio selection.
method Unified framework with minimal assumptions, proving existence and uniqueness of solution.
result Existence and uniqueness of square-integrable solution for the integral equation.

The study examines causal razors and their logical relations, highlighting a dilemma in causal discovery.

problem Selecting a reasonable scoring criterion for causal discovery algorithms.
method Review and logical comparison of numerous causal razors, focusing on parameter minimality in multinomial models.
result Parameter minimality poses a dilemma in selecting a reasonable scoring criterion for causal discovery algorithms.