Generalization-baed similarity
- URL: http://arxiv.org/abs/2302.10096v8
- Date: Sat, 17 May 2025 12:48:55 GMT
- Title: Generalization-baed similarity
- Authors: Christian Antić,
- Abstract summary: We develop an abstract notion of similarity based on the observation that sets of generalizations encode important properties of elements.<n>We show that similarity defined in this way has appealing mathematical properties.<n>We sketch some potential applications to theoretical computer science and artificial intelligence.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops \textit{from the ground up} an abstract algebraic and qualitative notion of similarity based on the observation that sets of generalizations encode important properties of elements. We show that similarity defined in this way has appealing mathematical properties. As we construct our notion of similarity from first principles using only elementary concepts of universal algebra, to convince the reader of its plausibility, we show that it can model fundamental relations occurring in mathematics and be naturally embedded into first-order logic via model-theoretic types. Finally, we sketch some potential applications to theoretical computer science and artificial intelligence.
Related papers
- A Complexity-Based Theory of Compositionality [53.025566128892066]
In AI, compositional representations can enable a powerful form of out-of-distribution generalization.
Here, we propose a formal definition of compositionality that accounts for and extends our intuitions about compositionality.
The definition is conceptually simple, quantitative, grounded in algorithmic information theory, and applicable to any representation.
arXiv Detail & Related papers (2024-10-18T18:37:27Z) - Analogical proportions II [0.0]
Analogical reasoning is the ability to detect parallels between two seemingly distant objects or situations.
Analogical proportions are expressions of the form $a$ is to $b$ what $c$ is to $d$'' at the core of analogical reasoning.
arXiv Detail & Related papers (2024-05-22T09:02:12Z) - Provable Compositional Generalization for Object-Centric Learning [55.658215686626484]
Learning representations that generalize to novel compositions of known concepts is crucial for bridging the gap between human and machine perception.
We show that autoencoders that satisfy structural assumptions on the decoder and enforce encoder-decoder consistency will learn object-centric representations that provably generalize compositionally.
arXiv Detail & Related papers (2023-10-09T01:18:07Z) - Algebras of actions in an agent's representations of the world [51.06229789727133]
We use our framework to reproduce the symmetry-based representations from the symmetry-based disentangled representation learning formalism.
We then study the algebras of the transformations of worlds with features that occur in simple reinforcement learning scenarios.
Using computational methods, that we developed, we extract the algebras of the transformations of these worlds and classify them according to their properties.
arXiv Detail & Related papers (2023-10-02T18:24:51Z) - A partial defense of algebraic relationalism [6.793496936204057]
I defend algebraicism as a genuine relationalist view against the conventional wisdom that it is equivalent to substantivalism.
I criticize the standard version of algebraicism that is considered equivalent to substantivalism.
arXiv Detail & Related papers (2023-09-07T10:32:24Z) - A Recursive Bateson-Inspired Model for the Generation of Semantic Formal
Concepts from Spatial Sensory Data [77.34726150561087]
This paper presents a new symbolic-only method for the generation of hierarchical concept structures from complex sensory data.
The approach is based on Bateson's notion of difference as the key to the genesis of an idea or a concept.
The model is able to produce fairly rich yet human-readable conceptual representations without training.
arXiv Detail & Related papers (2023-07-16T15:59:13Z) - A Category-theoretical Meta-analysis of Definitions of Disentanglement [97.34033555407403]
Disentangling the factors of variation in data is a fundamental concept in machine learning.
This paper presents a meta-analysis of existing definitions of disentanglement.
arXiv Detail & Related papers (2023-05-11T15:24:20Z) - On the Complexity of Bayesian Generalization [141.21610899086392]
We consider concept generalization at a large scale in the diverse and natural visual spectrum.
We study two modes when the problem space scales up, and the $complexity$ of concepts becomes diverse.
arXiv Detail & Related papers (2022-11-20T17:21:37Z) - Artificial Cognitively-inspired Generation of the Notion of Topological
Group in the Context of Artificial Mathematical Intelligence [0.0]
We provide the explicit artificial generation (or conceptual computation) for the fundamental mathematical notion of topological groups.
The concept of topological groups is explicitly generated through three different artificial specifications.
arXiv Detail & Related papers (2021-12-05T01:39:34Z) - Learning Algebraic Representation for Systematic Generalization in
Abstract Reasoning [109.21780441933164]
We propose a hybrid approach to improve systematic generalization in reasoning.
We showcase a prototype with algebraic representation for the abstract spatial-temporal task of Raven's Progressive Matrices (RPM)
We show that the algebraic representation learned can be decoded by isomorphism to generate an answer.
arXiv Detail & Related papers (2021-11-25T09:56:30Z) - Reasoning about conscious experience with axiomatic and graphical
mathematics [0.46408356903366527]
We cast aspects of consciousness in axiomatic mathematical terms, using the graphical calculus of general process theories.
A toy example using the axiomatic calculus is given to show the power of this approach.
arXiv Detail & Related papers (2021-06-30T13:39:02Z) - Probabilistic Analogical Mapping with Semantic Relation Networks [2.084078990567849]
We present a new computational model of analogical mapping, based on semantic relation networks.
We show that the model accounts for a broad range of phenomena involving analogical mapping by both adults and children.
arXiv Detail & Related papers (2021-03-30T22:14:13Z) - On Computable Geometric Expressions in Quantum Theory [0.0]
We propose criteria given which statistics of expressions in geometric algebra are computable in quantum theory.
One must be able to arbitrarily transform the basis of the Clifford algebra, via multiplication by elements of the algebra that act trivially on the state space.
arXiv Detail & Related papers (2020-12-11T16:07:57Z) - Relational reasoning and generalization using non-symbolic neural
networks [66.07793171648161]
Previous work suggested that neural networks were not suitable models of human relational reasoning because they could not represent mathematically identity, the most basic form of equality.
We find neural networks are able to learn basic equality (mathematical identity), (2) sequential equality problems (learning ABA-patterned sequences) with only positive training instances, and (3) a complex, hierarchical equality problem with only basic equality training instances.
These results suggest that essential aspects of symbolic reasoning can emerge from data-driven, non-symbolic learning processes.
arXiv Detail & Related papers (2020-06-14T18:25:42Z) - Analogical Proportions [0.0]
This paper introduces an abstract framework of analogical proportions of the form $a$ is to $b$ what $c$ is to $d$' in the general setting of universal algebra.
It turns out that our notion of analogical proportions has appealing mathematical properties.
This paper is a first step towards a theory of analogical reasoning and learning systems with potential applications to fundamental AI-problems.
arXiv Detail & Related papers (2020-06-04T13:44:36Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.