Related papers: Domain Theory in Constructive and Predicative Univ…
We introduce a family of discrete context-specific models, which we call decomposable. We construct this family from the subclass of staged tree models known as CStree models. We give an algebraic and combinatorial characterization of all…
We provide a comprehensive development of the basics of descriptive set theory for non-separable complete metric spaces whose weight is a singular cardinal $\lambda$ of countable confinality. Somewhat unexpectedly, the resulting theory is…
In imperative programming, the Domain-Driven Design methodology helps in coping with the complexity of software development by materializing in code the invariants of a domain of interest. Code is cleaner and more secure because any…
We begin the study of categorifications of Donaldson-Thomas invariants associated with Hilbert schemes of points on the three-dimensional affine space, which we call DT categories. The DT category is defined to be the category of matrix…
In analogy to the situation for continuous lattices which were introduced by Dana Scott as precisely the injective T$_0$ spaces via the (nowadays called) Scott topology, we study those metric spaces which correspond to injective T$_0$…
A strategy to construct physics-based local surrogate models for parametric Stokes flows and coupled Stokes-Darcy systems is presented. The methodology relies on the proper generalized decomposition (PGD) method to reduce the dimensionality…
Concrete domains have been introduced in the context of Description Logics to allow references to qualitative and quantitative values. In particular, the class of $\omega$-admissible concrete domains, which includes Allen's interval…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
Conformal prediction (CP) constructs uncertainty sets for model outputs with finite-sample coverage guarantees. A candidate output is included in the prediction set if its non-conformity score is not considered extreme relative to the…
We give an adequate denotational semantics for languages with recursive higher-order types, continuous probability distributions, and soft constraints. These are expressive languages for building Bayesian models of the kinds used in…
Conformal prediction provides a distribution-free framework for uncertainty quantification via prediction sets with exact finite-sample coverage. In low dimensions these sets are easy to interpret, but in high-dimensional or structured…
Domain shift, characterized by degraded model performance during transition from labeled source domains to unlabeled target domains, poses a persistent challenge for deploying deep learning systems. Current unsupervised domain adaptation…
A relativistic generalisation of a well-known method for approximating the dynamics of topological defects in condensed matter is constructed, and applied to the evolution of domain walls in a cosmological context. It is shown that there…
A powerful tool for studying the behavior of classical field theories is Derrick's theorem: one may rule out the existence of localized inhomogeneous stable field configurations (solitons) by inspecting the Hamiltonian and making scaling…
We consider model-based derivative-free optimization (DFO) for large-scale problems, based on iterative minimization in random subspaces. We provide the first worst-case complexity bound for such methods for convergence to approximate…
Deep implicit functions (DIFs), as a kind of 3D shape representation, are becoming more and more popular in the 3D vision community due to their compactness and strong representation power. However, unlike polygon mesh-based templates, it…
This thesis presents an alternative to Cantor's theory of cardinality, insofar as that is understood as a theory of set size. The alternative is based on a general theory, ClassSize. ClassSize contains all sentences in the first order…
We introduce a ZFC method that enables us to build spaces (in fact special dense subspaces of certain Cantor cubes) in which we have "full control" over all dense subsets. Using this method we are able to construct, in ZFC, for each…
We generalize type $A$ quivers to continuous type $A$ quivers and prove initial results about pointwise finite-dimensional (pwf) representations. We classify the indecomosable pwf representations and provide a decomposition theorem,…
A deformed differential calculus is developed based on an associative star-product. In two dimensions the Hamiltonian vector fields model the algebra of pseudo-differential operator, as used in the theory of integrable systems. Thus one…