{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009164944,0.0009378429,0.0007364334,0.000493917,0.0004624056,0.0008783579,0.000976389,0.0009052016,0.004719144],"category_scores_gemma":[0.002859632,0.0003501706,0.00078026,0.0005788427,0.0009303245,0.0007337058,0.00126691,0.001600966,0.002123911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006253195,"about_ca_system_score_gemma":0.001988116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006477968,"about_ca_topic_score_gemma":0.005986226,"domain_scores_codex":[0.9993734,0.0002202234,0.00003991072,0.0001045149,0.0001913045,0.00007071319],"domain_scores_gemma":[0.9989557,0.000400567,0.00009674492,0.000171885,0.0003006647,0.00007447234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002165773,0.000113157,0.001069322,0.000197482,0.00005918361,0.0001817732,0.0002029096,0.6603172,0.01706739,0.06990583,0.01065051,0.2400187],"study_design_scores_gemma":[0.000009691052,0.00001757874,0.00005269067,0.000004525018,0.000002278416,0.00001873712,0.00000754657,0.9929479,0.001641512,0.004119522,0.001172356,0.000005689632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00496142,0.00005782132,0.9928125,0.0001266605,0.00003925393,0.00003596129,0.00002961471,0.0004861726,0.001450774],"genre_scores_gemma":[0.1070498,0.0001202645,0.8881336,0.00009887305,0.00005517471,0.0001219346,0.0002160515,0.000319425,0.003884733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006477968,"threshold_uncertainty_score":0.01578707,"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."}}