Related papers: PFA(S)[S] for the masses

This paper presents a new ensemble learning method for classification problems called projection pursuit random forest (PPF). PPF uses the PPtree algorithm introduced in Lee et al. (2013). In PPF, trees are constructed by splitting on…

We explore resolutions of monomial ideals supported by simplicial trees. We argue that since simplicial trees are acyclic, the criterion of Bayer, Peeva and Sturmfels for checking if a simplicial complex supports a free resolution of a…

We present a generalisation of the sifting procedure introduced originally by Sims for computation with finite permutation groups, and now used for many computational procedures for groups, such as membership testing and finding group…

Deep reinforcement learning has proven remarkably useful in training agents from unstructured data. However, the opacity of the produced agents makes it difficult to ensure that they adhere to various requirements posed by human engineers.…

We introduce swordfish, a Monte-Carlo-free Python package to predict expected exclusion limits, the discovery reach and expected confidence contours for a large class of experiments relevant for particle- and astrophysics. The tool is…

We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and score normalisation functions are tested. Our results show…

Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant requires merging two paths in a single operation. In contrast to the standard…

We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…

Fair clustering has gained increasing attention in recent years, especially in applications involving socially sensitive attributes. However, existing fair clustering methods often lack interpretability, limiting their applicability in…

The S-matrices for non-simply-laced affine Toda field theories are considered in the context of a generalised bootstrap principle. The S-matrices, and in particular their poles, depend on a parameter whose range lies between the Coxeter…

We investigate the perturbative integrability of massive (1+1)-dimensional bosonic quantum field theories, focusing on the conditions for them to have a purely elastic S-matrix, with no particle production and diagonal scattering, at tree…

The separation between two theorems in reverse mathematics is usually done by constructing a Turing ideal satisfying a theorem P and avoiding the solutions to a fixed instance of a theorem Q. Lerman, Solomon and Towsner introduced a forcing…

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those…

We introduce a new combinatorial principle which we call $\clubsuit_{AD}$. This principle asserts the existence of a certain multi-ladder system with guessing and almost-disjointness features, and is shown to be sufficient for carrying out…

We propose a novel weakly supervised learning segmentation based on several global constraints derived from box annotations. Particularly, we leverage a classical tightness prior to a deep learning setting via imposing a set of constraints…

In Mathias forcing, conditions are pairs $(D,S)$ of sets of natural numbers, in which $D$ is finite, $S$ is infinite, and $\max D < \min S$. The Turing degrees and computational characteristics of generics for this forcing in the special…

Interpretability has become incredibly important as machine learning is increasingly used to inform consequential decisions. We propose to construct global explanations of complex, blackbox models in the form of a decision tree…

First-class constraints constitute a potential obstacle to the computation of a Poisson bracket in Dirac's theory of constrained Hamiltonian systems. Using the pseudoinverse instead of the inverse of the matrix defined by the Poisson…

We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).