Related papers: Descent for internal multicategory functors

We investigate an enriched-categorical approach to a field of discrete mathematics. The main result is a duality theorem between a class of enriched categories (called $\overline{\mathbb{Z}}$- or $\overline{\mathbb{R}}$-categories) and that…

We prove a descent result for affine/projective varieties defined over an algebraically closed field. The idea is to work with the reduced Groebner basis of the ideal where the variety vanishes and study it's behaviour under group action…

In the paper we answer the following question: for a morphism of varieties (or, more generally, stacks), when the derived category of the base can be recovered from the derived category of the covering variety by means of descent theory? As…

We define the notion of a specialization morphism from a locally noetherian analytic adic space to a scheme. This captures the (classical) specialization morphism associated to a formal scheme. There is a well behaved theory of…

This paper is part of a series of articles in which we reproduce the statements regarding the abstract six-functor formalism developed by Liu-Zheng. In this paper, we prove a theorem, which is an $\infty$-categorical version for defining…

The framework of differential inclusions encompasses modern optimal control and the calculus of variations. Necessary optimality conditions in the literature identify potentially optimal paths, but do not show how to perturb paths to…

Inspired by recent work on the categorical semantics of dependent type theories, we investigate the following question: When is logical structure (crucially, dependent-product and subobject-classifier structure) induced from a category to…

In the previous papers we found a direct method to confirm, for any square matrix, if it is associated to any categories or not. According to this method, the matrix 2 (all coefficients are 2) of a given order, admits associated categories.…

The inclusion of 1-categories into $(\infty,1)$-categories fails to preserve colimits in general, and pushouts in particular. In this note, we observe that if one functor in a span of categories belongs to a certain previously-identified…

An n-category is some sort of algebraic structure consisting of objects, morphisms between objects, 2-morphisms between morphisms, and so on up to n-morphisms, together with various ways of composing them. We survey various concepts of…

In this paper we provide a deep and systematic study of what it means to be an immersion, a submersion, a local diffeomorphism, and unramified in a tangent category. We also give a systematic study of the ways in which these classes of…

In present paper we develop categorical formalism of Verdier duality for diagrams of topoi. We use this approach to construct Grothendieck six operations formalism.

Riehl and Verity have introduced an "$\infty$-cosmic" framework in which they redevelop the category theory of $\infty$-categories using 2-categorical arguments. In this paper, we begin with a self-contained review of the parts of their…

By applying simplification operations to categories of multigraphs, several natural graph operations are shown to demonstrate categorical issues. The replacement of an undirected edge with a directed cycle for digraphs admits both a left…

Model theoretic internality provides conditions under which the group of automorphisms of a model over a reduct is itself a definable group. In this paper we formulate a categorical analogue of the condition of internality, and prove an…

Variational inequalities play a key role in machine learning research, such as generative adversarial networks, reinforcement learning, adversarial training, and generative models. This paper is devoted to the constrained variational…

We develop a progressive training approach for neural networks which adaptively grows the network structure by splitting existing neurons to multiple off-springs. By leveraging a functional steepest descent idea, we derive a simple…

This paper introduces a coordinate descent version of the V\~u-Condat algorithm. By coordinate descent, we mean that only a subset of the coordinates of the primal and dual iterates is updated at each iteration, the other coordinates being…

In this work we propose a realization of Lurie's prediction that inner fibrations $p: X \rightarrow A$ are classified by $A$-indexed diagrams in a ``higher category" whose objects are $\infty$-categories, morphisms are correspondences…

In this book we collect many different and useful facts around gradient descent method. First of all we consider gradient descent with inexact oracle. We build a general model of optimized function that include composite optimization…