Related papers: Proximity Induced by Order Relations
In Ordinal Classification tasks, items have to be assigned to classes that have a relative ordering, such as positive, neutral, negative in sentiment analysis. Remarkably, the most popular evaluation metrics for ordinal classification tasks…
Building upon work of Y. Shalom we give a homological-algebra flavored definition of an induction map in group homology associated to a topological coupling. As an application we obtain estimates of the (co)homological dimension of groups G…
We study semiorders induced by points drawn from a uniform random distribution. Of particular interest in this paper are the probabilities of generating specific semiorders and the equivalence classes they produce. We present a method for…
In the present paper a new concept of representability is introduced, which can be applied to not total and also to intransitive relations (semiorders in particular). This idea tries to represent the orderings in the simplest manner,…
In this article, I provide significant mathematical evidence in support of the existence of short-time approximations of any polynomial order for the computation of density matrices of physical systems described by arbitrarily smooth and…
Order-reduction is a standard automated approximation technique for computer-aided design, analysis, and simulation of many classes of systems, from circuits to buildings. For a given system, these methods produce a reduced-order system…
We introduce the concept of {\it self-referential order} which provides a way to quantify structural organization in non crystalline materials. The key idea consists in the observation that, in a disordered system, where there is no ideal,…
Given a distance $D$ on a finite set $X$ with $n$ elements, it is interesting to understand how the ranking $R_x = z_1,z_2,\dots,z_n$ obtained by ordering the elements in $X$ according to increasing distance $D(x,z_i)$ from $x$, varies with…
The general notion of a stochastic ordering is that one probability distribution is smaller than a second one if the second attaches more probability to higher values than the first. Motivated by recent work on barycentric maps on spaces of…
The correlation measure of order $k$ is a measure of pseudorandomness that quantifies the similarity between a sequence and its shifts. It is known that the correlation of order 4 is large for the Rudin-Shapiro sequence despite having nice…
We consider a similarity measure between two sets $A$ and $B$ of vectors, that balances the average and maximum cosine distance between pairs of vectors, one from set $A$ and one from set $B$. As a motivation for this measure, we present…
Two-dimensional semiconductor-superconductor heterostructures form the foundation of numerous nanoscale physical systems. However, measuring the properties of such heterostructures, and characterizing the semiconductor in-situ is…
Let $G$ be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the maximum Wiener index of simple triangulations and…
In the present paper we propose a new approach on `distributed systems': the processes are represented through total orders and the communications are characterized by means of biorders. The resulting distributed systems capture situations…
While decision theory provides an appealing normative framework for representing rich preference structures, eliciting utility or value functions typically incurs a large cost. For many applications involving interactive systems this…
Establishing correspondences between two images requires both local and global spatial context. Given putative correspondences of feature points in two views, in this paper, we propose Order-Aware Network, which infers the probabilities of…
In the field of node representation learning the task of interpreting latent dimensions has become a prominent, well-studied research topic. The contribution of this work focuses on appraising the interpretability of another…
In large datasets, it is hard to discover and analyze structure. It is thus common to introduce tags or keywords for the items. In applications, such datasets are then filtered based on these tags. Still, even medium-sized datasets with a…
The symmetric decreasing rearrangement of functions on $\mathbb{R}^n$ features in several seminal inequalities, such as the P\'olya-Szeg\H{o} inequality. The latter was shown by the authors to hold for all smoothing rearrangements, a class…
In this paper we generalize Nesterenko's criterion to the case where the small linear forms have an oscillating behaviour (for instance given by the saddle point method). This criterion provides both a lower bound for the dimension of the…