Related papers: Taming large categories
We develop a homotopy theory of categories enriched in a monoidal model category V. In particular, we deal with homotopy weighted limits and colimits, and homotopy local presentability. The main result, which was known for…
Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of {\em…
In a previous article, we introduced notions of finiteness obstruction, Euler characteristic, and L^2-Euler characteristic for wide classes of categories. In this sequel, we prove the compatibility of those notions with homotopy colimits of…
This survey paper provides a comprehensive analysis of big data algorithms in recommendation systems, addressing the lack of depth and precision in existing literature. It proposes a two-pronged approach: a thorough analysis of current…
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…
This paper gives an introduction to the homotopy theory of quasi-categories. Weak equivalences between quasi-categories are characterized as maps which induce equivalences on a naturally defined system of groupoids. These groupoids…
This paper explores the system of categories that is used to classify articles in Wikipedia. It is compared to collaborative tagging systems like del.icio.us and to hierarchical classification like the Dewey Decimal Classification (DDC).…
We introduce and develop the notion of *displayed categories*. A displayed category over a category C is equivalent to "a category D and functor F : D --> C", but instead of having a single collection of "objects of D" with a map to the…
Extriangulated categories axiomatize extension-closed subcategories of triangulated categories. We show that the homotopy category of an exact quasi-category can be equipped with a natural extriangulated structure.
We show that the category of pastures has arbitrary limits and colimits of diagrams indexed by a small category.
We explain how the notion of homotopy colimits gives rise to that of mapping spaces, even in categories which are not simplicial. We apply the technique of model approximations and use elementary properties of the category of spaces to be…
This article serves as a preliminary introduction to the design of a new, open-source applied and computational category theory framework, named Categorica, built on top of the Wolfram Language. Categorica allows one to configure and…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…
In this note, we revisit the algorithm of Har-Peled et. al. [HRZ07] for computing a linear maximum margin classifier. Our presentation is self contained, and the algorithm itself is slightly simpler than the original algorithm. The…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
Using full images of accessible functors, we prove some results about combinatorial and accessible model categories. In particular, we give an example of a weak factorization system on a locally presentable category which is not accessible.
Generating semantic lexicons semi-automatically could be a great time saver, relative to creating them by hand. In this paper, we present an algorithm for extracting potential entries for a category from an on-line corpus, based upon a…
We identify the classical Perceptron algorithm with margin as a member of a broader family of large margin classifiers which we collectively call the Margitron. The Margitron, (despite its) sharing the same update rule with the Perceptron,…
We give a new description of Rosenthal's generalized homotopy fixed point spaces as homotopy limits over the orbit category. This is achieved using a simple categorical model for classifying spaces with respect to families of subgroups.
Progressive filtering is a simple way to perform hierarchical classification, inspired by the behavior that most humans put into practice while attempting to categorize an item according to an underlying taxonomy. Each node of the taxonomy…