Jonathan Lenchner
YOU?
Author Swipe
View article: Fast, slow, and metacognitive thinking in AI
Fast, slow, and metacognitive thinking in AI Open
Inspired by the ”thinking fast and slow” cognitive theory of human decision making, we propose a multi-agent cognitive architecture (SOFAI) that is based on ”fast”/”slow” solvers and a metacognitive module. We then present experimental res…
View article: Who Wins the Multi-Structural Game?
Who Wins the Multi-Structural Game? Open
Combinatorial games played between two players, called Spoiler and Duplicator, have often been used to capture syntactic properties of formal logical languages. For instance, the widely used Ehrenfeucht-Fraïssé (EF) game captures the synta…
View article: SynPAT: A System for Generating Synthetic Physical Theories with Data
SynPAT: A System for Generating Synthetic Physical Theories with Data Open
Machine-assisted methods for discovering new physical laws of nature, starting from a given background theory and data, have recently emerged, and seem to hold the promise of someday advancing our understanding of the physical world. To ad…
View article: Multi-Structural Games and Number of Quantifiers
Multi-Structural Games and Number of Quantifiers Open
We study multi-structural games, played on two sets $\mathcal{A}$ and $\mathcal{B}$ of structures. These games generalize Ehrenfeucht-Fra\"{i}ss\'{e} games. Whereas Ehrenfeucht-Fra\"{i}ss\'{e} games capture the quantifier rank of…
View article: Breaking through the classical Shannon entropy limit: A new frontier through logical semantics
Breaking through the classical Shannon entropy limit: A new frontier through logical semantics Open
Information theory has provided foundations for the theories of several application areas critical for modern society, including communications, computer storage, and AI. A key aspect of Shannon's 1948 theory is a sharp lower bound on the …
View article: Multi-Structural Games and Beyond
Multi-Structural Games and Beyond Open
Multi-structural (MS) games are combinatorial games that capture the number of quantifiers of first-order sentences. On the face of their definition, MS games differ from Ehrenfeucht-Fraisse (EF) games in two ways: first, MS games are play…
View article: A Neuro-Symbolic Approach to Multi-Agent RL for Interpretability and Probabilistic Decision Making
A Neuro-Symbolic Approach to Multi-Agent RL for Interpretability and Probabilistic Decision Making Open
Multi-agent reinforcement learning (MARL) is well-suited for runtime decision-making in optimizing the performance of systems where multiple agents coexist and compete for shared resources. However, applying common deep learning-based MARL…
View article: Parallel Play Saves Quantifiers
Parallel Play Saves Quantifiers Open
The number of quantifiers needed to express first-order properties is captured by two-player combinatorial games called multi-structural (MS) games. We play these games on linear orders and strings, and introduce a technique we call "paral…
View article: On the Number of Quantifiers Needed to Define Boolean Functions
On the Number of Quantifiers Needed to Define Boolean Functions Open
The number of quantifiers needed to express first-order (FO) properties is captured by two-player combinatorial games called multi-structural games. We analyze these games on binary strings with an ordering relation, using a technique we c…
View article: Parameter-dependent model-blending with multi-expert based machine learning and proxy sites
Parameter-dependent model-blending with multi-expert based machine learning and proxy sites Open
A parameter-based multi-model blending method and system are described. The method includes selecting a parameter of interest among parameters estimated by each of a set of individual models, running the set of individual models with a ran…
View article: Multi-Structural Games and Beyond
Multi-Structural Games and Beyond Open
Multi-structural (MS) games are combinatorial games that capture the number of quantifiers of first-order sentences. On the face of their definition, MS games differ from Ehrenfeucht-Fraisse (EF) games in two ways: first, MS games are play…
View article: Towards a Unification of Logic and Information Theory
Towards a Unification of Logic and Information Theory Open
Today, the vast majority of the world's digital information is represented using the fundamental assumption, introduced by Claude Shannon in 1948, that ``...the semantic aspects of communication are irrelevant to the engineering problem (o…
View article: On the Number of Quantifiers as a Complexity Measure
On the Number of Quantifiers as a Complexity Measure Open
In 1981, Neil Immerman described a two-player game, which he called the "separability game" [Neil Immerman, 1981], that captures the number of quantifiers needed to describe a property in first-order logic. Immerman’s paper laid the ground…
View article: E-PDDL: A Standardized Way of Defining Epistemic Planning Problems
E-PDDL: A Standardized Way of Defining Epistemic Planning Problems Open
Epistemic Planning (EP) refers to an automated planning setting where the agent reasons in the space of knowledge states and tries to find a plan to reach a desirable state from the current state. Its general form, the Multi-agent Epistemi…
View article: Thinking Fast and Slow in AI
Thinking Fast and Slow in AI Open
This paper proposes a research direction to advance AI which draws inspiration from cognitive theories of human decision making. The premise is that if we gain insights about the causes of some human capabilities that are still lacking in …
View article: Multi-Structural Games and Number of Quantifiers
Multi-Structural Games and Number of Quantifiers Open
We study multi-structural games, played on two sets $\mathcal{A}$ and $\mathcal{B}$ of structures. These games generalize Ehrenfeucht-Fraïssé games. Whereas Ehrenfeucht-Fraïssé games capture the quantifier rank of a first-order sentence, m…
View article: Thinking Fast and Slow in AI
Thinking Fast and Slow in AI Open
This paper proposes a research direction to advance AI which draws inspiration from cognitive theories of human decision making. The premise is that if we gain insights about the causes of some human capabilities that are still lacking in …
View article: A Finitist's Manifesto: Do we need to Reformulate the Foundations of Mathematics?
A Finitist's Manifesto: Do we need to Reformulate the Foundations of Mathematics? Open
There is a problem with the foundations of classical mathematics, and potentially even with the foundations of computer science, that mathematicians have by-and-large ignored. This essay is a call for practicing mathematicians who have bee…
View article: On a Generalization of the Marriage Problem
On a Generalization of the Marriage Problem Open
We present a generalization of the marriage problem underlying Hall's famous Marriage Theorem to what we call the Symmetric Marriage Problem, a problem that can be thought of as a special case of Maximal Weighted Bipartite Matching. We sho…
View article: From Hall's Marriage Theorem to Boolean Satisfiability and Back
From Hall's Marriage Theorem to Boolean Satisfiability and Back Open
Motivated by the application of Hall's Marriage Theorem in various LP-rounding problems, we introduce a generalization of the classical marriage problem (CMP) that we call the Fractional Marriage Problem. We show that the Fractional Marria…
View article: Symbiotic Cognitive Computing
Symbiotic Cognitive Computing Open
IBM Research is engaged in a research program in symbiotic cognitive computing to investigate how to embed cognitive computing in physical spaces. This article proposes five key principles of symbiotic cognitive computing: context, connect…