Related papers: Principal gradient schemes have regular reduced cl…
We present general reduction procedures for Courant, Dirac and generalized complex structures, in particular when a group of symmetries is acting. We do so by taking the graded symplectic viewpoint on Courant algebroids and carrying out…
Recently \cite{Horowitz:2022rpp,Horowitz:2022uak}, denominator regularisation (Den. Reg.) scheme has been proposed to handle divergences in quantum field theory. It is shown to yield results as simple as in dimensional regularisation scheme…
A number of results have recently demonstrated the benefits of incorporating various constraints when training deep architectures in vision and machine learning. The advantages range from guarantees for statistical generalization to better…
We develop regularization methods to find flat minima while training deep neural networks. These minima generalize better than sharp minima, yielding models outperforming baselines on real-world test data (which may be distributed…
Quot schemes of quotients of a trivial bundle of arbitrary rank on a nonsingular projective surface X carry perfect obstruction theories and virtual fundamental classes whenever the quotient sheaf has at most 1-dimensional support. The…
The main goal of this paper is to obtain upper bounds for the regularity of graded deficiency modules in the spirit of the one obtained by Kumini--Murai in the monomial case building upon the spectral sequence formalism developed by…
Stochastic gradient descent (SGD) exhibits strong algorithmic regularization effects in practice, which has been hypothesized to play an important role in the generalization of modern machine learning approaches. In this work, we seek to…
The aim of this paper is to give a proof of the restriction theorems for principal bundles with a reductive algebraic group as structure group in arbitrary characteristic. Let $G$ be a reductive algebraic group over any field $k=\bar{k}$,…
An open question in the Deep Learning community is why neural networks trained with Gradient Descent generalize well on real datasets even though they are capable of fitting random data. We propose an approach to answering this question…
We prove necessary and sufficient conditions for the existence of homogeneous prime elements in normal N-graded rings of dimension two, in terms of rational coefficient Weil divisors on projective curves.
For a domestic finite group scheme, we give a direct description of the Euclidean components in its Auslander-Reiten quiver via the McKay-quiver of a finite linearly reductive subgroup scheme of $SL(2)$. Moreover, for a normal subgroup…
The $D$-graded Proj construction provides a general framework for constructing schemes from rings graded by finitely generated abelian groups $D$, yet its properties and applications remain underdeveloped compared to the classical…
We show that gradient descent converges to a local minimizer, almost surely with random initialization. This is proved by applying the Stable Manifold Theorem from dynamical systems theory.
Given a graph whose edges are labeled by ideals of a commutative ring R with identity, a generalized spline is a vertex labeling by the elements of R such that the difference of the labels on adjacent vertices lies in the ideal associated…
For many types of graphs, criteria have been discovered that give necessary and sufficient conditions for an integer sequence to be the degree sequence of such a graph. These criteria tend to take the form of a set of inequalities, and in…
We show that if a flat group scheme acts properly, with finite stabilizers, on an algebraic space, then a quotient exists as a separated algebraic space. More generally we show any flat groupid for which the family of stabilizers is finite…
We consider ideals in a polynomial ring that are generated by regular sequences of homogeneous polynomials and are stable under the action of the symmetric group permuting the variables. In previous work, we determined the possible…
Gradient schemes is a framework which enables the unified convergence analysis of many different methods -- such as finite elements (conforming, non-conforming and mixed) and finite volumes methods -- for $2^{\rm nd}$ order diffusion…
We give an effective uniform bound on the multigraded regularity of a subscheme of a smooth projective toric variety X with a given multigraded Hilbert polynomial. To establish this bound, we introduce a new combinatorial tool, called a…
Variational quantum algorithms are ubiquitous in applications of noisy intermediate-scale quantum computers. Due to the structure of conventional parametrized quantum gates, the evaluated functions typically are finite Fourier series of the…