Arrow Research search

Author name cluster

Etienne Barnard

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

AAAI Conference 2020 Conference Paper

DNNs as Layers of Cooperating Classifiers

  • Marelie Davel
  • Marthinus Theunissen
  • Arnold Pretorius
  • Etienne Barnard

A robust theoretical framework that can describe and predict the generalization ability of DNNs in general circumstances remains elusive. Classical attempts have produced complexity metrics that rely heavily on global measures of compactness and capacity with little investigation into the effects of sub-component collaboration. We demonstrate intriguing regularities in the activation patterns of the hidden nodes within fully-connected feedforward networks. By tracing the origin of these patterns, we show how such networks can be viewed as the combination of two information processing systems: one continuous and one discrete. We describe how these two systems arise naturally from the gradient-based optimization process, and demonstrate the classification ability of the two systems, individually and in collaboration. This perspective on DNN classification offers a novel way to think about generalization, in which different subsets of the training data are used to train distinct classifiers; those classifiers are then combined to perform the classification task, and their consistency is crucial for accurate classification.

AAAI Conference 2017 Conference Paper

Variable Kernel Density Estimation in High-Dimensional Feature Spaces

  • Christiaan van der Walt
  • Etienne Barnard

Estimating the joint probability density function of a dataset is a central task in many machine learning applications. In this work we address the fundamental problem of kernel bandwidth estimation for variable kernel density estimation in high-dimensional feature spaces. We derive a variable kernel bandwidth estimator by minimizing the leave-one-out entropy objective function and show that this estimator is capable of performing estimation in high-dimensional feature spaces with great success. We compare the performance of this estimator to state-of-the art maximumlikelihood estimators on a number of representative high-dimensional machine learning tasks and show that the newly introduced minimum leave-one-out entropy estimator performs optimally on a number of highdimensional datasets considered.

NeurIPS Conference 1989 Conference Paper

Performance Comparisons Between Backpropagation Networks and Classification Trees on Three Real-World Applications

  • Les Atlas
  • Ronald Cole
  • Jerome Connor
  • Mohamed El-Sharkawi
  • Robert Marks
  • Yeshwant Muthusamy
  • Etienne Barnard

Multi-layer perceptrons and trained classification trees are two very different techniques which have recently become popular. Given enough data and time, both methods are capable of performing arbi(cid: 173) trary non-linear classification. We first consider the important differences between multi-layer perceptrons and classification trees and conclude that there is not enough theoretical basis for the clear(cid: 173) cut superiority of one technique over the other. For this reason, we performed a number of empirical tests on three real-world problems in power system load forecasting, power system security prediction, and speaker-independent vowel identification. In all cases, even for piecewise-linear trees, the multi-layer perceptron performed as well as or better than the trained classification trees. Performance Comparisons 623

v2026.09.13