{"id":"W2790000037","doi":"10.48550/arxiv.1803.02414","title":"A gradient method in a Hilbert space with an optimized inner product: achieving a Newton-like convergence","year":2018,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University; University of Ottawa","funders":"","keywords":"Mathematics; Linear subspace; Gradient descent; Hilbert space; Applied mathematics; Subspace topology; Projection (relational algebra); Convergence (economics); Inner product space; Parameterized complexity; Mathematical analysis; Combinatorics; Algorithm; Pure mathematics; 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.001723122,0.0007262261,0.00108622,0.0005399685,0.0001708888,0.0001075174,0.001035047,0.0003412526,0.0003658993],"category_scores_gemma":[0.001702986,0.0006266378,0.0001365482,0.0009300484,0.0002951531,0.0003973018,0.001330486,0.001581765,0.00007382228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004401174,"about_ca_system_score_gemma":0.0005611519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002972009,"about_ca_topic_score_gemma":0.0003123089,"domain_scores_codex":[0.9948704,0.0007402848,0.0008558828,0.001771848,0.0008325167,0.0009290834],"domain_scores_gemma":[0.9956092,0.0004775301,0.0006070614,0.002214591,0.000732896,0.0003587608],"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.00792159,0.009260868,0.3225732,0.008165522,0.002668853,0.001510489,0.05167389,0.5620018,0.002910239,0.009176681,0.01337666,0.008760161],"study_design_scores_gemma":[0.01529835,0.002125883,0.02661091,0.005689308,0.0007139547,0.0003897425,0.002451854,0.8871816,0.01010864,0.02885938,0.01259481,0.007975615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3817854,0.0001952725,0.6106525,0.002357076,0.0006643267,0.003325781,0.00002576561,0.0003789079,0.00061502],"genre_scores_gemma":[0.02047572,0.0001708553,0.9728568,0.0001790763,0.0003264419,0.0006711509,0.00007562604,0.000245341,0.004999038],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3622043,"threshold_uncertainty_score":0.9996185,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08983312980673834,"score_gpt":0.3868919786399844,"score_spread":0.297058848833246,"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."}}