Related papers: Learning families of algebraic structures from inf…
Recently, a surprising connection between algorithmic learning of algebraic structures and descriptive set theory has emerged. Following this line of research, we define the learning power of an equivalence relation $E$ on a topological…
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a scoring criterion that favors the simplest model able to…
We establish the Borel computability of various C$^*$-algebra invariants, including the Elliott invariant and the Cuntz semigroup. As applications we deduce that AF algebras are classifiable by countable structures, and that a conjecture of…
We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…
The paper studies the structure of restricted Leibniz algebras. More specifically speaking, we first give the equivalent definition of restricted Leibniz algebras, which is by far more tractable than that of a restricted Leibniz algebras in…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
This paper is devoted to the classification and studying properties of complex unital $3$-dimensional structurable algebras. We provide a complete list of non-isomorphic classes, identifying five algebras for type $(2, 1)$ and two algebras…
The kernel exponential family is a rich class of distributions, which can be fit efficiently and with statistical guarantees by score matching. Being required to choose a priori a simple kernel such as the Gaussian, however, limits its…
In an earlier paper, we introduced ``bordered knot algebras'', which are graded algebras indexed by a pair of integers (m,k). In a subsequent paper, we introduced a two-parameter family of differential graded algebra, the ``pong algebras'',…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated what algebraic structures can be realised in worlds given by a positive (= recursively enumerable) equivalence relation which partitions the natural numbers into…
Graphical models can represent a multivariate distribution in a convenient and accessible form as a graph. Causal models can be viewed as a special class of graphical models that not only represent the distribution of the observed system…
We study the algebraic constraints on the structure of nilpotent Lie algebra $\mathbb{g}$, which arise because of the presence of an integrable complex structure $J$. Particular attention is paid to non-abelian complex structures.…
Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…
We study PAC and online learnability of hypothesis classes formed by copies of a countably infinite graph G, where each copy is induced by permuting G's vertices. This corresponds to learning a graph's labeling, knowing its structure and…
In this paper we derive an efficient algorithm to learn the parameters of structured predictors in general graphical models. This algorithm blends the learning and inference tasks, which results in a significant speedup over traditional…
For finite semidistributive lattices the map $\kappa$ gives a bijection between the sets of completely join-irreducible elements and completely meet-irreducible elements. Here we study the $\kappa$-map in the context of torsion classes. It…
We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in general dynamical systems, both invertible and…
Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for different types of automata. The CALF project seeks to unify…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…