Repository logo
  • Log In
    New user? Click here to register.Have you forgotten your password?
University College Dublin
    Colleges & Schools
    Statistics
    All of DSpace
  • Log In
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. College of Science
  3. School of Computer Science
  4. Computer Science Research Collection
  5. An Orthogonal Classification Layer with Kasami Sequences for Discriminative Feature Learning in Neural Networks
 
  • Details
Options

An Orthogonal Classification Layer with Kasami Sequences for Discriminative Feature Learning in Neural Networks

Author(s)
Saadeldin, Mohamed  
MacNamee, Brian  
Uri
http://hdl.handle.net/10197/25407
Date Issued
2021-11-03
Date Available
2024-02-09T15:58:44Z
Abstract
This paper proposes a novel Orthogonal Classification Layer (OCL) utilizing Kasami sequences for neural networks trained for classification problems. OCL consists of a fully connected layer with fixed orthogonal weights and zero biases for all of its output neurons. Attaching the OCL to the end of any neural network encourages the network to generate a unique latent representation (orthogonal code) at its last hidden layer for each data class. This is achieved by associating and fixing the weights for each of the output neurons to a unique code from a set of orthogonal sequences, such as Kasami. When networks use OCL the latent representations they learn for each data class at the end of the network converge to values equivalent to the fixed weights of the OCL. Auto-correlation and cross-correlation properties of orthogonal codes maximize the output of the correct class and increase its separation from the outputs of all other classes. Therefore, networks trained with OCL benefit from a wider classification decision margin than networks without OCL. Moreover, the feature sets extracted by the network for different data classes are well separated and more amenable to human interpretation. The implementation of OCL is simple and OCL can easily be integrated into any neural network architecture without a need for network architecture modifications or changes to the training scheme (for example optimization, normalization, or regularization) adopted in the original network architecture. The computational and memory cost required for the OCL is lower than conventional classification layers since the weights are fixed and no gradient is required. Though simple and practical the proposed OCL enhances learning of discriminative latent representations, generates explainable features, and provides high classification accuracy. We demonstrate this through a set of evaluation experiments comparing the performance of equivalent networks with and without OCL.
Sponsorship
Science Foundation Ireland
Type of Material
Conference Publication
Publisher
IEEE
Copyright (Published Version)
2021 IEEE
Subjects

Neurosciences

Mental health

Training

Representation learni...

Codes

Memory management

Network architecture

DOI
10.1109/ictai52525.2021.00060
Web versions
https://ictai.computer.org/
Language
English
Status of Item
Peer reviewed
Journal
2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)
Conference Details
The 33rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2021), Virtual Event, 1-3 November 2021
This item is made available under a Creative Commons License
https://creativecommons.org/licenses/by-nc-nd/3.0/ie/
File(s)
Loading...
Thumbnail Image
Name

Camera_Ready_An_Orthogonal_Classification_Layer_with_Kasami_Sequences_for_Discriminative_Feature_Learning_in_Neural_Networks__Copy_.pdf

Size

384.63 KB

Format

Adobe PDF

Checksum (MD5)

db660cd5ebe74a01c51a4ab12896847a

Owning collection
Computer Science Research Collection

Item descriptive metadata is released under a CC-0 (public domain) license: https://creativecommons.org/public-domain/cc0/.
All other content is subject to copyright.

For all queries please contact research.repository@ucd.ie.

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement