{"id":"W2255188617","doi":"10.48550/arxiv.1407.0671","title":"Optimal rates of convergence of matrices with applications","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Division of Mathematical Sciences; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Linear subspace; Rate of convergence; Eigenvalues and eigenvectors; Characterization (materials science); Convergence (economics); Projection (relational algebra); Intersection (aeronautics); Mathematics; Applied mathematics; Compact convergence; Modes of convergence (annotated index); Projection method; Normal convergence; Mathematical optimization; Computer science; Algorithm; Pure mathematics; Dykstra's projection algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.0002055962,0.0001618319,0.0002913674,0.0001579826,0.0000512729,0.0000184512,0.001584859,0.0001052198,0.0000299678],"category_scores_gemma":[0.000006080849,0.0001566619,0.00009602535,0.0004984053,0.0001921935,0.0001581901,0.0007430997,0.0001741191,0.00001633079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001762968,"about_ca_system_score_gemma":0.0001187222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004338226,"about_ca_topic_score_gemma":0.000001997726,"domain_scores_codex":[0.9990223,0.00007950751,0.0001799178,0.0005004822,0.00007309167,0.0001447109],"domain_scores_gemma":[0.998279,0.0001255349,0.0004408081,0.0008824831,0.0002030546,0.00006906344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000030771,0.00008790505,0.001833139,0.0003138136,0.00007407561,0.00001194727,0.0001019214,0.2799136,0.00007854043,0.7171816,0.00003036514,0.0003423693],"study_design_scores_gemma":[0.0006432847,0.0002272862,0.0009256971,0.0002235325,0.0001544224,0.000007546998,0.0001303829,0.928511,0.01223528,0.0554843,0.0008268532,0.0006304125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1577244,0.00006427146,0.8409284,0.00001322515,0.00006631661,0.000197035,0.00001439662,0.00004700255,0.000944962],"genre_scores_gemma":[0.9799808,0.0001241267,0.01950188,0.00000733915,0.00002346807,0.00000155978,0.000004560216,0.000006247153,0.0003500294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8222564,"threshold_uncertainty_score":0.6388488,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03359885151676442,"score_gpt":0.1924748976258742,"score_spread":0.1588760461091098,"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."}}