Related papers: Descent for internal multicategory functors

In this short note we explain the proof that proper surjective and faithfully flat maps are morphisms of effective descent for overconvergent isocrystals. We then show how to deduce the folklore theorem that for an arbitrary variety over a…

This is essentially an illustration for the general technology of homotopical enhancements developed recently in arxiv:2409.17489. We take the derived category of an abelian category, and we look at the full subcategory spanned by complexes…

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…

The notion of pseudocategory, as considered in [11], is extended from the context of a 2-category to the more general one of a sesquicategory, which is considered as a category equipped with a 2-cell structure. Some particular examples of…

For any algebra morphism in a monoidal category, we provide sufficient conditions (which are also necessary if the unit is a left tensor generator) for the attached induction functor being semiseparable. Under mild assumptions, we prove…

We revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-convex functionals. We describe limit points in terms of the…

We develop a formalism for studying descent and codescent in the context of Iwasawa theory. The main result essentially states that to control descent or codescent amounts to the same. Arithmetic applications are given.

Combining empirical risk minimization with capacity control is a classical strategy in machine learning when trying to control the generalization gap and avoid overfitting, as the model class capacity gets larger. Yet, in modern deep…

We introduce two-scale loss functions for use in various gradient descent algorithms applied to classification problems via deep neural networks. This new method is generic in the sense that it can be applied to a wide range of machine…

We construct an iterative method for factorising small strict n-categories into a unique (up to isomorphism) collection of small 1- categories. Following this we develop the theory to include a large class of $\infty$-categories. We use…

In this article, we develop a general technique for gluing subcategories of $\infty$-categories. We obtain categorical equivalences between simplicial sets associated to certain multisimplicial sets. Such equivalences can be used to…

Interest in weak cubical n-categories arises in various contexts, in particular in topological field theories. In this paper, we describe a concept of double bicategory, namely a strict model of the theory of bicategories in Bicat. We show…

Gradient descent optimization algorithms, while increasingly popular, are often used as black-box optimizers, as practical explanations of their strengths and weaknesses are hard to come by. This article aims to provide the reader with…

We study (pre-)sheaves in bicategories on geometric categories: smooth manifolds, manifolds with a Lie group action and Lie groupoids. We present three main results: we describe equivariant descent, we generalize the plus construction to…

The fundamental construction underlying descent theory, the lax descent category, comes with a functor that forgets the descent data. We prove that, in any $2$-category $\mathfrak{A} $ with lax descent objects, the forgetful morphisms…

We give an abstract criterion for pasting pseudofunctors on two subcategories of a category into a pseudofunctor on the whole category. As an application we extend the variance theory of the twisted inverse image $(-)^!$ over schemes to…

The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…

Coordinate descent algorithms solve optimization problems by successively performing approximate minimization along coordinate directions or coordinate hyperplanes. They have been used in applications for many years, and their popularity…

We show that differential calculus (in its usual form, or in the general form of topological differential calculus) can be fully imdedded into a functor category (functors from a small category of anchord tangent algebras to anchored sets).…

In this paper, we introduce quotients of exact categories by percolating subcategories. This approach extends earlier localization theories by Cardenas and Schlichting for exact categories, allowing new examples. Let $\mathcal{A}$ be a…