Related papers: Ordered Black Boxes: Existence
We define a countable antichain condition (ccc) property for partial orderings, weaker than precalibre-$\aleph_1$, and show that Martin's axiom restricted to the class of partial orderings that have the property does not imply Martin's…
We present a general black box theorem that ensures convergence of a sequence of stationary Markov processes, provided a few assumptions are satisfied. This theorem relies on a control of the resolvents of the sequence of Markov processes,…
There exists a family $\{B_{\alpha}\}_{\alpha<\omega_1}$ of sets of countable ordinals such that o $\max B_{\alpha}=\alpha$, o if $\alpha\in B_{\beta}$ then $B_{\alpha}\subseteq B_{\beta}$, o if $\lambda\leq \alpha$ and $\lambda$ is a limit…
In situations where explanations of black-box models may be useful, the fairness of the black-box is also often a relevant concern. However, the link between the fairness of the black-box model and the behavior of explanations for the…
In this article we study a coarse version of the $K$-theoretic Farrell--Jones conjecture we call coarse or bounded isomorphism conjecture. Using controlled category theory we are able to translate this conjecture for asymptotically faithful…
Classical black holes and event horizons are highly non-local objects, defined in relation to the causal past of future null infinity. Alternative, quasilocal characterizations of black holes are often used in mathematical, quantum, and…
We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…
Objects that are on the verge of being extremal black holes but actually are distinct in many ways are called quasi-black holes. Quasi-black holes are defined here and treated in a unified way through the displaying of their properties. The…
Very compact objects probe extreme gravitational fields and may be the key to understand outstanding puzzles in fundamental physics. These include the nature of dark matter, the fate of spacetime singularities, or the loss of unitarity in…
This paper discusses a special kind of convex constrained optimization problem, whose constraints consist of box inequalities and linear equalities. For this problem, in addition to general optimization algorithms such as exact penalty…
Primordial black holes (PBHs) may have formed in the early Universe and may account for all or part of the dark matter. In this review, we summarize the current observational constraints on PBHs across the full mass range, highlight…
Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…
We consider the problem of explaining the predictions of an arbitrary blackbox model $f$: given query access to $f$ and an instance $x$, output a small set of $x$'s features that in conjunction essentially determines $f(x)$. We design an…
Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…
This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…
We present two first-order, sequential optimization algorithms to solve constrained optimization problems. We consider a black-box setting with a priori unknown, non-convex objective and constraint functions that have Lipschitz continuous…
In this paper, we consider a quantum algorithm for solving the following problem: ``Suppose $f$ is a function given as a black box (that is also called an oracle) and $f$ is invariant under some AND-mask. Examine a property of $f$ by…
We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…
We look at the internal structure of neural networks which is usually treated as a black box. The easiest and the most comprehensible thing to do is to look at a binary classification and try to understand the approach a neural network…
We consider a microscopic model of a stretched horizon of the Schwarzschild black hole. In our model the stretched horizon consists of a finite number of discrete constituents. Assuming that the quantum states of the Schwarzschild black…