{"id":"W3200713868","doi":"10.48550/arxiv.2109.05685","title":"Barzilai and Borwein conjugate gradient method equipped with a non-monotone line search technique and its application on non-negative matrix factorization","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Monotone polygon; Mathematics; Line search; Conjugate gradient method; Matrix (chemical analysis); Non-negative matrix factorization; Gradient method; Convergence (economics); Nonlinear conjugate gradient method; Applied mathematics; Mathematical optimization; Algorithm; Gradient descent; Matrix decomposition; Computer science","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005501857,0.0004482938,0.0005826672,0.0004721864,0.0002286039,0.0001022723,0.0003040264,0.0003925793,0.00002636314],"category_scores_gemma":[0.0002141644,0.0004632328,0.00006561431,0.0008373802,0.0001485111,0.0002646888,0.0008019851,0.0009183835,0.000005997317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003507826,"about_ca_system_score_gemma":0.0002365359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000734132,"about_ca_topic_score_gemma":0.00003864866,"domain_scores_codex":[0.9974737,0.000303974,0.0003072569,0.001271838,0.0002497341,0.0003935492],"domain_scores_gemma":[0.9973708,0.0005881471,0.0003198087,0.0006620795,0.0007891853,0.0002700285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001859533,0.001221332,0.001161373,0.003411935,0.0009301126,0.0005946686,0.004452146,0.8576173,0.01946327,0.1069386,0.0000357163,0.002314036],"study_design_scores_gemma":[0.001612955,0.0003604474,0.0001999639,0.0004142617,0.0001420774,0.00001328367,0.0006249912,0.9359756,0.03948977,0.02053726,0.00001627535,0.0006130905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1155139,0.00002265809,0.8811575,0.00007541175,0.00002783519,0.00273935,0.00006961306,0.0001106868,0.000282999],"genre_scores_gemma":[0.8500084,0.0006344893,0.1480685,0.00001921704,0.00003950863,0.00005735917,0.0001231877,0.00007938571,0.0009699028],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7344944,"threshold_uncertainty_score":0.999782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07802442260630979,"score_gpt":0.3038032719078441,"score_spread":0.2257788493015343,"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."}}