Data-Time Tradeoffs for Corrupted Sensing

Jinchi Chen; Yulong Liu

doi:10.1109/LSP.2018.2833428

Data-Time Tradeoffs for Corrupted Sensing

Jinchi Chen, Yulong Liu^*

^*此作品的通讯作者

物理学院

Beijing Institute of Technology

科研成果: 期刊稿件 › 文章 › 同行评审

1 引用（Scopus）

摘要

In this letter, we characterize a data-time tradeoff for projected gradient descent (PGD) algorithms used for solving corrupted sensing problems under sub-Gaussian measurements. We also show that with a proper step size, the PGD method can achieve a linear rate of convergence when the number of measurements is sufficiently large.

源语言	英语
页（从-至）	941-945
页数	5
期刊	IEEE Signal Processing Letters
卷	25
期	7
DOI	https://doi.org/10.1109/LSP.2018.2833428
出版状态	已出版 - 7月 2018

访问文件

10.1109/LSP.2018.2833428

其它文件与链接

链接到 Scopus 的出版物

引用此

Chen, J., & Liu, Y. (2018). Data-Time Tradeoffs for Corrupted Sensing. IEEE Signal Processing Letters, 25(7), 941-945. https://doi.org/10.1109/LSP.2018.2833428

@article{10396dbcaeb445bb9aeb3abdeefbbcf1,

title = "Data-Time Tradeoffs for Corrupted Sensing",

abstract = "In this letter, we characterize a data-time tradeoff for projected gradient descent (PGD) algorithms used for solving corrupted sensing problems under sub-Gaussian measurements. We also show that with a proper step size, the PGD method can achieve a linear rate of convergence when the number of measurements is sufficiently large.",

keywords = "Corrupted sensing, data-time tradeoffs, projected gradient descent (PGD)",

author = "Jinchi Chen and Yulong Liu",

note = "Publisher Copyright: {\textcopyright} 1994-2012 IEEE.",

year = "2018",

month = jul,

doi = "10.1109/LSP.2018.2833428",

language = "English",

volume = "25",

pages = "941--945",

journal = "IEEE Signal Processing Letters",

issn = "1070-9908",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

T1 - Data-Time Tradeoffs for Corrupted Sensing

AU - Chen, Jinchi

AU - Liu, Yulong

PY - 2018/7

Y1 - 2018/7

N2 - In this letter, we characterize a data-time tradeoff for projected gradient descent (PGD) algorithms used for solving corrupted sensing problems under sub-Gaussian measurements. We also show that with a proper step size, the PGD method can achieve a linear rate of convergence when the number of measurements is sufficiently large.

AB - In this letter, we characterize a data-time tradeoff for projected gradient descent (PGD) algorithms used for solving corrupted sensing problems under sub-Gaussian measurements. We also show that with a proper step size, the PGD method can achieve a linear rate of convergence when the number of measurements is sufficiently large.

KW - Corrupted sensing

KW - data-time tradeoffs

KW - projected gradient descent (PGD)

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

U2 - 10.1109/LSP.2018.2833428

DO - 10.1109/LSP.2018.2833428

M3 - Article

AN - SCOPUS:85046445086

SN - 1070-9908

VL - 25

SP - 941

EP - 945

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

IS - 7

ER -