{"id":"https://openalex.org/W4288389001","doi":"https://doi.org/10.1109/jcsse54890.2022.9836288","title":"Memory-Efficient Adjoints via Graph Partitioning","display_name":"Memory-Efficient Adjoints via Graph Partitioning","publication_year":2022,"publication_date":"2022-06-22","ids":{"openalex":"https://openalex.org/W4288389001","doi":"https://doi.org/10.1109/jcsse54890.2022.9836288"},"language":"en","primary_location":{"id":"doi:10.1109/jcsse54890.2022.9836288","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jcsse54890.2022.9836288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 19th International Joint Conference on Computer Science and Software Engineering (JCSSE)","raw_type":"proceedings-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/A5020761435","display_name":"Ekkapot Charoenwanit","orcid":"https://orcid.org/0009-0004-9362-2518"},"institutions":[{"id":"https://openalex.org/I82828225","display_name":"King Mongkut's University of Technology North Bangkok","ror":"https://ror.org/04fy6jb97","country_code":"TH","type":"education","lineage":["https://openalex.org/I82828225"]}],"countries":["TH"],"is_corresponding":true,"raw_author_name":"Ekkapot Charoenwanit","raw_affiliation_strings":["King Mongkut&#x0027;s University of Technology North Bangkok,Bangkok,Thailand"],"affiliations":[{"raw_affiliation_string":"King Mongkut&#x0027;s University of Technology North Bangkok,Bangkok,Thailand","institution_ids":["https://openalex.org/I82828225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020761435"],"corresponding_institution_ids":["https://openalex.org/I82828225"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10408964,"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":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9983000159263611,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9983000159263611,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.838714599609375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6607983112335205},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.596859335899353},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5388182997703552},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4591618776321411},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3506094217300415},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3430179953575134}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.838714599609375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6607983112335205},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.596859335899353},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5388182997703552},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4591618776321411},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3506094217300415},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3430179953575134}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jcsse54890.2022.9836288","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jcsse54890.2022.9836288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 19th International Joint Conference on Computer Science and Software Engineering (JCSSE)","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":4,"referenced_works":["https://openalex.org/W1967134278","https://openalex.org/W1984176077","https://openalex.org/W2045126306","https://openalex.org/W2478429860"],"related_works":["https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W4247536566","https://openalex.org/W4241418540","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W1508895727","https://openalex.org/W1524101012","https://openalex.org/W1604988569","https://openalex.org/W2477549100"],"abstract_inverted_index":{"Derivative":[0],"information":[1],"plays":[2],"a":[3,15,145,191,216],"crucial":[4],"role":[5],"in":[6,14,79,98,139,169,212],"the":[7,42,57,66,89,92,108,112,119,127,151,161,184,196,200,229,234,244],"correctness":[8],"and":[9,29],"performance":[10],"of":[11,18,35,44,46,59,68,91,104,111,121,130,163,199,236],"scientific":[12,19],"computing":[13],"wide":[16],"variety":[17],"domains":[20],"such":[21],"as":[22,76,231],"computational":[23,128,197],"fluid":[24],"dynamics":[25],"(CFD),":[26],"finance":[27],"engineering":[28],"so":[30],"on.":[31],"The":[32,101],"reverse":[33,102],"mode":[34,103],"Algorithmic":[36],"Differentiation":[37],"is":[38,87],"particularly":[39],"efficient":[40],"for":[41,156,182],"computation":[43],"derivatives":[45],"multivariate":[47],"vector":[48],"functions":[49,78],"<tex":[50,61,70,131,202],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[51,62,71,132,203],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$F:":[52],"R^{n}\\mapsto":[53],"R^{m}$</tex>":[54],",":[55,73],"where":[56,160],"number":[58,67],"inputs":[60],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[63],"far":[64],"exceeds":[65],"outputs":[69],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m$</tex>":[72],"frequently":[74],"appearing":[75],"cost":[77],"numerical":[80,158],"optimization":[81],"kernels.":[82],"In":[83,171],"particular,":[84],"reverse-mode":[85],"AD":[86,105],"at":[88,205],"heart":[90],"back":[93],"propagation":[94],"algorithm":[95,177],"widely":[96],"used":[97],"machine":[99],"learning.":[100],"requires":[106],"that":[107,118],"control":[109],"flow":[110],"derivative":[113,222],"program":[114],"be":[115,136],"reversed,":[116],"meaning":[117],"results":[120,162],"intermediate":[122,164],"computations":[123,165],"(in":[124],"our":[125],"case,":[126],"graph":[129,198],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$F$</tex>":[133,204],")":[134],"must":[135],"stored":[137],"either":[138],"memory":[140,152,185],"or":[141],"secondary":[142],"storage.":[143],"As":[144],"result,":[146],"this":[147,172],"requirement":[148],"leads":[149],"to":[150,195,214,228,233,243],"wall":[153,186],"problem,":[154],"especially":[155],"large-scale":[157],"problems,":[159],"cannot":[166],"fit":[167],"entirely":[168],"memory.":[170],"paper,":[173],"we":[174],"present":[175],"an":[176],"called":[178],"Memory-Efficient":[179],"Adjoints":[180],"(ME-Adjoints)":[181],"solving":[183],"problem":[187],"by":[188],"dynamically":[189],"applying":[190],"simple":[192],"partitioning":[193],"scheme":[194],"function":[201],"runtime.":[206],"Our":[207],"approach":[208],"employs":[209],"operator":[210],"overloading":[211],"C++":[213],"achieve":[215],"fully":[217],"automatic":[218],"adjoining":[219],"process,":[220],"whereby":[221],"programs":[223],"require":[224,240],"only":[225],"trivial":[226],"changes":[227,242],"code":[230],"opposed":[232],"use":[235],"checkpointing":[237],"techniques,":[238],"which":[239],"substantial":[241],"code.":[245]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}