{"id":"W2963626304","doi":"10.1002/nla.1963","title":"A nonlinearly preconditioned conjugate gradient algorithm for rank‐<i>R</i> canonical tensor approximation","year":2014,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Preconditioner; Conjugate gradient method; Convergence (economics); Mathematics; Rank (graph theory); Tensor (intrinsic definition); Acceleration; Nonlinear conjugate gradient method; Nonlinear system; Algorithm; Applied mathematics; Mathematical optimization; Computer science; Iterative method; Pure mathematics; Gradient descent; Combinatorics; Artificial intelligence; Artificial neural network","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002754039,0.0003179672,0.000454928,0.0001078804,0.0004860301,0.0000792795,0.0003293302,0.0001492975,0.0001133532],"category_scores_gemma":[0.00009527326,0.0002699438,0.0001799606,0.0005243391,0.000173977,0.0001427108,0.00003612998,0.0002542034,0.0002171141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007521245,"about_ca_system_score_gemma":0.00008286454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001202853,"about_ca_topic_score_gemma":0.000007916099,"domain_scores_codex":[0.9978486,0.00008082278,0.0006493522,0.0006505525,0.0003310874,0.0004396167],"domain_scores_gemma":[0.9974237,0.0007732444,0.0003170988,0.0007256651,0.0004347567,0.0003255447],"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.0001329687,0.002847971,0.0001068172,0.0001541936,0.0002204317,7.929349e-7,0.000225508,0.0001709805,0.001223535,0.9156867,0.006253873,0.07297618],"study_design_scores_gemma":[0.005686503,0.001000237,0.0006781157,0.00006603466,0.0005244989,0.0001116227,0.0001226045,0.4176864,0.004258652,0.2274836,0.3410499,0.001331796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003543493,0.00001287997,0.9888576,0.002449051,0.00003648563,0.002939911,0.0004105985,0.0005051383,0.001244841],"genre_scores_gemma":[0.09040556,0.000005400363,0.8969364,0.001060035,0.0005748688,0.009291874,0.0009602787,0.0001085816,0.000656991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6882032,"threshold_uncertainty_score":0.9999753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01939508976469891,"score_gpt":0.2887760599794227,"score_spread":0.2693809702147238,"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."}}