{"id":"https://openalex.org/W7126171128","doi":"https://doi.org/10.48550/arxiv.2601.21775","title":"Differentiable Knapsack and Top-k Operators via Dynamic Programming","display_name":"Differentiable Knapsack and Top-k Operators via Dynamic Programming","publication_year":2026,"publication_date":"2026-01-29","ids":{"openalex":"https://openalex.org/W7126171128","doi":"https://doi.org/10.48550/arxiv.2601.21775"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2601.21775","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5098937254","display_name":"Germain Vivier--Ardisson","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vivier-Ardisson, Germain","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090284871","display_name":"Michael E. Sander","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sander, Micha\u00ebl E.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016280438","display_name":"Axel Parmentier","orcid":"https://orcid.org/0000-0003-1762-4947"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Parmentier, Axel","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Blondel, Mathieu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Blondel, Mathieu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5098937254"],"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.6901000142097473,"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.6901000142097473,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.04450000077486038,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.02759999968111515,"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/knapsack-problem","display_name":"Knapsack problem","score":0.7229999899864197},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5863000154495239},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4871000051498413},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.4657000005245209},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.4507000148296356},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4406999945640564},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.43689998984336853},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.4311999976634979}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7229999899864197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5907999873161316},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5863000154495239},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.58160001039505},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4871000051498413},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.4657000005245209},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.4507000148296356},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4406999945640564},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.43689998984336853},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.4311999976634979},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.41449999809265137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3714999854564667},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.36160001158714294},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.34619998931884766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3264999985694885},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.3212999999523163},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.30570000410079956},{"id":"https://openalex.org/C118365987","wikidata":"https://www.wikidata.org/wiki/Q273328","display_name":"Integration by parts","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.27649998664855957},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2671000063419342}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2601.21775","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2601.21775","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.21775","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2601.21775","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.7277346849441528,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Knapsack":[0],"and":[1,46,67,71,95,121],"Top-k":[2],"operators":[3,42],"are":[4,22,28],"useful":[5],"for":[6,74],"selecting":[7],"discrete":[8,125],"subsets":[9],"of":[10,124],"variables.":[11],"However,":[12],"their":[13],"integration":[14],"into":[15],"neural":[16],"networks":[17],"is":[18,87],"challenging":[19],"as":[20,43],"they":[21],"piecewise":[23],"constant,":[24],"yielding":[25,92],"gradients":[26],"that":[27,84],"zero":[29],"almost":[30],"everywhere.":[31],"In":[32],"this":[33],"paper,":[34],"we":[35,59,82,106],"propose":[36],"a":[37,111,115],"unified":[38],"framework":[39,109],"casting":[40],"these":[41],"dynamic":[44,117],"programs,":[45],"derive":[47],"differentiable":[48],"relaxations":[49],"by":[50],"smoothing":[51],"the":[52,56,75,79,88,103],"underlying":[53],"recursions.":[54],"On":[55,78],"algorithmic":[57],"side,":[58,81,105],"develop":[60],"efficient":[61],"parallel":[62],"algorithms":[63],"supporting":[64],"both":[65],"deterministic":[66],"stochastic":[68],"forward":[69],"passes,":[70],"vector-Jacobian":[72],"products":[73],"backward":[76],"pass.":[77],"theoretical":[80],"prove":[83],"Shannon":[85],"entropy":[86],"unique":[89],"regularization":[90],"choice":[91],"permutation-equivariant":[93],"operators,":[94],"characterize":[96],"regularizers":[97],"inducing":[98],"sparse":[99],"selections.":[100],"Finally,":[101],"on":[102,110],"experimental":[104],"demonstrate":[107],"our":[108],"decision-focused":[112],"learning":[113],"benchmark,":[114],"constrained":[116],"assortment":[118],"RL":[119],"problem,":[120],"an":[122],"extension":[123],"VAEs.":[126]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-01T00:00:00"}