arXiv research

Improved CNN for HCCR with new loss function and ranking method.

FUJI scores similarity of ranked lists more robustly.

Paper improves image retrieval quality using nonlinear rank approximations.

DNN-based cross-modal retrieval has become a research hotspot, by which users can search results across various modalities like image and text. However, existing methods mainly focus on the pairwise correlation and reconstruction error of labeled data. They ignore the semantically similar and dissimilar constraints bet…

MarlRank uses multi-agent reinforcement learning to improve document ranking.

Retrieving the most similar objects in a large-scale database for a given query is a fundamental building block in many application domains, ranging from web searches, visual, cross media, and document retrievals. State-of-the-art approaches have mainly focused on capturing the underlying geometry of the data manifolds…

We describe a seriation algorithm for ranking a set of items given pairwise comparisons between these items. Intuitively, the algorithm assigns similar rankings to items that compare similarly with all others. It does so by constructing a similarity matrix from pairwise comparisons, using seriation methods to reorder t…

Fried's theorem proven for symmetric space boundaries.

We propose a novel way to train ranking models, such as recommender systems, that are both effective and efficient. Knowledge distillation (KD) was shown to be successful in image recognition to achieve both effectiveness and efficiency. We propose a KD technique for learning to rank problems, called \emph{ranking dist…

We propose a novel method of introducing structure into existing machine learning techniques by developing structure-based similarity and distance measures. To learn structural information, low-dimensional structure of the data is captured by solving a non-linear, low-rank representation problem. We show that this low-…

Embedding words in a vector space has gained a lot of attention in recent years. While state-of-the-art methods provide efficient computation of word similarities via a low-dimensional matrix embedding, their motivation is often left unclear. In this paper, we argue that word embedding can be naturally viewed as a rank…

The study examines nilpotent similarity structures on manifolds and their properties.

A large body of research into semantic textual similarity has focused on constructing state-of-the-art embeddings using sophisticated modelling, careful choice of learning signals and many clever tricks. By contrast, little attention has been devoted to similarity measures between these embeddings, with cosine similari…

The problem of ranking a set of objects given some measure of similarity is one of the most basic in machine learning. Recently Agarwal proposed a method based on techniques in semi-supervised learning utilizing the graph Laplacian. In this work we consider a novel application of this technique to ranking binary choice…

InfoTuple efficiently selects larger tuple queries for ranking multiple objects, improving efficiency and consistency.

This paper studies a stylized, yet natural, learning-to-rank problem and points out the critical incorrectness of a widely used nearest neighbor algorithm. We consider a model with $n$ agents (users) $\{x_i\}_{i \in [n]}$ and $m$ alternatives (items) $\{y_j\}_{j \in [m]}$, each of which is associated with a latent feat…

In this paper we investigate two variants of association rules for preference data, Label Ranking Association Rules and Pairwise Association Rules. Label Ranking Association Rules (LRAR) are the equivalent of Class Association Rules (CAR) for the Label Ranking task. In CAR, the consequent is a single class, to which th…

Fast and accurate methods for low-rank learning problems.

Enzyme sequences and structures are routinely used in the biological sciences as queries to search for functionally related enzymes in online databases. To this end, one usually departs from some notion of similarity, comparing two enzymes by looking for correspondences in their sequences, structures or surfaces. For a…

Nuclear norm minimization (NNM) has recently gained significant attention for its use in rank minimization problems. Similar to compressed sensing, using null space characterizations, recovery thresholds for NNM have been studied in \cite{arxiv,Recht_Xu_Hassibi}. However simulations show that the thresholds are far fro…

Let $M$ be a compact connected orientable Seifert manifold with hyperbolic orbifold $B_M$, and $f_π: π_1(M)\rightarrowπ_1(M)$ be an automorphism induced by an orientation-reversing homeomorphism $f$ of $M$. We give a bound on the rank of the fixed subgroup of $f_π$, namely, $\rank\fix(f_π)<2\rank π_1(M)$, which is simi…

Algorithm ensures fair ranking by minority groups alongside majority groups.

People are rated and ranked, towards algorithmic decision making in an increasing number of applications, typically based on machine learning. Research on how to incorporate fairness into such tasks has prevalently pursued the paradigm of group fairness: giving adequate success rates to specifically protected groups. I…

The performance of many machine learning techniques depends on the choice of an appropriate similarity or distance measure on the input space. Similarity learning (or metric learning) aims at building such a measure from training data so that observations with the same (resp. different) label are as close (resp. far) a…

Algorithm estimates tensors from sparse observations with robust error bounds.

Equivalent formulations for low-rank matrix optimization are proven.

Paper proposes a method to learn structure from data similarities.

Rank-one measurements limit feasible sets for low-rank PSD matrices.

Time-aware fact-checking improves veracity predictions for time-sensitive claims.

New metrics reveal oversmoothing in GNNs more accurately than traditional methods.

Paper extends multivariate rank tests for robust subspace detection.

Paper presents a technique using Spearman's Rank Correlation Coefficient for KE in TDs.

Maps from rational homology solid tori yield rank inequalities in Heegaard Floer homology.

The paper reviews exchangeability and its implications for conformal prediction and rank tests.

We construct a Weil-Petersson geodesic completion of Teichmuller space through the formalism of Coxeter complex with the Teichmuller space as its non-linear non-homogeneous fundamental domain. We show that the metric and geodesic completions both satisfy a finite rank property, demonstrating a similarity with the non-c…

In this paper we focus on the problem of completion of multidimensional arrays (also referred to as tensors) from limited sampling. Our approach is based on a recently proposed tensor-Singular Value Decomposition (t-SVD) [1]. Using this factorization one can derive notion of tensor rank, referred to as the tensor tubal…

Convolutional neural networks predict the analytic rank of elliptic curves accurately.

Extends linear classification framework to nonlinear SVM-based ranking problems.

GNNRank uses neural networks to learn global rankings from competition match data.

The purpose of this study was to build a customer selection model based on 20 dimensions, including customer codes, total contribution, assets, deposit, profit, profit rate, trading volume, trading amount, turnover rate, order amount, withdraw amount, withdraw rate, process fee, process fee submitted, process fee retai…

This paper investigates the rank distribution, cumulative probability, and probability density of price returns for the stocks traded in the KSE and the KOSDAQ market. This research demonstrates that the rank distribution is consistent approximately with the Zipf's law with exponent $α= -1.00$ (KSE) and -1.31 (KOSDAQ),…

Paper tackles invoice line item matching in P2P processes using agent feedback.

Consider a Riemannian manifold in dimension $n\geq 3$ with strictly convex boundary. We prove the local invertibility, up to potential fields, of the geodesic ray transform on tensor fields of rank four near a boundary point. This problem is closely related with elastic \textit{qP}-wave tomography. Under the condition …

We study stability and local minimizing properties of $L^p$- norms of Riemannian curvature tensor denoted by $\mathcal{R}_p$ by variational methods. We compute the Hessian of $\mathcal{R}_p$ at compact rank 1 symmetric spaces and prove that they are stable for $\mathcal{R}_p$ for certain values of p > 2. A similar resu…

Under expected utility the local index of absolute risk aversion has played a central role in many applications. Besides, its link with the "global" concepts of the risk and probability premia has reinforced its attractiveness. This paper shows that, with an appropriate approach, similar developments can be achieved in…

Ranking data arises in a wide variety of application areas but remains difficult to model, learn from, and predict. Datasets often exhibit multimodality, intransitivity, or incomplete rankings---particularly when generated by humans---yet popular probabilistic models are often too rigid to capture such complexities. In…

New algorithm ranks players from partial comparisons with optimal rate.

Recovery of low-rank matrices has recently seen significant activity in many areas of science and engineering, motivated by recent theoretical results for exact reconstruction guarantees and interesting practical applications. A number of methods have been developed for this recovery problem. However, a principled meth…