Deep Compact Polyhedral Conic Classifier for Open and Closed Set Recognition
In this paper, we propose a new deep neural network classifier that simultaneously maximizes the inter-class separation and minimizes the intra-class variation by using the polyhedral conic classification function. The proposed method has one loss term that allows the margin maximization to maximize the inter-class separation and another loss term that controls the compactness of the class acceptance regions. Our proposed method has a nice geometric interpretation using polyhedral conic function geometry. We tested the proposed method on various visual classification problems including closed/open set recognition and anomaly detection. The experimental results show that the proposed method typically outperforms other state-of-the art methods, and becomes a better choice compared to other tested methods especially for open set recognition type problems.
Code (0)
등록된 구현이 없습니다.
Tasks
Anomaly DetectionGeneral ClassificationOpen Set LearningSimilar Papers 제목 키워드 기반
Polyhedral Conic Classifiers for Visual Object Detection and Classification
We propose a family of quasi-linear discriminants that outperform current large-margin methods in sliding window visual object detection and open set recognition tasks. In these tasks the classification problems are b…
ClassificationGeneral ClassificationObjectobject-detection+2Polyhedral Conic Classifier for CTR Prediction
This paper introduces a novel approach for click-through rate (CTR) prediction within industrial recommender systems, addressing the inherent challenges of numerical imbalance and geometric asymmetry. These challenges st…
Click-Through Rate PredictionDiversityPredictionRecommendation SystemsOn the convex hull of convex quadratic optimization problems with indicators
We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space …
SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functions
Classical ReLU-based Input Convex Neural Networks (ICNNs) are equivalent to the optimal value functions of Linear Programming (LP). This intrinsic structural equivalence restricts their representational capacity to piece…
Polyceptron: A Polyhedral Learning Algorithm
In this paper we propose a new algorithm for learning polyhedral classifiers which we call as Polyceptron. It is a Perception like algorithm which updates the parameters only when the current classifier misclassifies any…