{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":69,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":69,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"9cb4c79e07f9","filters":{"venue":"International Conference on Artificial Intelligence and Statistics"}},"results":[{"id":"W36903255","doi":"10.3390/molecules28052010","title":"Hierarchical Probabilistic Neural Network Language Model.","year":2005,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":840,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"National Center for Advancing Translational Sciences","keywords":"Computer science; Language model; Artificial intelligence; Cluster analysis; Hierarchy; Probabilistic logic; Embedding; Generalization; Artificial neural network; Hierarchical clustering; Hierarchical database model; Natural language processing; Machine learning; Data mining; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07106443107823439,"gpt":0.3506428053863268,"spread":0.2795783743080924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002561734,0.0001702437,0.0001437936,0.00009275549,0.0001220186,0.0004133669,0.0007762907,0.00007063059,0.00008577844],"category_scores_gemma":[0.0003276776,0.0001515867,0.00002727343,0.0001294421,0.0001494441,0.0003038131,0.0001935557,0.0003054032,0.00005013861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004906621,"about_ca_system_score_gemma":0.00007451949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001546147,"about_ca_topic_score_gemma":0.00007974545,"domain_scores_codex":[0.9985691,0.00005645359,0.000338266,0.0003912126,0.0003744176,0.0002706054],"domain_scores_gemma":[0.999113,0.0002232715,0.00009530086,0.0002409107,0.0002216286,0.0001059381],"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.0000195226,0.0000332528,0.00000324385,0.000003242405,0.000004545173,0.00001300692,0.0003550909,0.004484291,0.0002216198,0.6719996,0.0002502573,0.3226123],"study_design_scores_gemma":[0.00001009314,0.00004683587,0.000003926795,0.00001792441,0.00000206748,0.00001024104,0.00002191214,0.5661093,0.0006826984,0.4329358,0.00005430263,0.0001048931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009547558,0.0001058799,0.9921883,0.004080359,0.0002297512,0.0001225794,0.00004532927,0.0001983894,0.002074638],"genre_scores_gemma":[0.5620671,0.00002536646,0.4369541,0.000606036,0.0001609528,0.00001046988,0.00001293683,0.000005913506,0.0001570732],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.561625,"threshold_uncertainty_score":0.6181528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117499988","doi":"","title":"The Difficulty of Training Deep Architectures and the Effect of Unsupervised Pre-Training","year":2009,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":323,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Artificial intelligence; Computer science; Initialization; Robustness (evolution); Deep learning; Training (meteorology); Machine learning; Deep neural networks; Unsupervised learning; Training set","retraction":null,"screen_n_in":null,"score":{"opus":0.05197575815289519,"gpt":0.3078173894272081,"spread":0.2558416312743129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005936504,0.0001189173,0.0001958824,0.00004166448,0.0001689681,0.0001566529,0.0004354919,0.00002891906,0.000009269998],"category_scores_gemma":[0.0007153387,0.00006370814,0.00003697781,0.00008065949,0.000459485,0.00005390874,0.00005569533,0.0001179408,6.481765e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005448499,"about_ca_system_score_gemma":0.0000284661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002594124,"about_ca_topic_score_gemma":0.00005611958,"domain_scores_codex":[0.998877,0.0002149644,0.0003309037,0.0001847301,0.0002554294,0.0001369002],"domain_scores_gemma":[0.9974318,0.002075209,0.0001520812,0.0001508773,0.0001524195,0.00003765902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001662374,0.00000712588,0.00001116603,0.000002212583,0.00001933109,8.856098e-7,0.003680728,0.001372304,0.0008520117,0.4389897,0.000004809095,0.5548935],"study_design_scores_gemma":[0.0001121132,0.0004572345,0.001142773,0.00004265944,0.00001288791,0.000004723776,0.0006535111,0.80071,0.008951396,0.1878019,0.00002558819,0.00008518693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02852775,0.0000779141,0.9686359,0.00160158,0.0001937476,0.000160776,0.0000205707,0.000009007502,0.0007727653],"genre_scores_gemma":[0.9907714,0.0001286131,0.008945464,0.00007481471,0.00005237582,0.000005289258,0.000002455883,0.000002542735,0.00001703877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9622437,"threshold_uncertainty_score":0.2597942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154096410","doi":"","title":"Modeling annotator expertise: Learning when everybody knows a bit of something","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Artificial intelligence; Machine learning; Domain (mathematical analysis); Task (project management); Space (punctuation); Agreement; Natural language processing; Training set; Variable (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.0815228368451885,"gpt":0.3287389152244423,"spread":0.2472160783792537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004900097,0.0001677726,0.0001960172,0.0002057759,0.0001742336,0.0003599813,0.0005176828,0.00008827969,0.0001218592],"category_scores_gemma":[0.000783988,0.0001655716,0.00004011333,0.0001146142,0.000136202,0.0002738724,0.0001465208,0.0004674572,0.00003174567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002026652,"about_ca_system_score_gemma":0.0001052884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001803377,"about_ca_topic_score_gemma":0.0001057335,"domain_scores_codex":[0.9984047,0.00007189756,0.0004866121,0.0003886673,0.000419896,0.0002282707],"domain_scores_gemma":[0.9986982,0.0002899808,0.0001451863,0.0002471116,0.0005123075,0.0001072129],"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.00002322304,0.0000483832,0.00005049237,0.000008000456,0.00001530806,0.00001120271,0.002524544,0.005302793,0.02497779,0.7165547,0.00002183716,0.2504617],"study_design_scores_gemma":[0.00002619096,0.00009163652,0.00001506873,0.00006272485,0.000004340907,0.00001380318,0.0005440806,0.8817701,0.01006932,0.1071056,0.0001333605,0.0001637884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06714629,0.00001676763,0.929545,0.000477826,0.0007904036,0.00007441006,0.00001737918,0.00006014245,0.001871805],"genre_scores_gemma":[0.9049788,0.00003858923,0.09464713,0.0000950042,0.00010064,0.000006277339,0.00000753983,0.000009971207,0.0001160502],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8764672,"threshold_uncertainty_score":0.6751815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144414892","doi":"","title":"HOP-MAP: Efficient Message Passing with High Order Potentials","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Message passing; Inference; Computer science; Hop (telecommunications); Probabilistic logic; Maximum a posteriori estimation; A priori and a posteriori; Class (philosophy); Theoretical computer science; Representation (politics); Exponential function; Algorithm; Artificial intelligence; Distributed computing; Mathematics; Computer network; Maximum likelihood","retraction":null,"screen_n_in":null,"score":{"opus":0.05460748480378558,"gpt":0.3106988401195279,"spread":0.2560913553157423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003456089,0.0002301272,0.0001930131,0.0001508986,0.0002181952,0.0008180711,0.0007185209,0.00009582109,0.0002812993],"category_scores_gemma":[0.0001825577,0.0001905365,0.00002363981,0.0001847902,0.0002541412,0.000194013,0.000133434,0.0004095552,0.0001403977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001991044,"about_ca_system_score_gemma":0.000175357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000117134,"about_ca_topic_score_gemma":0.0001781423,"domain_scores_codex":[0.9981597,0.00005819529,0.0003917781,0.0005329041,0.0005552983,0.0003021333],"domain_scores_gemma":[0.9983953,0.0002327238,0.0001537861,0.0003392127,0.0007198287,0.0001591285],"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.00002877441,0.00009188397,0.00001848606,0.000004497702,0.00001802461,0.00003286414,0.0002363079,0.00107728,0.004927258,0.852735,0.00005597567,0.1407736],"study_design_scores_gemma":[0.00005629953,0.0001962348,0.0001800096,0.00006478725,0.00001119454,0.00002798963,0.0001574461,0.710277,0.009386385,0.2790434,0.0002553879,0.0003438433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01273033,0.000006503464,0.9808627,0.002859628,0.001178117,0.0001117608,0.00007347546,0.00008984827,0.002087595],"genre_scores_gemma":[0.8261513,0.0000218906,0.1732695,0.0002665581,0.0001017762,0.00001154137,0.00001888272,0.00001031689,0.0001482479],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.813421,"threshold_uncertainty_score":0.7888679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W193851967","doi":"","title":"Tempered Markov Chain Monte Carlo for training of Restricted Boltzmann Machines","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Markov chain Monte Carlo; Boltzmann machine; Monte Carlo method; Computer science; Statistical physics; Markov chain; Markov chain mixing time; Parallel tempering; Boltzmann constant; Direct simulation Monte Carlo; Monte Carlo molecular modeling; Markov model; Markov property; Artificial intelligence; Dynamic Monte Carlo method; Mathematics; Physics; Machine learning; Artificial neural network; Statistics; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.0921970941412643,"gpt":0.3253742672901905,"spread":0.2331771731489262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002765633,0.0001533968,0.0001989023,0.0001319117,0.0001186665,0.0001904525,0.0005074232,0.00006807501,0.00007244058],"category_scores_gemma":[0.0007862357,0.0001398412,0.0000453419,0.0001156508,0.0001496784,0.0001767307,0.00007343703,0.0001640173,0.000004648874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009849319,"about_ca_system_score_gemma":0.00009242984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001137877,"about_ca_topic_score_gemma":0.0003547971,"domain_scores_codex":[0.9987757,0.000051809,0.0004062986,0.000327701,0.0002462465,0.0001922035],"domain_scores_gemma":[0.9984714,0.000541675,0.0001720759,0.0002031046,0.0005316928,0.00008004659],"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.00006749313,0.00004484468,0.00002979235,0.000005369207,0.00002492884,0.000003560923,0.0006487055,0.0004325627,0.01391554,0.6157774,0.0002102372,0.3688395],"study_design_scores_gemma":[0.00005242021,0.0001737919,0.0003180912,0.00002424936,0.00000754367,0.000003944853,0.0002682314,0.9033294,0.007051245,0.08817594,0.0004358801,0.0001592686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007162992,0.000009414968,0.9887243,0.001231068,0.001134171,0.0001905264,0.000289495,0.00002587744,0.001232161],"genre_scores_gemma":[0.8271466,0.00004065939,0.1723546,0.00009320805,0.0001630629,0.00001883371,0.00001464418,0.000007062277,0.0001612667],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9028968,"threshold_uncertainty_score":0.570256,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170307371","doi":"","title":"On correlation and budget constraints in model-based bandit optimization with application to automatic machine learning","year":2014,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Frequentist inference; Bayesian optimization; Computer science; Machine learning; Bayesian probability; Artificial intelligence; Constraint (computer-aided design); Feature (linguistics); Function (biology); Mathematical optimization; Bayesian inference; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.100663809997761,"gpt":0.4084052332996377,"spread":0.3077414233018767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027689,0.000152706,0.0001872088,0.000474108,0.0001292304,0.0002927018,0.0002332084,0.00005968089,0.0002514753],"category_scores_gemma":[0.003545202,0.0001246847,0.00001150242,0.0002898249,0.0002261836,0.0001500004,0.00003883908,0.0002407994,0.00007836451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006312464,"about_ca_system_score_gemma":0.00007198884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000268961,"about_ca_topic_score_gemma":0.0002606476,"domain_scores_codex":[0.9977874,0.000159489,0.0004830483,0.0004707915,0.0009197857,0.0001794468],"domain_scores_gemma":[0.9971771,0.001868611,0.0001681678,0.0001638054,0.0005014008,0.0001209432],"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.0001284999,0.00003647511,0.0002756029,0.000002016048,0.000002307793,0.000001726444,0.0001289168,0.6343229,0.00003154029,0.1309274,0.000007707282,0.234135],"study_design_scores_gemma":[0.00009329148,0.0003511424,0.0002989195,0.00004482931,0.000002434735,0.000002225305,0.0001595191,0.8606589,0.0001701428,0.1380725,0.00002229363,0.0001237989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004389176,0.00000202369,0.9934682,0.0007588559,0.0000719133,0.0002859669,0.00008504647,0.00002322086,0.0009156473],"genre_scores_gemma":[0.9234951,0.00001025836,0.07606488,0.0001933581,0.00002124999,0.00003325807,0.00006847082,0.00001021523,0.0001032279],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9191059,"threshold_uncertainty_score":0.5084496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2289330286","doi":"","title":"A Spike and Slab Restricted Boltzmann Machine","year":2011,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Boltzmann machine; Spike (software development); Slab; Restricted Boltzmann machine; Computer science; Block (permutation group theory); Boltzmann equation; Boltzmann constant; Lattice Boltzmann methods; Support vector machine; Artificial intelligence; Pattern recognition (psychology); Algorithm; Mathematics; Physics; Artificial neural network; Geometry; Mechanics; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.126799832973073,"gpt":0.3056727456217436,"spread":0.1788729126486707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001475148,0.0001527186,0.0001376985,0.0001159936,0.0001256163,0.0002394414,0.0003775768,0.00004909129,0.0002198274],"category_scores_gemma":[0.0002141156,0.0001372434,0.0000187389,0.0001149279,0.0001539852,0.0002445484,0.000148274,0.0001333888,0.00005104703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001423602,"about_ca_system_score_gemma":0.00004055802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002050756,"about_ca_topic_score_gemma":0.0001246891,"domain_scores_codex":[0.9988884,0.00006846244,0.0002827203,0.0003594462,0.0002212666,0.0001797162],"domain_scores_gemma":[0.9992199,0.0001544573,0.0000939965,0.0001806378,0.0002446488,0.000106379],"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.00003888924,0.00004752314,0.00007938935,0.000001885952,0.00001638213,0.00002363988,0.0005764265,0.00001693255,0.0004783371,0.7740325,0.0001446881,0.2245434],"study_design_scores_gemma":[0.00004394424,0.0002770232,0.001638648,0.00002740237,0.000009180082,0.000016095,0.0001827269,0.6229757,0.004938458,0.3690056,0.0006493431,0.000235877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001133481,0.00003819344,0.987921,0.0006483101,0.0004627723,0.00009211621,0.00007481554,0.0000378696,0.009591462],"genre_scores_gemma":[0.8833429,0.0003401385,0.115744,0.0002715449,0.00007086504,0.000007126473,0.00001119834,0.000006025498,0.0002061789],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8822094,"threshold_uncertainty_score":0.5596623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2622730215","doi":"","title":"Discovering and Exploiting Additive Structure for Bayesian Optimization","year":2017,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Bayesian probability; Bayesian optimization; Artificial intelligence; Data mining; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.074198638650729,"gpt":0.3368367995968381,"spread":0.2626381609461091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001099467,0.0001489277,0.0001336606,0.00007199556,0.0005189747,0.001644422,0.0005623475,0.00005373169,0.00006571144],"category_scores_gemma":[0.0005384061,0.0001393455,0.00001740341,0.00002923596,0.0001649181,0.0006806724,0.0001680048,0.0001053114,0.000002617309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002002152,"about_ca_system_score_gemma":0.00006416276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002980078,"about_ca_topic_score_gemma":0.00007591552,"domain_scores_codex":[0.9989836,0.00001644947,0.0002459218,0.0003824754,0.0001900654,0.0001814794],"domain_scores_gemma":[0.9990045,0.0001868427,0.0002178368,0.000228529,0.0002784054,0.00008382262],"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.00002033594,0.0000112607,0.0000451669,0.000009853128,0.000009537784,0.00000427222,0.0003255765,0.0003810491,0.0001119154,0.7500687,0.00001965084,0.2489927],"study_design_scores_gemma":[0.00003227192,0.00008702507,0.0002150643,0.00005854385,0.000004043278,0.000006972921,0.0002359012,0.6418862,0.001497781,0.3557843,0.00005530527,0.0001365693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000682515,0.000007214557,0.9950086,0.00166119,0.000380085,0.0001402207,0.0003908032,0.00002510136,0.001704245],"genre_scores_gemma":[0.7770833,0.0001152906,0.2225188,0.00009786808,0.00008976611,0.00001337603,0.00002573492,0.000006235746,0.00004969298],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7764007,"threshold_uncertainty_score":0.999392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2798888671","doi":"","title":"Linear Stochastic Approximation: How Far Does Constant Step-Size and Iterate Averaging Go?","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Constant (computer programming); Applied mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06654015255569296,"gpt":0.3147389566761767,"spread":0.2481988041204837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002790701,0.0002128751,0.00018282,0.0001693396,0.0002202871,0.0007357004,0.0004322325,0.00006523228,0.0001235996],"category_scores_gemma":[0.0007130423,0.0001802949,0.00001975448,0.0001648437,0.0004505068,0.0003654795,0.0001745895,0.0001539945,0.00003476945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003970094,"about_ca_system_score_gemma":0.00007151312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001377351,"about_ca_topic_score_gemma":0.00002821358,"domain_scores_codex":[0.9984599,0.00006295521,0.0003585904,0.0004942582,0.0003919046,0.000232375],"domain_scores_gemma":[0.9982053,0.0005078003,0.0001800627,0.0002363386,0.0007482029,0.0001222873],"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.00003217587,0.00003480419,0.00001426778,0.000006622837,0.00001754881,0.000007440643,0.0007745401,0.00008187721,0.000327812,0.9290766,0.00008335652,0.06954303],"study_design_scores_gemma":[0.00004212391,0.0001953917,0.00003071262,0.00006210837,0.000006176498,0.00001939813,0.0002440128,0.7577154,0.001589565,0.2397873,0.0001163041,0.0001915195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005296533,0.00001140072,0.9943765,0.00244538,0.0007292287,0.0002269142,0.0001153065,0.0001280323,0.001437597],"genre_scores_gemma":[0.6976997,0.000054228,0.3015374,0.0003408241,0.0001180311,0.00001908534,0.00001298721,0.000009031702,0.0002087329],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7576335,"threshold_uncertainty_score":0.7352213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037467471","doi":"","title":"Optimization Methods for Interpretable Differentiable Decision Trees Applied to Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Differentiable function; Artificial intelligence; Computer science; Decision tree; Machine learning; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.119486721409573,"gpt":0.3891250946442423,"spread":0.2696383732346694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005333195,0.0002777409,0.0003048142,0.0002107343,0.0002828102,0.0008001918,0.0009480398,0.00008848518,0.000355646],"category_scores_gemma":[0.00166922,0.0002769208,0.00005617124,0.0003408766,0.00007679058,0.0003610577,0.0003320014,0.0002214307,0.0001444947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007642848,"about_ca_system_score_gemma":0.00008293344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002852261,"about_ca_topic_score_gemma":0.00002941455,"domain_scores_codex":[0.9976686,0.00009265255,0.0007137721,0.0007300209,0.000400184,0.0003947581],"domain_scores_gemma":[0.9976984,0.0009778774,0.0001908091,0.0002588972,0.0005732987,0.0003006918],"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.0001894194,0.0000307662,0.000003480498,0.000006897231,0.00001729041,0.000001447624,0.0009758162,0.2389711,0.002429908,0.505233,0.0001845996,0.2519562],"study_design_scores_gemma":[0.00004207273,0.0005356396,0.000004470387,0.00004262568,0.000009797623,0.000001349291,0.0006850243,0.8677044,0.02463484,0.1041531,0.001916012,0.0002706771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001309084,0.00001059357,0.9926955,0.002476905,0.0004605241,0.0005602703,0.00002237621,0.0001246187,0.00351834],"genre_scores_gemma":[0.4270589,0.00006312189,0.5714808,0.001014411,0.00008501841,0.0000863987,0.00003436273,0.00001539456,0.0001616447],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6287332,"threshold_uncertainty_score":0.9999683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037971676","doi":"","title":"Scalable Gradients for Stochastic Differential Equations","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Stochastic differential equation; Stochastic partial differential equation; Computer science; Applied mathematics; Ordinary differential equation; Differential equation; Mathematics; Scalability; Sensitivity (control systems); Mathematical optimization; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1583036032922305,"gpt":0.3499637908190082,"spread":0.1916601875267778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003701502,0.0001172754,0.0001153234,0.00003642112,0.0001279383,0.0001342106,0.000130904,0.00002476824,0.001585283],"category_scores_gemma":[0.00007025038,0.0001127871,0.00003667069,0.00005173912,0.00007463908,0.00006925733,0.0000275895,0.0001084118,0.00006674387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008500246,"about_ca_system_score_gemma":0.00002888604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001497795,"about_ca_topic_score_gemma":0.000003264383,"domain_scores_codex":[0.9991913,0.00001917429,0.0002438723,0.0002373461,0.000158799,0.0001494675],"domain_scores_gemma":[0.9993764,0.0001850069,0.00007526729,0.00005845785,0.0001801568,0.0001247602],"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.0001049223,0.00006023329,0.0000144008,0.000002849799,0.00002566642,3.46813e-7,0.0001827836,0.002591059,0.0003850516,0.9047673,0.0005734587,0.0912919],"study_design_scores_gemma":[0.00005143353,0.0001113011,0.00001097054,0.00001068892,0.00001337089,2.693789e-7,0.0002589929,0.8096203,0.0006227221,0.1889951,0.0001920887,0.000112728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002325355,0.000002537374,0.9933671,0.001609781,0.0004988359,0.0001840596,0.0005738411,0.00001859098,0.001419927],"genre_scores_gemma":[0.9964086,0.000005091938,0.002397182,0.0002004015,0.0004801803,0.000035536,0.0001988358,0.000009241055,0.0002648718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9940833,"threshold_uncertainty_score":0.9993274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037881973","doi":"","title":"RelatIF: Identifying Explanatory Training Samples via Relative Influence","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Outlier; Computer science; Machine learning; Constraint (computer-aided design); Class (philosophy); Training (meteorology); Artificial intelligence; Econometrics; Mathematics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.2680933203368275,"gpt":0.3703719702066749,"spread":0.1022786498698474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002928786,0.0001667156,0.0001583408,0.000108559,0.0001913696,0.0004154711,0.0006455621,0.00006494222,0.0001230538],"category_scores_gemma":[0.001215817,0.0001678694,0.00002657004,0.0001803732,0.0001313204,0.0007023285,0.0001380579,0.000348748,0.0002393553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000308419,"about_ca_system_score_gemma":0.0000846248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005361393,"about_ca_topic_score_gemma":0.00002924796,"domain_scores_codex":[0.9983414,0.0001214003,0.00043246,0.0004973377,0.0004142366,0.0001930954],"domain_scores_gemma":[0.9986769,0.0005056251,0.0002027601,0.0002042376,0.0002483103,0.0001621418],"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.0000211328,0.00001449486,0.0001517396,0.000005881813,0.00001445579,0.00001285894,0.003399819,0.0003050629,0.001048617,0.7731393,0.00005510506,0.2218316],"study_design_scores_gemma":[0.00003577042,0.0001402641,0.001760643,0.00005210378,0.000007166439,0.000009859763,0.0009738897,0.659647,0.0007052916,0.3350254,0.001400925,0.000241697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001513022,0.00002095187,0.9887015,0.005533937,0.000263662,0.00009048685,0.00008615806,0.0001081742,0.003682108],"genre_scores_gemma":[0.9146397,0.00009388525,0.08412224,0.0009129306,0.0000816258,0.000009782701,0.00006909127,0.000008229452,0.00006256165],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9131266,"threshold_uncertainty_score":0.6845514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2416891345","doi":"","title":"Online and distributed Bayesian moment matching for parameter learning in sum-product networks","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Moment (physics); Matching (statistics); Computer science; Bayesian network; Bayesian probability; Product (mathematics); Artificial intelligence; Machine learning; Mathematics; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.09218863346414675,"gpt":0.3382280818462473,"spread":0.2460394483821005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003599397,0.0001681195,0.0001749621,0.0001175453,0.00009901765,0.0002735133,0.0003259079,0.00005656742,0.00002090557],"category_scores_gemma":[0.0003382007,0.000132369,0.00002119719,0.00009386105,0.000107625,0.0002131745,0.0001077519,0.0001736975,0.000004890437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004443272,"about_ca_system_score_gemma":0.00004947669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004829188,"about_ca_topic_score_gemma":0.0001472791,"domain_scores_codex":[0.9985895,0.00006871889,0.0004015322,0.0004735551,0.0001989902,0.0002677299],"domain_scores_gemma":[0.9987927,0.0006454353,0.0001073957,0.000151089,0.0002061893,0.00009717863],"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.00003970922,0.00005709791,0.0002822528,0.000004571617,0.000008751076,0.000005638088,0.0001538667,0.001618069,0.000282773,0.5960744,0.00002382611,0.401449],"study_design_scores_gemma":[0.00005342605,0.0001319875,0.0005495134,0.00009890134,0.000002904044,0.000004961036,0.00009602913,0.68058,0.0002799817,0.3179552,0.00009258957,0.0001545461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008538837,0.00002627811,0.9870208,0.003709714,0.0002931602,0.0001410801,0.0001564386,0.00004337223,0.0000703547],"genre_scores_gemma":[0.9357091,0.0003143611,0.06359411,0.0001538717,0.00007360541,0.00002077168,0.00004145404,0.000007499431,0.00008526871],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9271702,"threshold_uncertainty_score":0.5397849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3090986099","doi":"","title":"Accelerated Stochastic Power Iteration","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Power (physics); Mathematical optimization; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.09359267841454008,"gpt":0.3200912996233732,"spread":0.2264986212088331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001269339,0.0001751769,0.0001245826,0.0001581783,0.000102753,0.000263709,0.0001939927,0.00007107656,0.00166752],"category_scores_gemma":[0.000108815,0.0001729237,0.00001560968,0.000124301,0.0001685482,0.0002198765,0.00002357396,0.0001547401,0.0007899513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005327768,"about_ca_system_score_gemma":0.00003285346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000872386,"about_ca_topic_score_gemma":0.00003309771,"domain_scores_codex":[0.9989574,0.00002108997,0.000332313,0.0002136221,0.0002678164,0.0002077407],"domain_scores_gemma":[0.9992535,0.0001024759,0.00004304398,0.0001310099,0.0003894703,0.00008055482],"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.0001273008,0.00006303805,0.0000247298,0.00001031703,0.00006015091,0.00001349499,0.001293149,0.006609265,0.01210752,0.8787088,0.002200416,0.09878183],"study_design_scores_gemma":[0.00003941981,0.0002534904,0.000206835,0.00004688281,0.000007891603,0.000008190093,0.0002183296,0.9486388,0.01562114,0.0343014,0.0004036491,0.0002539895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02337085,0.00001091121,0.9629115,0.0001670192,0.001506943,0.0001303099,0.0001427684,0.000138695,0.01162098],"genre_scores_gemma":[0.9963441,0.00004393133,0.002979326,0.0001347701,0.0002213046,0.00001366362,0.00005385468,0.00002045508,0.0001886185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9729732,"threshold_uncertainty_score":0.999988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2183286887","doi":"","title":"Learning from Weak Teachers","year":2012,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sample complexity; Intuition; Crowdsourcing; Machine learning; Artificial intelligence; Sample (material); Homogeneous; Parametric statistics; Probably approximately correct learning; Quality (philosophy); Generality; Active learning (machine learning); Algorithmic learning theory; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09309872800627544,"gpt":0.3426236158681678,"spread":0.2495248878618923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000309412,0.0001394288,0.0001180003,0.00008906594,0.0001458864,0.0003111729,0.0004378357,0.00005276934,0.0004058749],"category_scores_gemma":[0.0003916434,0.0001307097,0.00002432191,0.00008303591,0.00007785568,0.0002896796,0.0001174023,0.0003433905,0.0003688341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002651364,"about_ca_system_score_gemma":0.00003119081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001895624,"about_ca_topic_score_gemma":0.00001664805,"domain_scores_codex":[0.9988082,0.0001111257,0.000246273,0.0002614428,0.0003236865,0.0002492411],"domain_scores_gemma":[0.9991454,0.0003489241,0.00009791403,0.000149963,0.0001162232,0.0001415674],"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.000006323718,0.0000404002,0.0008025734,6.677058e-7,0.00001210148,0.00000249308,0.001410936,0.0001744736,0.000175333,0.6024501,0.0001166386,0.394808],"study_design_scores_gemma":[0.0000353201,0.0001613236,0.002265137,0.00003251733,0.000007078364,0.000008269565,0.001278908,0.8263167,0.001095755,0.1625578,0.005947777,0.0002934585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005018708,0.00003128225,0.9786525,0.001305812,0.001045658,0.00004535596,0.00002409781,0.00008809278,0.0137885],"genre_scores_gemma":[0.9222162,0.00007509137,0.07637784,0.0001826978,0.0003172478,0.00000545722,0.0000331979,0.000007296912,0.0007849185],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9171975,"threshold_uncertainty_score":0.5330188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037721576","doi":"","title":"A Tight and Unified Analysis of Gradient-Based Methods for a Whole Spectrum of Differentiable Games.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Differentiable function; Computer science; Spectrum (functional analysis); Mathematical optimization; Mathematics; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1016578330645837,"gpt":0.3708106973623068,"spread":0.2691528642977231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002861764,0.0001107579,0.0002803839,0.0002007258,0.0000425041,0.00008187929,0.0003414378,0.00003552119,0.0000898568],"category_scores_gemma":[0.0002694097,0.0001007316,0.0000578118,0.0003184533,0.0001493265,0.00007708731,0.00006516626,0.00006773847,0.000001503861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007381531,"about_ca_system_score_gemma":0.00004924826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002551082,"about_ca_topic_score_gemma":0.00002041209,"domain_scores_codex":[0.998967,0.00008620006,0.0003849834,0.0002794469,0.0001631587,0.0001191994],"domain_scores_gemma":[0.9987391,0.0006285221,0.000194348,0.0001366108,0.0002160727,0.00008533469],"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.00009701211,0.00006216561,0.00004490451,0.0000248288,0.0001532569,0.000001164269,0.0004783215,0.0003108494,0.002869231,0.9150501,0.00001587877,0.08089225],"study_design_scores_gemma":[0.00004449851,0.0002385933,0.0001304469,0.00001402734,0.00007343678,2.879266e-7,0.000106557,0.7719403,0.0279483,0.1992869,0.0001346548,0.00008202227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003074492,0.00002002367,0.9947113,0.001376953,0.0001017001,0.0001152639,0.0003454928,0.00001314446,0.0002415654],"genre_scores_gemma":[0.7584015,0.00002883027,0.24135,0.0001206013,0.00001674173,0.000006638856,0.00003132392,0.000003459315,0.00004097414],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7716295,"threshold_uncertainty_score":0.4107714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963848397","doi":"","title":"{Accurate and conservative estimates of MRF log-likelihood using reverse annealing}","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Estimator; Markov chain Monte Carlo; Mathematics; Markov chain; Markov random field; Statistics; Partition (number theory); Upper and lower bounds; Algorithm; Simulated annealing; Computer science; Artificial intelligence; Combinatorics; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.2588405899942396,"gpt":0.4020975121392004,"spread":0.1432569221449608,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004950748,0.0001431179,0.0001981999,0.0001043882,0.00006027895,0.0001643646,0.0002909038,0.00005758151,0.00001762791],"category_scores_gemma":[0.0005949202,0.0001312615,0.00001716321,0.0001083892,0.0002256556,0.000244992,0.0001233943,0.0001191008,0.000006076429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002301292,"about_ca_system_score_gemma":0.0001630267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000178176,"about_ca_topic_score_gemma":0.00003708719,"domain_scores_codex":[0.9988272,0.00008992125,0.0003677613,0.0002970271,0.000255767,0.0001623934],"domain_scores_gemma":[0.9985116,0.0003472567,0.0001899718,0.0001535405,0.0006589853,0.0001386648],"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.00004403931,0.0000315844,0.00008411931,0.000008166104,0.00001840787,0.00001514388,0.00110818,0.00009499122,0.0007164133,0.8903719,0.0000934821,0.1074136],"study_design_scores_gemma":[0.00002970878,0.0001033433,0.00003637369,0.00004162163,0.000006079908,0.00001224224,0.0002213217,0.499337,0.003136988,0.4969505,0.0000357334,0.00008902761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004607025,0.00004644236,0.9928189,0.0007576594,0.0003638782,0.00009290557,0.0001332286,0.0000194448,0.001160544],"genre_scores_gemma":[0.4240721,0.00007645805,0.5755867,0.000204531,0.00002809194,0.000002172124,0.000007334832,0.000004436123,0.00001813861],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.499242,"threshold_uncertainty_score":0.535269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101806650","doi":"","title":"{PAC-Bayesian Theory for Transductive Learning}","year":2014,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Université de Moncton","funders":"","keywords":"Artificial intelligence; Bayesian probability; Generalization; Computer science; Generalization error; Machine learning; Probably approximately correct learning; Inductive bias; Multi-task learning; Stability (learning theory); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05392569779190722,"gpt":0.3345362810595931,"spread":0.2806105832676859,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000617075,0.0001467646,0.0001417228,0.0001081206,0.0001896795,0.0002985329,0.000457824,0.00005124329,0.0001193674],"category_scores_gemma":[0.0007932961,0.0001351171,0.00003784299,0.00007547474,0.0001191391,0.0001347493,0.00004254268,0.0002209067,0.00004625225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001691594,"about_ca_system_score_gemma":0.00003975243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001639027,"about_ca_topic_score_gemma":0.00001785917,"domain_scores_codex":[0.998777,0.0001600314,0.0002548973,0.0003678689,0.0002413151,0.0001989135],"domain_scores_gemma":[0.9985589,0.0008491662,0.00009717409,0.0001475663,0.0002614926,0.00008569567],"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.00003533668,0.00002580536,0.000007580096,0.000003034935,0.00001078901,0.000001139403,0.0005358086,0.0003307824,0.00008619828,0.605359,0.00004716298,0.3935573],"study_design_scores_gemma":[0.00002617952,0.000252527,0.000027432,0.0000114442,0.000003485837,0.000003550845,0.0001670625,0.5146558,0.0006064668,0.4822201,0.001918014,0.0001079888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002253569,0.000006458156,0.9900933,0.002041268,0.0006096329,0.0001096832,0.00003809278,0.00007461647,0.006801603],"genre_scores_gemma":[0.8662564,0.00002685993,0.1321829,0.0003449728,0.000220177,0.0000145693,0.00002727015,0.000009764636,0.0009170908],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.866031,"threshold_uncertainty_score":0.5509917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W39904068","doi":"","title":"A simple sketching algorithm for entropy estimation over streaming data.","year":2013,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Rényi entropy; Estimator; Mathematics; Entropy (arrow of time); Maximum entropy probability distribution; Min entropy; Joint entropy; Entropy estimation; Shannon's source coding theorem; Streaming algorithm; Computation; Upper and lower bounds; Entropy rate; Applied mathematics; Algorithm; Principle of maximum entropy; Statistics; Joint quantum entropy; Maximum entropy thermodynamics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1188387014756424,"gpt":0.3807147191308058,"spread":0.2618760176551633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002578376,0.0001612653,0.0001397202,0.0001311949,0.0001330752,0.0008885598,0.001163695,0.00005193686,0.0001556188],"category_scores_gemma":[0.0005012244,0.0001574168,0.00001796541,0.00008338628,0.00007857991,0.0009755577,0.0003676044,0.0001163458,0.00006168478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000039534,"about_ca_system_score_gemma":0.00006538631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002842555,"about_ca_topic_score_gemma":0.00003547802,"domain_scores_codex":[0.9986047,0.0000369915,0.0003354569,0.0004909613,0.0003114235,0.0002205226],"domain_scores_gemma":[0.9984549,0.0005224516,0.0001537255,0.0004892339,0.0002982066,0.0000814324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002874065,0.00003345032,0.000008795458,0.000002495448,0.000008815592,0.000001723862,0.00008325766,0.00001725157,0.0001342856,0.4560744,0.001129074,0.5425036],"study_design_scores_gemma":[0.00001921262,0.00008036389,0.0001026779,0.00002264649,0.000003808596,0.000003031879,0.00007954017,0.6555883,0.0009859368,0.3426429,0.0003571319,0.0001144446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007041552,0.000004114479,0.9964786,0.0006440799,0.0002951734,0.0002945998,0.001096543,0.0001175448,0.0003651971],"genre_scores_gemma":[0.272797,0.00003122575,0.7262564,0.0001533315,0.00007240252,0.00004791821,0.0005889151,0.000008444783,0.00004433798],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.655571,"threshold_uncertainty_score":0.8568403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W213438331","doi":"","title":"{Near-optimal max-affine estimators for convex regression}","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Affine transformation; Estimator; Applied mathematics; Logarithm; Lipschitz continuity; Mathematical optimization; Nonlinear regression; Convex function; Affine combination; Rate of convergence; Regular polygon; Regression analysis; Statistics; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1741243008509181,"gpt":0.3612388527655024,"spread":0.1871145519145844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000128528,0.0001572451,0.0001573836,0.00007246235,0.00006252304,0.0001731103,0.0001686052,0.000068332,0.0001501491],"category_scores_gemma":[0.0002551952,0.0001451571,0.00002364187,0.00004847455,0.0001277668,0.00007814135,0.00003088213,0.0001170005,0.00004842061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003736885,"about_ca_system_score_gemma":0.00004702343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001784789,"about_ca_topic_score_gemma":0.00001719359,"domain_scores_codex":[0.9991553,0.00001559341,0.0002648279,0.0001869633,0.0002099054,0.0001673736],"domain_scores_gemma":[0.9992023,0.0001588773,0.00004671699,0.0001205924,0.0003602473,0.0001112912],"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.0002009562,0.00005540938,0.00005010748,0.0000111635,0.00005034296,0.00002592842,0.0005171562,0.01386386,0.001385941,0.7571323,0.01217751,0.2145293],"study_design_scores_gemma":[0.00004188465,0.0001506412,0.00001807003,0.00005656895,0.000009300771,0.000009637341,0.000272024,0.860907,0.01444525,0.1201102,0.003801503,0.0001779881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01162057,0.000026311,0.9803724,0.0003299037,0.0008282028,0.0001611689,0.0002084663,0.0002109581,0.006241991],"genre_scores_gemma":[0.9040152,0.00006810165,0.09545384,0.00009419806,0.0001210992,0.0000209083,0.00006586169,0.00001988026,0.0001409246],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8923946,"threshold_uncertainty_score":0.5919335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962994149","doi":"","title":"Connecting Weighted Automata and Recurrent Neural Networks through Spectral Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Recurrent neural network; Computer science; Connection (principal bundle); Automaton; Algorithm; Extension (predicate logic); Rank (graph theory); Artificial neural network; Artificial intelligence; Theoretical computer science; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.08167116604847909,"gpt":0.3369207155138802,"spread":0.2552495494654011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002899765,0.000175874,0.0001560144,0.00007616683,0.0002915208,0.0005808105,0.0004276358,0.0000597155,0.000161295],"category_scores_gemma":[0.000220378,0.0001633971,0.00002134362,0.0001231072,0.0002052605,0.0003408541,0.0002067898,0.0002640775,0.00003587899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002402604,"about_ca_system_score_gemma":0.00002378219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004531478,"about_ca_topic_score_gemma":0.00007083135,"domain_scores_codex":[0.9986177,0.00009900077,0.0003335896,0.0004333841,0.0002521818,0.0002641313],"domain_scores_gemma":[0.9989913,0.0003931607,0.0001392688,0.0001699513,0.0002218265,0.00008451606],"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.00002485861,0.00002530478,0.0000403767,0.000002262542,0.00001114431,0.00001177544,0.0006830276,0.00008331128,0.00009918405,0.6640102,0.00004056439,0.334968],"study_design_scores_gemma":[0.00003242551,0.0002943363,0.000112723,0.00003721724,0.000004071785,0.00003177964,0.0003792321,0.7864067,0.0007277475,0.2115308,0.0002856143,0.0001574036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02908644,0.00003445041,0.9659364,0.0009158768,0.001100984,0.00008327499,0.000021555,0.0001367288,0.002684335],"genre_scores_gemma":[0.9592342,0.0001936129,0.03995382,0.0002553908,0.000288368,0.000003879351,0.00001910971,0.000009032746,0.00004252267],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9301478,"threshold_uncertainty_score":0.6663138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962791800","doi":"","title":"Conjugate-Computation Variational Inference : Converting Variational Inference in Non-Conjugate Models to Inferences in Conjugate Models","year":2017,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjugate gradient method; Conjugate residual method; Gradient descent; Conjugate; Derivation of the conjugate gradient method; Convergence (economics); Mathematics; Inference; Computation; Stochastic gradient descent; Nonlinear conjugate gradient method; Biconjugate gradient method; Computer science; Mathematical optimization; Applied mathematics; Algorithm; Artificial intelligence; Artificial neural network; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1595042624709313,"gpt":0.3705196349275402,"spread":0.2110153724566089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001280563,0.0004320637,0.0004789887,0.0006820573,0.0004690498,0.001854426,0.001529203,0.0001844116,0.0001549024],"category_scores_gemma":[0.001904403,0.0004693875,0.00005272078,0.0003101055,0.0002617839,0.002327568,0.0004658474,0.0005745757,0.0001622917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001811436,"about_ca_system_score_gemma":0.0005387301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001318561,"about_ca_topic_score_gemma":0.001955328,"domain_scores_codex":[0.9959285,0.0002316003,0.001306158,0.0009995756,0.0009574031,0.0005767887],"domain_scores_gemma":[0.9961138,0.001555294,0.0006485477,0.0004698263,0.0009434969,0.0002690514],"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.0001012145,0.000111325,0.0008653475,0.00001026984,0.00001787165,0.00002988677,0.003193832,0.2234535,0.0002292987,0.717582,0.00001058618,0.05439488],"study_design_scores_gemma":[0.0001700722,0.000101556,0.005096985,0.0001406288,0.000003312882,0.000002399802,0.000293275,0.5685103,0.0001183244,0.4252475,0.00001410112,0.0003015413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01059232,0.000008222618,0.9762087,0.002909504,0.0008494092,0.0004609989,0.0001289592,0.00006252086,0.008779327],"genre_scores_gemma":[0.9270052,0.0001147305,0.07175419,0.0007452224,0.00008344939,0.00008423846,0.00008135126,0.00001825978,0.0001133641],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9164129,"threshold_uncertainty_score":0.9997758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037571487","doi":"","title":"Value Preserving State-Action Abstractions","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Value (mathematics); State (computer science); Action (physics); Programming language; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.2378914496979285,"gpt":0.3741205699300081,"spread":0.1362291202320796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001442417,0.0001386996,0.0001137312,0.00007962517,0.0001460135,0.0005362493,0.0005671955,0.00004300163,0.0003368287],"category_scores_gemma":[0.0004273273,0.0001433702,0.00002466306,0.0001183768,0.00007549416,0.0004266227,0.0001499639,0.000255421,0.0003660564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000373681,"about_ca_system_score_gemma":0.00007477702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005140958,"about_ca_topic_score_gemma":0.00001825552,"domain_scores_codex":[0.9986442,0.00005265069,0.0003645326,0.0003332616,0.0004204338,0.0001848655],"domain_scores_gemma":[0.9990258,0.0002501527,0.0001464699,0.000170865,0.0002636519,0.0001430561],"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.0000255792,0.00002141108,0.00003442695,0.000007740223,0.00001866919,0.00001222256,0.0007064152,0.1278758,0.0008141842,0.8014607,0.0003316262,0.06869115],"study_design_scores_gemma":[0.00002025178,0.0001673975,0.0002276003,0.00001584192,0.000003743577,0.000004462065,0.0002621328,0.9239734,0.002068251,0.07173079,0.001380387,0.0001457126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004589524,0.00000415901,0.9844529,0.005759501,0.0006266981,0.0001046169,0.00003407921,0.0001014268,0.008457677],"genre_scores_gemma":[0.9311973,0.0001494539,0.0673078,0.0008695347,0.0001198714,0.000008015429,0.0000222427,0.000009185019,0.000316607],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9307383,"threshold_uncertainty_score":0.5846468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2798463223","doi":"","title":"Statistical Sparse Online Regression: A Diffusion Approximation Perspective.","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Perspective (graphical); Diffusion; Computer science; Regression; Regression analysis; Statistics; Artificial intelligence; Machine learning; Econometrics; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1049720817424107,"gpt":0.3812492784967594,"spread":0.2762771967543487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002476609,0.0001718453,0.0001497946,0.0001479659,0.0002226049,0.0003322342,0.0004738279,0.00006445815,0.0004812311],"category_scores_gemma":[0.0007082617,0.0001441724,0.0000207565,0.0001410288,0.000262722,0.0001902077,0.0001639075,0.0001886226,0.0002437037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005329398,"about_ca_system_score_gemma":0.00007478808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001327858,"about_ca_topic_score_gemma":0.0001342877,"domain_scores_codex":[0.9984485,0.0001108419,0.0003248853,0.0004562092,0.0004484935,0.0002111066],"domain_scores_gemma":[0.998634,0.0002648863,0.0001255982,0.0002417109,0.0006105783,0.0001231896],"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.00005177185,0.000138918,0.00003669328,0.000002792324,0.000007715224,0.00001280602,0.0007673705,0.00001520725,0.0002250743,0.7191318,0.0003620951,0.2792478],"study_design_scores_gemma":[0.00003766594,0.000303227,0.000747996,0.00004502963,0.000003833987,0.00001480824,0.0005318539,0.6246865,0.000388387,0.3722167,0.0008796909,0.0001442624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004228161,0.000009034055,0.9829151,0.004112589,0.0006883318,0.000092305,0.0001222019,0.00008504734,0.007747207],"genre_scores_gemma":[0.8630796,0.000066131,0.1356966,0.0003748997,0.0003001564,0.000005600218,0.000057663,0.000007929149,0.0004113556],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8588514,"threshold_uncertainty_score":0.5879178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2390241580","doi":"","title":"Sequential Inference for Deep Gaussian Process","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; University of Toronto","funders":"","keywords":"Gaussian process; Inference; Computer science; Process (computing); Artificial intelligence; Machine learning; Gaussian","retraction":null,"screen_n_in":null,"score":{"opus":0.08939333074622631,"gpt":0.3665205894727141,"spread":0.2771272587264878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002415839,0.0002401404,0.0002004783,0.0001637394,0.0001811655,0.0005128012,0.0009908359,0.00009235807,0.0002885516],"category_scores_gemma":[0.0006426385,0.0001736695,0.00004320716,0.000151797,0.0002190498,0.0005438414,0.0001170503,0.0001108486,0.0001184573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004889447,"about_ca_system_score_gemma":0.0002251688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001119986,"about_ca_topic_score_gemma":0.00006833702,"domain_scores_codex":[0.9981113,0.00003954643,0.000475523,0.0006020498,0.000405266,0.0003663298],"domain_scores_gemma":[0.9981811,0.000510369,0.0001891533,0.0002833582,0.0006664972,0.0001695075],"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.00004360295,0.00004425968,0.00003745598,0.00001268471,0.00001255358,0.000006594724,0.0002191021,0.00001001563,0.0006226372,0.6529816,0.00004478812,0.3459647],"study_design_scores_gemma":[0.0000807853,0.0002932858,0.0001162816,0.00010945,0.00000696549,0.00001322048,0.0001346913,0.1174789,0.007513685,0.8735382,0.0004155565,0.0002989994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004118804,0.00001006524,0.9891099,0.005535972,0.0006685597,0.0002211678,0.0001927728,0.00008429998,0.003765368],"genre_scores_gemma":[0.9330574,0.0001282852,0.06599198,0.0003265624,0.0001414935,0.00007178215,0.00001356756,0.00001170822,0.0002572594],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9326455,"threshold_uncertainty_score":0.7082038,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2411304668","doi":"","title":"Scalable and Sound Low-Rank Tensor Learning","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Scalability; Computer science; Tensor (intrinsic definition); Rank (graph theory); Sound (geography); Mathematics; Acoustics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1441293292145125,"gpt":0.3819043419830679,"spread":0.2377750127685553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001685967,0.0001285016,0.0001350984,0.00008249983,0.0001576841,0.0001477286,0.0001236052,0.00005306995,0.0009145663],"category_scores_gemma":[0.0005571115,0.00009670226,0.00001961537,0.00005031355,0.0002109317,0.00009165807,0.00004204472,0.000114707,0.0001880179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002407926,"about_ca_system_score_gemma":0.0000183927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009976489,"about_ca_topic_score_gemma":0.00004237133,"domain_scores_codex":[0.9990198,0.00004545668,0.0003065497,0.0002593937,0.0002135889,0.0001551806],"domain_scores_gemma":[0.9986176,0.0008132345,0.0001021379,0.0001089543,0.000263981,0.00009408915],"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.0000414051,0.00006190743,0.0002301367,0.000007194541,0.00001525359,0.000003989274,0.0001269356,0.000003290128,0.002930163,0.9157333,0.0002773766,0.0805691],"study_design_scores_gemma":[0.00005795907,0.00008431005,0.0003090981,0.00007016282,0.00001161416,0.00001539261,0.0003794305,0.01102015,0.002237276,0.984934,0.0007196825,0.0001609068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06778777,0.000008296031,0.9212328,0.003256605,0.0001632733,0.0001517681,0.0002133411,0.00007387521,0.007112337],"genre_scores_gemma":[0.9812475,0.0001666429,0.01672303,0.0001481015,0.00007801328,0.00001939942,0.00001166957,0.00001262125,0.001593037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9134597,"threshold_uncertainty_score":0.9999987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3157563060","doi":"","title":"On the role of data in PAC-Bayes","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bayes' theorem; Artificial intelligence; Data mining; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.08857393213513721,"gpt":0.3235185906190126,"spread":0.2349446584838754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001533579,0.00007293256,0.00009432222,0.0000510233,0.00002280641,0.00006010672,0.000209742,0.00003131856,0.0003779792],"category_scores_gemma":[0.0002830795,0.00005920353,0.000010522,0.00007302641,0.00004610056,0.00005137752,0.0000307415,0.000118556,0.00004194865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001503518,"about_ca_system_score_gemma":0.00002502707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005582629,"about_ca_topic_score_gemma":0.0006061166,"domain_scores_codex":[0.9993191,0.00003948082,0.0002450806,0.0001355627,0.0001795376,0.00008117509],"domain_scores_gemma":[0.9992942,0.0003643557,0.00003024331,0.0001946479,0.00009366382,0.0000228558],"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.00002403782,0.00002706652,0.00003797232,0.000004503373,0.0000164014,0.000007082819,0.0001546054,0.0009433759,0.003386756,0.8474246,0.00008894304,0.1478846],"study_design_scores_gemma":[0.00001994487,0.00003310856,0.0001012076,0.00005333018,0.000002748696,0.000003404013,0.001660355,0.796124,0.01248362,0.1882417,0.001203841,0.00007274858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1515629,0.0005685685,0.6927788,0.003574872,0.003231959,0.0005456244,0.003559278,0.0001575923,0.1440205],"genre_scores_gemma":[0.9992976,0.0001462903,0.0003446102,0.00006426444,0.00003732483,0.00000603674,0.00003674571,0.000005579129,0.00006155589],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8477347,"threshold_uncertainty_score":0.4138608,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2922025696","doi":"","title":"Multitask Metric Learning: Theory and Algorithm","year":2019,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Boosting (machine learning); Generalization; Multi-task learning; Stability (learning theory); Metric (unit); Benchmark (surveying); Algorithm; Artificial intelligence; Machine learning; Learning to rank; Task (project management); Mathematics; Ranking (information retrieval)","retraction":null,"screen_n_in":null,"score":{"opus":0.05850819405852739,"gpt":0.3255875308177551,"spread":0.2670793367592277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003728586,0.0001193121,0.0001159192,0.0001814347,0.00008856838,0.0002955009,0.0002657565,0.00005449981,0.000347794],"category_scores_gemma":[0.0003126327,0.0001068003,0.00001724852,0.000120665,0.00007344256,0.0002456653,0.0001199471,0.0001837694,0.0004266645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001443313,"about_ca_system_score_gemma":0.0000308116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002034585,"about_ca_topic_score_gemma":0.000004743732,"domain_scores_codex":[0.9989251,0.0001121811,0.0002182956,0.0003265448,0.0002714903,0.0001463434],"domain_scores_gemma":[0.9989158,0.0005923696,0.00008096259,0.0001216438,0.0002096833,0.00007953601],"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.00001712254,0.000022623,0.00004876897,0.000002581498,0.00000781114,0.000004292192,0.000181477,0.00003221049,0.0003016946,0.5340808,0.00005093093,0.4652497],"study_design_scores_gemma":[0.0000494183,0.0002302382,0.0002474302,0.0000424244,0.000004605707,0.00001149084,0.0007340767,0.5566639,0.002767116,0.43782,0.001243373,0.0001858673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004577738,0.00003299821,0.9885761,0.0004637128,0.0005454532,0.0001057921,0.00003980528,0.00004660496,0.005611836],"genre_scores_gemma":[0.9191342,0.0005230707,0.07847373,0.0003699538,0.00005008027,0.000009050855,0.00002903778,0.000007350418,0.001403547],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9145564,"threshold_uncertainty_score":0.5484052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037083547","doi":"","title":"Accelerating Smooth Games by Manipulating Spectral Shapes.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Monotone polygon; Eigenvalues and eigenvectors; Acceleration; Regularization (linguistics); Mathematical optimization; Gradient descent; Mathematics; Computer science; Applied mathematics; Algorithm; Geometry; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1591484155708708,"gpt":0.3326122698059081,"spread":0.1734638542350373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001321172,0.0001514128,0.0001484801,0.00007183506,0.000150602,0.0006693015,0.0004803781,0.00004372486,0.0007692915],"category_scores_gemma":[0.0003146343,0.000148701,0.00003395782,0.0002000629,0.0000517995,0.0003228875,0.0001074747,0.0001530954,0.0001083205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000025505,"about_ca_system_score_gemma":0.00005309845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000312625,"about_ca_topic_score_gemma":0.00001735881,"domain_scores_codex":[0.9985749,0.00005010974,0.0004151387,0.0003965327,0.0003908951,0.0001724208],"domain_scores_gemma":[0.9991835,0.0001850645,0.0001459791,0.00008871946,0.0002565565,0.000140181],"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.00001327438,0.00003407338,0.000101792,0.000003230744,0.00002197894,0.000005953895,0.0004328148,0.002694009,0.0007522607,0.9217367,0.0006557845,0.07354819],"study_design_scores_gemma":[0.00002706443,0.00008206126,0.000178509,0.000009619956,0.000004957547,0.000001806491,0.0002040185,0.948773,0.0007047731,0.04945248,0.0003957361,0.0001660161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004363392,0.00001129694,0.9806642,0.01235665,0.0001406581,0.000067946,0.00009038863,0.00006876467,0.006163765],"genre_scores_gemma":[0.8770982,0.00007116824,0.1202884,0.002221159,0.0001285159,0.000005292065,0.00006033887,0.000007413372,0.0001195689],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.946079,"threshold_uncertainty_score":0.8423203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2410679624","doi":"","title":"A Column Generation Bound Minimization Approach with PAC-Bayesian Generalization Guarantees","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Generalization; Column (typography); Computer science; Minification; Bayesian probability; Column generation; Mathematical optimization; Artificial intelligence; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.2157938118567386,"gpt":0.3608432622986248,"spread":0.1450494504418862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006481912,0.0001903139,0.0001991135,0.000231132,0.0001750887,0.0005311834,0.0003472546,0.0000851724,0.0005073851],"category_scores_gemma":[0.001601484,0.0001172984,0.00002601893,0.0002437891,0.0002600493,0.0002790185,0.00003571704,0.00007585336,0.00007549411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006076384,"about_ca_system_score_gemma":0.0001140701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002252116,"about_ca_topic_score_gemma":0.0001051912,"domain_scores_codex":[0.9976205,0.0001360415,0.0006004495,0.0005198132,0.0009223295,0.0002009058],"domain_scores_gemma":[0.9979913,0.0005539868,0.0002089702,0.0002495729,0.0008957926,0.0001003785],"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.0001257651,0.00008330031,0.0001811722,0.000003189326,0.0000221099,0.000006461626,0.000331212,0.008332569,0.002404121,0.856364,0.001246513,0.1308996],"study_design_scores_gemma":[0.00008515993,0.000230111,0.0002063599,0.00004200347,0.00001337132,0.00001670641,0.0003772204,0.7912354,0.001618687,0.2054254,0.0005092438,0.000240344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003525013,0.00001216823,0.9922754,0.001102111,0.0004100405,0.0002000246,0.0001852709,0.00003867885,0.002251308],"genre_scores_gemma":[0.9374583,0.00009364321,0.0607516,0.0001344954,0.0002165494,0.00001976275,0.00007057962,0.00001459739,0.001240517],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9339333,"threshold_uncertainty_score":0.5555511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963026695","doi":"","title":"Frank-Wolfe Splitting via Augmented Lagrangian Method","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Augmented Lagrangian method; Sublinear function; Intersection (aeronautics); Rate of convergence; Polytope; Mathematical optimization; Oracle; Mathematics; Convex function; Quadratic equation; Penalty method; Quadratic programming; Feasible region; Computer science; Regular polygon; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.08781745070840186,"gpt":0.3537138227200863,"spread":0.2658963720116845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001663394,0.0001572895,0.0001378999,0.0001199774,0.00009470388,0.0001308966,0.0001867525,0.00005680316,0.0005073391],"category_scores_gemma":[0.00009282116,0.0001581595,0.00002436694,0.00008691906,0.0001320609,0.00007497558,0.00003584053,0.0001552499,0.0001447628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002901088,"about_ca_system_score_gemma":0.00001401437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006445742,"about_ca_topic_score_gemma":0.00008661671,"domain_scores_codex":[0.9990526,0.00003665346,0.000294462,0.0002116883,0.0002152832,0.0001892405],"domain_scores_gemma":[0.9992926,0.0001585009,0.00004839251,0.0001386215,0.0002924036,0.00006947225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005067874,0.00003158859,0.0000212765,0.000005882836,0.00005499803,0.00002059775,0.0004544008,0.0002990568,0.01918185,0.4372552,0.001110046,0.5415144],"study_design_scores_gemma":[0.00002112151,0.000122464,0.00008122988,0.00006903274,0.00001136534,0.00001348168,0.0002132214,0.7733042,0.09063496,0.1337855,0.001541576,0.0002019193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003140606,0.00001635118,0.9780384,0.0001807229,0.0006632523,0.00008630213,0.00007563477,0.0002187596,0.01758003],"genre_scores_gemma":[0.9011381,0.00009081651,0.09822306,0.0001774988,0.0002412987,0.000005936533,0.00002612252,0.00001744448,0.00007972698],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8979975,"threshold_uncertainty_score":0.6449558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037668816","doi":"","title":"Asynchronous Gibbs Sampling.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Gibbs sampling; Markov chain Monte Carlo; Asynchronous communication; Computer science; Markov chain; Algorithm; Bayesian probability; Sampling (signal processing); Set (abstract data type); Theoretical computer science; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.2058612348148112,"gpt":0.3747995126403912,"spread":0.16893827782558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001897819,0.0001528423,0.000155287,0.00006049638,0.00009612187,0.000366134,0.0006187687,0.00005776742,0.0002118077],"category_scores_gemma":[0.0003137346,0.0001438378,0.00002977794,0.0001175975,0.0000948602,0.0001806057,0.0001372446,0.0001915815,0.0001679136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001878724,"about_ca_system_score_gemma":0.0000892508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001468381,"about_ca_topic_score_gemma":0.000009301994,"domain_scores_codex":[0.9987229,0.00006596562,0.0003114767,0.0004138093,0.0002943008,0.0001915396],"domain_scores_gemma":[0.9991125,0.0002257322,0.00008829583,0.0001707348,0.0002195699,0.0001832085],"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.00001618335,0.0000184967,0.000004460595,0.000002899409,0.000007831053,0.00001110413,0.0004076081,0.00002372231,0.000355478,0.6032252,0.0001381537,0.3957888],"study_design_scores_gemma":[0.00001909363,0.0001623379,0.00003169529,0.00001316675,0.00000326271,0.000006811659,0.00005526025,0.4031604,0.001551505,0.5937707,0.001078077,0.0001476906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001069853,0.00002166932,0.9803926,0.009260232,0.000448711,0.00008845337,0.00007223639,0.00007083626,0.009538243],"genre_scores_gemma":[0.4093853,0.0001126349,0.588173,0.002117664,0.0001509194,0.000005477111,0.000009479066,0.000006342263,0.00003913379],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4092783,"threshold_uncertainty_score":0.5865534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2644693190","doi":"","title":"Unsupervised Sequential Sensor Acquisition","year":2017,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.1415958106355498,"gpt":0.3586155390995791,"spread":0.2170197284640293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002459243,0.0001554064,0.0001359738,0.00008764531,0.0005547773,0.001564632,0.00107315,0.00007656037,0.0003879988],"category_scores_gemma":[0.0002486869,0.000149037,0.0000316035,0.00003629941,0.0002085411,0.0004470165,0.0002496532,0.0001551988,0.00016457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002296505,"about_ca_system_score_gemma":0.00004557186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000710976,"about_ca_topic_score_gemma":0.00004578879,"domain_scores_codex":[0.9986157,0.00005745664,0.0003133613,0.0004152373,0.0003836744,0.0002145505],"domain_scores_gemma":[0.9986612,0.0001681282,0.0001749668,0.0005614351,0.0003232667,0.0001110202],"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.00003780921,0.00004089972,0.00007856797,0.000002612279,0.00001182979,0.00004152749,0.0001460819,0.00009399719,0.0005997788,0.8055378,0.0004959137,0.1929131],"study_design_scores_gemma":[0.00006769678,0.0001401255,0.001182287,0.00006077803,0.000007534975,0.00002793163,0.0001562643,0.6227185,0.003275033,0.3704912,0.001578237,0.0002944677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003093569,0.000007011815,0.9822624,0.003053244,0.00184893,0.00008903315,0.0002143326,0.00007392597,0.00935754],"genre_scores_gemma":[0.9371673,0.0001720632,0.06165456,0.0003694067,0.0002756173,0.000006553667,0.0000590644,0.000007810241,0.0002876462],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9340737,"threshold_uncertainty_score":0.9994718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037201993","doi":"","title":"Purifying Interaction Effects with the Functional ANOVA: An Efficient Algorithm for Recovering Identifiable Additive Models","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Identifiability; Interpretability; Representation (politics); Piecewise; Equivalence (formal languages); Computer science; Decomposition; Algorithm; Additive model; Mathematics; Generalized additive model; Function (biology); Variance (accounting); Artificial intelligence; Machine learning; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1435383434496695,"gpt":0.3268560395712488,"spread":0.1833176961215794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004028498,0.0002750588,0.0002191466,0.0001275944,0.0004707219,0.0009824126,0.0007251321,0.00007283016,0.00007987482],"category_scores_gemma":[0.0002807065,0.0002192043,0.00005100264,0.0002876405,0.0001846087,0.0009374534,0.0001459607,0.0003052494,0.00006740236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000922828,"about_ca_system_score_gemma":0.0001352688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000730301,"about_ca_topic_score_gemma":0.00009651681,"domain_scores_codex":[0.9977751,0.000114674,0.000433981,0.0007323374,0.0005791454,0.0003647143],"domain_scores_gemma":[0.997511,0.0009627704,0.0002260032,0.0002687001,0.000844119,0.0001874518],"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.0001548597,0.00008677662,0.000001302126,0.00001142232,0.00004045579,0.00001612679,0.001491346,0.0411347,0.0007081056,0.6192497,0.0002416085,0.3368636],"study_design_scores_gemma":[0.00005274685,0.0006349095,0.00001209411,0.00005510129,0.0000154907,0.00001302913,0.002072706,0.8983718,0.01758007,0.08050831,0.0004300656,0.0002536547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001893929,0.00001539475,0.9919799,0.003453941,0.0008821951,0.0005424264,0.000171689,0.0001021176,0.0009584274],"genre_scores_gemma":[0.8687044,0.00005206034,0.1291533,0.001310957,0.0003754653,0.0001812634,0.00009276494,0.00002662439,0.000103164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8668104,"threshold_uncertainty_score":0.9473428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2922253549","doi":"","title":"Vine copula structure learning via Monte Carlo tree search","year":2019,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Vine copula; Monte Carlo tree search; Computer science; Copula (linguistics); Monte Carlo method; Tree structure; Tree (set theory); Sampling (signal processing); Artificial intelligence; Bivariate analysis; Vine; Machine learning; Mathematics; Algorithm; Statistics; Econometrics; Binary tree","retraction":null,"screen_n_in":null,"score":{"opus":0.07554591244505358,"gpt":0.3394016780820889,"spread":0.2638557656370353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003744833,0.000317883,0.000306467,0.0002726377,0.0001962152,0.0006473095,0.001204081,0.000141897,0.001080667],"category_scores_gemma":[0.0003216542,0.0003054535,0.00005971894,0.0002757303,0.0002250941,0.0004655813,0.0003183431,0.0006031527,0.0007904369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009553673,"about_ca_system_score_gemma":0.0001254334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002796276,"about_ca_topic_score_gemma":0.0003330671,"domain_scores_codex":[0.9971474,0.0001652214,0.0006333325,0.0007566299,0.000840186,0.0004571747],"domain_scores_gemma":[0.9980197,0.0005075384,0.0001792211,0.0004435595,0.0006642243,0.0001857826],"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.00005857829,0.00005071121,0.0005387067,0.000008473769,0.00002938974,0.00002880644,0.001161148,0.005309527,0.006246651,0.629402,0.00007586517,0.3570901],"study_design_scores_gemma":[0.00003200939,0.0004020465,0.0004034629,0.00005517972,0.000006746855,0.00002626469,0.0008080892,0.8382154,0.01664785,0.142368,0.0006663666,0.000368661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04549444,0.00003626607,0.9457437,0.001589921,0.001562683,0.0003067211,0.00009513558,0.0001381907,0.005032955],"genre_scores_gemma":[0.9678692,0.0001158579,0.03026277,0.0002554175,0.0001566175,0.00000859105,0.00002453314,0.0000211662,0.001285863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9223747,"threshold_uncertainty_score":0.9999875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037273417","doi":"","title":"An Empirical Study of Stochastic Gradient Descent with Structured Covariance Noise","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Covariance; Computer science; Stochastic gradient descent; Noise (video); Mathematics; Artificial intelligence; Statistics; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.1220083634845631,"gpt":0.3505932410490974,"spread":0.2285848775645344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001198497,0.000164032,0.000196017,0.00006805049,0.00009508365,0.0002120577,0.0006673845,0.00004146102,0.0000768281],"category_scores_gemma":[0.0001305142,0.000134848,0.00001434987,0.000184303,0.0001192263,0.0001768398,0.00008813927,0.0001960217,0.00001034788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001629845,"about_ca_system_score_gemma":0.00006471562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004231461,"about_ca_topic_score_gemma":0.00009880811,"domain_scores_codex":[0.9983751,0.00009627341,0.0003924815,0.000468854,0.0004980257,0.0001692344],"domain_scores_gemma":[0.9988332,0.0001831505,0.0001565538,0.0002712163,0.0003688015,0.000187102],"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.0006906744,0.000927569,0.001008466,0.00001203385,0.00006112973,0.00008745843,0.008725015,0.0491056,0.0005834047,0.8057716,0.0002043873,0.1328227],"study_design_scores_gemma":[0.0001183079,0.002254308,0.001768037,0.00003337091,0.00001302895,0.000009986901,0.001543493,0.9727709,0.0004231932,0.02083068,0.00002936352,0.0002053477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05496461,0.000004697234,0.9435865,0.0007199434,0.000290546,0.0001855638,0.0001255044,0.00004545132,0.00007714881],"genre_scores_gemma":[0.9548172,0.00000904113,0.04473028,0.0003248391,0.00007579107,0.000006583064,0.00002541867,0.000007356705,0.000003522853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9236653,"threshold_uncertainty_score":0.5498941,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3157424867","doi":"","title":"A Theoretical Analysis of Catastrophic Forgetting through the NTK Overlap Matrix","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Forgetting; Computer science; Gradient descent; Principal component analysis; Similarity (geometry); Task (project management); Matrix (chemical analysis); Stochastic gradient descent; Field (mathematics); Measure (data warehouse); Artificial intelligence; Algorithm; Data mining; Mathematics; Image (mathematics); Chemistry; Engineering; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.08335431458207082,"gpt":0.3645647301400853,"spread":0.2812104155580145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003146793,0.0001155599,0.0001867926,0.0001125061,0.0001370496,0.0002904222,0.0004804826,0.00004097866,0.0005951189],"category_scores_gemma":[0.0006957582,0.00009173646,0.00006936282,0.0005014312,0.0002859563,0.0001523819,0.0001447192,0.0001813496,0.00002494767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001996626,"about_ca_system_score_gemma":0.0001088683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003148868,"about_ca_topic_score_gemma":0.00004885207,"domain_scores_codex":[0.9985271,0.0001399679,0.0004202447,0.0002990261,0.0004469456,0.0001666936],"domain_scores_gemma":[0.9982678,0.0007597877,0.0001673025,0.0002667577,0.0004881601,0.00005014247],"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.000019147,0.00004550036,0.00008064484,0.000003166474,0.0001371472,0.00001880622,0.001302574,0.002199044,0.0004317018,0.9479086,0.00002664398,0.04782701],"study_design_scores_gemma":[0.00001808207,0.00004197673,0.00031385,0.00001493847,0.00004714475,0.000006220052,0.001456407,0.6259983,0.001146422,0.3706301,0.0002428845,0.00008368298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002115708,0.00003455588,0.9885789,0.003122061,0.0002713643,0.00005317078,0.0001022399,0.00002028669,0.005701751],"genre_scores_gemma":[0.9342164,0.00009831323,0.06509928,0.0003805061,0.00003582787,0.000004713966,0.00004525225,0.000004431529,0.0001152799],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9321007,"threshold_uncertainty_score":0.6516134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3159134962","doi":"","title":"Does Invariant Risk Minimization Capture Invariance","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Invariant (physics); Minification; Generalization; Computer science; Population; Applied mathematics; Mathematical optimization; Mathematics; Artificial intelligence; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0740804629402809,"gpt":0.3117591392564938,"spread":0.2376786763162129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002695239,0.0001930983,0.0001769217,0.00009206129,0.0001867637,0.0006992389,0.0005581268,0.0001038752,0.000309706],"category_scores_gemma":[0.0007860942,0.0001472274,0.00003268907,0.0002088475,0.0001141733,0.0003162513,0.0001662592,0.0002918972,0.0001124219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003478099,"about_ca_system_score_gemma":0.0002387725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009951791,"about_ca_topic_score_gemma":0.0002702361,"domain_scores_codex":[0.9982072,0.0001631166,0.000427862,0.0005693103,0.0004018351,0.0002306726],"domain_scores_gemma":[0.9982991,0.0003191513,0.0001751783,0.0003380255,0.0007374501,0.0001311458],"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.00001832232,0.00007094749,0.00009449782,0.000005058572,0.00002028965,0.00007246886,0.0004893827,0.00052322,0.0004796564,0.888025,0.0001839846,0.1100172],"study_design_scores_gemma":[0.00002595256,0.00004150036,0.0001695822,0.00004296277,0.000006438959,0.00001490232,0.0002742447,0.5054625,0.003777462,0.4897236,0.0002775728,0.0001832496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006674938,0.00002709307,0.98962,0.003894202,0.001169709,0.00007151871,0.0002029613,0.00006889259,0.004278146],"genre_scores_gemma":[0.8307713,0.0007285443,0.1669772,0.0007554691,0.0001159812,0.00001158281,0.00005614915,0.000009005121,0.0005747975],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8301038,"threshold_uncertainty_score":0.6742777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962865366","doi":"","title":"Benefits from Superposed Hawkes Processes","year":2017,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Superposition principle; Point process; Computer science; Process (computing); Class (philosophy); Point (geometry); Upper and lower bounds; Algorithm; Mathematical optimization; Artificial intelligence; Econometrics; Mathematics; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.3277779055284474,"gpt":0.4107638946153611,"spread":0.08298598908691368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002220199,0.0001860126,0.0002190851,0.0001150097,0.0003904752,0.0007839721,0.0005496162,0.00007619669,0.001164539],"category_scores_gemma":[0.006139298,0.0001655876,0.00002635027,0.00005383594,0.0002262105,0.0002778481,0.0001387069,0.000145823,0.00008989499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000208476,"about_ca_system_score_gemma":0.0001078147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004087432,"about_ca_topic_score_gemma":0.001039822,"domain_scores_codex":[0.9986467,0.00002539788,0.0004074954,0.0003120742,0.0004024916,0.0002058914],"domain_scores_gemma":[0.9976032,0.001044931,0.0002506248,0.0002968344,0.0007188091,0.0000855874],"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.00007622227,0.00008406331,0.0002556198,0.00003275225,0.00003387302,0.000008312333,0.000565681,0.000005156126,0.00004467375,0.8765079,0.0002239443,0.1221619],"study_design_scores_gemma":[0.0000434604,0.0001067731,0.0008124851,0.0001162717,0.0000186263,0.000003129921,0.001178943,0.004165849,0.004132754,0.9889008,0.0003021752,0.0002187403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.265185,0.0001693185,0.634592,0.00635142,0.002435942,0.0004855319,0.005382109,0.0001847386,0.08521389],"genre_scores_gemma":[0.9807401,0.0006000463,0.01750881,0.0001389825,0.0002497687,0.00001561588,0.00007229771,0.00001485463,0.0006595445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.715555,"threshold_uncertainty_score":0.9997485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037675535","doi":"","title":"On Minimax Optimality of GANs for Robust Mean Estimation.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Control Systems and Identification","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; Simon Fraser University; University of Waterloo","funders":"","keywords":"Minimax; Estimation; Mathematical optimization; Computer science; Robustness (evolution); Mathematics; Applied mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.1417360051587558,"gpt":0.3205866555247586,"spread":0.1788506503660028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001202824,0.0001024877,0.0001435771,0.00005224894,0.00003759632,0.00007513416,0.000126964,0.00003959626,0.0001424901],"category_scores_gemma":[0.0003262569,0.0001044124,0.0000288527,0.00005074821,0.00004928003,0.00006464901,0.00000924336,0.0000678213,0.00003217412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002201061,"about_ca_system_score_gemma":0.00001893223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002188918,"about_ca_topic_score_gemma":0.00004385806,"domain_scores_codex":[0.9991692,0.0000156086,0.0003790176,0.0001629779,0.0001804836,0.00009271273],"domain_scores_gemma":[0.9993062,0.0002369301,0.00007413185,0.00008122555,0.0002400896,0.00006143053],"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.0001256251,0.00003343998,0.000008443446,0.0000537313,0.00003311502,9.234385e-7,0.000579875,0.07944252,0.002538645,0.8267657,0.0008239554,0.08959398],"study_design_scores_gemma":[0.00004237066,0.0001486798,0.00009357109,0.00003540534,0.00001001904,4.957353e-7,0.0002696971,0.9557461,0.004040791,0.03938597,0.0001292356,0.00009761954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005064114,0.00001088654,0.9910836,0.0007033409,0.0003372687,0.0002024959,0.0006819964,0.0000377032,0.001878589],"genre_scores_gemma":[0.9817271,0.00003213811,0.01793738,0.0000738028,0.00007623425,0.0000221165,0.00008352953,0.00001037826,0.00003734446],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9766629,"threshold_uncertainty_score":0.4257812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3157613611","doi":"","title":"Online Sparse Reinforcement Learning","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Markov decision process; Reinforcement learning; Dimension (graph theory); Upper and lower bounds; Time horizon; Q-learning; Oracle; Mathematics; Lasso (programming language); Mathematical optimization; Computer science; Markov process; Combinatorics; Discrete mathematics; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.4004819125429087,"gpt":0.497299212462624,"spread":0.09681729991971538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007706407,0.0001498582,0.0002034316,0.0002096347,0.0001867663,0.0005560044,0.0004558353,0.00005856731,0.005444273],"category_scores_gemma":[0.008803629,0.0001297259,0.00004049105,0.0003066001,0.0002207622,0.0001965958,0.0002132516,0.0003600259,0.0006861209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005514658,"about_ca_system_score_gemma":0.0001852285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000229981,"about_ca_topic_score_gemma":0.000243561,"domain_scores_codex":[0.9967614,0.0001708451,0.0006843545,0.0005054419,0.001616356,0.0002616357],"domain_scores_gemma":[0.9961553,0.001476111,0.0001674036,0.0002569645,0.001794923,0.0001493483],"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.00008131028,0.0001257275,0.0001338465,0.000001849495,0.00001914623,0.0001441214,0.0002482729,0.02006389,0.0005229427,0.5086488,0.0004327381,0.4695774],"study_design_scores_gemma":[0.00003982033,0.0001505419,0.000285902,0.00002433172,0.000003644799,0.00002011583,0.003225774,0.545452,0.003981931,0.4394213,0.007235308,0.0001593471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002495149,0.00002423779,0.9870315,0.001999762,0.0006009514,0.00008122922,0.000150016,0.00002368778,0.007593464],"genre_scores_gemma":[0.9681119,0.000445561,0.0203363,0.0003186816,0.00020867,0.000007851381,0.000153691,0.00001153603,0.01040579],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9666952,"threshold_uncertainty_score":0.9995456,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3158469333","doi":"","title":"Implicit Regularization via Neural Feature Alignment","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Topology Optimization in Engineering","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Institute for Advanced Research; Université de Montréal","funders":"","keywords":"Regularization (linguistics); Tangent; Heuristic; Computer science; Artificial intelligence; Algorithm; Feature selection; Kernel (algebra); Artificial neural network; Mathematics; Pattern recognition (psychology); Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03631847140534972,"gpt":0.2869032862195527,"spread":0.250584814814203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005754452,0.000139123,0.0001140898,0.00007778266,0.00005846807,0.000110998,0.000112817,0.00008355394,0.0004753188],"category_scores_gemma":[0.00009300536,0.0001560665,0.00001881221,0.000100639,0.00006017408,0.00008857384,0.00002978057,0.0001562287,0.00003709688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004837088,"about_ca_system_score_gemma":0.0000187997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002916991,"about_ca_topic_score_gemma":0.00001912594,"domain_scores_codex":[0.9992123,0.00002175333,0.0002303463,0.0001948726,0.0001852528,0.0001554618],"domain_scores_gemma":[0.9994922,0.00008126372,0.00003052186,0.000123529,0.0002078482,0.00006458873],"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.00001116871,0.00002208584,0.00003224783,0.00001100395,0.00003773685,0.00003189988,0.0001718805,0.2179978,0.006655878,0.7133565,0.0005324823,0.06113932],"study_design_scores_gemma":[0.00002328826,0.00002547003,0.0001311832,0.00001731499,0.000008377754,0.00003412127,0.0001753701,0.9285051,0.01359152,0.05682835,0.0005004447,0.000159419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001009176,0.00004404793,0.9915028,0.0009643854,0.001163748,0.00006224876,0.0001251422,0.0001100863,0.005018411],"genre_scores_gemma":[0.9632009,0.0002636162,0.0354249,0.000179351,0.0001367112,0.00001337732,0.0002133187,0.00002278464,0.0005449808],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9621918,"threshold_uncertainty_score":0.6364206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2182753936","doi":"","title":"Asymptotic Theory for Linear-Chain Conditional Random Fields","year":2011,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; CRFS; Conditional random field; Sequence (biology); Hessian matrix; Ergodicity; Applied mathematics; Feature (linguistics); Consistency (knowledge bases); Exponential family; Ergodic theory; Inference; Discrete mathematics; Statistics; Computer science; Artificial intelligence; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1594198810513854,"gpt":0.3580646289721905,"spread":0.1986447479208051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006152891,0.0001478431,0.0001600722,0.0001031558,0.0001210324,0.0001193509,0.0004711728,0.00008195821,0.0003222505],"category_scores_gemma":[0.0004277975,0.0001324476,0.00004846784,0.0000608512,0.0001378014,0.0001606822,0.00006638273,0.0001401947,0.00003724506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001560916,"about_ca_system_score_gemma":0.0000756301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001213782,"about_ca_topic_score_gemma":0.00001839244,"domain_scores_codex":[0.9988123,0.0001113218,0.0003309883,0.0003360445,0.0002182174,0.0001911833],"domain_scores_gemma":[0.9984843,0.0007991751,0.0001010719,0.0001810642,0.0003399285,0.00009442568],"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.000151282,0.00005721356,0.000003991589,0.000004580981,0.00002204213,0.000006953065,0.0005955414,0.00001389183,0.00005895451,0.8003384,0.0001387835,0.1986084],"study_design_scores_gemma":[0.0000681511,0.0001613405,0.0000310489,0.00001585664,0.000006464311,0.00000763156,0.00005621826,0.2600607,0.001885226,0.737448,0.0001376341,0.0001217247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008696147,0.00001378429,0.9902112,0.0006965775,0.0006906343,0.0001953606,0.0001767199,0.00003946846,0.007889267],"genre_scores_gemma":[0.4773091,0.00004308033,0.5214559,0.0006154235,0.0001056196,0.00003251324,0.00002895329,0.000006237187,0.0004032046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4772221,"threshold_uncertainty_score":0.5401057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3158392704","doi":"","title":"On the Suboptimality of Negative Momentum for Minimax Optimization","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Momentum (technical analysis); Minimax; Convergence (economics); Mathematical optimization; Mathematics; Rate of convergence; Simple (philosophy); Applied mathematics; Computer science; Economics; Key (lock)","retraction":null,"screen_n_in":null,"score":{"opus":0.4766689215919608,"gpt":0.4878975526146724,"spread":0.01122863102271154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008409644,0.0001223214,0.0001865052,0.0001012718,0.0001292821,0.0002071958,0.000579745,0.00004130648,0.001292315],"category_scores_gemma":[0.01604395,0.00008185102,0.0000438139,0.0002403109,0.0003493736,0.0001240588,0.00007915507,0.0001464297,0.00006073702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002664021,"about_ca_system_score_gemma":0.00008281524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001276955,"about_ca_topic_score_gemma":0.00001196043,"domain_scores_codex":[0.9977005,0.0001334299,0.0005871176,0.0003664614,0.001055597,0.0001569576],"domain_scores_gemma":[0.9919167,0.006188759,0.0002573399,0.0001727121,0.001372377,0.00009215467],"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.00068982,0.00006767394,0.00001525081,0.000003724751,0.00002080044,0.000002087957,0.0008041458,0.05348096,0.0001939721,0.8894948,0.001138819,0.05408794],"study_design_scores_gemma":[0.00003283263,0.0003258249,0.00002490265,0.000008618651,0.000002526625,2.766425e-7,0.001334247,0.5953615,0.004806139,0.3979163,0.0001295959,0.00005731996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001281908,0.000003684052,0.9846703,0.01093606,0.0001961481,0.0003307421,0.0009739091,0.00000885308,0.001598396],"genre_scores_gemma":[0.9631561,0.00004531416,0.03594643,0.000511345,0.00008620172,0.00003363411,0.00002741392,0.000008252024,0.0001852933],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9618742,"threshold_uncertainty_score":0.9996206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2414396530","doi":"","title":"Survey Propagation beyond Constraint Satisfaction Problems.","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Local consistency; Computer science; Constraint satisfaction problem; Constraint (computer-aided design); Mathematical optimization; Artificial intelligence; Mathematics; Probabilistic logic","retraction":null,"screen_n_in":null,"score":{"opus":0.08947312638678116,"gpt":0.3303909803103093,"spread":0.2409178539235282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005529664,0.0001451316,0.0001217572,0.0001218649,0.0001221026,0.0002945725,0.0003100733,0.00005381813,0.0002580813],"category_scores_gemma":[0.0006108319,0.0001055342,0.00001917181,0.000106105,0.0001590887,0.0002701724,0.00007314398,0.0001322103,0.0001811235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004394283,"about_ca_system_score_gemma":0.00008640424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002025668,"about_ca_topic_score_gemma":0.0003807426,"domain_scores_codex":[0.9985704,0.0001561178,0.0003442339,0.0003779536,0.0003669936,0.0001842699],"domain_scores_gemma":[0.9987041,0.0004741996,0.0001467934,0.0001788127,0.0004063273,0.00008974952],"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.000009604049,0.00001832226,0.0007082957,0.000002028167,0.000007195193,0.000003104457,0.00009193936,0.00002953976,0.0006001345,0.5096681,0.00006721785,0.4887945],"study_design_scores_gemma":[0.00008901334,0.000367064,0.02272251,0.0001064949,0.00000477189,0.00002393599,0.00008048103,0.4571303,0.002550877,0.5161907,0.0003706517,0.0003631715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002484912,0.000006285558,0.9908699,0.002987257,0.0007180633,0.0001247083,0.000167897,0.00007267232,0.002568266],"genre_scores_gemma":[0.9768031,0.00009857378,0.02249409,0.0001480419,0.00007940064,0.00001281521,0.00002447525,0.000006608307,0.0003329101],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9743181,"threshold_uncertainty_score":0.4303558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2798578734","doi":"","title":"Nonlinear Weighted Finite Automata","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Nonlinear system; Computer science; Automaton; Finite-state machine; Algorithm; Theoretical computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.08505758686459591,"gpt":0.3371786691107923,"spread":0.2521210822461964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002779769,0.0001611746,0.0001358293,0.0001437512,0.0001607266,0.0004351248,0.0008037296,0.00006083531,0.0005269292],"category_scores_gemma":[0.0002486138,0.0001462371,0.00002517904,0.0001594705,0.0002766248,0.0002633372,0.0001918619,0.0001349068,0.0007799483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002273782,"about_ca_system_score_gemma":0.0000713636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002833277,"about_ca_topic_score_gemma":0.00003831498,"domain_scores_codex":[0.9986274,0.0000574044,0.0003414332,0.0003939731,0.0003554032,0.0002243646],"domain_scores_gemma":[0.9987021,0.0003723992,0.0001066552,0.0003229306,0.0003926793,0.0001032402],"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.00002299953,0.00006175852,0.0000108019,0.000001841993,0.00001135154,0.0000148089,0.0002559392,0.000003263148,0.0003075374,0.729224,0.0002962337,0.2697894],"study_design_scores_gemma":[0.00002263238,0.0001926744,0.00005409135,0.00002419081,0.000002437705,0.000008284365,0.00007022212,0.6192563,0.004350565,0.3743264,0.001562574,0.0001295851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002372177,0.000007191969,0.9824083,0.00198445,0.001064051,0.00007760475,0.0001479081,0.0001400084,0.01179826],"genre_scores_gemma":[0.8264657,0.0000988329,0.171818,0.0008978982,0.0003207816,0.00000710568,0.0000366614,0.000009444499,0.0003456502],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8240935,"threshold_uncertainty_score":0.999998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3159394092","doi":"","title":"CLAR: Contrastive Learning of Auditory Representations","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Music and Audio Processing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Artificial intelligence; Supervised learning; Representation (politics); Machine learning; Speech recognition; Quality (philosophy); Raw data; Labeled data; Training set; Natural language processing; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.1028174873514848,"gpt":0.3563111225016691,"spread":0.2534936351501842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001578486,0.00008911954,0.0001266805,0.00007122126,0.0001121495,0.0001827346,0.0002489491,0.00003918114,0.0002506865],"category_scores_gemma":[0.000676765,0.0000912804,0.00002409876,0.0001294379,0.0001384332,0.000187334,0.00009677031,0.0001660012,0.00002818344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001678631,"about_ca_system_score_gemma":0.0001759581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001666286,"about_ca_topic_score_gemma":0.00001951928,"domain_scores_codex":[0.9989316,0.00007543496,0.0003104716,0.0002738225,0.0002889109,0.0001196896],"domain_scores_gemma":[0.998585,0.0003876911,0.0001521231,0.0001250467,0.0006950709,0.00005501002],"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.00001068779,0.0000462004,0.00007777783,0.000005962039,0.00001682038,0.00002466702,0.000613279,0.0003732229,0.003330081,0.8199154,0.0002376457,0.1753482],"study_design_scores_gemma":[0.00005358291,0.0001222475,0.0009375698,0.0001149401,0.00001066111,0.00002280397,0.001774718,0.4106809,0.04131344,0.5435926,0.001165805,0.0002107954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001478564,0.00002748203,0.9833483,0.001630607,0.0005942264,0.00003667431,0.00003531698,0.00002455314,0.01282428],"genre_scores_gemma":[0.9493397,0.0001358538,0.04962329,0.0002555744,0.00009983134,0.00000443451,0.00002067483,0.00000402075,0.000516627],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9478611,"threshold_uncertainty_score":0.3722307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037549864","doi":"","title":"Causal inference in degenerate systems: An impossibility result","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Directed acyclic graph; Impossibility; Degenerate energy levels; Causal inference; Causal model; Computer science; Directed graph; Theoretical computer science; Inference; Mathematics; Algorithm; Artificial intelligence; Econometrics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.2107680685530983,"gpt":0.3770893154097028,"spread":0.1663212468566045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004870221,0.0002393027,0.0002532176,0.0001254992,0.0001025315,0.0007779856,0.0009367859,0.0001071487,0.00005924411],"category_scores_gemma":[0.0007934525,0.0002320463,0.00002322568,0.0002646704,0.0001471095,0.0005376469,0.0001652694,0.0003564849,0.00009569761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005245687,"about_ca_system_score_gemma":0.0002224366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003043972,"about_ca_topic_score_gemma":0.0002732095,"domain_scores_codex":[0.9975892,0.0002137924,0.0006935907,0.0007429927,0.0004469604,0.0003135057],"domain_scores_gemma":[0.9984555,0.0003414344,0.0001499478,0.0003132173,0.0004467055,0.0002931591],"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.00007864738,0.00008802391,0.0002797481,0.00001091443,0.000007932672,0.00004505267,0.001185312,0.004979413,0.001288352,0.9231375,0.00003076668,0.06886826],"study_design_scores_gemma":[0.000044924,0.0003211907,0.0003017741,0.00004252808,0.000002735572,0.000004217277,0.000336377,0.8698809,0.001118839,0.1276591,0.00004342851,0.0002440075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01833631,0.00002527295,0.9769783,0.002213846,0.0004797807,0.0001574955,0.0001564629,0.00009384297,0.001558684],"genre_scores_gemma":[0.9737106,0.0001223598,0.02530805,0.0006461674,0.000123253,0.00001884728,0.00003436311,0.000009167575,0.00002716911],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9553743,"threshold_uncertainty_score":0.9462574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037834087","doi":"","title":"Structured Conditional Continuous Normalizing Flows for Efficient Amortized Inference in Graphical Models.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Graphical model; Computer science; Inference; Amortized analysis; Theoretical computer science; Programming language; Data structure; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.116448737573174,"gpt":0.3425164012567682,"spread":0.2260676636835943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001406835,0.000169115,0.0002030721,0.00009904407,0.0001181538,0.0002836307,0.0005381268,0.00006456249,0.00005228298],"category_scores_gemma":[0.0002713662,0.0001633796,0.00004178528,0.0002136869,0.0001087743,0.0001663522,0.000105641,0.0002050219,0.00001295774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002206871,"about_ca_system_score_gemma":0.00007334047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002530082,"about_ca_topic_score_gemma":0.00009195997,"domain_scores_codex":[0.9984695,0.00004114528,0.0004809261,0.0004578092,0.0003116913,0.0002389373],"domain_scores_gemma":[0.9987129,0.0005745549,0.0001245441,0.0001379375,0.0003034368,0.0001466497],"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.00007382457,0.00005054833,0.00002882091,0.000005667658,0.000008753158,0.00000797004,0.0003070382,0.04689566,0.0007374883,0.9165722,0.00008298679,0.03522907],"study_design_scores_gemma":[0.0000643106,0.00008061301,0.00008468115,0.00001370172,0.000002602867,0.000001752535,0.00006926053,0.6352476,0.0003956905,0.363822,0.00009919937,0.0001185089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007379238,0.00001282239,0.986497,0.004858078,0.0002123415,0.0003220612,0.0003211446,0.00004932939,0.0003479977],"genre_scores_gemma":[0.9439371,0.0000528346,0.05481153,0.0009266777,0.00009549993,0.00006975506,0.00009195265,0.000007138407,0.000007516584],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9365578,"threshold_uncertainty_score":0.6662426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037853175","doi":"","title":"Greed Meets Sparsity: Understanding and Improving Greedy Coordinate Descent for Sparse Optimization.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Coordinate descent; Greedy algorithm; Computer science; Mathematical optimization; Descent (aeronautics); Artificial intelligence; Algorithm; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2545147513009305,"gpt":0.3238538095647961,"spread":0.0693390582638656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002043748,0.0001743693,0.0001701376,0.0001325345,0.0001952646,0.0004759647,0.0003848333,0.00005903671,0.00003944391],"category_scores_gemma":[0.0005866662,0.0001829303,0.00002350326,0.0001490656,0.0001433268,0.0002826517,0.0001686615,0.0001078144,0.000004874519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006842691,"about_ca_system_score_gemma":0.00006018559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001929401,"about_ca_topic_score_gemma":0.00001286231,"domain_scores_codex":[0.9986687,0.00003421048,0.0003581752,0.0004600755,0.0002743055,0.0002044759],"domain_scores_gemma":[0.9989123,0.0002915354,0.0001656109,0.0001260533,0.0003393812,0.0001650592],"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.00005718329,0.00002820462,0.00002432992,0.0000155372,0.00001751739,0.00000623924,0.0006282382,0.007087733,0.0001750163,0.9638851,0.000121215,0.02795372],"study_design_scores_gemma":[0.00006405614,0.0002485733,0.00001039571,0.00002998462,0.00001009306,0.00000551979,0.0003389606,0.840924,0.000810914,0.1573569,0.00003236411,0.000168254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00008022389,0.00001192656,0.9922473,0.006407197,0.00029448,0.000339236,0.0001085094,0.0001149255,0.0003962289],"genre_scores_gemma":[0.5845641,0.00007366334,0.4147674,0.000485796,0.0000443196,0.00001604257,0.0000226156,0.00000899543,0.0000170904],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8338363,"threshold_uncertainty_score":0.7459682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}