Generalized One-Class Learning Using Pairs of Complementary Classifiers
- URL: http://arxiv.org/abs/2106.13272v1
- Date: Thu, 24 Jun 2021 18:52:05 GMT
- Title: Generalized One-Class Learning Using Pairs of Complementary Classifiers
- Authors: Anoop Cherian and Jue Wang
- Abstract summary: One-class learning is the classic problem of fitting a model to the data for which annotations are available only for a single class.
In this paper, we explore novel objectives for one-class learning, which we collectively refer to as Generalized One-class Discriminative Subspaces (GODS)
- Score: 41.64645294104883
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: One-class learning is the classic problem of fitting a model to the data for
which annotations are available only for a single class. In this paper, we
explore novel objectives for one-class learning, which we collectively refer to
as Generalized One-class Discriminative Subspaces (GODS). Our key idea is to
learn a pair of complementary classifiers to flexibly bound the one-class data
distribution, where the data belongs to the positive half-space of one of the
classifiers in the complementary pair and to the negative half-space of the
other. To avoid redundancy while allowing non-linearity in the classifier
decision surfaces, we propose to design each classifier as an orthonormal frame
and seek to learn these frames via jointly optimizing for two conflicting
objectives, namely: i) to minimize the distance between the two frames, and ii)
to maximize the margin between the frames and the data. The learned orthonormal
frames will thus characterize a piecewise linear decision surface that allows
for efficient inference, while our objectives seek to bound the data within a
minimal volume that maximizes the decision margin, thereby robustly capturing
the data distribution. We explore several variants of our formulation under
different constraints on the constituent classifiers, including kernelized
feature maps. We demonstrate the empirical benefits of our approach via
experiments on data from several applications in computer vision, such as
anomaly detection in video sequences, human poses, and human activities. We
also explore the generality and effectiveness of GODS for non-vision tasks via
experiments on several UCI datasets, demonstrating state-of-the-art results.
Related papers
- Convolutional autoencoder-based multimodal one-class classification [80.52334952912808]
One-class classification refers to approaches of learning using data from a single class only.
We propose a deep learning one-class classification method suitable for multimodal data.
arXiv Detail & Related papers (2023-09-25T12:31:18Z) - Neural Collapse Terminus: A Unified Solution for Class Incremental
Learning and Its Variants [166.916517335816]
In this paper, we offer a unified solution to the misalignment dilemma in the three tasks.
We propose neural collapse terminus that is a fixed structure with the maximal equiangular inter-class separation for the whole label space.
Our method holds the neural collapse optimality in an incremental fashion regardless of data imbalance or data scarcity.
arXiv Detail & Related papers (2023-08-03T13:09:59Z) - DiGeo: Discriminative Geometry-Aware Learning for Generalized Few-Shot
Object Detection [39.937724871284665]
Generalized few-shot object detection aims to achieve precise detection on both base classes with abundant annotations and novel classes with limited training data.
Existing approaches enhance few-shot generalization with the sacrifice of base-class performance.
We propose a new training framework, DiGeo, to learn Geometry-aware features of inter-class separation and intra-class compactness.
arXiv Detail & Related papers (2023-03-16T22:37:09Z) - Learning from Temporal Spatial Cubism for Cross-Dataset Skeleton-based
Action Recognition [88.34182299496074]
Action labels are only available on a source dataset, but unavailable on a target dataset in the training stage.
We utilize a self-supervision scheme to reduce the domain shift between two skeleton-based action datasets.
By segmenting and permuting temporal segments or human body parts, we design two self-supervised learning classification tasks.
arXiv Detail & Related papers (2022-07-17T07:05:39Z) - Semi-supervised Domain Adaptive Structure Learning [72.01544419893628]
Semi-supervised domain adaptation (SSDA) is a challenging problem requiring methods to overcome both 1) overfitting towards poorly annotated data and 2) distribution shift across domains.
We introduce an adaptive structure learning method to regularize the cooperation of SSL and DA.
arXiv Detail & Related papers (2021-12-12T06:11:16Z) - Learning a Discriminant Latent Space with Neural Discriminant Analysis [7.074386822875744]
We propose an optimization called Neural Discriminant Analysis (NDA) for Deep Convolutional Neural Networks (DCNNs)
NDA transforms deep features to become more discriminative and, therefore, improves the performances in various tasks.
We evaluate our NDA optimization in different research fields: general supervised classification, fine-grained classification, semi-supervised learning, and out of distribution detection.
arXiv Detail & Related papers (2021-07-13T16:06:07Z) - Adaptive Prototypical Networks with Label Words and Joint Representation
Learning for Few-Shot Relation Classification [17.237331828747006]
This work focuses on few-shot relation classification (FSRC)
We propose an adaptive mixture mechanism to add label words to the representation of the class prototype.
Experiments have been conducted on FewRel under different few-shot (FS) settings.
arXiv Detail & Related papers (2021-01-10T11:25:42Z) - Learning Robust Representation for Clustering through Locality
Preserving Variational Discriminative Network [16.259673823482665]
Variational Deep Embedding achieves great success in various clustering tasks.
VaDE suffers from two problems: 1) it is fragile to the input noise; 2) it ignores the locality information between the neighboring data points.
We propose a joint learning framework that improves VaDE with a robust embedding discriminator and a local structure constraint.
arXiv Detail & Related papers (2020-12-25T02:31:55Z) - Learning by Minimizing the Sum of Ranked Range [58.24935359348289]
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.
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.
arXiv Detail & Related papers (2020-10-05T01:58:32Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.