Related papers: Labels of real projective varieties

For an algebraic stack $\sX$ flat and of finite presentation over a scheme $S$, we introduce various notions of {\em relative connected components} and {\em relative irreducible components}. The main distinction between these notions is…

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…

In this work, we present a probabilistic model for directed graphs where nodes have attributes and labels. This model serves as a generative classifier capable of predicting the labels of unseen nodes using either maximum likelihood or…

In this paper, we study the classification problem in which we have access to easily obtainable surrogate for true labels, namely complementary labels, which specify classes that observations do \textbf{not} belong to. Let $Y$ and $\bar{Y}$…

Multi-label ranking maps instances to a ranked set of predicted labels from multiple possible classes. The ranking approach for multi-label learning problems received attention for its success in multi-label classification, with one of the…

We determine the splitting (isomorphism) type of the normal bundle of a generic genus-0 curve with 1 or 2 components in any projective space, as well as the (sometimes nontrivial) way the bundle deforms locally with a general deformation of…

We formulate a supervised learning problem, referred to as continuous ranking, where a continuous real-valued label Y is assigned to an observable r.v. X taking its values in a feature space $\mathcal{X}$ and the goal is to order all…

We investigate multi-label classification involving large sets of labels, where the output labels may be known to satisfy some logical constraints. We look at an architecture in which classifiers for individual labels are fed into an…

For an ordinary abelian variety $X$, $F^e_*\mathcal{O}_X$ is decomposed into line bundles for every positive integer $e$. Conversely, if a smooth projective variety $X$ satisfies this property and its Kodaira dimension is non-negative, then…

We propose a method for jointly inferring labels across a collection of data samples, where each sample consists of an observation and a prior belief about the label. By implicitly assuming the existence of a generative model for which a…

Let $X$ be a normal complex projective variety, $T\subseteq X$ a subvariety, $a\colon X\rightarrow A$ a morphism to an abelian variety such that $\rm{Pic}^0(A)$ injects into $\rm{Pic}^0(T)$ and let $L$ be a line bundle on $X$. Denote by…

Statistical decision algorithms are increasingly deployed in domains where ground-truth labels are hard to obtain, such as hiring, university admissions, and content moderation. In these settings, models are typically trained on historical…

Given a representation of a unimodular locally compact group, we discuss criteria for associated coherent state expansions in terms of the commuting algebra. It turns out that for those representations that admit such expansions there…

For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…

Let $C$ be an irreducible projective plane curve in the complex projective space ${\mathbb{P}}^2$. The classification of such curves, up to the action of the automorphism group $PGL(3,{\mathbb{C}})$ on ${\mathbb{P}}^2$, is a very difficult…

Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…

A total prime labeling of a graph of order $n$ is an extension of a prime labeling in which we distinctly label the vertices and edges. The goal of the labeling is for adjacent vertex labels to be relatively prime, and for each vertex of…

A new class of general exponential ranking models is introduced which we label angle-based models for ranking data. A consensus score vector is assumed, which assigns scores to a set of items, where the scores reflect a consensus view of…

It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection positivity and exponential rank-connectivity. In terms…

In this paper we provide a principled approach to solve a transductive classification problem involving a similar graph (edges tend to connect nodes with same labels) and a dissimilar graph (edges tend to connect nodes with opposing…