Learning by Minimizing the Sum of Ranked Range
In forming learning objectives, one oftentimes needs to aggregate a set of individual values to a single output. Such cases occur in the aggregate loss, which combines individual losses of a learning model over each training sample, and in the individual loss for multi-label learning, which combines prediction scores over all class labels. In this work, we introduce the sum of ranked range (SoRR) as a general approach to form learning objectives. A ranked range is a consecutive sequence of sorted values of a set of real numbers. The minimization of SoRR is solved with the difference of convex algorithm (DCA). We explore two applications in machine learning of the minimization of the SoRR framework, namely the AoRR aggregate loss for binary classification and the TKML individual loss for multi-label/multi-class classification. Our empirical results highlight the effectiveness of the proposed optimization framework and demonstrate the applicability of proposed losses using synthetic and real datasets.
Code (1)
Tasks
Binary ClassificationGeneral ClassificationMulti-class ClassificationMulti-Label LearningSimilar Papers 제목 키워드 기반
SWAP: Exploiting Second-Ranked Logits for Adversarial Attacks on Time Series
Time series classification (TSC) has emerged as a critical task in various domains, and deep neural models have shown superior performance in TSC tasks. However, these models are vulnerable to adversarial attacks, where …
Time SeriesTime Series ClassificationRanked Choice Bedlam in a 2022 Oakland School Director Election
The November 2022 ranked choice election for District 4 School Director in Oakland, CA, was very interesting from the perspective of social choice theory. The election did not contain a Condorcet winner and exhibited dow…
Efficient and Effective Tail Latency Minimization in Multi-Stage Retrieval Systems
Scalable web search systems typically employ multi-stage retrieval architectures, where an initial stage generates a set of candidate documents that are then pruned and re-ranked. Since subsequent stages typically exploi…
RetrievalLabel-Aware Ranked Loss for robust People Counting using Automotive in-cabin Radar
In this paper, we introduce the Label-Aware Ranked loss, a novel metric loss function. Compared to the state-of-the-art Deep Metric Learning losses, this function takes advantage of the ranked ordering of the labels in r…
Metric LearningregressionSum of Ranked Range Loss for Supervised Learning
In forming learning objectives, one oftentimes needs to aggregate a set of individual values to a single output. Such cases occur in the aggregate loss, which combines individual losses of a learning model over each trai…
Multi-class ClassificationMulti-Label Learning