{"id":"https://openalex.org/W175309908","doi":null,"title":"Anti-differentiating approximation algorithms:A case study with min-cuts, spectral, and flow","display_name":"Anti-differentiating approximation algorithms:A case study with min-cuts, spectral, and flow","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W175309908","mag":"175309908"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.716.2632","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.716.2632","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stat.berkeley.edu/%7Emmahoney/pubs/gleich14-icml14.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/A5084102378","display_name":"David F. Gleich","orcid":"https://orcid.org/0000-0002-8107-6474","observed_orcids":["https://orcid.org/0000-0002-8107-6474"]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David F. Gleich","raw_affiliation_strings":["Computer Science, Purdue University, West Lafayette, IN 47906"],"raw_orcid":"https://orcid.org/0000-0002-8107-6474","affiliations":[{"raw_affiliation_string":"Computer Science, Purdue University, West Lafayette, IN 47906","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033006662","display_name":"Michael W. Mahoney","orcid":"https://orcid.org/0000-0001-7920-4652","observed_orcids":["https://orcid.org/0000-0001-7920-4652"]},"institutions":[{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael W. Mahoney","raw_affiliation_strings":["International Computer Science Institute and Dept. of Statistics, University of California at Berkeley, Berkeley, CA 94720"],"raw_orcid":"https://orcid.org/0000-0001-7920-4652","affiliations":[{"raw_affiliation_string":"International Computer Science Institute and Dept. of Statistics, University of California at Berkeley, Berkeley, CA 94720","institution_ids":["https://openalex.org/I1297971548","https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.256,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.86266047,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1018","last_page":"1025"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9771000146865845,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9771000146865845,"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"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.007499999832361937,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.002199999988079071,"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/approximation-algorithms","display_name":"approximation algorithms","score":0.9419999718666077},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"minimum cut","score":0.7699999809265137},{"id":"https://openalex.org/keywords/personalized-pagerank","display_name":"personalized PageRank","score":0.8420000076293945},{"id":"https://openalex.org/keywords/spectral-partitioning","display_name":"spectral partitioning","score":0.7300000190734863},{"id":"https://openalex.org/keywords/flow-algorithms","display_name":"flow algorithms","score":0.6930000185966492}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7559466361999512},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6649404764175415},{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.5924975872039795},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5241087675094604},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5219897031784058},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.44556087255477905},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39348357915878296},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.361083984375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2596641182899475},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20518887042999268},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.716.2632","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.716.2632","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stat.berkeley.edu/%7Emmahoney/pubs/gleich14-icml14.pdf","raw_type":"text"},{"id":"mag:175309908","doi":null,"is_oa":false,"landing_page_url":"http://proceedings.mlr.press/v32/gleich14.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419644","display_name":"International Conference on Machine Learning","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"International Conference on Machine Learning","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1521333607","https://openalex.org/W1854214752","https://openalex.org/W1906783320","https://openalex.org/W1968307589","https://openalex.org/W1981196578","https://openalex.org/W2015953751","https://openalex.org/W2086254934","https://openalex.org/W2088759008","https://openalex.org/W2090359754","https://openalex.org/W2101278992","https://openalex.org/W2122540157","https://openalex.org/W2135046866","https://openalex.org/W2135957668","https://openalex.org/W2143776582","https://openalex.org/W2146591355","https://openalex.org/W2154455818","https://openalex.org/W2162148078","https://openalex.org/W2271295020","https://openalex.org/W3101676988"],"related_works":["https://openalex.org/W1981519953","https://openalex.org/W7095629850","https://openalex.org/W7099486712","https://openalex.org/W7054807336","https://openalex.org/W7097865730","https://openalex.org/W2763662138","https://openalex.org/W7098325652","https://openalex.org/W2399614914","https://openalex.org/W7098148430","https://openalex.org/W69774245"],"abstract_inverted_index":{"We":[0,62,107,134],"formalize":[1],"and":[2,93,148],"illustrate":[3],"the":[4,89,94,150],"general":[5],"concept":[6,65],"of":[7,51,70,88,152],"algorithmic":[8],"anti-differentiation:":[9],"given":[10],"an":[11,15,44,52,102,119],"algorith-mic":[12],"procedure,":[13],"e.g.,":[14],"approximation":[16,21,71,103,154],"algorithm":[17,114],"for":[18,36,73,100,109,146],"which":[19,37],"worst-case":[20],"guarantees":[22],"are":[23],"available":[24],"or":[25],"a":[26,38,48,67,85,123],"heuristic":[27],"that":[28,55,60,111,125],"has":[29],"been":[30],"engi-neered":[31],"to":[32,104,127],"be":[33,144],"practically-useful":[34],"but":[35,117],"pre-cise":[39],"theoretical":[40],"understanding":[41],"is":[42,47,56],"lacking,":[43],"algo-rithmic":[45],"anti-derivative":[46],"precise":[49],"statement":[50],"optimization":[53,141],"problem":[54],"exactly":[57],"solved":[58],"by":[59],"procedure.":[61],"explore":[63],"this":[64,112],"with":[66],"case":[68],"study":[69],"algorithms":[72,155],"finding":[74],"locally-biased":[75],"partitions":[76],"in":[77,132],"data":[78],"graphs,":[79],"demon-strating":[80],"connections":[81],"between":[82],"min-cut":[83],"objectives,":[84],"personalized":[86,105],"version":[87],"popular":[90],"PageRank":[91],"vector,":[92],"highly":[95],"effective":[96],"\u201cpush":[97],"\u201d":[98],"procedure":[99],"computing":[101],"PageRank.":[106],"show,":[108],"example,":[110],"lat-ter":[113],"solves":[115],"(exactly,":[116],"implicitly)":[118],"`1-regularized":[120],"`2-regression":[121],"problem,":[122],"fact":[124],"helps":[126],"explain":[128],"its":[129],"excellent":[130],"performance":[131,151],"prac-tice.":[133],"expect":[135],"that,":[136],"when":[137],"available,":[138],"these":[139],"im-plicit":[140],"problems":[142],"will":[143],"critical":[145],"rationalizing":[147],"predicting":[149],"many":[153],"on":[156],"realistic":[157],"data.":[158],"1.":[159]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}