{"id":"https://openalex.org/W783404226","doi":"https://doi.org/10.1145/2897518.2897650","title":"Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time","display_name":"Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time","publication_year":2016,"publication_date":"2016-06-10","ids":{"openalex":"https://openalex.org/W783404226","doi":"https://doi.org/10.1145/2897518.2897650","mag":"783404226"},"language":"en","primary_location":{"id":"doi:10.1145/2897518.2897650","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2897518.2897650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086773451","display_name":"Michael Kapralov","orcid":"https://orcid.org/0009-0006-2882-0459"},"institutions":[{"id":"https://openalex.org/I174424907","display_name":"Laboratoire d'Informatique Fondamentale de Lille","ror":"https://ror.org/05rhg0h08","country_code":"FR","type":"facility","lineage":["https://openalex.org/I174424907"]},{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH","FR"],"is_corresponding":true,"raw_author_name":"Michael Kapralov","raw_affiliation_strings":["EPFL, Switzerland","EPFL, SWITZERLAND"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"EPFL, SWITZERLAND","institution_ids":["https://openalex.org/I174424907","https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086773451"],"corresponding_institution_ids":["https://openalex.org/I174424907","https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"264","last_page":"277"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11210","display_name":"Mathematical Analysis and Transform Methods","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.6597439050674438},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5594682097434998},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.5145015716552734},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.509842574596405},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.47019681334495544},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4648726284503937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4603351056575775},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4602363109588623},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43510276079177856},{"id":"https://openalex.org/keywords/non-uniform-discrete-fourier-transform","display_name":"Non-uniform discrete Fourier transform","score":0.42787665128707886},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.4123859405517578},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37194764614105225},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.35812023282051086},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3547772765159607},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.26863664388656616},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1895090639591217}],"concepts":[{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.6597439050674438},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5594682097434998},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.5145015716552734},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.509842574596405},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.47019681334495544},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4648726284503937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4603351056575775},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4602363109588623},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43510276079177856},{"id":"https://openalex.org/C62058723","wikidata":"https://www.wikidata.org/wiki/Q7049066","display_name":"Non-uniform discrete Fourier transform","level":5,"score":0.42787665128707886},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.4123859405517578},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37194764614105225},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.35812023282051086},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3547772765159607},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.26863664388656616},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1895090639591217},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2897518.2897650","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2897518.2897650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W148879656","https://openalex.org/W641843003","https://openalex.org/W783404226","https://openalex.org/W1493892051","https://openalex.org/W1501755821","https://openalex.org/W1522894866","https://openalex.org/W1575519488","https://openalex.org/W1948197544","https://openalex.org/W1986545790","https://openalex.org/W2012365979","https://openalex.org/W2020301027","https://openalex.org/W2027528470","https://openalex.org/W2029816571","https://openalex.org/W2031425559","https://openalex.org/W2053817819","https://openalex.org/W2055064119","https://openalex.org/W2082051116","https://openalex.org/W2105623290","https://openalex.org/W2107625832","https://openalex.org/W2112094394","https://openalex.org/W2116962375","https://openalex.org/W2120383799","https://openalex.org/W2123591640","https://openalex.org/W2129638195","https://openalex.org/W2137198385","https://openalex.org/W2152263739","https://openalex.org/W2172979040","https://openalex.org/W2205172111","https://openalex.org/W2296616510","https://openalex.org/W2325483632","https://openalex.org/W2395231588","https://openalex.org/W2952014918","https://openalex.org/W2952413220","https://openalex.org/W3025603868","https://openalex.org/W4242004838","https://openalex.org/W4250955649","https://openalex.org/W6777684314"],"related_works":["https://openalex.org/W2118155316","https://openalex.org/W3141389362","https://openalex.org/W2382218334","https://openalex.org/W2116983948","https://openalex.org/W2090697566","https://openalex.org/W2057875231","https://openalex.org/W2154898175","https://openalex.org/W4299146998","https://openalex.org/W2183889480","https://openalex.org/W2343504300"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,10,43,56,59,66,107,111],"problem":[3],"of":[4,13,42,58],"computing":[5,26],"a":[6,14,22,81,93,126],"k-sparse":[7],"approximation":[8,29],"to":[9,74,85,90],"Fourier":[11,37,60,108],"transform":[12,109],"length":[15],"N":[16],"signal.":[17],"Our":[18],"main":[19],"result":[20,94],"is":[21,55],"randomized":[23],"algorithm":[24],"for":[25,70,76,80,106,115],"such":[27],"an":[28,86],"(i.e.":[30],"achieving":[31],"\u21132/\u21132":[32],"sparse":[33],"recovery":[34],"guarantees":[35],"using":[36,39],"measurements)":[38],"Od(klogNloglogN)":[40],"samples":[41],"signal":[44],"in":[45,130],"time":[46],"domain":[47],"and":[48,101],"Od(klogd+3":[49],"N)":[50],"runtime,":[51],"where":[52],"d\u2265":[53,118],"1":[54],"dimensionality":[57],"transform.":[61],"The":[62],"sample":[63,97,131],"complexity":[64,98,132],"matches":[65],"\u03a9(klog(N/k))":[67],"lower":[68],"bound":[69],"non-adaptive":[71],"algorithms":[72],"due":[73],"[DIPW]":[75],"any":[77,116],"k\u2264":[78],"N1\u2212\u03b4":[79],"constant":[82],"\u03b4>0":[83],"up":[84],"O(loglogN)":[87],"factor.":[88],"Prior":[89],"our":[91],"work":[92],"with":[95],"comparable":[96],"klogN":[99],"logO(1)logN":[100],"sublinear":[102],"runtime":[103],"was":[104],"known":[105,121],"on":[110],"line":[112],"[IKP],":[113],"but":[114],"dimension":[117],"2":[119],"previously":[120],"techniques":[122],"either":[123],"suffered":[124],"from":[125],"(logN)":[127],"factor":[128],"loss":[129],"or":[133],"required":[134],"\u03a9(N)":[135],"runtime.":[136]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}