{"id":"https://openalex.org/W2940073586","doi":"https://doi.org/10.1109/icassp.2019.8682720","title":"Iterative Hessian Sketch with Momentum","display_name":"Iterative Hessian Sketch with Momentum","publication_year":2019,"publication_date":"2019-04-17","ids":{"openalex":"https://openalex.org/W2940073586","doi":"https://doi.org/10.1109/icassp.2019.8682720","mag":"2940073586"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2019.8682720","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2019.8682720","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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/A5012854172","display_name":"Ibrahim K. Ozaslan","orcid":"https://orcid.org/0000-0001-9974-4998"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ibrahim Kurban Ozaslan","raw_affiliation_strings":["EEE Department, Bilkent University, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EEE Department, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001436196","display_name":"Mert Pilanc\u0131","orcid":"https://orcid.org/0000-0002-0870-9992"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mert Pilanci","raw_affiliation_strings":["EE Department, Stanford University, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EE Department, Stanford University, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065341937","display_name":"Orhan Ar\u0131kan","orcid":"https://orcid.org/0000-0002-3698-8888"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Orhan Arikan","raw_affiliation_strings":["EEE Department, Bilkent University, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EEE Department, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"7470","last_page":"7474"},"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.9995999932289124,"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.9995999932289124,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/hessian-matrix","display_name":"Hessian matrix","score":0.8208468556404114},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7209006547927856},{"id":"https://openalex.org/keywords/sketch","display_name":"Sketch","score":0.6366736888885498},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.6266058087348938},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.5255787968635559},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.48283180594444275},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4764147996902466},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.44972705841064453},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4348664879798889},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41886892914772034},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4166561961174011},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41637760400772095},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34283512830734253},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.1599608063697815},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06686955690383911}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.8208468556404114},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7209006547927856},{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.6366736888885498},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6266058087348938},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.5255787968635559},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.48283180594444275},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4764147996902466},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.44972705841064453},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4348664879798889},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41886892914772034},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4166561961174011},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41637760400772095},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34283512830734253},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.1599608063697815},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06686955690383911},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icassp.2019.8682720","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2019.8682720","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/52875","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/52875","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 44th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W637574335","https://openalex.org/W1575701986","https://openalex.org/W1981220107","https://openalex.org/W1988720110","https://openalex.org/W2007399394","https://openalex.org/W2007500622","https://openalex.org/W2008776938","https://openalex.org/W2033242948","https://openalex.org/W2048305372","https://openalex.org/W2097897435","https://openalex.org/W2100556411","https://openalex.org/W2107599050","https://openalex.org/W2120350343","https://openalex.org/W2131172946","https://openalex.org/W2237587256","https://openalex.org/W2524385150","https://openalex.org/W2773306503","https://openalex.org/W2795485111","https://openalex.org/W2963002486","https://openalex.org/W2963459305","https://openalex.org/W2963903233","https://openalex.org/W2964299664","https://openalex.org/W2965497096","https://openalex.org/W3029645440","https://openalex.org/W4293775970","https://openalex.org/W6679168169","https://openalex.org/W6682597329","https://openalex.org/W6727533652"],"related_works":["https://openalex.org/W4312795749","https://openalex.org/W238360271","https://openalex.org/W2388528661","https://openalex.org/W2796297998","https://openalex.org/W2025314782","https://openalex.org/W1977152816","https://openalex.org/W2132704413","https://openalex.org/W2020937688","https://openalex.org/W2912110980","https://openalex.org/W2365136455"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,115],"novel":[3],"randomized":[4,18,103],"linear":[5],"least":[6],"squares":[7],"solver":[8],"which":[9,125],"is":[10,29,38,71],"an":[11],"improvement":[12],"of":[13,35,48,69,82,100,122],"Iterative":[14],"Hessian":[15],"Sketch":[16],"and":[17,58,111],"preconditioning.":[19],"In":[20],"the":[21,33,52,55,59,63,67,75,79,83,91,98,101,120,128],"proposed":[22,92],"Momentum-IHS":[23],"technique":[24],"(M-IHS),":[25],"Heavy":[26],"Ball":[27],"Method":[28],"used":[30],"to":[31],"accelerate":[32],"convergence":[34,49,70],"iterations.":[36],"It":[37],"shown":[39],"that":[40],"for":[41,130],"any":[42],"full":[43],"rank":[44],"data":[45,84],"matrix,":[46],"rate":[47,68],"depends":[50],"on":[51],"ratio":[53],"between":[54],"feature":[56],"size":[57],"sketch":[60],"size.":[61],"Unlike":[62],"Conjugate":[64],"Gradient":[65],"technique,":[66],"unaffected":[72],"by":[73],"either":[74],"condition":[76],"number":[77],"or":[78,109],"eigenvalue":[80],"spectrum":[81],"matrix.":[85],"As":[86],"demonstrated":[87],"over":[88],"many":[89],"examples,":[90],"M-IHS":[93],"provides":[94,114],"compatible":[95],"performance":[96],"with":[97],"state":[99],"art":[102],"preconditioning":[104],"methods":[105],"such":[106],"as":[107],"LSRN":[108],"Blendenpik":[110],"yet,":[112],"it":[113],"completely":[116],"different":[117],"perspective":[118],"in":[119],"area":[121],"iterative":[123],"solvers":[124],"can":[126],"pave":[127],"way":[129],"future":[131],"developments.":[132]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}