{"id":"https://openalex.org/W7155104444","doi":"https://doi.org/10.48550/arxiv.2604.17275","title":"Solving Stochastic Constraints by Oracle-based Gradient Descent and Interval Arithmetic","display_name":"Solving Stochastic Constraints by Oracle-based Gradient Descent and Interval Arithmetic","publication_year":2026,"publication_date":"2026-04-19","ids":{"openalex":"https://openalex.org/W7155104444","doi":"https://doi.org/10.48550/arxiv.2604.17275"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.17275","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.17275","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2604.17275","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101393020","display_name":"Xiakun Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Xiakun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134121158","display_name":"Hao Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Hao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065639971","display_name":"Bican Xia","orcid":"https://orcid.org/0000-0002-2570-2338"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xia, Bican","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134185683","display_name":"Tengshun Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Tengshun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5026435847","display_name":"Naijun Zhan","orcid":"https://orcid.org/0000-0003-3298-3817"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhan, Naijun","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.3472999930381775,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.3472999930381775,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.09189999848604202,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.07280000299215317,"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/stochastic-optimization","display_name":"Stochastic optimization","score":0.544700026512146},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5394999980926514},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5080999732017517},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5008999705314636},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.45100000500679016},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.41850000619888306},{"id":"https://openalex.org/keywords/interval-arithmetic","display_name":"Interval arithmetic","score":0.3977000117301941},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.38609999418258667}],"concepts":[{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.544700026512146},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5394999980926514},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5339000225067139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.531000018119812},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5080999732017517},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5008999705314636},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.45100000500679016},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.41850000619888306},{"id":"https://openalex.org/C191252586","wikidata":"https://www.wikidata.org/wiki/Q1671453","display_name":"Interval arithmetic","level":3,"score":0.3977000117301941},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.38609999418258667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.364300012588501},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.35740000009536743},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.35409998893737793},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3472999930381775},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3391999900341034},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3377000093460083},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.3061999976634979},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.289000004529953},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.2623000144958496},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.25459998846054077},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.17275","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.17275","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2604.17275","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.17275","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Stochastic":[0,143],"constraints,":[1],"which":[2],"incorporate":[3],"both":[4],"deterministic":[5,12,57],"parameters":[6,58],"and":[7,29,73,113,134,149],"random":[8],"variables,":[9],"extend":[10],"classical":[11],"constraints":[13,20],"by":[14,125],"explicitly":[15],"accounting":[16],"for":[17,55,118],"uncertainty.":[18],"These":[19],"are":[21],"increasingly":[22,114],"prevalent":[23],"in":[24,44],"data":[25],"science,":[26],"artificial":[27],"intelligence,":[28],"bioinformatics;":[30],"however,":[31],"solving":[32],"them":[33],"requires":[34],"addressing":[35],"quantitative":[36],"satisfaction":[37,62,122],"problems":[38,148],"that":[39,59],"remain":[40],"a":[41,52,67,109,126,150],"significant":[42],"challenge":[43],"computer":[45],"science.":[46],"In":[47],"this":[48],"paper,":[49],"we":[50],"propose":[51],"novel":[53],"framework":[54,107],"deciding":[56],"maximize":[60],"the":[61,77,93,119,132],"probability.":[63],"Our":[64],"approach":[65,138],"features":[66],"unique":[68],"synergy":[69],"between":[70],"stochastic":[71,83,151],"optimization":[72],"symbolic":[74],"techniques:":[75],"at":[76,92],"high":[78],"level,":[79,95],"it":[80,96],"employs":[81],"\\emph{oracle-based":[82],"gradient":[84],"descent}":[85],"to":[86,100,142],"identify":[87],"high-quality":[88],"parameter":[89],"candidates,":[90],"while":[91],"low":[94],"utilizes":[97],"\\emph{interval":[98],"arithmetic}":[99],"compute":[101],"rigorously":[102],"certified":[103],"lower":[104,116],"bounds.":[105],"This":[106],"produces":[108],"sequence":[110],"of":[111,136],"sound":[112],"tight":[115],"bounds":[117],"true":[120],"maximum":[121],"probability,":[123],"supported":[124],"high-probability":[127],"convergence":[128],"guarantee.":[129],"We":[130],"demonstrate":[131],"effectiveness":[133],"efficiency":[135],"our":[137],"through":[139],"its":[140],"application":[141],"Satisfiability":[144],"Modulo":[145],"Theories":[146],"(SSMT)":[147],"trajectory":[152],"planning":[153],"task.":[154]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-22T00:00:00"}