{"id":"https://openalex.org/W7133357003","doi":"https://doi.org/10.48550/arxiv.2603.01591","title":"FAST-DIPS: Adjoint-Free Analytic Steps and Hard-Constrained Likelihood Correction for Diffusion-Prior Inverse Problems","display_name":"FAST-DIPS: Adjoint-Free Analytic Steps and Hard-Constrained Likelihood Correction for Diffusion-Prior Inverse Problems","publication_year":2026,"publication_date":"2026-03-02","ids":{"openalex":"https://openalex.org/W7133357003","doi":"https://doi.org/10.48550/arxiv.2603.01591"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.01591","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01591","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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.01591","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5127887490","display_name":"Minwoo Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kim, Minwoo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5127983601","display_name":"Seunghyeok Shin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shin, Seunghyeok","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5019802439","display_name":"Hongki Lim","orcid":"https://orcid.org/0000-0002-2764-3730"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lim, Hongki","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5127887490"],"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/T11206","display_name":"Model Reduction and Neural Networks","score":0.16050000488758087,"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"}},"topics":[{"id":"https://openalex.org/T11206","display_name":"Model Reduction and Neural Networks","score":0.16050000488758087,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.13359999656677246,"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/T10775","display_name":"Generative Adversarial Networks and Image Synthesis","score":0.12960000336170197,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/backtracking","display_name":"Backtracking","score":0.6212000250816345},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.6115999817848206},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5771999955177307},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.515500009059906},{"id":"https://openalex.org/keywords/prior-probability","display_name":"Prior probability","score":0.46399998664855957},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.4489000141620636},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.4390999972820282},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.42570000886917114},{"id":"https://openalex.org/keywords/inverse-problem","display_name":"Inverse problem","score":0.4244999885559082},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.39329999685287476}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6212000250816345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6200000047683716},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.6115999817848206},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5771999955177307},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.515500009059906},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5130000114440918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5044999718666077},{"id":"https://openalex.org/C177769412","wikidata":"https://www.wikidata.org/wiki/Q278090","display_name":"Prior probability","level":3,"score":0.46399998664855957},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.4489000141620636},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.4390999972820282},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.42570000886917114},{"id":"https://openalex.org/C135252773","wikidata":"https://www.wikidata.org/wiki/Q1567213","display_name":"Inverse problem","level":2,"score":0.4244999885559082},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4169999957084656},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.39329999685287476},{"id":"https://openalex.org/C205203396","wikidata":"https://www.wikidata.org/wiki/Q612143","display_name":"Bilinear interpolation","level":2,"score":0.39079999923706055},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.36410000920295715},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.35339999198913574},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.3529999852180481},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.32820001244544983},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.326200008392334},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3140999972820282},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3021000027656555},{"id":"https://openalex.org/C4199805","wikidata":"https://www.wikidata.org/wiki/Q2725903","display_name":"Gaussian noise","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.2815000116825104},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.26930001378059387},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C58716799","wikidata":"https://www.wikidata.org/wiki/Q6035648","display_name":"Inner loop","level":3,"score":0.2630000114440918},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.257999986410141}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.01591","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01591","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.01591","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01591","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":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Training-free":[0],"diffusion":[1],"priors":[2],"enable":[3],"inverse-problem":[4],"solvers":[5],"without":[6,154],"retraining,":[7],"but":[8],"for":[9,114,124],"nonlinear":[10],"forward":[11],"operators":[12],"data":[13],"consistency":[14],"often":[15],"relies":[16],"on":[17],"repeated":[18],"derivatives":[19],"or":[20,95,157],"inner":[21,42,158],"optimization/MCMC":[22],"loops":[23,43],"with":[24,44,81,149],"conservative":[25],"step":[26,56],"sizes,":[27],"incurring":[28],"many":[29],"iterations":[30],"and":[31,52,83,91,102,110,118,139],"denoiser/score":[32],"evaluations.":[33],"We":[34,105,133],"propose":[35],"a":[36,45,59,84,96,128,136,140],"training-free":[37],"solver":[38],"that":[39],"replaces":[40],"these":[41],"hard":[46],"measurement-space":[47],"feasibility":[48],"constraint":[49],"(closed-form":[50],"projection)":[51],"an":[53,77,120],"analytic,":[54],"model-optimal":[55],"size,":[57],"enabling":[58],"small,":[60],"fixed":[61],"compute":[62],"budget":[63],"per":[64],"noise":[65],"level.":[66],"Anchored":[67],"at":[68],"the":[69,72,115],"denoiser":[70],"prediction,":[71],"correction":[73],"is":[74],"approximated":[75],"via":[76],"adjoint-free,":[78],"ADMM-style":[79],"splitting":[80],"projection":[82],"few":[85],"steepest-descent":[86],"updates,":[87],"using":[88],"one":[89,93],"VJP":[90],"either":[92],"JVP":[94],"forward-difference":[97],"probe,":[98],"followed":[99],"by":[100],"backtracking":[101,113],"decoupled":[103],"re-annealing.":[104],"prove":[106],"local":[107,129],"model":[108],"optimality":[109],"descent":[111],"under":[112,127],"step-size":[116],"rule,":[117],"derive":[119],"explicit":[121],"KL":[122],"bound":[123],"mode-substitution":[125],"re-annealing":[126],"Gaussian":[130],"conditional":[131],"surrogate.":[132],"also":[134],"develop":[135],"latent":[137],"variant":[138],"one-parameter":[141],"pixel$\\rightarrow$latent":[142],"hybrid":[143],"schedule.":[144],"Experiments":[145],"achieve":[146],"competitive":[147],"PSNR/SSIM/LPIPS":[148],"up":[150],"to":[151],"19.5$\\times$":[152],"speedup,":[153],"hand-coded":[155],"adjoints":[156],"MCMC.":[159]},"counts_by_year":[],"updated_date":"2026-03-04T07:09:34.246503","created_date":"2026-03-04T00:00:00"}
