Incremental Fast Subclass Discriminant Analysis

02/11/2020
by   Kateryna Chumachenko, et al.
0

This paper proposes an incremental solution to Fast Subclass Discriminant Analysis (fastSDA). We present an exact and an approximate linear solution, along with an approximate kernelized variant. Extensive experiments on eight image datasets with different incremental batch sizes show the superiority of the proposed approach in terms of training time and accuracy being equal or close to fastSDA solution and outperforming other methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2019

Speed-up and multi-view extensions to Subclass Discriminant Analysis

In this paper, we propose a speed-up approach for subclass discriminant ...
research
02/22/2022

Distributed Sparse Multicategory Discriminant Analysis

This paper proposes a convex formulation for sparse multicategory linear...
research
09/04/2019

Lifelong Machine Learning with Deep Streaming Linear Discriminant Analysis

When a robot acquires new information, ideally it would immediately be c...
research
09/18/2023

Pivotal Estimation of Linear Discriminant Analysis in High Dimensions

We consider the linear discriminant analysis problem in the high-dimensi...
research
05/29/2019

Personalizing human activity recognition models using incremental learning

In this study, the aim is to personalize inertial sensor data-based huma...
research
01/01/2022

Dynamic Least-Squares Regression

A common challenge in large-scale supervised learning, is how to exploit...
research
04/13/2023

IBIA: An Incremental Build-Infer-Approximate Framework for Approximate Inference of Partition Function

Exact computation of the partition function is known to be intractable, ...

Please sign up or login with your details

Forgot password? Click here to reset