HIGH CONFIDENCE SET REGULARIZATION IN SPARSE HIGH DIMENSIONAL LOGISTIC REGRESSION WITH MEASUREMENT ERROR

Search for this publication on Google Scholar
Rao, M. (2019). HIGH CONFIDENCE SET REGULARIZATION IN SPARSE HIGH DIMENSIONAL LOGISTIC REGRESSION WITH MEASUREMENT ERROR. Unc Charlotte Electronic Theses And Dissertations.
Download PDF

Analytics

28 views ◎
11 downloads ⇓


Abstract

l1 based regularization such as Lasso and Dantizg Selector succeed in two aspects. First,the inherent sparsity of l1 accords with the underlying nature of high dimensional data; second, the convexity essence paves the way to computational feasibility in high dimension.James and Radchenko developed an algorithm to solve Dantzig Selector for generalized linear model. Fan abstracted this framework to the set of convex loss function.To fill the gap of theoretical support within this framework, we derive non-asymptotic error bounds with logistic loss. We termed this classifier as High Confidence Set Selector (HCS).An implicit assumption of high confidence set selector is that the data is collected precisely. However, the data is inevitable to process with measurement error in reality.In response to this challenge, we introduce a new methodology abbreviated as MHCS accounts for measurement error. We derive the non-asymptotic error bounds in theoretic study.Our simulation study shows MHCS performs better than other competing classifiers especially when measurement error aggravates, which provides numerical support to our theory. Ascribe to embedded linearity instinct, HCS and MHCS is versatile to connect with state of art technique such as word vectors, deep network, transfer learning, etc.

Details
Author

Rao, Maorong

Title

HIGH CONFIDENCE SET REGULARIZATION IN SPARSE HIGH DIMENSIONAL LOGISTIC REGRESSION WITH MEASUREMENT ERROR

Physical Description

1 online resource (96 pages) : PDF

Date

2019

Degree Granting Institution

University of North Carolina at Charlotte

Abstract

l1 based regularization such as Lasso and Dantizg Selector succeed in two aspects. First,the inherent sparsity of l1 accords with the underlying nature of high dimensional data; second, the convexity essence paves the way to computational feasibility in high dimension.James and Radchenko developed an algorithm to solve Dantzig Selector for generalized linear model. Fan abstracted this framework to the set of convex loss function.To fill the gap of theoretical support within this framework, we derive non-asymptotic error bounds with logistic loss. We termed this classifier as High Confidence Set Selector (HCS).An implicit assumption of high confidence set selector is that the data is collected precisely. However, the data is inevitable to process with measurement error in reality.In response to this challenge, we introduce a new methodology abbreviated as MHCS accounts for measurement error. We derive the non-asymptotic error bounds in theoretic study.Our simulation study shows MHCS performs better than other competing classifiers especially when measurement error aggravates, which provides numerical support to our theory. Ascribe to embedded linearity instinct, HCS and MHCS is versatile to connect with state of art technique such as word vectors, deep network, transfer learning, etc.

Genre

doctoral dissertations

Subjects--Topics

Mathematics

Degree

Ph.D.

Subject Area

Mathematics

Advisor(s)

Jiang, Jiancheng

Degree Note

Thesis (Ph.D.)--University of North Carolina at Charlotte, 2019.

Rights Statement

This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). For additional information, see http://rightsstatements.org/page/InC/1.0/.

Rights Holder Information

Copyright is held by the author unless otherwise indicated.

Identifier

Rao_uncc_0694D_12056

Permalink

http://hdl.handle.net/20.500.13093/etd:1836