Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform

Author:

Cheraghchi Mahdi1ORCID,Indyk Piotr2

Affiliation:

1. Imperial College London

2. Massachusetts Institute of Technology

Abstract

For every fixed constant α > 0, we design an algorithm for computing the k -sparse Walsh-Hadamard transform (i.e., Discrete Fourier Transform over the Boolean cube) of an N -dimensional vector x ∈ R N in time k 1 + α (log N ) O (1) . Specifically, the algorithm is given query access to x and computes a k -sparse x˜ ∈ R N satisfying ‖ 1cH k ( )‖‖‖‖‖‖‖‖ 1 for an absolute constant c > 0, where xˆ is the transform of x and H k ( ) is its best k -sparse approximation. Our algorithm is fully deterministic and only uses nonadaptive queries to x (i.e., all queries are determined and performed in parallel when the algorithm starts). An important technical tool that we use is a construction of nearly optimal and linear lossless condensers, which is a careful instantiation of the GUV condenser (Guruswami et al. [2009]). Moreover, we design a deterministic and nonadaptive ℓ 1 /ℓ 1 compressed sensing scheme based on general lossless condensers that is equipped with a fast reconstruction algorithm running in time k 1 + α (log N ) O (1) (for the GUV-based condenser) and is of independent interest. Our scheme significantly simplifies and improves an earlier expander-based construction due to Berinde, Gilbert, Indyk, Karloff, and Strauss [Berinde et al. 2008]. Our methods use linear lossless condensers in a black box fashion; therefore, any future improvement on explicit constructions of such condensers would immediately translate to improved parameters in our framework (potentially leading to k (log N ) O (1) reconstruction time with a reduced exponent in the poly-logarithmic factor, and eliminating the extra parameter α). By allowing the algorithm to use randomness while still using nonadaptive queries, the runtime of the algorithm can be improved to õ ( k log 3 N ).

Funder

Swiss National Science Foundation

Qualcomm fellowship at Simons Institute for the Theory of Computing at UC Berkeley

NSF and the Simons Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3