Related papers: Left determined model categories
The key information of a model category structure on a poset is encoded in a transfer system, which is a combinatorial gadget, originally introduced to investigate homotopy coherence structures in equivariant homotopy theory. We describe…
Probabilistic sentential decision diagrams are a class of structured-decomposable probabilistic circuits especially designed to embed logical constraints. To adapt the classical LearnSPN scheme to learn the structure of these models, we…
We present general techniques for constructing functorial factorizations appropriate for model structures that are not known to be cofibrantly generated. Our methods use "algebraic" characterizations of fibrations to produce factorizations…
Suppose that $F: \mathcal{N} \to \mathcal{M}$ is a functor whose target is a Quillen model category. We give a succinct sufficient condition for the existence of the right-induced model category structure on $\mathcal{N}$ in the case when…
We build a model structure from the simple point of departure of a structured interval in a monoidal category - more generally, a structured cylinder and a structured co-cylinder in a category.
For a model category, we prove that taking the category of coalgebras over a comonad commutes with left Bousfield localization in a suitable sense. Then we prove a general existence result for the left-induced model structure on the…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
One goal of applied category theory is to better understand networks appearing throughout science and engineering. Here we introduce "structured cospans" as a way to study networks with inputs and outputs. Given a functor $L \colon…
In a Systems Engineering setting, various models are produced using a variety of methods and tools. Focusing on a type of models -- called descriptive models -- which we shall describe, we argue that, while the clarity and precision of…
Most categorical models for dependent types have traditionally been heavily set based: contexts form a category, and for each we have a set of types in said context -- and for each type a set of terms of said type. This is the case for…
A Quillen model structure is presented by an interacting pair of weak factorization systems. We prove that in the world of locally presentable categories, any weak factorization system with accessible functorial factorizations can be lifted…
We derive a new sufficient condition for the existence of {\omega}-categorical universal structures in classes of relational structures with constraints, augmenting results by Cherlin, Shelah, Chi, and Hubi\v{c}ka and Ne\v{s}et\v{r}il.…
This is the second paper in a series that aims to provide mathematical descriptions of objects and constructions related to the first few steps of the semantical theory of dependent type systems. We construct for any pair $(R,LM)$, where…
In this work, we investigate an effective method for showing that functors between categories are left adjoints. The method applies to a large class of categories, namely locally finitely presentable categories, which are ubiquitous in…
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…
The sole purpose of this note is to introduce some elementary results on the structure and functoriality of Reedy model categories. In particular, I give a very useful little criterion to determine whether composition with a morphism of…
A constructive proof of identification of multilinear decompositions of multiway arrays is presented. It can be applied to show identification in a variety of multivariate latent structures. Examples are finite-mixture models and hidden…
In this paper we present a new way to construct the pro-category of a category. This new model is very convenient to work with in certain situations. We present a few applications of this new model, the most important of which solves an…
Numerous methods for probabilistic reasoning in large, complex belief or decision networks are currently being developed. There has been little research on automating the dynamic, incremental construction of decision models. A uniform…
We show that for any type in Martin-L\"of Intensional Type Theory, the terms of that type and its higher identity types form a weak omega-category in the sense of Leinster. Precisely, we construct a contractible globular operad of definable…