{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009436936,0.001905265,0.001074626,0.002299725,0.0009146329,0.00254828,0.001808236,0.00144709,0.006400021],"category_scores_gemma":[0.07091821,0.0008431898,0.0009185362,0.001136471,0.003359708,0.005064554,0.003727404,0.002871317,0.00156691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001500593,"about_ca_system_score_gemma":0.001431903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000505664,"about_ca_topic_score_gemma":0.0003898089,"domain_scores_codex":[0.9951277,0.002635036,0.0002624458,0.000575004,0.0009347747,0.0004650409],"domain_scores_gemma":[0.972418,0.01751515,0.001983924,0.002608135,0.00438181,0.00109311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003939567,0.0001098374,0.00141226,0.0004805444,0.00006270364,0.0001871917,0.0005185963,0.1812899,0.01218375,0.7588677,0.003394054,0.0410995],"study_design_scores_gemma":[0.00004398313,0.000205113,0.0003442424,0.0001694413,0.00002383942,0.0001933837,0.0001683652,0.7535368,0.01262065,0.2293662,0.003281201,0.00004664603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08995549,0.002376291,0.8830966,0.0009369621,0.0001999225,0.0002046286,0.0001211539,0.0004230334,0.02268586],"genre_scores_gemma":[0.7617733,0.00272078,0.2220085,0.0003480554,0.0003268274,0.0006887187,0.0002207554,0.0007744249,0.01113863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009436936,"threshold_uncertainty_score":0.04990786,"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."}}