{"id":"W2891961001","doi":"","title":"Gradient Descent Meets Shift-and-Invert Preconditioning for Eigenvector Computation","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Gradient descent; Leverage (statistics); Eigenvalues and eigenvectors; Algorithm; Computation; Solver; Rate of convergence; Computer science; Mathematical optimization; Mathematics; Applied mathematics; Key (lock)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003970576,0.0001251645,0.0001345298,0.000130136,0.0005086145,0.0008525974,0.0002156073,0.00005040675,0.000002114678],"category_scores_gemma":[0.0000363503,0.0001108271,0.00003196218,0.0002036371,0.00005003113,0.003566309,0.0000500381,0.00005824797,0.00002527851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004656398,"about_ca_system_score_gemma":0.00004214026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009698578,"about_ca_topic_score_gemma":0.000001271006,"domain_scores_codex":[0.9989761,0.00004635386,0.0004163419,0.0001636408,0.0001837127,0.0002138127],"domain_scores_gemma":[0.9992169,0.00005045686,0.000294196,0.0001188212,0.0002381339,0.00008155383],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006431359,0.00006533186,0.0002969441,0.002348314,0.00004352955,0.000001069909,0.02396307,0.005529683,0.0002403755,0.1528334,0.003115296,0.8114987],"study_design_scores_gemma":[0.0003394335,0.0001322534,0.0004004117,0.0001146817,0.000005801385,0.00003462402,0.000110668,0.9911131,0.0006667874,0.001646838,0.005275068,0.0001602775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02113098,0.00009950857,0.9760175,0.0004454782,0.001157854,0.0004917256,0.000007047423,0.0002581785,0.0003916711],"genre_scores_gemma":[0.991762,0.000001297335,0.007601153,0.0002803599,0.0002083054,0.00007179841,0.00002634042,0.000005490861,0.00004324088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9855835,"threshold_uncertainty_score":0.8221616,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01972911649381998,"score_gpt":0.2599810769652536,"score_spread":0.2402519604714336,"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."}}