FROCC: Fast Random projection-based One-Class Classification

• URL: http://arxiv.org/abs/2011.14317v2
• Date: Sat, 23 Jan 2021 11:10:57 GMT
• Title: FROCC: Fast Random projection-based One-Class Classification
• Authors: Arindam Bhattacharya and Sumanth Varambally and Amitabha Bagchi and Srikanta Bedathur
• Abstract summary: Fast Random projection-based One-Class Classification (FROCC) is an efficient method for one-class classification. FROCC achieves up to 3.1 percent points better ROC, with 1.2--67.8x speedup in training and test times.
• Score: 4.312746668772342
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present Fast Random projection-based One-Class Classification (FROCC), an extremely efficient method for one-class classification. Our method is based on a simple idea of transforming the training data by projecting it onto a set of random unit vectors that are chosen uniformly and independently from the unit sphere, and bounding the regions based on separation of the data. FROCC can be naturally extended with kernels. We theoretically prove that FROCC generalizes well in the sense that it is stable and has low bias. FROCC achieves up to 3.1 percent points better ROC, with 1.2--67.8x speedup in training and test times over a range of state-of-the-art benchmarks including the SVM and the deep learning based models for the OCC task.

Related papers

• CLIPure: Purification in Latent Space via CLIP for Adversarially Robust Zero-Shot Classification [65.46685389276443]
  We ground our work on CLIP, a vision-language pre-trained encoder model that can perform zero-shot classification by matching an image with text prompts. We then formulate purification risk as the KL divergence between the joint distributions purification process. We propose two variants for our CLIPure approach: CLI-Diff which models the likelihood of images' latent vectors, and CLIPure-Cos which models the likelihood with the cosine similarity between the embeddings of an image and a photo of a.''
  arXiv  Detail & Related papers  (2025-02-25T13:09:34Z)
• Time series classification with random convolution kernels based transforms: pooling operators and input representations matter [0.0]
  This article presents a new approach based on MiniRocket, called SelF-Rocket, for fast time series classification (TSC) It dynamically selects the best couple of input representations and pooling operator during the training process. It achieves state-of-the-art accuracy on the University of California Riverside (UCR) benchmark datasets.
  arXiv  Detail & Related papers  (2024-09-02T09:42:17Z)
• MOKD: Cross-domain Finetuning for Few-shot Classification via Maximizing Optimized Kernel Dependence [97.93517982908007]
  In cross-domain few-shot classification, NCC aims to learn representations to construct a metric space where few-shot classification can be performed. In this paper, we find that there exist high similarities between NCC-learned representations of two samples from different classes. We propose a bi-level optimization framework, emphmaximizing optimized kernel dependence (MOKD) to learn a set of class-specific representations that match the cluster structures indicated by labeled data.
  arXiv  Detail & Related papers  (2024-05-29T05:59:52Z)
• GCC: Generative Calibration Clustering [55.44944397168619]
  We propose a novel Generative Clustering (GCC) method to incorporate feature learning and augmentation into clustering procedure. First, we develop a discrimirative feature alignment mechanism to discover intrinsic relationship across real and generated samples. Second, we design a self-supervised metric learning to generate more reliable cluster assignment.
  arXiv  Detail & Related papers  (2024-04-14T01:51:11Z)
• GRSDet: Learning to Generate Local Reverse Samples for Few-shot Object Detection [15.998148904793426]
  Few-shot object detection (FSOD) aims to achieve object detection only using a few novel class training data. Most of the existing methods usually adopt a transfer-learning strategy to construct the novel class distribution. We propose generating local reverse samples (LRSamples) in Prototype Reference Frames to adaptively adjust the center position and boundary range of the novel class distribution.
  arXiv  Detail & Related papers  (2023-12-27T13:36:29Z)
• Morphological Classification of Radio Galaxies using Semi-Supervised Group Equivariant CNNs [0.0]
  Out of the estimated few trillion galaxies, only around a million have been detected through radio frequencies. We employ a semi-supervised learning approach to classify them into the known Fanaroff-Riley Type I (FRI) and Type II (FRII) categories. A Group Equivariant Convolutional Neural Network (G-CNN) was used as an encoder of the state-of-the-art self-supervised methods SimCLR and BYOL.
  arXiv  Detail & Related papers  (2023-05-31T06:50:32Z)
• A One-shot Framework for Distributed Clustered Learning in Heterogeneous Environments [54.172993875654015]
  The paper proposes a family of communication efficient methods for distributed learning in heterogeneous environments. One-shot approach, based on local computations at the users and a clustering based aggregation step at the server is shown to provide strong learning guarantees. For strongly convex problems it is shown that, as long as the number of data points per user is above a threshold, the proposed approach achieves order-optimal mean-squared error rates in terms of the sample size.
  arXiv  Detail & Related papers  (2022-09-22T09:04:10Z)
• Robust Representation via Dynamic Feature Aggregation [44.927408735490005]
  Deep convolutional neural network (CNN) based models are vulnerable to adversarial attacks. We propose a method, denoted as Dynamic Feature Aggregation, to compress the embedding space with a novel regularization. An averaging accuracy of 56.91% is achieved by our method on CIFAR-10 against various attack methods.
  arXiv  Detail & Related papers  (2022-05-16T06:22:15Z)
• Distributionally Robust Models with Parametric Likelihood Ratios [123.05074253513935]
  Three simple ideas allow us to train models with DRO using a broader class of parametric likelihood ratios. We find that models trained with the resulting parametric adversaries are consistently more robust to subpopulation shifts when compared to other DRO approaches.
  arXiv  Detail & Related papers  (2022-04-13T12:43:12Z)
• No Fear of Heterogeneity: Classifier Calibration for Federated Learning with Non-IID Data [78.69828864672978]
  A central challenge in training classification models in the real-world federated system is learning with non-IID data. We propose a novel and simple algorithm called Virtual Representations (CCVR), which adjusts the classifier using virtual representations sampled from an approximated ssian mixture model. Experimental results demonstrate that CCVR state-of-the-art performance on popular federated learning benchmarks including CIFAR-10, CIFAR-100, and CINIC-10.
  arXiv  Detail & Related papers  (2021-06-09T12:02:29Z)
• Solving Long-tailed Recognition with Deep Realistic Taxonomic Classifier [68.38233199030908]
  Long-tail recognition tackles the natural non-uniformly distributed data in realworld scenarios. While moderns perform well on populated classes, its performance degrades significantly on tail classes. Deep-RTC is proposed as a new solution to the long-tail problem, combining realism with hierarchical predictions.
  arXiv  Detail & Related papers  (2020-07-20T05:57:42Z)
• Fuzziness-based Spatial-Spectral Class Discriminant Information Preserving Active Learning for Hyperspectral Image Classification [0.456877715768796]
  This work proposes a novel fuzziness-based spatial-spectral within and between for both local and global class discriminant information preserving method. Experimental results on benchmark HSI datasets demonstrate the effectiveness of the FLG method on Generative, Extreme Learning Machine and Sparse Multinomial Logistic Regression.
  arXiv  Detail & Related papers  (2020-05-28T18:58:11Z)

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.