{"id":"W2034877773","doi":"10.1016/j.neunet.2012.12.009","title":"A class of finite-time dual neural networks for solving quadratic programming problems and its -winners-take-all application","year":2013,"lang":"en","type":"article","venue":"Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Artificial neural network; Quadratic programming; Computer science; Convergence (economics); Mathematical optimization; Class (philosophy); Quadratic equation; Activation function; Function (biology); Recurrent neural network; Stability (learning theory); Limiting; Property (philosophy); Dual (grammatical number); Mathematics; Artificial intelligence; Machine learning","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.0002837736,0.0003764034,0.0004461784,0.00008849212,0.0003170446,0.0003903675,0.0007086548,0.0002186871,0.000008680708],"category_scores_gemma":[0.00003593257,0.0003387263,0.0001551934,0.0006747579,0.00009860216,0.0008267901,0.0002982804,0.0004039877,0.000007842496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002620468,"about_ca_system_score_gemma":0.00001502504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003418326,"about_ca_topic_score_gemma":0.00001965199,"domain_scores_codex":[0.9973053,0.00007431321,0.0007108608,0.0008017106,0.0002573197,0.0008505361],"domain_scores_gemma":[0.9977669,0.0006808423,0.0004537683,0.0006048135,0.0002407937,0.0002528405],"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.00001720168,0.0001372817,0.0002754823,0.00009236933,0.00004716043,0.000002055038,0.0002277373,0.6904603,0.002006374,0.006138034,0.002124447,0.2984715],"study_design_scores_gemma":[0.000437633,0.0002271969,0.0003963048,0.00003759187,0.00003162381,0.00001989718,0.00001154934,0.9965088,0.00005408462,0.000649801,0.001277954,0.0003475381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08186211,0.001532948,0.9072974,0.00363668,0.0003852768,0.004720495,0.000005402159,0.0004618918,0.00009781724],"genre_scores_gemma":[0.9913725,0.00004734967,0.005796473,0.0007007211,0.0005037221,0.001370804,0.00005047623,0.00004541211,0.0001125213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9095104,"threshold_uncertainty_score":0.9999065,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02072694984196465,"score_gpt":0.2387100501315881,"score_spread":0.2179831002896234,"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."}}