{"id":"https://openalex.org/W7123352114","doi":"https://doi.org/10.1109/cdc57313.2025.11312326","title":"Online Complexity Estimation for Repetitive Scenario Design","display_name":"Online Complexity Estimation for Repetitive Scenario Design","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123352114","doi":"https://doi.org/10.1109/cdc57313.2025.11312326"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5017266405","display_name":"Guillaume Berger","orcid":null},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Guillaume O. Berger","raw_affiliation_strings":["UCLouvain,ICTEAM,Louvain-La-Neuve,Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UCLouvain,ICTEAM,Louvain-La-Neuve,Belgium","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5122876407","display_name":"Rapha\u00ebl M. Jungers","orcid":null},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Rapha\u00ebl M. Jungers","raw_affiliation_strings":["UCLouvain,ICTEAM,Louvain-La-Neuve,Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UCLouvain,ICTEAM,Louvain-La-Neuve,Belgium","institution_ids":["https://openalex.org/I95674353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95674353"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5762","last_page":"5767"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.5752000212669373,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.5752000212669373,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.05990000069141388,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.05649999901652336,"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/sample-size-determination","display_name":"Sample size determination","score":0.6104999780654907},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.5814999938011169},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5289000272750854},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5268999934196472},{"id":"https://openalex.org/keywords/optimal-design","display_name":"Optimal design","score":0.49079999327659607},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.42089998722076416},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.3598000109195709},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.34040001034736633}],"concepts":[{"id":"https://openalex.org/C129848803","wikidata":"https://www.wikidata.org/wiki/Q2564360","display_name":"Sample size determination","level":2,"score":0.6104999780654907},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.5814999938011169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5529000163078308},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5449000000953674},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5289000272750854},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5268999934196472},{"id":"https://openalex.org/C186394612","wikidata":"https://www.wikidata.org/wiki/Q7098942","display_name":"Optimal design","level":2,"score":0.49079999327659607},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.42089998722076416},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.3598000109195709},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.34040001034736633},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32839998602867126},{"id":"https://openalex.org/C197055811","wikidata":"https://www.wikidata.org/wiki/Q207522","display_name":"Probability density function","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3165999948978424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31200000643730164},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C34559072","wikidata":"https://www.wikidata.org/wiki/Q2334061","display_name":"Design of experiments","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2671000063419342},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.258899986743927}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334322","display_name":"HORIZON EUROPE Framework Programme","ror":null},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1976466849","https://openalex.org/W2018878471","https://openalex.org/W2049606892","https://openalex.org/W2066778083","https://openalex.org/W2094435766","https://openalex.org/W2125107769","https://openalex.org/W2131295967","https://openalex.org/W2164261482","https://openalex.org/W2167412190","https://openalex.org/W2248658287","https://openalex.org/W2409332044","https://openalex.org/W2481731143","https://openalex.org/W2790380176","https://openalex.org/W2913035457","https://openalex.org/W2991484107","https://openalex.org/W3013742101","https://openalex.org/W3014272419","https://openalex.org/W3185159669","https://openalex.org/W3200797398","https://openalex.org/W4214700019","https://openalex.org/W4383109321","https://openalex.org/W7123352114"],"related_works":[],"abstract_inverted_index":{"We":[0,37,99,137],"consider":[1],"the":[2,21,44,46,72,78,84,93,101,110,115,133,140],"problem":[3,17],"of":[4,25,32,77,83,105,117,143,149],"repetitive":[5,151],"scenario":[6,15,57,119,125,134,152],"design":[7,16,153],"where":[8],"one":[9],"has":[10],"to":[11,27,41,108],"solve":[12],"repeatedly":[13],"a":[14,29,68,81,147],"and":[18,59,103,160],"can":[19],"adjust":[20],"sample":[22,48,85,95,112],"size":[23,49,96,113],"(number":[24],"scenarios)":[26],"obtain":[28,109],"desired":[30],"level":[31],"risk":[33,61,79],"(constraint":[34],"violation":[35],"probability).":[36],"propose":[38],"an":[39],"approach":[40,64,107,145],"learn":[42],"on":[43,51,146],"fly":[45],"optimal":[47,94,111],"based":[50],"observed":[52],"data":[53],"consisting":[54],"in":[55,66,132],"previous":[56],"solutions":[58],"their":[60],"level.":[62],"Our":[63],"consists":[65],"learning":[67],"function":[69,82,89],"that":[70,127],"represents":[71],"pdf":[73],"(probability":[74],"density":[75],"function)":[76],"as":[80],"size.":[86],"Once":[87],"this":[88],"is":[90,97],"known,":[91],"retrieving":[92],"straightforward.":[98],"prove":[100],"soundness":[102],"convergence":[104],"our":[106,144],"for":[114],"class":[116],"fixed-complexity":[118],"problems,":[120,154,157],"which":[121],"generalizes":[122],"fully-supported":[123],"convex":[124],"programs":[126],"have":[128],"been":[129],"studied":[130],"extensively":[131],"optimization":[135],"literature.":[136],"also":[138],"demonstrate":[139],"practical":[141],"efficiency":[142],"series":[148],"challenging":[150],"including":[155],"non-fixed-complexity":[156],"nonconvex":[158],"constraints":[159],"time-varying":[161],"distributions.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-01-14T00:00:00"}