Log In Sign Up

An Algorithm for Learning Smaller Representations of Models With Scarce Data

by   Adrian de Wynter, et al.

We present a greedy algorithm for solving binary classification problems in situations where the dataset is either too small or not fully representative of the problem being solved, and obtaining more data is not possible. This algorithm is of particular interest when training small models that have trouble generalizing. It relies on a trained model with loose accuracy constraints, an iterative hyperparameter pruning procedure, and a function used to generate new data. Analysis on correctness and runtime complexity under ideal conditions and an extension to deep neural networks is provided. In the former case we obtain an asymptotic bound of O(|Θ^2|(log|Θ| + |θ^2| + T_f(| D|)) + S̅|Θ||E|), where |Θ| is the cardinality of the set of hyperparameters θ to be searched; |E| and |D| are the sizes of the evaluation and training datasets, respectively; S̅ and f̅ are the inference times for the trained model and the candidate model; and T_f(|D|) is a polynomial on |D| and f̅. Under these conditions, this algorithm returns a solution that is 1 ≤ r ≤ 2(1 - 2^-|Θ|) times better than simply enumerating and training with any θ∈Θ. As part of our analysis of the generating function we also prove that, under certain assumptions, if an open cover of D has the same homology as the manifold where the support of the underlying probability distribution lies, then D is learnable, and viceversa.


page 1

page 2

page 3

page 4


Using Topological Framework for the Design of Activation Function and Model Pruning in Deep Neural Networks

Success of deep neural networks in diverse tasks across domains of compu...

A closer look at domain shift for deep learning in histopathology

Domain shift is a significant problem in histopathology. There can be la...

SBPF: Sensitiveness Based Pruning Framework For Convolutional Neural Network On Image Classification

Pruning techniques are used comprehensively to compress convolutional ne...

A Privacy-Preserving DNN Pruning and Mobile Acceleration Framework

To facilitate the deployment of deep neural networks (DNNs) on resource-...

A Non-Intrusive Correction Algorithm for Classification Problems with Corrupted Data

A novel correction algorithm is proposed for multi-class classification ...

Machine Unlearning: Learning, Polluting, and Unlearning for Spam Email

Machine unlearning for security is studied in this context. Several spam...