{"id":"https://openalex.org/W2752394239","doi":"https://doi.org/10.1109/ita.2017.8023450","title":"Generalized Hessian approximations via Stein's lemma for constrained minimization","display_name":"Generalized Hessian approximations via Stein's lemma for constrained minimization","publication_year":2017,"publication_date":"2017-02-01","ids":{"openalex":"https://openalex.org/W2752394239","doi":"https://doi.org/10.1109/ita.2017.8023450","mag":"2752394239"},"language":"en","primary_location":{"id":"doi:10.1109/ita.2017.8023450","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2017.8023450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Information Theory and Applications Workshop (ITA)","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/A5022491830","display_name":"Murat A. Erdogdu","orcid":"https://orcid.org/0000-0002-4271-8921"},"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":true,"raw_author_name":"Murat A. Erdogdu","raw_affiliation_strings":["Department of Statistics, Stanford University, CA 94305, USA","Department of Statistics, Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics, Stanford University, CA 94305, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Statistics, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022491830"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18311426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8049991130828857},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.6244997382164001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6007177829742432},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5715295672416687},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5287132859230042},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5175989866256714},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.49816370010375977},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4747486710548401},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4682791233062744},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4643338918685913},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.45883244276046753},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4412572681903839},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4343096911907196},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4025164246559143},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.295281320810318},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.28872066736221313},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.15240031480789185}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.8049991130828857},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6244997382164001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6007177829742432},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5715295672416687},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5287132859230042},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5175989866256714},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.49816370010375977},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4747486710548401},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4682791233062744},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4643338918685913},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.45883244276046753},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4412572681903839},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4343096911907196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4025164246559143},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.295281320810318},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.28872066736221313},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.15240031480789185},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ita.2017.8023450","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2017.8023450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Information Theory and Applications Workshop (ITA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W196761320","https://openalex.org/W221278985","https://openalex.org/W1492528531","https://openalex.org/W1554663460","https://openalex.org/W1556219185","https://openalex.org/W1598497354","https://openalex.org/W1707676469","https://openalex.org/W1915957564","https://openalex.org/W1964840769","https://openalex.org/W1970789124","https://openalex.org/W1991083751","https://openalex.org/W2015627422","https://openalex.org/W2018850201","https://openalex.org/W2032916024","https://openalex.org/W2054640142","https://openalex.org/W2062294426","https://openalex.org/W2094644779","https://openalex.org/W2097428361","https://openalex.org/W2101557761","https://openalex.org/W2118901394","https://openalex.org/W2124541940","https://openalex.org/W2126166357","https://openalex.org/W2129606454","https://openalex.org/W2131172946","https://openalex.org/W2141996170","https://openalex.org/W2164273299","https://openalex.org/W2183305617","https://openalex.org/W2293249015","https://openalex.org/W2295465721","https://openalex.org/W2296319761","https://openalex.org/W2316564661","https://openalex.org/W2394967154","https://openalex.org/W2551586060","https://openalex.org/W2951282416","https://openalex.org/W2963050127","https://openalex.org/W2963060476","https://openalex.org/W2963278901","https://openalex.org/W2963483271","https://openalex.org/W2963865165","https://openalex.org/W2963891150","https://openalex.org/W2964140893","https://openalex.org/W2965497096","https://openalex.org/W2969945254","https://openalex.org/W3099188570","https://openalex.org/W3120740533","https://openalex.org/W3141595720","https://openalex.org/W4238202755","https://openalex.org/W4250589301","https://openalex.org/W4255230573","https://openalex.org/W4293652906","https://openalex.org/W4294629963","https://openalex.org/W4388297464","https://openalex.org/W6608133726","https://openalex.org/W6608805005","https://openalex.org/W6640256981","https://openalex.org/W6675234955","https://openalex.org/W6678474271","https://openalex.org/W6685825971","https://openalex.org/W6696081829","https://openalex.org/W6729685777","https://openalex.org/W6766816269"],"related_works":["https://openalex.org/W2611031068","https://openalex.org/W1704347466","https://openalex.org/W4283017538","https://openalex.org/W1996936972","https://openalex.org/W1545275724","https://openalex.org/W2802707792","https://openalex.org/W2075777916","https://openalex.org/W3021699548","https://openalex.org/W2355987247","https://openalex.org/W4297883503"],"abstract_inverted_index":{"We":[0,25,79,128],"consider":[1],"the":[2,15,18,33,45,62,66,70,76,112],"problem":[3],"of":[4,8,11,73],"convex":[5],"constrained":[6,113],"minimization":[7],"an":[9],"average":[10],"n":[12],"functions,":[13],"where":[14,32,87],"parameter":[16],"and":[17,42,100,125,140],"features":[19],"are":[20],"related":[21],"through":[22,132],"inner":[23],"products.":[24],"focus":[26],"on":[27,83,137],"second":[28],"order":[29,72],"batch":[30],"updates,":[31],"curvature":[34],"matrix":[35],"is":[36,90,122],"obtained":[37],"by":[38,43,143],"assuming":[39],"random":[40],"design":[41],"applying":[44],"celebrated":[46],"Stein's":[47,88],"lemma":[48,89],"together":[49],"with":[50],"subsampling":[51],"techniques.":[52],"The":[53],"proposed":[54],"algorithm":[55,115],"enjoys":[56],"fast":[57],"convergence":[58,119],"rates":[59],"similar":[60],"to":[61,146],"Newton":[63],"method,":[64],"yet":[65],"per-iteration":[67],"cost":[68],"has":[69],"same":[71],"magnitude":[74],"as":[75,95],"gradient":[77],"descent.":[78],"demonstrate":[80],"its":[81,130],"performance":[82,131],"well-known":[84],"optimization":[85,114,135,148],"problems":[86],"not":[91],"directly":[92],"applicable,":[93],"such":[94],"M-estimation":[96],"for":[97],"robust":[98],"statistics,":[99],"inequality":[101],"form":[102],"linear/quadratic":[103],"programming":[104],"etc.":[105],"Under":[106],"certain":[107],"assumptions,":[108],"we":[109],"show":[110],"that":[111,121],"attains":[116],"a":[117],"composite":[118],"rate":[120],"initially":[123],"quadratic":[124],"asymptotically":[126],"linear.":[127],"validate":[129],"widely":[133],"encountered":[134],"tasks":[136],"several":[138],"real":[139],"synthetic":[141],"datasets":[142],"comparing":[144],"it":[145],"classical":[147],"algorithms.":[149]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}