{"id":"https://openalex.org/W7164010429","doi":"https://doi.org/10.48550/arxiv.2606.08797","title":"Scaling Decision-Focused Learning to Large Problems with Lagrangian Decomposition","display_name":"Scaling Decision-Focused Learning to Large Problems with Lagrangian Decomposition","publication_year":2026,"publication_date":"2026-06-07","ids":{"openalex":"https://openalex.org/W7164010429","doi":"https://doi.org/10.48550/arxiv.2606.08797"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.08797","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08797","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.08797","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138211611","display_name":"St\u00e9phane Eilles-Chan Way","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Way, St\u00e9phane Eilles-Chan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138250516","display_name":"Hugo Percot","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Percot, Hugo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065781444","display_name":"Quentin Cappart","orcid":"https://orcid.org/0000-0002-8742-0774"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cappart, Quentin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041230402","display_name":"Tias Guns","orcid":"https://orcid.org/0000-0002-2156-2155"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guns, Tias","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138263351","display_name":"Louis-Martin Rousseau","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rousseau, Louis-Martin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.4562000036239624,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.4562000036239624,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.0949999988079071,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12026","display_name":"Explainable Artificial Intelligence (XAI)","score":0.053599998354911804,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5098000168800354},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.48809999227523804},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.446399986743927},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.38269999623298645},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.3822000026702881},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.36640000343322754},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.3497999906539917},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.3377000093460083},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.32600000500679016}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6258999705314636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5940999984741211},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5098000168800354},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.48809999227523804},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.446399986743927},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3910999894142151},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.38269999623298645},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.3822000026702881},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.36640000343322754},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3497999906539917},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3433000147342682},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30160000920295715},{"id":"https://openalex.org/C50292564","wikidata":"https://www.wikidata.org/wiki/Q2462783","display_name":"Computational learning theory","level":3,"score":0.29269999265670776},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.28459998965263367},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C2780821815","wikidata":"https://www.wikidata.org/wiki/Q5340806","display_name":"Portfolio","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.08797","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08797","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.08797","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08797","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.527484118938446}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Decision-focused":[0],"learning":[1,62,111,157],"has":[2],"shown":[3],"great":[4],"promise":[5],"for":[6,39,76],"addressing":[7],"predict-then-optimize":[8],"problems,":[9],"particularly":[10],"in":[11,173],"the":[12,60,80,129],"presence":[13],"of":[14,89],"under-specified":[15],"models.":[16],"However,":[17],"its":[18],"practical":[19],"deployment":[20],"is":[21,178],"often":[22],"hindered":[23],"by":[24],"high":[25],"computational":[26,97],"costs":[27],"and":[28,78,99,117,133],"limited":[29],"scalability,":[30],"as":[31],"it":[32,152],"requires":[33],"solving":[34],"a":[35,52,67],"constrained":[36],"optimization":[37],"problem":[38,132],"each":[40],"training":[41,79],"instance":[42],"at":[43,180],"every":[44],"iteration.":[45],"To":[46],"address":[47],"these":[48],"challenges,":[49],"we":[50,65,137],"propose":[51,86],"novel":[53],"framework":[54,103],"that":[55,139],"incorporates":[56],"Lagrangian":[57],"decomposition":[58],"into":[59],"decision-focused":[61,110,156],"paradigm.":[63],"Specifically,":[64],"introduce":[66],"new":[68],"surrogate":[69],"objective":[70],"along":[71],"with":[72,108],"two":[73,87,126],"loss":[74],"functions":[75],"evaluating":[77],"underlying":[81],"prediction":[82],"model.":[83],"We":[84],"further":[85],"variants":[88],"our":[90,140],"approach,":[91],"which":[92],"offer":[93],"different":[94],"trade-offs":[95],"between":[96],"efficiency":[98],"solution":[100],"quality.":[101],"Our":[102],"can":[104],"be":[105],"seamlessly":[106],"integrated":[107],"standard":[109,127],"methods,":[112],"including":[113],"Smart":[114],"Predict-then-Optimize":[115],"(SPO+)":[116],"Implicit":[118],"Maximum":[119],"Likelihood":[120],"Estimation":[121],"(IMLE).":[122],"Through":[123],"experiments":[124],"on":[125,159],"benchmarks,":[128],"multi-dimensional":[130],"knapsack":[131],"quadratic":[134],"portfolio":[135],"optimization,":[136],"demonstrate":[138],"approach":[141],"achieves":[142],"competitive":[143],"performance":[144],"while":[145],"remaining":[146],"amenable":[147],"to":[148,164],"parallelization.":[149],"In":[150],"particular,":[151],"consistently":[153],"outperforms":[154],"traditional":[155],"methods":[158],"large-scale":[160],"instances,":[161],"involving":[162],"up":[163],"eight":[165],"times":[166],"more":[167],"variables":[168],"than":[169],"those":[170],"typically":[171],"considered":[172],"related":[174],"work.":[175],"The":[176],"implementation":[177],"available":[179],"https://github.com/corail-research/DFL-LD.":[181]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-10T00:00:00"}