Big data sketching with model mismatch

Sundeep Prabhakar Chepuri; Yu Zhangt; Geert Leus; Georgios B Giannakis

doi:10.1109/ACSSC.2015.7421090

Big data sketching with model mismatch

Sundeep Prabhakar Chepuri, Yu Zhangt, Geert Leus, Georgios B Giannakis

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

Data reduction for large-scale linear regression is one of the most important tasks in this era of data deluge. Exact model information is however not often available for big data analytics. Therefore, we propose a framework for big data sketching (i.e., a data reduction tool) that is robust to possible model mismatch. Such a sketching task is cast as a Boolean min-max optimization problem, and then equivalently reduced to a Boolean minimization program. Capitalizing on the block coordinate descent algorithm, a scalable solver is developed to yield an efficient sampler and a good estimate of the unknown regression coefficient.

Original language	English (US)
Title of host publication	Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Editors	Michael B. Matthews
Publisher	IEEE Computer Society
Pages	97-101
Number of pages	5
ISBN (Electronic)	9781467385763
DOIs	https://doi.org/10.1109/ACSSC.2015.7421090
State	Published - Feb 26 2016
Event	49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States Duration: Nov 8 2015 → Nov 11 2015

Publication series

Name	Conference Record - Asilomar Conference on Signals, Systems and Computers
Volume	2016-February
ISSN (Print)	1058-6393

Other

Other	49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Country/Territory	United States
City	Pacific Grove
Period	11/8/15 → 11/11/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

Keywords

Big data
data reduction
linear regression
model mismatch
sketching

Publisher link

10.1109/ACSSC.2015.7421090

Find It

Find It at U of M Libraries

Cite this

Chepuri, S. P., Zhangt, Y., Leus, G., & Giannakis, G. B. (2016). Big data sketching with model mismatch. In M. B. Matthews (Ed.), Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 (pp. 97-101). Article 7421090 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2016-February). IEEE Computer Society. https://doi.org/10.1109/ACSSC.2015.7421090

Big data sketching with model mismatch. / Chepuri, Sundeep Prabhakar; Zhangt, Yu; Leus, Geert et al.
Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015. ed. / Michael B. Matthews. IEEE Computer Society, 2016. p. 97-101 7421090 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2016-February).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Chepuri, SP, Zhangt, Y, Leus, G & Giannakis, GB 2016, Big data sketching with model mismatch. in MB Matthews (ed.), Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015., 7421090, Conference Record - Asilomar Conference on Signals, Systems and Computers, vol. 2016-February, IEEE Computer Society, pp. 97-101, 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, United States, 11/8/15. https://doi.org/10.1109/ACSSC.2015.7421090

@inproceedings{09808009ba054bb6b77efdd5a7cd2757,

title = "Big data sketching with model mismatch",

abstract = "Data reduction for large-scale linear regression is one of the most important tasks in this era of data deluge. Exact model information is however not often available for big data analytics. Therefore, we propose a framework for big data sketching (i.e., a data reduction tool) that is robust to possible model mismatch. Such a sketching task is cast as a Boolean min-max optimization problem, and then equivalently reduced to a Boolean minimization program. Capitalizing on the block coordinate descent algorithm, a scalable solver is developed to yield an efficient sampler and a good estimate of the unknown regression coefficient.",

keywords = "Big data, data reduction, linear regression, model mismatch, sketching",

author = "Chepuri, {Sundeep Prabhakar} and Yu Zhangt and Geert Leus and Giannakis, {Georgios B}",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 ; Conference date: 08-11-2015 Through 11-11-2015",

year = "2016",

month = feb,

day = "26",

doi = "10.1109/ACSSC.2015.7421090",

language = "English (US)",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

publisher = "IEEE Computer Society",

pages = "97--101",

editor = "Matthews, {Michael B.}",

booktitle = "Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015",

}

TY - GEN

T1 - Big data sketching with model mismatch

AU - Chepuri, Sundeep Prabhakar

AU - Zhangt, Yu

AU - Leus, Geert

AU - Giannakis, Georgios B

PY - 2016/2/26

Y1 - 2016/2/26

N2 - Data reduction for large-scale linear regression is one of the most important tasks in this era of data deluge. Exact model information is however not often available for big data analytics. Therefore, we propose a framework for big data sketching (i.e., a data reduction tool) that is robust to possible model mismatch. Such a sketching task is cast as a Boolean min-max optimization problem, and then equivalently reduced to a Boolean minimization program. Capitalizing on the block coordinate descent algorithm, a scalable solver is developed to yield an efficient sampler and a good estimate of the unknown regression coefficient.

AB - Data reduction for large-scale linear regression is one of the most important tasks in this era of data deluge. Exact model information is however not often available for big data analytics. Therefore, we propose a framework for big data sketching (i.e., a data reduction tool) that is robust to possible model mismatch. Such a sketching task is cast as a Boolean min-max optimization problem, and then equivalently reduced to a Boolean minimization program. Capitalizing on the block coordinate descent algorithm, a scalable solver is developed to yield an efficient sampler and a good estimate of the unknown regression coefficient.

KW - Big data

KW - data reduction

KW - linear regression

KW - model mismatch

KW - sketching

UR - http://www.scopus.com/inward/record.url?scp=84969799225&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84969799225&partnerID=8YFLogxK

U2 - 10.1109/ACSSC.2015.7421090

DO - 10.1109/ACSSC.2015.7421090

M3 - Conference contribution

AN - SCOPUS:84969799225

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 97

EP - 101

BT - Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015

A2 - Matthews, Michael B.

PB - IEEE Computer Society

T2 - 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015

Y2 - 8 November 2015 through 11 November 2015

ER -

Big data sketching with model mismatch

Abstract

Publication series

Other

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this