Related papers: Mutual Interpretability of Weak Essentially Undeci…
Model interpretability has become an important problem in machine learning (ML) due to the increased effect that algorithmic decisions have on humans. Counterfactual explanations can help users understand not only why ML models make certain…
We study the positive theory of groups acting on trees and show that under the presence of weak small cancellation elements, the positive theory of the group is trivial, i.e. coincides with the positive theory of a non-abelian free group.…
A brief review of the status of duality symmetries in string theory is presented. The evidence is accumulating rapidly that an enormous group of duality symmetries, including perturbative T dualities and non-perturbative S-dualities,…
A rooted tree module (RTM) $M:=M(T,F)$ over a zero-relation algebra $\Lambda:=\mathcal KQ/\langle\rho\rangle$ over a field $\mathcal K$ is given by the data of a quiver morphism $F:T\to Q$ from a rooted tree $T$ (either with a source or a…
Kruskal's theorem famously states that finite trees (ordered using an infima-preserving embeddability relation) form a well partial order. Freund, Rathjen, and Weiermann extended this result to general recursive data types with their…
Ensemble methods such as random forests have transformed the landscape of supervised learning, offering highly accurate prediction through the aggregation of multiple weak learners. However, despite their effectiveness, these methods often…
In this paper we study unitary Ramond twisted representations of minimal $W$-algebras. We classify all such irreducible highest weight representations with a non-Ramond extremal highest weight (unitarity in the Ramond extremal case, as well…
The tree-level amplitudes in $\beta$-deformed theory are studied from twistor string theory. We first show that a simple generalization of the proposal in hep-th/0410122 gives the correct results for all of the tree-level amplitudes to the…
We characterize those finitely generated commutative rings which are (parametrically) bi-interpretable with arithmetic: a finitely generated commutative ring $A$ is bi-interpretable with $(\mathbb N,{+},{\times})$ if and only if the space…
We prove that metabelian Baumslag$-$Solitar group $BS(1,k)$, $k>1$, is (strongly) regularly bi-interpretable with the ring of integers $\mathbb{Z}$, and describe in algebraic terms all groups that are elementarily equivalent to $BS(1,k)$.
The conjectured duality relating all-loop leading singularities of n-particle N^(k-2)MHV scattering amplitudes in N=4 SYM to a simple contour integral over the Grassmannian G(k,n) makes all the symmetries of the theory manifest. Every…
We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…
The natural join and the inner union operations combine relations of a database. Tropashko and Spight [24] realized that these two operations are the meet and join operations in a class of lattices, known by now as the relational lattices.…
Let $A$ be a unital $C^*$-algebra generated by some separable operator system $S$. More than a decade ago, Arveson conjectured that $S$ is hyperrigid in $A$ if all irreducible representations of $A$ are boundary representations for $S$.…
The field of health informatics has been profoundly influenced by the development of random forest models, which have led to significant advances in the interpretability of feature interactions. These models are characterized by their…
The ability to interpret Machine Learning (ML) models is becoming increasingly essential. However, despite significant progress in the field, there remains a lack of rigorous characterization regarding the innate interpretability of…
Being able to interpret, or explain, the predictions made by a machine learning model is of fundamental importance. This is especially true when there is interest in deploying data-driven models to make high-stakes decisions, e.g. in…
We analyze the trade-off between model complexity and accuracy for random forests by breaking the trees up into individual classification rules and selecting a subset of them. We show experimentally that already a few rules are sufficient…
A modified realisability interpretation of infinitary logic is formalised and proved sound in constructive type theory (CTT). The logic considered subsumes first order logic. The interpretation makes it possible to extract programs with…
Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…