{"title":"Satisfying the restricted isometry property with the optimal number of rows and slightly less randomness","authors":"Shravas Rao","doi":"10.1016/j.ipl.2024.106553","DOIUrl":null,"url":null,"abstract":"<div><div>A matrix <span><math><mi>Φ</mi><mo>∈</mo><msup><mrow><mi>R</mi></mrow><mrow><mi>Q</mi><mo>×</mo><mi>N</mi></mrow></msup></math></span> satisfies the restricted isometry property if <span><math><msubsup><mrow><mo>‖</mo><mi>Φ</mi><mi>x</mi><mo>‖</mo></mrow><mrow><mn>2</mn></mrow><mrow><mn>2</mn></mrow></msubsup></math></span> is approximately equal to <span><math><msubsup><mrow><mo>‖</mo><mi>x</mi><mo>‖</mo></mrow><mrow><mn>2</mn></mrow><mrow><mn>2</mn></mrow></msubsup></math></span> for all <em>k</em>-sparse vectors <em>x</em>. We give a construction of RIP matrices with the optimal <span><math><mi>Q</mi><mo>=</mo><mi>O</mi><mo>(</mo><mi>k</mi><mi>log</mi><mo></mo><mo>(</mo><mi>N</mi><mo>/</mo><mi>k</mi><mo>)</mo><mo>)</mo></math></span> rows using <span><math><mi>O</mi><mo>(</mo><mi>k</mi><mi>log</mi><mo></mo><mo>(</mo><mi>N</mi><mo>/</mo><mi>k</mi><mo>)</mo><mi>log</mi><mo></mo><mo>(</mo><mi>k</mi><mo>)</mo><mo>)</mo></math></span> bits of randomness. The main technical ingredient is an extension of the Hanson-Wright inequality to <em>ε</em>-biased distributions.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"189 ","pages":"Article 106553"},"PeriodicalIF":0.7000,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019024000838","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
A matrix satisfies the restricted isometry property if is approximately equal to for all k-sparse vectors x. We give a construction of RIP matrices with the optimal rows using bits of randomness. The main technical ingredient is an extension of the Hanson-Wright inequality to ε-biased distributions.
期刊介绍:
Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered.
Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.