Decentralized regression with asynchronous sub-Nyquist sampling

Hoi To Wai; Anna Scaglione

doi:10.1109/ACSSC.2014.7094559

Decentralized regression with asynchronous sub-Nyquist sampling

Hoi To Wai, Anna Scaglione

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

Abstract

When capturing data on a sensor field to uncover its latent structure, there are often nuisance parameters in the observation model that turn even linear regression problems into non-convex optimizations. One common case is the lack of common timing source in ADCs, therefore samplings are done with time offsets. Motivated by the desire of estimating jointly the sensor field and nuisance parameters in a wide area deployment, this paper derives a new decentralized algorithm that combines alternating optimization and gossip-based learning. The proposed algorithm is shown to converge to the neighborhood of a local minimum, both analytically and empirically.

Original language	English (US)
Title of host publication	Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers
Editors	Michael B. Matthews
Publisher	IEEE Computer Society
Pages	798-802
Number of pages	5
ISBN (Electronic)	9781479982974
DOIs	https://doi.org/10.1109/ACSSC.2014.7094559
State	Published - Apr 24 2015
Externally published	Yes
Event	48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States Duration: Nov 2 2014 → Nov 5 2014

Publication series

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

Other

Other	48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Country/Territory	United States
City	Pacific Grove
Period	11/2/14 → 11/5/14

Keywords

asynchronous sampling
decentralized regression
gossip algorithm
sub-Nyquist sampling

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Access to Document

10.1109/ACSSC.2014.7094559

Cite this

Wai, H. T., & Scaglione, A. (2015). Decentralized regression with asynchronous sub-Nyquist sampling. In M. B. Matthews (Ed.), Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers (pp. 798-802). Article 7094559 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2015-April). IEEE Computer Society. https://doi.org/10.1109/ACSSC.2014.7094559

Decentralized regression with asynchronous sub-Nyquist sampling. / Wai, Hoi To; Scaglione, Anna.
Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers. ed. / Michael B. Matthews. IEEE Computer Society, 2015. p. 798-802 7094559 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2015-April).

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

Wai, HT & Scaglione, A 2015, Decentralized regression with asynchronous sub-Nyquist sampling. in MB Matthews (ed.), Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers., 7094559, Conference Record - Asilomar Conference on Signals, Systems and Computers, vol. 2015-April, IEEE Computer Society, pp. 798-802, 48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, United States, 11/2/14. https://doi.org/10.1109/ACSSC.2014.7094559

@inproceedings{042e8d267f0c408dadce14e72dacb9fa,

title = "Decentralized regression with asynchronous sub-Nyquist sampling",

abstract = "When capturing data on a sensor field to uncover its latent structure, there are often nuisance parameters in the observation model that turn even linear regression problems into non-convex optimizations. One common case is the lack of common timing source in ADCs, therefore samplings are done with time offsets. Motivated by the desire of estimating jointly the sensor field and nuisance parameters in a wide area deployment, this paper derives a new decentralized algorithm that combines alternating optimization and gossip-based learning. The proposed algorithm is shown to converge to the neighborhood of a local minimum, both analytically and empirically.",

keywords = "asynchronous sampling, decentralized regression, gossip algorithm, sub-Nyquist sampling",

author = "Wai, {Hoi To} and Anna Scaglione",

year = "2015",

month = apr,

day = "24",

doi = "10.1109/ACSSC.2014.7094559",

language = "English (US)",

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

publisher = "IEEE Computer Society",

pages = "798--802",

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

booktitle = "Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers",

note = "48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 ; Conference date: 02-11-2014 Through 05-11-2014",

}

TY - GEN

T1 - Decentralized regression with asynchronous sub-Nyquist sampling

AU - Wai, Hoi To

AU - Scaglione, Anna

PY - 2015/4/24

Y1 - 2015/4/24

N2 - When capturing data on a sensor field to uncover its latent structure, there are often nuisance parameters in the observation model that turn even linear regression problems into non-convex optimizations. One common case is the lack of common timing source in ADCs, therefore samplings are done with time offsets. Motivated by the desire of estimating jointly the sensor field and nuisance parameters in a wide area deployment, this paper derives a new decentralized algorithm that combines alternating optimization and gossip-based learning. The proposed algorithm is shown to converge to the neighborhood of a local minimum, both analytically and empirically.

AB - When capturing data on a sensor field to uncover its latent structure, there are often nuisance parameters in the observation model that turn even linear regression problems into non-convex optimizations. One common case is the lack of common timing source in ADCs, therefore samplings are done with time offsets. Motivated by the desire of estimating jointly the sensor field and nuisance parameters in a wide area deployment, this paper derives a new decentralized algorithm that combines alternating optimization and gossip-based learning. The proposed algorithm is shown to converge to the neighborhood of a local minimum, both analytically and empirically.

KW - asynchronous sampling

KW - decentralized regression

KW - gossip algorithm

KW - sub-Nyquist sampling

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

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

U2 - 10.1109/ACSSC.2014.7094559

DO - 10.1109/ACSSC.2014.7094559

M3 - Conference contribution

AN - SCOPUS:84940511185

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

SP - 798

EP - 802

BT - Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers

A2 - Matthews, Michael B.

PB - IEEE Computer Society

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

Y2 - 2 November 2014 through 5 November 2014

ER -

Decentralized regression with asynchronous sub-Nyquist sampling

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this