{"id":"https://openalex.org/W7161799011","doi":"https://doi.org/10.48550/arxiv.2605.19306","title":"A Two-Phase Adaptive Balanced Penalty Method for Controllable Pareto Front Learning under Split Feasibility Conditions","display_name":"A Two-Phase Adaptive Balanced Penalty Method for Controllable Pareto Front Learning under Split Feasibility Conditions","publication_year":2026,"publication_date":"2026-05-19","ids":{"openalex":"https://openalex.org/W7161799011","doi":"https://doi.org/10.48550/arxiv.2605.19306"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.19306","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19306","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.2605.19306","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136514451","display_name":"Nguyen Viet Hoang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hoang, Nguyen Viet","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129720540","display_name":"Dung D. Le","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Le, Dung D.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029410939","display_name":"Tran Ngoc Thang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thang, Tran Ngoc","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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.450300008058548,"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.450300008058548,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.24889999628067017,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.06790000200271606,"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/convergence","display_name":"Convergence (economics)","score":0.6868000030517578},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6467999815940857},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5608999729156494},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5388000011444092},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.49160000681877136},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.4902999997138977},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4724999964237213},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4133000075817108}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7055000066757202},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6868000030517578},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6467999815940857},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5608999729156494},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5388000011444092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5073999762535095},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.49160000681877136},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4902999997138977},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4724999964237213},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4133000075817108},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.39329999685287476},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3774000108242035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.367000013589859},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.33570000529289246},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3222000002861023},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3059000074863434},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.29829999804496765},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2928999960422516},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.258899986743927},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.19306","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19306","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.2605.19306","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19306","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":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.44690847396850586}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,22],"address":[1],"the":[2,24,37,109,128],"open":[3],"problem":[4,27],"of":[5],"training":[6,95],"hypernetworks":[7],"for":[8,97],"Controllable":[9],"Pareto":[10,26],"Front":[11],"Learning":[12],"(CPFL)":[13],"under":[14,77],"split":[15],"feasibility":[16,53,153],"conditions":[17],"with":[18],"rigorous":[19],"theoretical":[20],"guarantees.":[21],"reformulate":[23],"constrained":[25,105],"as":[28],"a":[29,63,68,92],"Bi-Level":[30],"Scalarized":[31],"Split":[32],"Problem":[33],"(BSSP)":[34],"and":[35,51,80,99,119],"propose":[36],"Adaptive":[38],"Balanced":[39],"Penalty":[40],"(ABP)":[41],"algorithm,":[42],"whose":[43],"three":[44,135],"gradient":[45],"components":[46],"--":[47,54],"optimality,":[48],"set":[49],"feasibility,":[50],"image":[52],"are":[55],"blended":[56],"through":[57],"an":[58],"adaptive":[59],"indicator":[60],"driven":[61],"by":[62,151],"computable":[64],"lower":[65],"bound.":[66],"Using":[67],"novel":[69],"convex":[70],"surrogate":[71],"technique,":[72],"we":[73,107],"prove":[74],"full-sequence":[75],"convergence":[76],"standard":[78],"convexity":[79],"Robbins-Monro":[81],"step-size":[82],"assumptions.":[83],"The":[84],"ABP":[85,129],"penalty":[86],"structure":[87],"is":[88],"then":[89],"translated":[90],"into":[91],"two-phase,":[93],"feasibility-first":[94],"strategy":[96],"Hyper-MLP":[98],"HyperTrans":[100],"architectures":[101],"(ABP-HyperNet).":[102],"To":[103],"evaluate":[104],"CPFL,":[106],"introduce":[108],"Expected":[110],"Feasible":[111],"Hypervolume":[112],"(EFHV),":[113],"which":[114],"jointly":[115],"captures":[116],"solution":[117],"quality":[118],"constraint":[120],"satisfaction.":[121],"Experiments":[122],"on":[123],"five":[124],"multi-objective":[125],"benchmarks":[126],"validate":[127],"solver":[130],"against":[131],"ground":[132],"truth,":[133],"while":[134],"multi-task":[136],"learning":[137],"datasets":[138],"demonstrate":[139],"that":[140],"ABP-HyperNet":[141],"achieves":[142],"up":[143],"to":[144,156],"2.3x":[145],"higher":[146],"EFHV":[147],"than":[148],"unconstrained":[149],"baselines":[150],"raising":[152],"from":[154],"36-49%":[155],"87-100%.":[157]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-21T00:00:00"}