{"id":"W3104862198","doi":"","title":"The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification","year":2020,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Relaxation (psychology); Univariate; Computer science; Artificial neural network; Algorithm; Convex optimization; Linear programming relaxation; Linear programming; Exponential function; Regular polygon; Activation function; Mathematical optimization; Mathematics; Multivariate statistics; Artificial intelligence; Mathematical analysis; Geometry; 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.0008245276,0.0003032057,0.0002882159,0.000101826,0.001285929,0.0005784918,0.001417141,0.0002121193,0.0000060067],"category_scores_gemma":[0.002325713,0.0002683648,0.0001836355,0.001007432,0.00009422538,0.0008370375,0.0003264614,0.0005511738,0.00001495602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002482925,"about_ca_system_score_gemma":0.0001506056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001575301,"about_ca_topic_score_gemma":0.00006855535,"domain_scores_codex":[0.9972513,0.0003790771,0.0006132856,0.0006780712,0.0004061117,0.0006721531],"domain_scores_gemma":[0.9970226,0.0007622267,0.0006302514,0.001051623,0.0002460873,0.0002872467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000247242,0.00007973592,0.006600094,0.00005373959,0.00006797763,0.00001515149,0.001028761,0.3936638,0.01383104,0.4887432,0.01354537,0.0821239],"study_design_scores_gemma":[0.0004057345,0.0002175525,0.005465633,0.00002152845,0.00002788321,0.00001450211,0.00002947953,0.9647207,0.00127909,0.004535335,0.02298307,0.0002995433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004050383,0.0006746854,0.95718,0.03521227,0.0003738532,0.001165118,0.000009468076,0.001108709,0.0002254857],"genre_scores_gemma":[0.7358592,0.00009604938,0.2575201,0.005039054,0.0006452036,0.0004872656,0.00005175752,0.00006718993,0.000234172],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7318088,"threshold_uncertainty_score":0.9999769,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01768905105007076,"score_gpt":0.2372244581559873,"score_spread":0.2195354071059166,"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."}}