{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002599381,0.001117088,0.001877472,0.0008212701,0.0005538012,0.001289023,0.00244804,0.001764284,0.002854188],"category_scores_gemma":[0.00798359,0.0007955661,0.001166954,0.0009869918,0.001473285,0.001787375,0.002596703,0.002632936,0.001286043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022852,"about_ca_system_score_gemma":0.001968288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004413781,"about_ca_topic_score_gemma":0.003359044,"domain_scores_codex":[0.9985946,0.0005771071,0.00006568043,0.0002199219,0.0004434159,0.00009920997],"domain_scores_gemma":[0.9975399,0.0013649,0.0002152537,0.0003133429,0.0004264284,0.0001402547],"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.0001840918,0.00006869679,0.0003666032,0.0001220812,0.00008354241,0.00007409315,0.0000737485,0.8579022,0.002289964,0.03396655,0.00414881,0.1007196],"study_design_scores_gemma":[0.000009129833,0.00001531994,0.00001371228,0.000003764591,0.000002258655,0.000009707125,0.00000190806,0.996068,0.0003231812,0.00310159,0.0004466412,0.000004751303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00119763,0.00008451353,0.9979634,0.00005623885,0.00001613735,0.00002277846,0.00001513159,0.0002578588,0.0003862935],"genre_scores_gemma":[0.1400649,0.0002011509,0.8559456,0.0002092563,0.00007772407,0.0003336738,0.0002566038,0.0004190525,0.002492063],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004413781,"threshold_uncertainty_score":0.01374704,"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."}}