{"id":"https://openalex.org/W7128736477","doi":"https://doi.org/10.48550/arxiv.2602.11107","title":"Renet: Principled and Efficient Relaxation for the Elastic Net via Dynamic Objective Selection","display_name":"Renet: Principled and Efficient Relaxation for the Elastic Net via Dynamic Objective Selection","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W7128736477","doi":"https://doi.org/10.48550/arxiv.2602.11107"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.11107","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","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/A5125768968","display_name":"Albert Dorador","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dorador, Albert","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5125768968"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17048838,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.8406000137329102,"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.8406000137329102,"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/T10136","display_name":"Statistical Methods and Inference","score":0.03310000151395798,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.02019999921321869,"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/elastic-net-regularization","display_name":"Elastic net regularization","score":0.744700014591217},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.650600016117096},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5475999712944031},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.486299991607666},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4345000088214874},{"id":"https://openalex.org/keywords/lasso","display_name":"Lasso (programming language)","score":0.41429999470710754},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.40849998593330383},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.3725000023841858},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.35850000381469727},{"id":"https://openalex.org/keywords/elasticity","display_name":"Elasticity (physics)","score":0.34700000286102295}],"concepts":[{"id":"https://openalex.org/C203868755","wikidata":"https://www.wikidata.org/wiki/Q5353562","display_name":"Elastic net regularization","level":3,"score":0.744700014591217},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.650600016117096},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6043000221252441},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5666000247001648},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5475999712944031},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.486299991607666},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4345000088214874},{"id":"https://openalex.org/C37616216","wikidata":"https://www.wikidata.org/wiki/Q3218363","display_name":"Lasso (programming language)","level":2,"score":0.41429999470710754},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.40849998593330383},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.3725000023841858},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3612000048160553},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.35850000381469727},{"id":"https://openalex.org/C121854251","wikidata":"https://www.wikidata.org/wiki/Q62932","display_name":"Elasticity (physics)","level":2,"score":0.34700000286102295},{"id":"https://openalex.org/C131053463","wikidata":"https://www.wikidata.org/wiki/Q4680751","display_name":"Adaptive mesh refinement","level":2,"score":0.3379000127315521},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.337799996137619},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.3278000056743622},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3190000057220459},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C160343418","wikidata":"https://www.wikidata.org/wiki/Q185256","display_name":"Rigidity (electromagnetism)","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C93959086","wikidata":"https://www.wikidata.org/wiki/Q6888345","display_name":"Model selection","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2980000078678131},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C200331156","wikidata":"https://www.wikidata.org/wiki/Q506041","display_name":"Jacobian matrix and determinant","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C22019652","wikidata":"https://www.wikidata.org/wiki/Q331309","display_name":"Overfitting","level":3,"score":0.2759000062942505},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C32230216","wikidata":"https://www.wikidata.org/wiki/Q7882499","display_name":"Uncertainty quantification","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.25290000438690186},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.25040000677108765},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.25}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.11107","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.11107","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.11107","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":"pmh:doi:10.48550/arxiv.2602.11107","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.5812135338783264,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"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,64],"introduce":[1],"Renet,":[2],"a":[3,24,71,133,145,181,202,232],"principled":[4],"generalization":[5],"of":[6,15,83,155],"the":[7,11,19,35,38,49,90,95,102,139,153,156,160,196,207],"Relaxed":[8],"Lasso":[9],"to":[10,66,151,206],"Elastic":[12,51,198,209],"Net":[13,52,199,210],"family":[14],"estimators.":[16],"While,":[17],"on":[18,34,79],"one":[20],"hand,":[21,37],"$\\ell_1$-regularization":[22],"is":[23,178],"standard":[25,50,197],"tool":[26],"for":[27,173],"variable":[28],"selection":[29],"in":[30,163,211],"high-dimensional":[31],"regimes":[32,176],"and,":[33],"other":[36],"$\\ell_2$":[39],"penalty":[40],"provides":[41,201],"stability":[42,171],"and":[43,85,99,124,131,138,177,188,200,216],"solution":[44],"uniqueness":[45],"through":[46,70,113],"strict":[47],"convexity,":[48],"nevertheless":[53],"suffers":[54],"from":[55],"shrinkage":[56],"bias":[57],"that":[58,93,118,192,235],"frequently":[59],"yields":[60],"suboptimal":[61],"prediction":[62],"accuracy.":[63],"propose":[65],"address":[67],"this":[68],"limitation":[69],"framework":[72,168],"called":[73],"\\textit{relaxation}.":[74],"Existing":[75],"relaxation":[76,116,137,142],"implementations":[77],"rely":[78],"naive":[80],"linear":[81],"interpolations":[82],"penalized":[84],"unpenalized":[86],"solutions,":[87],"which":[88],"ignore":[89],"non-linear":[91],"geometry":[92],"characterizes":[94],"entire":[96],"regularization":[97],"path":[98],"risk":[100],"violating":[101],"Karush-Kuhn-Tucker":[103],"conditions.":[104],"Renet":[105,193,225],"addresses":[106],"these":[107,227],"limitations":[108],"by":[109,180],"enforcing":[110],"sign":[111],"consistency":[112],"an":[114,221],"adaptive":[115,222],"procedure":[117],"dynamically":[119],"dispatches":[120],"between":[121,136],"convex":[122],"blending":[123],"efficient":[125],"sub-path":[126],"refitting.":[127],"Furthermore,":[128],"we":[129],"identify":[130],"formalize":[132],"unique":[134],"synergy":[135],"``One-Standard-Error''":[140],"rule:":[141],"serves":[143],"as":[144],"robust":[146,204],"debiasing":[147],"mechanism,":[148],"allowing":[149],"practitioners":[150],"leverage":[152],"parsimony":[154],"1-SE":[157],"rule":[158],"without":[159],"traditional":[161],"loss":[162],"predictive":[164],"fidelity.":[165],"Our":[166],"theoretical":[167],"incorporates":[169],"automated":[170],"safeguards":[172],"ultra-high":[174],"dimensional":[175],"supported":[179],"comprehensive":[182],"benchmarking":[183],"suite":[184],"across":[185],"20":[186],"synthetic":[187],"real-world":[189],"datasets,":[190],"demonstrating":[191],"consistently":[194],"outperforms":[195],"more":[203],"alternative":[205],"Adaptive":[208],"high-dimensional,":[212],"low":[213],"signal-to-noise":[214],"ratio":[215],"high-multicollinearity":[217],"regimes.":[218],"By":[219],"leveraging":[220],"solver":[223],"backend,":[224],"delivers":[226],"statistical":[228],"gains":[229],"while":[230],"offering":[231],"computational":[233],"profile":[234],"remains":[236],"competitive":[237],"with":[238],"state-of-the-art":[239],"coordinate":[240],"descent":[241],"implementations.":[242]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-13T00:00:00"}