{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471265,0.00108422,0.001158375,0.0006119763,0.0005172828,0.000692547,0.0009955306,0.001347114,0.002070854],"category_scores_gemma":[0.00279544,0.0004744796,0.000684979,0.0007965819,0.001010863,0.001221177,0.001003843,0.001580616,0.0009093366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004058761,"about_ca_system_score_gemma":0.001016621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0012252,"about_ca_topic_score_gemma":0.001274131,"domain_scores_codex":[0.9992206,0.000385356,0.00003286912,0.0001006197,0.0002217337,0.00003889638],"domain_scores_gemma":[0.9993992,0.0003088299,0.00005833063,0.00005488395,0.0001470767,0.00003163512],"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.0002904063,0.0001977774,0.0009789803,0.0008811958,0.0002247826,0.0003964455,0.0002351911,0.5077678,0.04087321,0.2150149,0.005915259,0.227224],"study_design_scores_gemma":[0.00002506479,0.00005168972,0.00008817162,0.00001246511,0.000009277113,0.00006108022,0.000006889341,0.9849277,0.002407944,0.009902121,0.002492039,0.00001560845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001738163,0.0002446473,0.9969149,0.00008775636,0.00004672347,0.00002849681,0.000008006245,0.00006095069,0.0008703333],"genre_scores_gemma":[0.07298081,0.0006657875,0.9218963,0.0001693955,0.0000818595,0.0002563549,0.00006156915,0.0001240304,0.003763876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002070854,"threshold_uncertainty_score":0.00778091,"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."}}