{"id":"W3099022131","doi":"","title":"Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual information; Generalization; Conditional mutual information; Computer science; Algorithm; Sample complexity; Sample (material); Mathematics; Artificial intelligence; Theoretical 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.01817819,0.002475671,0.002383949,0.003817209,0.001337927,0.003220725,0.003689181,0.003241295,0.00268036],"category_scores_gemma":[0.09934791,0.001295065,0.002536046,0.002441686,0.007742745,0.009121503,0.009771379,0.009629199,0.0004527693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004085642,"about_ca_system_score_gemma":0.002069914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00256823,"about_ca_topic_score_gemma":0.002274384,"domain_scores_codex":[0.9909457,0.003744866,0.0005156194,0.001603646,0.002613156,0.000576967],"domain_scores_gemma":[0.9201509,0.06300534,0.004187095,0.006895335,0.004495482,0.001265842],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001586654,0.00006765775,0.001409806,0.0002157216,0.0001748816,0.0001355671,0.0003815508,0.3518868,0.003093186,0.6165335,0.001383019,0.02455959],"study_design_scores_gemma":[0.000009846341,0.00005509217,0.0003607061,0.0000584121,0.00003098639,0.00004373892,0.00001858016,0.7376121,0.001467401,0.2593524,0.0009537496,0.00003701621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009847768,0.001161395,0.9847234,0.0008175629,0.00007257405,0.00003236325,0.00007385667,0.0001828643,0.003088154],"genre_scores_gemma":[0.5960857,0.002514654,0.3928203,0.001207216,0.0007399751,0.0004452245,0.0003563708,0.0007207404,0.005109803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01817819,"threshold_uncertainty_score":0.09613663,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0177399444791206,"score_gpt":0.2671884721861898,"score_spread":0.2494485277070692,"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."}}