Papers › Nonlinear classifiers for ranking problems based on kernelized SVM

Nonlinear classifiers for ranking problems based on kernelized SVM

26 Feb 2020arXiv:2002.11436archive 2025-07-28

Václav Mácha, Lukáš Adam, Václav Šmídl

Many classification problems focus on maximizing the performance only on the samples with the highest relevance instead of all samples. As an example, we can mention ranking problems, accuracy at the top or search engines where only the top few queries matter. In our previous work, we derived a general framework including several classes of these linear classification problems. In this paper, we extend the framework to nonlinear classifiers. Utilizing a similarity to SVM, we dualize the problems, add kernels and propose a componentwise dual ascent method.

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

VaclavMacha/ClassificationOnTop_new.jl officialmentioned in papermentioned on GitHubSyntology: not harvested report
VaclavMacha/ClassificationOnTop_nonlinear.jl officialmentioned in papermentioned on GitHubSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

ClassificationGeneral Classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SVM

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections