Related papers: Inclusion-exclusion and Segre classes
In many learning tasks, certain requirements on the processing of individual data samples should arguably be formalized as strict constraints in the underlying optimization problem, rather than by means of arbitrary penalties. We show that,…
Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…
Classification may not be reliable for several reasons: noise in the data, insufficient input information, overlapping distributions and sharp definition of classes. Faced with several possibilities neural network may in such cases still be…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
A new S-type singular value inclusion set for rectangular tensors is given and proved to be tighter than that in [Sang C.L., An S-type singular value inclusion set for rectangular tensors, J. Inequal. Appl. 2017: 141, 2017]. Based on this…
We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various properties of the code. The theory has $\Pi$-types, weak and strong $\Sigma$-types, natural numbers, an empty type, and a…
We introduce and study a Serre functor in the category ${\cal P}_d$ of strict polynomial functors over a field of positive characteristic. By using it we obtain the Poincar\'e duality formula for Ext--groups from [C3] in elementary way. We…
For a rigid tensor abelian category $T$ over a field $k$ we introduce a notion of a normal quotient $q:T\to Q$. In case $T$ is a Tannaka category, our notion is equivalent to Milne's notion of a normal quotient. More precisely, if $T$ is…
There has been growing interest in developing accurate models that can also be explained to humans. Unfortunately, if there exist multiple distinct but accurate models for some dataset, current machine learning methods are unlikely to find…
Grammatical inference is a classical problem in computational learning theory and a topic of wider influence in natural language processing. We treat grammars as a model of computation and propose a novel neural approach to induction of…
In this survey one discusses the notion of the Poincar\'e series of multi-index filtrations, an alternative approach to the definition, a method of computation of the Poincar\'e series based on the notion of integration with respect to the…
We study observational bounds in a class of scalar-tensor gravity theories recently proposed. Either an upper or lower bound on a conformal factor in these theories is derived from null observation in composition dependent fifth force…
Let S be a smooth projective surface equipped with a line bundle H. Lehn's conjecture is a formula for the top Segre class of the tautological bundle associated to H on the Hilbert scheme of points of S. Voisin has recently reduced Lehn's…
In this paper we take closer look at recent developments for the chase procedure, and provide additional results. Our analysis allows us create a taxonomy of the chase variations and the properties they satisfy. Two of the most central…
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
We present a procedure which allows one to integrate explicitly the class of checkerboard IC-nets which has recently been introduced as a generalisation of incircular (IC) nets. The latter class of privileged congruences of lines in the…
The Segre determinant is a polynomial which encodes the condition for points to lie on a bilinear hypersurface in the product of projective spaces. We study Segre determinants and compute them in various coordinate systems. We show that the…
Selectional preference learning methods have usually focused on word-to-class relations, e.g., a verb selects as its subject a given nominal class. This paper extends previous statistical models to class-to-class preferences, and presents a…
Stratifolds are considered from a categorical point of view. We show among others that the category of stratifolds fully faithfully embeds into the category of ${\mathbb R}$-algebras as does the category of smooth manifolds. We prove that a…
The increasing use of complex machine learning models in education has led to concerns about their interpretability, which in turn has spurred interest in developing explainability techniques that are both faithful to the model's inner…