{"id":"W4414989062","doi":"10.48550/arxiv.2506.20335","title":"CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subspace topology; Linear subspace; Convergence (economics); Measure (data warehouse); Random subspace method; Constraint (computer-aided design); Projection (relational algebra); Random projection","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004693343,0.0005943757,0.0007728142,0.0004469909,0.0002744465,0.000233379,0.002309259,0.0005953668,0.00003102977],"category_scores_gemma":[0.0008038934,0.0006353747,0.0003282109,0.0006974962,0.0002148116,0.0003954769,0.001983739,0.0005207006,0.00000613904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002469878,"about_ca_system_score_gemma":0.0003982444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003314787,"about_ca_topic_score_gemma":0.000003109605,"domain_scores_codex":[0.9968698,0.0001691649,0.000727691,0.001335023,0.0003702905,0.0005280447],"domain_scores_gemma":[0.996501,0.0005240013,0.0006399783,0.001641075,0.0005409069,0.0001530387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005341802,0.001088001,0.01482713,0.001203826,0.001531281,0.00009069253,0.005605056,0.7012482,0.0001298988,0.1244932,0.05063143,0.09861714],"study_design_scores_gemma":[0.003481701,0.0001023851,0.0003703869,0.0002763378,0.0000899176,0.00001199263,0.00002610769,0.9815802,0.001473849,0.01144601,0.0005032661,0.0006378523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004322121,0.0001541164,0.9904017,0.002791394,0.001238555,0.002939536,0.00008425363,0.001213789,0.0007444675],"genre_scores_gemma":[0.008767803,0.0001276159,0.9875419,0.0007483579,0.0001472698,0.001229833,0.0001674437,0.00004874309,0.00122104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2803321,"threshold_uncertainty_score":0.9996098,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03735733149559817,"score_gpt":0.274019454456596,"score_spread":0.2366621229609978,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}