{"id":"https://openalex.org/W1985808834","doi":"https://doi.org/10.1109/jstsp.2011.2149496","title":"Robust and Fast Learning of Sparse Codes With Stochastic Gradient Descent","display_name":"Robust and Fast Learning of Sparse Codes With Stochastic Gradient Descent","publication_year":2011,"publication_date":"2011-05-03","ids":{"openalex":"https://openalex.org/W1985808834","doi":"https://doi.org/10.1109/jstsp.2011.2149496","mag":"1985808834"},"language":"en","primary_location":{"id":"doi:10.1109/jstsp.2011.2149496","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jstsp.2011.2149496","pdf_url":null,"source":{"id":"https://openalex.org/S42167783","display_name":"IEEE Journal of Selected Topics in Signal Processing","issn_l":"1932-4553","issn":["1932-4553","1941-0484"],"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 Journal of Selected Topics in Signal Processing","raw_type":"journal-article"},"type":"article","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/A5087265660","display_name":"Kai Labusch","orcid":null},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kai Labusch","raw_affiliation_strings":["Institute for Neuro-and Bioinformatics, University of L\u00fcbeck, Lubeck, Germany","Inst. for Neuro-& Bioinf., Univ. of Lubeck, Lu\u0308beck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Neuro-and Bioinformatics, University of L\u00fcbeck, Lubeck, Germany","institution_ids":["https://openalex.org/I9341345"]},{"raw_affiliation_string":"Inst. for Neuro-& Bioinf., Univ. of Lubeck, Lu\u0308beck, Germany","institution_ids":["https://openalex.org/I9341345"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021756032","display_name":"Erhardt Barth","orcid":"https://orcid.org/0000-0001-8556-2472"},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Erhardt Barth","raw_affiliation_strings":["Institute for Neuro-and Bioinformatics, University of L\u00fcbeck, Lubeck, Germany","Inst. for Neuro-& Bioinf., Univ. of Lubeck, Lu\u0308beck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Neuro-and Bioinformatics, University of L\u00fcbeck, Lubeck, Germany","institution_ids":["https://openalex.org/I9341345"]},{"raw_affiliation_string":"Inst. for Neuro-& Bioinf., Univ. of Lubeck, Lu\u0308beck, Germany","institution_ids":["https://openalex.org/I9341345"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014856404","display_name":"Thomas Martinetz","orcid":"https://orcid.org/0000-0002-4539-4475"},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Martinetz","raw_affiliation_strings":["Institute for Neuro-and Bioinformatics, University of L\u00fcbeck, Lubeck, Germany","Inst. for Neuro-& Bioinf., Univ. of Lubeck, Lu\u0308beck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Neuro-and Bioinformatics, University of L\u00fcbeck, Lubeck, Germany","institution_ids":["https://openalex.org/I9341345"]},{"raw_affiliation_string":"Inst. for Neuro-& Bioinf., Univ. of Lubeck, Lu\u0308beck, Germany","institution_ids":["https://openalex.org/I9341345"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I9341345"],"apc_list":null,"apc_paid":null,"fwci":1.5693,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.81277313,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"5","issue":"5","first_page":"1048","last_page":"1060"},"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/gradient-descent","display_name":"Gradient descent","score":0.6593410968780518},{"id":"https://openalex.org/keywords/matching-pursuit","display_name":"Matching pursuit","score":0.6234256625175476},{"id":"https://openalex.org/keywords/neural-coding","display_name":"Neural coding","score":0.6085781455039978},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5520376563072205},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5456297397613525},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.5164242386817932},{"id":"https://openalex.org/keywords/k-svd","display_name":"K-SVD","score":0.50038743019104},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.4993855953216553},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4968762695789337},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.4479203522205353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41345012187957764},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.404153048992157},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.356240838766098},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.2760929763317108}],"concepts":[{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6593410968780518},{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.6234256625175476},{"id":"https://openalex.org/C77637269","wikidata":"https://www.wikidata.org/wiki/Q7002051","display_name":"Neural coding","level":2,"score":0.6085781455039978},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5520376563072205},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5456297397613525},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.5164242386817932},{"id":"https://openalex.org/C154771677","wikidata":"https://www.wikidata.org/wiki/Q17098361","display_name":"K-SVD","level":3,"score":0.50038743019104},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.4993855953216553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4968762695789337},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4479203522205353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41345012187957764},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.404153048992157},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.356240838766098},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.2760929763317108},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jstsp.2011.2149496","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jstsp.2011.2149496","pdf_url":null,"source":{"id":"https://openalex.org/S42167783","display_name":"IEEE Journal of Selected Topics in Signal Processing","issn_l":"1932-4553","issn":["1932-4553","1941-0484"],"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 Journal of Selected Topics in Signal Processing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.7799999713897705,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W56456207","https://openalex.org/W1976709621","https://openalex.org/W2021302824","https://openalex.org/W2065829287","https://openalex.org/W2078204800","https://openalex.org/W2097323375","https://openalex.org/W2099641086","https://openalex.org/W2115429828","https://openalex.org/W2116148865","https://openalex.org/W2123441153","https://openalex.org/W2128659236","https://openalex.org/W2129131372","https://openalex.org/W2136235822","https://openalex.org/W2145889472","https://openalex.org/W2149270675","https://openalex.org/W2151693816","https://openalex.org/W2154332973","https://openalex.org/W2160547390","https://openalex.org/W2164452299","https://openalex.org/W2166322089","https://openalex.org/W2167839759"],"related_works":["https://openalex.org/W2011611369","https://openalex.org/W4245251483","https://openalex.org/W4254934694","https://openalex.org/W2160547390","https://openalex.org/W2113038107","https://openalex.org/W2016265625","https://openalex.org/W2965458591","https://openalex.org/W2111634407","https://openalex.org/W2552089492","https://openalex.org/W4205656132"],"abstract_inverted_index":{"Particular":[0],"classes":[1],"of":[2,54,73,89,96,104,118,129,138,151,157,187,202],"signals,":[3],"as":[4,101,135,137],"for":[5,172,199],"example":[6],"natural":[7],"images,":[8],"can":[9,162],"be":[10,163],"encoded":[11],"sparsely":[12],"if":[13],"appropriate":[14],"dictionaries":[15,20,49,196,213],"are":[16,82,197],"used.":[17],"Finding":[18],"such":[19],"based":[21,178],"on":[22,179],"data":[23,80,182],"samples,":[24],"however,":[25],"is":[26,35,64,99,110,146,176,208],"a":[27,86,154],"difficult":[28,69],"optimization":[29],"task.":[30],"In":[31,190],"this":[32],"paper,":[33],"it":[34,109,113,145],"shown":[36,111,147],"that":[37,112,210,222],"simple":[38],"stochastic":[39],"gradient":[40,133],"descent,":[41],"besides":[42],"being":[43],"much":[44],"faster,":[45],"leads":[46],"to":[47,51,165,217],"superior":[48,226],"compared":[50],"the":[52,59,68,79,93,119,127,130,139,149,158,184,191,211,218],"Method":[53],"Optimal":[55],"Directions":[56],"(MOD)":[57],"and":[58,108,141,153,183,204,221],"K-SVD":[60,142],"algorithm.":[61],"The":[62],"gain":[63],"most":[65],"significant":[66],"in":[67],"but":[70],"relevant":[71],"case":[72],"highly":[74],"overlapping":[75],"subspaces,":[76],"i.e.,":[77],"when":[78],"samples":[81],"jointly":[83],"represented":[84],"by":[85],"restricted":[87],"set":[88],"dictionary":[90],"elements.":[91],"Moreover,":[92],"so-called":[94],"Bag":[95,150],"Pursuits":[97,152],"method":[98,171],"introduced":[100],"an":[102,115,167],"extension":[103],"Orthogonal":[105],"Matching":[106],"Pursuit,":[107],"provides":[114],"improved":[116],"approximation":[117],"optimal":[120],"sparse":[121,173],"coefficients":[122],"and,":[123],"therefore,":[124],"significantly":[125],"improves":[126],"performance":[128],"here":[131],"proposed":[132],"descent":[134],"well":[136],"MOD":[140],"approaches.":[143],"Finally,":[144],"how":[148],"generalized":[155],"version":[156],"Neural":[159],"Gas":[160],"algorithm":[161],"used":[164],"derive":[166],"even":[168],"more":[169],"powerful":[170],"coding.":[174],"Performance":[175],"analyzed":[177],"both":[180],"synthetic":[181],"practical":[185],"problem":[186],"image":[188,219],"deconvolution.":[189],"latter":[192],"case,":[193],"two":[194],"different":[195],"learned":[198,212],"sample":[200],"images":[201],"buildings":[203],"flowers,":[205],"respectively.":[206],"It":[207],"demonstrated":[209],"do":[214],"indeed":[215],"adapt":[216],"class":[220],"they":[223],"therefore":[224],"yield":[225],"reconstruction":[227],"results.":[228]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}