Home
Resource
Identification of overcomplete dictionaries and their application in distributed classification problems
PDF
PDF format is widely accepted and good for printing.
Plug-in required
PDF-1(540.54 kb)
Citation & Export
View Usage Statistics
Staff View

Citation & Export
Hide

Simple citation

Shakeri, Zahra. Identification of overcomplete dictionaries and their application in distributed classification problems. Retrieved from https://doi.org/doi:10.7282/T3ZG6VF2

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleIdentification of overcomplete dictionaries and their application in distributed classification problems
NameShakeri, Zahra (author); Bajwa, Waheed U. (chair); Sarwate, Anand D. (internal member); Rates, Roy (internal member); Rutgers University; Graduate School - New Brunswick
Date Created2016
Other Date2016-05 (degree)
SubjectElectrical and Computer Engineering, Machine learning
Extent1 online resource (vii, 36 p. : ill.)
DescriptionThe work presented in this thesis aims to study the conditions essential for reliable dictionary recovery based on the maximal response criterion and exploit the application of dictionary learning in classification of distributed data. The first part of this thesis revisits the problem of recovery of an overcomplete dictionary in a local neighborhood from training samples using the so-called maximal response criterion. While it is known in the literature that the maximal response criterion can be used for asymptotic exact recovery of a dictionary in a local neighborhood, those results do not allow for linear (in the ambient dimension) scaling of sparsity levels in signal representations. The first contribution in this work is introducing a new condition for the sparse representation of signals and leveraging a new proof technique to establish that maximal response criterion can in fact handle linear sparsity (modulo a logarithmic factor) of signal representations. While the focus of this work is on asymptotic exact recovery, the same ideas can be used in a straightforward manner to strengthen the original maximal response criterion-based results involving noisy observations and finite number of training samples. The second part of this thesis addresses the problem of collaborative training of nonlinear classifiers using big, distributed training data. The proposed supervised learning strategy corresponds to data-driven joint learning of a nonlinear transformation that maps the (training) data to a higher-dimensional feature space and a ridge regression based linear classifier in the feature space. The key aspect of this work, which distinguishes it from related prior work, is that it assumes: 1. The training data are distributed across a number of interconnected sites. 2. Sizes of the local training data as well as privacy concerns prohibit exchange of individual training samples between sites. The main contribution is formulation of an algorithm, termed cloud D-KSVD, that reliably, efficiently and collaboratively learns both the nonlinear map and the linear classifier under these constraints. In order to demonstrate the effectiveness of cloud D-KSVD, a number of numerical experiments on the MNIST dataset are also reported.
NoteM.S.
NoteIncludes bibliographical references
Noteby Zahra Shakeri
Genretheses, ETD graduate
Persistent URLhttps://doi.org/doi:10.7282/T3ZG6VF2
Languageeng
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.
Version 8.5.5
Rutgers University Libraries - Copyright ©2024