{"id":"https://openalex.org/W2096725512","doi":null,"title":"Nearest Neighbor based Greedy Coordinate Descent","display_name":"Nearest Neighbor based Greedy Coordinate Descent","publication_year":2011,"publication_date":"2011-12-12","ids":{"openalex":"https://openalex.org/W2096725512","mag":"2096725512"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.3972","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.3972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/users/inderjit/public_papers/nn_greedy_nips11.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5063459703","display_name":"Inderjit S. Dhillon","orcid":"https://orcid.org/0000-0002-2759-1416","observed_orcids":["https://orcid.org/0000-0002-2759-1416"]},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Inderjit S. Dhillon","raw_affiliation_strings":["Dept. of Computer Science, University of Texas at Austin#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-2759-1416","affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053209283","display_name":"Pradeep Ravikumar","orcid":"https://orcid.org/0000-0001-5635-5765","observed_orcids":["https://orcid.org/0000-0001-5635-5765"]},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pradeep Ravikumar","raw_affiliation_strings":["Dept. of Computer Science, University of Texas at Austin#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-5635-5765","affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051918150","display_name":"Ambuj Tewari","orcid":"https://orcid.org/0000-0001-6969-7844","observed_orcids":["https://orcid.org/0000-0001-6969-7844"]},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ambuj Tewari","raw_affiliation_strings":["Dept. of Computer Science, University of Texas at Austin#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-6969-7844","affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":2.1009,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.88813219,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"24","issue":null,"first_page":"2160","last_page":"2168"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9970999956130981,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9970999956130981,"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/T10136","display_name":"Statistical Methods and Inference","score":0.0007999999797903001,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.000699999975040555,"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/nearest-neighbor-search","display_name":"nearest neighbor search","score":0.9919999837875366},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"locality-sensitive hashing","score":0.847000002861023},{"id":"https://openalex.org/keywords/sparse-optimization","display_name":"sparse optimization","score":0.7580000162124634},{"id":"https://openalex.org/keywords/nonsmooth-optimization","display_name":"nonsmooth optimization","score":0.8180000185966492},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6460000276565552},{"id":"https://openalex.org/keywords/first-order-methods","display_name":"first-order methods","score":0.7990000247955322}],"concepts":[{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.7761490345001221},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7573195099830627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6459731459617615},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5504197478294373},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.5378581285476685},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5369994044303894},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.5134297609329224},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5116596221923828},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.47638505697250366},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.47479715943336487},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4158020317554474},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.3957306146621704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33584314584732056},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3310680091381073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31196045875549316},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.1755274534225464},{"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/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.3972","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.3972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/users/inderjit/public_papers/nn_greedy_nips11.pdf","raw_type":"text"},{"id":"mag:2096725512","doi":null,"is_oa":false,"landing_page_url":"http://dept.stat.lsa.umich.edu/~tewaria/research/dhillon11nearest.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Neural Information Processing Systems","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W16591383","https://openalex.org/W403935824","https://openalex.org/W1969048569","https://openalex.org/W1974524469","https://openalex.org/W2007273639","https://openalex.org/W2039050532","https://openalex.org/W2056636001","https://openalex.org/W2071866949","https://openalex.org/W2072265605","https://openalex.org/W2093813380","https://openalex.org/W2115706991","https://openalex.org/W2127300249","https://openalex.org/W2147656689","https://openalex.org/W2147717514","https://openalex.org/W2152402969","https://openalex.org/W2166183437","https://openalex.org/W2798766386","https://openalex.org/W2976223356","https://openalex.org/W3105543546","https://openalex.org/W4294541781"],"related_works":["https://openalex.org/W2896769428","https://openalex.org/W7099552854","https://openalex.org/W3119239468","https://openalex.org/W2963818748","https://openalex.org/W2950517004","https://openalex.org/W3183593932","https://openalex.org/W2806297429","https://openalex.org/W3037853175","https://openalex.org/W2748472879","https://openalex.org/W2185160770"],"abstract_inverted_index":{"Increasingly,":[0],"optimization":[1,231],"problems":[2],"in":[3,62],"machine":[4],"learning,":[5],"especially":[6],"those":[7],"arising":[8],"from":[9],"high-dimensional":[10],"statistical":[11,20,28],"estimation,":[12],"have":[13,27],"a":[14,116,127,136,159],"large":[15],"number":[16,38],"of":[17,39,118,140,153,162,209,224],"variables.":[18],"Modern":[19],"estimators":[21],"developed":[22],"over":[23],"the":[24,37,47,87,96,101,105,109,176,189,199,207,222],"past":[25],"decade":[26],"or":[29],"sample":[30],"complexity":[31,65],"that":[32,74,76,94,120,165],"depends":[33],"only":[34,183],"weakly":[35],"on":[36,104],"parameters":[40],"when":[41,198],"there":[42],"is":[43,55,111],"some":[44],"structure":[45],"to":[46,129,185,217],"problem,":[48],"such":[49,77,154],"as":[50,66,147,149],"sparsity.":[51],"A":[52],"central":[53],"question":[54],"whether":[56],"similar":[57],"advances":[58,78],"can":[59,79],"be":[60,81],"made":[61],"their":[63],"computational":[64,225],"well.":[67],"In":[68,83],"this":[69],"paper,":[70],"we":[71,85,180],"propose":[72,115],"strategies":[73],"indicate":[75,206],"indeed":[80],"made.":[82],"particular,":[84],"investigate":[86],"greedy":[88,97,123,141,155,167,191],"coordinate":[89,168],"descent":[90,142,169,197],"algorithm,":[91],"and":[92,214],"note":[93],"performing":[95],"step":[98],"efficiently":[99,125],"weakens":[100],"costly":[102],"dependence":[103],"problem":[106,200],"size":[107,201],"provided":[108],"solution":[110],"sparse.":[112],"We":[113,133,157],"then":[114],"suite":[117],"methods":[119],"perform":[121],"these":[122],"steps":[124],"by":[126],"reduction":[128],"nearest":[130,211],"neighbor":[131,212],"search.":[132],"also":[134,194,215],"devise":[135],"more":[137],"amenable":[138],"form":[139],"for":[143],"composite":[144],"non-smooth":[145],"objectives;":[146],"well":[148],"several":[150],"approximate":[151],"variants":[152],"descent.":[156],"develop":[158],"practical":[160],"implementation":[161],"our":[163,210],"algorithm":[164],"combines":[166],"with":[170],"locality":[171],"sensitive":[172],"hashing.":[173],"Without":[174],"tuning":[175],"latter":[177],"data":[178],"structure,":[179],"are":[181],"not":[182],"able":[184],"significantly":[186],"speed":[187],"up":[188],"vanilla":[190],"method,":[192],"but":[193],"outperform":[195],"cyclic":[196],"becomes":[202],"large.":[203],"Our":[204],"results":[205],"effectiveness":[208],"strategies,":[213],"point":[216],"many":[218],"open":[219],"questions":[220],"regarding":[221],"development":[223],"geometric":[226],"techniques":[227],"tailored":[228],"towards":[229],"first-order":[230],"methods.":[232],"1":[233]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}