Related papers: $(\infty,1)$-Categorical Comprehension Schemes

We develop a Bayesian approach for selecting the model which is the most supported by the data within a class of marginal models for categorical variables formulated through equality and/or inequality constraints on generalised logits…

We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…

In this dissertation we develop a new formal graphical framework for causal reasoning. Starting with a review of monoidal categories and their associated graphical languages, we then revisit probability theory from a categorical perspective…

We investigate fibrancy conditions in the Thomason model structure on the category of small categories. In particular, we show that the category of weak equivalences of a partial model category is fibrant. Furthermore, we describe…

We study four types of (co)cartesian fibrations of $\infty$-bicategories over a given base $\mathcal{B}$, and prove that they encode the four variance flavors of $\mathcal{B}$-indexed diagrams of $\infty$-categories. We then use this…

Object recognition has become a crucial part of machine learning and computer vision recently. The current approach to object recognition involves Deep Learning and uses Convolutional Neural Networks to learn the pixel patterns of the…

Category, or property generalization is a central function in the human cognition. It plays a crucial role in a variety of domains, such as learning, everyday reasoning, specialized reasoning, and decision making. Judging the content of a…

The notion of a natural model of type theory is defined in terms of that of a representable natural transfomation of presheaves. It is shown that such models agree exactly with the concept of a category with families in the sense of Dybjer,…

`Categorification' is the process of replacing equations by isomorphisms. We describe some of the ways a thoroughgoing emphasis on categorification can simplify and unify mathematics. We begin with elementary arithmetic, where the category…

Let $\mathscr{A}$ be an abelian category and let $\mathscr{C}$ and $\mathscr{D}$ be additive subcategories of $\mathscr{A}$. As a generalization of Gorenstein categories, we introduce one-sided $n$-$(\C,\D)$-Gorenstein categories with…

Mechanistic Interpretability (MI) aims to understand neural networks through causal explanations. Though MI has many explanation-generating methods, progress has been limited by the lack of a universal approach to evaluating explanations.…

We give a new definition of a Frobenius structure on an algebra object in a monoidal category, generalising Frobenius algebras in the category of vector spaces. Our definition allows Frobenius forms valued in objects other than the unit…

We focus on two factorization systems for opfibrations in the 2-category Fib(B) of fibrations over a fixed base category B. The first one is the internal version of the so called comprehensive factorization, where the right orthogonal class…

The present paper gives a generalization of cartesian closed categories, called cartesian closed categories with dependence, whose strict version induces categories with families that support 1-, Sigma- and Pi-types in the strict sense.…

In 1990, Johnstone gave a syntactic characterisation of the equational theories whose associated varieties are cartesian closed. Among such theories are all unary theories -- whose models are sets equipped with an action by a monoid M --…

The cartesian structure possessed by relations, spans, profunctors, and other such morphisms is elegantly expressed by universal properties in double categories. Though cartesian double categories were inspired in part by the older program…

Let A be a commutative noetherian ring. In this paper, we interpret localizing subcategories of the derived category of A by using subsets of Spec A and subcategories of the category of A-modules. We unify theorems of Gabriel, Neeman and…

We introduce the notion of a definable category--a category equivalent to a full subcategory of a locally finitely presentable category that is closed under products, directed colimits and pure subobjects. Definable subcategories are…

We construct a classifier which attains the rate of convergence $\log n/n$ under sparsity and margin assumptions. An approach close to the one met in approximation theory for the estimation of function is used to obtain this result. The…

Machine learning has made major advances in categorizing objects in images, yet the best algorithms miss important aspects of how people learn and think about categories. People can learn richer concepts from fewer examples, including…