{"id":"https://openalex.org/W2045142754","doi":"https://doi.org/10.1109/lsp.2014.2345761","title":"On the Computational Intractability of Exact and Approximate Dictionary Learning","display_name":"On the Computational Intractability of Exact and Approximate Dictionary Learning","publication_year":2014,"publication_date":"2014-08-07","ids":{"openalex":"https://openalex.org/W2045142754","doi":"https://doi.org/10.1109/lsp.2014.2345761","mag":"2045142754"},"language":"en","primary_location":{"id":"doi:10.1109/lsp.2014.2345761","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2014.2345761","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1405.6664","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Andreas M. Tillmann","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas M. Tillmann","raw_affiliation_strings":["Research Group Optimization at TU Darmstadt, Darmstadt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Group Optimization at TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":5.6684,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.96411331,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":"22","issue":"1","first_page":"45","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9939000010490417,"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":0.9939000010490417,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12131","display_name":"Wireless Signal Modulation Classification","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/k-svd","display_name":"K-SVD","score":0.7839999794960022},{"id":"https://openalex.org/keywords/dictionary-learning","display_name":"Dictionary learning","score":0.7353000044822693},{"id":"https://openalex.org/keywords/neural-coding","display_name":"Neural coding","score":0.7014999985694885},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.579800009727478},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5777000188827515},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5181999802589417},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.5109000205993652},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5054000020027161},{"id":"https://openalex.org/keywords/signal-processing","display_name":"Signal processing","score":0.5012000203132629},{"id":"https://openalex.org/keywords/basis-pursuit","display_name":"Basis pursuit","score":0.4772000014781952}],"concepts":[{"id":"https://openalex.org/C154771677","wikidata":"https://www.wikidata.org/wiki/Q17098361","display_name":"K-SVD","level":3,"score":0.7839999794960022},{"id":"https://openalex.org/C2988886741","wikidata":"https://www.wikidata.org/wiki/Q25304494","display_name":"Dictionary learning","level":3,"score":0.7353000044822693},{"id":"https://openalex.org/C77637269","wikidata":"https://www.wikidata.org/wiki/Q7002051","display_name":"Neural coding","level":2,"score":0.7014999985694885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6776999831199646},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.579800009727478},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5777000188827515},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.51910001039505},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5181999802589417},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.5109000205993652},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5054000020027161},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.5012000203132629},{"id":"https://openalex.org/C99217422","wikidata":"https://www.wikidata.org/wiki/Q4867576","display_name":"Basis pursuit","level":4,"score":0.4772000014781952},{"id":"https://openalex.org/C70958404","wikidata":"https://www.wikidata.org/wiki/Q7512728","display_name":"Signal reconstruction","level":4,"score":0.4571000039577484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4553000032901764},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.4320000112056732},{"id":"https://openalex.org/C2989281035","wikidata":"https://www.wikidata.org/wiki/Q120811","display_name":"Signal recovery","level":3,"score":0.4185999929904938},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.40369999408721924},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3955000042915344},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.36039999127388},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33889999985694885},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.33559998869895935},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C51632099","wikidata":"https://www.wikidata.org/wiki/Q3985153","display_name":"Training set","level":2,"score":0.319599986076355},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.30390000343322754},{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.28700000047683716},{"id":"https://openalex.org/C141379421","wikidata":"https://www.wikidata.org/wiki/Q6094427","display_name":"Iterative reconstruction","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C50292564","wikidata":"https://www.wikidata.org/wiki/Q2462783","display_name":"Computational learning theory","level":3,"score":0.2630000114440918},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.2547999918460846},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.25189998745918274},{"id":"https://openalex.org/C2778192920","wikidata":"https://www.wikidata.org/wiki/Q16874989","display_name":"Signal compression","level":4,"score":0.25040000677108765}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lsp.2014.2345761","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2014.2345761","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1405.6664","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1405.6664","pdf_url":"https://arxiv.org/pdf/1405.6664","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1405.6664","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1405.6664","pdf_url":"https://arxiv.org/pdf/1405.6664","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W143004564","https://openalex.org/W1491318578","https://openalex.org/W1492835675","https://openalex.org/W1550477103","https://openalex.org/W1616556810","https://openalex.org/W1983210177","https://openalex.org/W1985572324","https://openalex.org/W1986931325","https://openalex.org/W1988337847","https://openalex.org/W1994281301","https://openalex.org/W2028781966","https://openalex.org/W2069390315","https://openalex.org/W2075779886","https://openalex.org/W2099321050","https://openalex.org/W2114083954","https://openalex.org/W2115429828","https://openalex.org/W2127114523","https://openalex.org/W2128659236","https://openalex.org/W2142940228","https://openalex.org/W2151417896","https://openalex.org/W2152061189","https://openalex.org/W2153663612","https://openalex.org/W2155981690","https://openalex.org/W2160547390","https://openalex.org/W2951429494","https://openalex.org/W3144422206","https://openalex.org/W4250955649","https://openalex.org/W4293860921","https://openalex.org/W6675992869","https://openalex.org/W6676454372","https://openalex.org/W6676727762","https://openalex.org/W6682009426","https://openalex.org/W6682411926","https://openalex.org/W6684954309"],"related_works":[],"abstract_inverted_index":{"The":[0],"efficient":[1],"sparse":[2,47,69,175],"coding":[3],"and":[4,148],"reconstruction":[5],"of":[6,17,29,40,54,83,93,111,130,138],"signal":[7,42,59],"vectors":[8],"via":[9],"linear":[10],"observations":[11],"has":[12,49],"received":[13],"a":[14,30,104,108,152,168],"tremendous":[15],"amount":[16],"attention":[18],"over":[19],"the":[20,26,81,132,139,158,163,173],"last":[21],"decade.":[22],"In":[23,96],"this":[24,97],"context,":[25],"automated":[27],"learning":[28,65,85,103,155],"suitable":[31],"basis":[32],"or":[33],"overcomplete":[34],"dictionary":[35,64,84,105,154],"from":[36,178],"training":[37,112],"data":[38],"sets":[39],"certain":[41],"classes":[43],"for":[44,151,172],"use":[45],"in":[46,72],"representations":[48],"turned":[50],"out":[51],"to":[52,134],"be":[53,115],"particular":[55],"importance":[56],"regarding":[57],"practical":[58],"processing":[60],"applications.":[61],"Most":[62],"popular":[63],"algorithms":[66],"involve":[67],"NP-hard":[68],"recovery":[70,176],"problems":[71],"each":[73],"iteration,":[74],"which":[75,107],"may":[76],"give":[77,145],"some":[78],"indication":[79],"about":[80],"complexity":[82],"but":[86],"does":[87],"not":[88],"constitute":[89],"an":[90],"actual":[91],"proof":[92],"computational":[94],"intractability.":[95],"technical":[98],"note,":[99],"we":[100,126,144,165],"show":[101],"that":[102],"with":[106],"given":[109],"set":[110],"signals":[113],"can":[114],"represented":[116],"as":[117,119],"sparsely":[118],"possible":[120],"is":[121],"indeed":[122],"\\ssb":[123,146],"NP-hard.":[124],"Moreover,":[125],"also":[127,166],"establish":[128],"hardness":[129],"approximating":[131],"solution":[133],"within":[135],"large":[136],"factors":[137],"optimal":[140],"sparsity":[141],"level.":[142],"Furthermore,":[143],"NP-hardness":[147],"non-approximability":[149,170],"results":[150],"recent":[153],"variation":[156],"called":[157],"sensor":[159],"permutation":[160],"problem.":[161],"Along":[162],"way,":[164],"obtain":[167],"new":[169],"result":[171],"classical":[174],"problem":[177],"compressed":[179],"sensing.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":6}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2016-06-24T00:00:00"}