Polynomial expansion of the binary classification function
This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification technique that is resistant to over-fitting.
Code (1)
Tasks
Binary ClassificationClassificationGeneral ClassificationregressionRobust classificationSimilar Papers 제목 키워드 기반
Estimating Probability Distributions using "Dirac" Kernels (via Rademacher-Walsh Polynomial Basis Functions)
In many applications (in particular information systems, such as pattern recognition, machine learning, cheminformatics, bioinformatics to name but a few) the assessment of uncertainty is essential - i.e., the estimation…
Asymmetric Polynomial Loss For Multi-Label Classification
Various tasks are reformulated as multi-label classification problems, in which the binary cross-entropy (BCE) loss is frequently utilized for optimizing well-designed models. However, the vanilla BCE loss cannot be tail…
Classificationimage-classificationImage ClassificationMulti-Label Classification+4Fast approximation and learning of binary classification tasks in o-minimal structures using ReLU neural networks
We study binary classification problems whose decision sets are given by definable sets in o-minimal expansions of the real field. Motivated by cell decomposition of definable sets, we introduce traceable sets as a class…
Binary ClassificationPolyLoss: A Polynomial Expansion Perspective of Classification Loss Functions
Cross-entropy loss and focal loss are the most common choices when training deep neural networks for classification problems. Generally speaking, however, a good loss function can take on much more flexible forms, and sh…
3D Object Detectionimage-classificationImage ClassificationInstance Segmentation+2Fairness constraints can help exact inference in structured prediction
Many inference problems in structured prediction can be modeled as maximizing a score function on a space of labels, where graphs are a natural representation to decompose the total score into a sum of unary (nodes) and …
FairnessPredictionStructured Prediction