{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Fréderic Morin","is_ca":true},{"name":"Yoshua Bengio","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001977554,0.001348436,0.001815766,0.001724129,0.0008701258,0.00187601,0.002538478,0.002007599,0.02025467],"category_scores_gemma":[0.00674375,0.0008179068,0.002109803,0.001751219,0.0008248735,0.002778095,0.001591408,0.002739206,0.007420287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001686926,"about_ca_system_score_gemma":0.002167754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02821097,"about_ca_topic_score_gemma":0.02564965,"domain_scores_codex":[0.9988282,0.0004326765,0.00007640656,0.000334791,0.0001770589,0.0001507804],"domain_scores_gemma":[0.996842,0.002329556,0.0001748815,0.0001827326,0.0003912897,0.00007940917],"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.0002731805,0.0001970079,0.003107936,0.0003879823,0.0002854107,0.0002804672,0.0001838819,0.6900156,0.0004689054,0.06895947,0.03389309,0.2019471],"study_design_scores_gemma":[0.00001681137,0.00001366085,0.000137465,0.00001696587,0.00001862465,0.00003164914,0.00001338189,0.9617651,0.00007702759,0.03472379,0.003176377,0.000009245978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01492251,0.004231634,0.940626,0.00400142,0.0006463347,0.0003615656,0.01071768,0.006975322,0.01751765],"genre_scores_gemma":[0.5465831,0.003572518,0.3872391,0.001685683,0.0006096321,0.00165151,0.01809134,0.0009763881,0.03959071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02821097,"threshold_uncertainty_score":0.06775862,"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","authors":[{"name":"Dumitru Erhan","is_ca":true},{"name":"Pierre-Antoine Manzagol","is_ca":true},{"name":"Yoshua Bengio","is_ca":true},{"name":"Samy Bengio","is_ca":false},{"name":"Pascal Vincent","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004570615,0.001691648,0.001056452,0.000330973,0.0007126205,0.0009829716,0.001545149,0.002213132,0.002451544],"category_scores_gemma":[0.04140577,0.001007346,0.0006096715,0.0005230665,0.0022897,0.003816698,0.002002061,0.004173051,0.0004233043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007688448,"about_ca_system_score_gemma":0.0008239233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002482794,"about_ca_topic_score_gemma":0.005429824,"domain_scores_codex":[0.9980217,0.00108524,0.0001123616,0.0003118325,0.0002947183,0.0001742695],"domain_scores_gemma":[0.974034,0.02031298,0.001376273,0.003289734,0.000660355,0.000326675],"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.0007030441,0.000287542,0.005454922,0.0005775477,0.0001673369,0.0002337979,0.0002186616,0.8598297,0.01632774,0.01464953,0.002594286,0.09895599],"study_design_scores_gemma":[0.0001284187,0.0005383437,0.004377194,0.0001259165,0.00007464471,0.0002957596,0.0001071473,0.9396941,0.02030964,0.03210635,0.002186078,0.00005629296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2548288,0.002633711,0.7292233,0.003176136,0.000190145,0.0002805519,0.000365459,0.001197688,0.00810423],"genre_scores_gemma":[0.8360043,0.00133468,0.1574253,0.0007778743,0.0001450766,0.0003223285,0.0003895479,0.0003643034,0.00323657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004570615,"threshold_uncertainty_score":0.02417201,"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)","authors":[{"name":"Yan Yan","is_ca":false},{"name":"Rómer Rosales","is_ca":false},{"name":"Glenn Fung","is_ca":false},{"name":"Mark Schmidt","is_ca":true},{"name":"Gerardo Hermosillo Valadez","is_ca":false},{"name":"Luca Bogoni","is_ca":false},{"name":"Linda Moy","is_ca":false},{"name":"Jennifer Dy","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03110217,0.001563541,0.00274553,0.002858032,0.002513954,0.0038219,0.004286889,0.00508608,0.002260016],"category_scores_gemma":[0.1210571,0.001635869,0.00138883,0.003107981,0.004258732,0.01128816,0.006570463,0.004384953,0.0009073901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002413639,"about_ca_system_score_gemma":0.001743096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005640475,"about_ca_topic_score_gemma":0.006482527,"domain_scores_codex":[0.9759762,0.01204554,0.001012689,0.007377029,0.002653203,0.0009353411],"domain_scores_gemma":[0.8608054,0.1093532,0.01083879,0.01057128,0.006495407,0.00193594],"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.003068018,0.0006519858,0.134864,0.001600233,0.001460881,0.002829668,0.01701951,0.3396285,0.01134928,0.1585079,0.01903733,0.3099828],"study_design_scores_gemma":[0.0001001419,0.0001480382,0.01061812,0.0002021603,0.0002001796,0.0007695259,0.0009835392,0.7049601,0.003464642,0.2714421,0.006966034,0.0001454224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07460673,0.0008307214,0.9165198,0.00315087,0.0001161045,0.0001575959,0.000445831,0.0003362242,0.003836037],"genre_scores_gemma":[0.8376469,0.000548395,0.1545103,0.0009221679,0.0004826018,0.0005160993,0.0009730749,0.0002558932,0.004144591],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03110217,"threshold_uncertainty_score":0.164486,"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","authors":[{"name":"Daniel Tarlow","is_ca":true},{"name":"Inmar E. Givoni","is_ca":true},{"name":"Richard S. Zemel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002633686,0.0009183143,0.001323276,0.001221813,0.00107016,0.002531273,0.003256849,0.002070219,0.006809212],"category_scores_gemma":[0.01282268,0.0007631021,0.001180951,0.001321623,0.001693712,0.004992071,0.004206957,0.002843909,0.001455352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001220173,"about_ca_system_score_gemma":0.001652697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002956983,"about_ca_topic_score_gemma":0.002566516,"domain_scores_codex":[0.9980715,0.0008934865,0.00008895453,0.0002312678,0.0005352799,0.0001795121],"domain_scores_gemma":[0.9951142,0.003523754,0.0002213436,0.0006598541,0.0003030928,0.000177739],"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.0002944027,0.00008447474,0.0005548025,0.0001732344,0.000100281,0.000207447,0.0002623516,0.4647457,0.001927654,0.4376442,0.006090412,0.08791509],"study_design_scores_gemma":[0.00002339202,0.00001651071,0.00002110566,0.000007253217,0.000008966809,0.00001989996,0.00001070359,0.85446,0.0008368119,0.1430235,0.001561623,0.00001023943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00471531,0.0001650025,0.992045,0.0002166602,0.00004267333,0.0000403154,0.00007956547,0.0009596476,0.001735772],"genre_scores_gemma":[0.4502607,0.0006510593,0.5374981,0.0003840909,0.0002147245,0.0004206923,0.0005382459,0.0006126878,0.009419716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006809212,"threshold_uncertainty_score":0.02277905,"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","authors":[{"name":"Guillaume Desjardins","is_ca":true},{"name":"Aaron Courville","is_ca":true},{"name":"Yoshua Bengio","is_ca":true},{"name":"Pascal Vincent","is_ca":true},{"name":"Olivier Delalleau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003406874,0.0009277733,0.002101623,0.0008719225,0.0007096873,0.001218929,0.002935122,0.002430764,0.005654731],"category_scores_gemma":[0.01808408,0.001580331,0.001069105,0.0010971,0.001778216,0.002002532,0.002627826,0.004225873,0.001533517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001476998,"about_ca_system_score_gemma":0.00166798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00723487,"about_ca_topic_score_gemma":0.007655044,"domain_scores_codex":[0.9984836,0.0009024758,0.00008126675,0.0001996438,0.0002077926,0.000125184],"domain_scores_gemma":[0.9902139,0.008127678,0.0002734652,0.0005700407,0.0005910483,0.0002237828],"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.00007366829,0.00002031704,0.0002153335,0.00003957812,0.00003084588,0.00001502842,0.0000295279,0.9703234,0.0003833233,0.01205658,0.0004028486,0.01640946],"study_design_scores_gemma":[0.000004904186,0.000003920185,0.00001184782,0.000003391204,0.000001763688,0.000001974762,9.880578e-7,0.9958379,0.00009200556,0.003958816,0.00008047622,0.000002057674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005363922,0.0002552696,0.9931422,0.0001011844,0.00003440846,0.00003535819,0.00003667047,0.0005054148,0.0005255668],"genre_scores_gemma":[0.4560996,0.0004541557,0.5371703,0.0002948514,0.0001364908,0.0007423394,0.0006205658,0.0006607294,0.003820973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00723487,"threshold_uncertainty_score":0.0189169,"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","authors":[{"name":"Matthew D. Hoffman","is_ca":false},{"name":"Bobak Shahriari","is_ca":true},{"name":"Nando de Freitas","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01258978,0.001871037,0.003283414,0.001245615,0.001063086,0.002910195,0.001951497,0.002683786,0.0031896],"category_scores_gemma":[0.0478168,0.001658477,0.001154536,0.002468247,0.002825283,0.004776639,0.0029524,0.003264846,0.0005186292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002441917,"about_ca_system_score_gemma":0.003459275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00769961,"about_ca_topic_score_gemma":0.005589286,"domain_scores_codex":[0.9943281,0.004127205,0.0001795834,0.0003612915,0.0006885232,0.0003152719],"domain_scores_gemma":[0.9677492,0.02836379,0.001769658,0.000922508,0.0008928834,0.0003019053],"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.0000637394,0.00003502236,0.0002828123,0.0000772104,0.00003900244,0.00004635853,0.00006248183,0.9014193,0.0002117823,0.08611374,0.0007518136,0.01089662],"study_design_scores_gemma":[0.000009216778,0.00001404231,0.00005504857,0.00002189401,0.000006086471,0.000009310244,0.000006818202,0.9684592,0.00009840572,0.03103287,0.0002779002,0.000009125981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007337685,0.0006491969,0.9889731,0.0005743331,0.00003121223,0.00003784584,0.00004369155,0.0001244671,0.002228393],"genre_scores_gemma":[0.6324829,0.002475647,0.3567643,0.000776708,0.000333898,0.0008702309,0.0002905663,0.0003961169,0.005609708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01258978,"threshold_uncertainty_score":0.0665819,"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","authors":[{"name":"Aaron Courville","is_ca":true},{"name":"James Bergstra","is_ca":true},{"name":"Yoshua Bengio","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007950015,0.0005369482,0.0009555648,0.0003201893,0.0003585758,0.001043069,0.00211206,0.001581131,0.005318876],"category_scores_gemma":[0.00281223,0.0003737094,0.0007524667,0.0006202946,0.00104826,0.001859261,0.001803049,0.002109333,0.001547873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006254981,"about_ca_system_score_gemma":0.001110198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001754445,"about_ca_topic_score_gemma":0.002063407,"domain_scores_codex":[0.9994697,0.0001671329,0.00002107094,0.0001006266,0.0001582725,0.00008320005],"domain_scores_gemma":[0.9994204,0.0002439125,0.00003465911,0.0001082332,0.0001215283,0.00007123949],"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.0002457622,0.00007675912,0.0009250104,0.0001362278,0.00009177966,0.0001747215,0.0001171582,0.550682,0.009014343,0.3191527,0.01066675,0.1087168],"study_design_scores_gemma":[0.00001210262,0.00002564158,0.0000776973,0.000006814095,0.000006603628,0.00005416661,0.000007111316,0.9234629,0.000996371,0.07250821,0.002830577,0.00001179505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009905297,0.00040791,0.9826781,0.0007100162,0.000158434,0.00003250532,0.0002267064,0.0007800309,0.005101047],"genre_scores_gemma":[0.5234786,0.0009874165,0.4492948,0.0009583488,0.0002634989,0.0002447233,0.0008239012,0.0003670076,0.02358169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005318876,"threshold_uncertainty_score":0.01779342,"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","authors":[{"name":"Jacob R. Gardner","is_ca":false},{"name":"Chuan Guo","is_ca":true},{"name":"Kilian Q. Weinberger","is_ca":false},{"name":"Roman Garnett","is_ca":false},{"name":"Roger Grosse","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00674759,0.001427,0.002583228,0.002336987,0.0009225053,0.002247482,0.0027786,0.002375441,0.002231469],"category_scores_gemma":[0.03728081,0.002785833,0.002390448,0.001755982,0.002436262,0.004702394,0.003943884,0.004171262,0.0005443043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001276607,"about_ca_system_score_gemma":0.002475635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006460345,"about_ca_topic_score_gemma":0.008034138,"domain_scores_codex":[0.9968581,0.001750075,0.0002027161,0.0004165962,0.0005990667,0.0001734341],"domain_scores_gemma":[0.9783079,0.01859835,0.0007620562,0.001094021,0.0009252363,0.0003124315],"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.000161914,0.0001555325,0.001416661,0.0001949492,0.0002872112,0.00006638261,0.0002418591,0.7127374,0.001312959,0.1574108,0.00207352,0.1239408],"study_design_scores_gemma":[0.00001049569,0.0000149712,0.0000891351,0.00001119333,0.00001526749,0.000007163268,0.000007673947,0.9250748,0.0001989454,0.07425996,0.0002999627,0.00001044596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00484252,0.0001799478,0.9942932,0.0001767617,0.0000136434,0.00001408672,0.00002544258,0.0001048249,0.0003495106],"genre_scores_gemma":[0.298718,0.0007254606,0.697022,0.0003147929,0.0001828028,0.0001922144,0.0003868691,0.000230659,0.002227196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00674759,"threshold_uncertainty_score":0.03568506,"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","authors":[{"name":"Chandrashekar Lakshminarayanan","is_ca":true},{"name":"Csaba Szepesvári","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0119088,0.001604709,0.002721328,0.001088183,0.001050825,0.002758022,0.002776658,0.004805728,0.00663754],"category_scores_gemma":[0.07838089,0.0008411178,0.001183319,0.001100545,0.002585378,0.01137857,0.002652865,0.005819519,0.001970955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001190552,"about_ca_system_score_gemma":0.002874085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006763755,"about_ca_topic_score_gemma":0.006251047,"domain_scores_codex":[0.9958227,0.002089638,0.0002901591,0.0006570551,0.0008919717,0.0002484859],"domain_scores_gemma":[0.9757729,0.01807301,0.0006119612,0.002736271,0.002257371,0.0005485527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00119941,0.0003918438,0.004124762,0.0008264009,0.000658955,0.0001844783,0.0003330613,0.1544605,0.00206885,0.2672717,0.03195211,0.5365279],"study_design_scores_gemma":[0.00008338896,0.00008952629,0.0007583342,0.0002893299,0.0001436469,0.00008124283,0.00009643961,0.8400038,0.001578568,0.1513156,0.005485469,0.00007449106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0188351,0.01240075,0.9358034,0.01604063,0.00189806,0.00006676114,0.0001422758,0.001917338,0.01289576],"genre_scores_gemma":[0.5051268,0.00843999,0.4612401,0.005299798,0.002554909,0.0002160526,0.0003783353,0.002249092,0.01449485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0119088,"threshold_uncertainty_score":0.06298053,"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","authors":[{"name":"Andrew Silva","is_ca":false},{"name":"Matthew Gombolay","is_ca":false},{"name":"Taylor W. Killian","is_ca":true},{"name":"Ivan Jimenez","is_ca":false},{"name":"Sung-Hyun Son","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003165225,0.000993378,0.00162888,0.0008877086,0.0004642179,0.001357166,0.001481454,0.001944374,0.003655325],"category_scores_gemma":[0.01087652,0.000858883,0.001003867,0.0008018921,0.001171273,0.001280624,0.001663615,0.003037168,0.0004806542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001496233,"about_ca_system_score_gemma":0.001690874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00653463,"about_ca_topic_score_gemma":0.005546076,"domain_scores_codex":[0.999061,0.0005474807,0.00006129478,0.0001077518,0.0001590392,0.00006335475],"domain_scores_gemma":[0.9950851,0.004109002,0.0001852974,0.0001254515,0.0004006736,0.00009442944],"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.00003175816,0.00003649028,0.0001943122,0.00006399811,0.00002822209,0.00003202224,0.00006927187,0.9185212,0.0003473948,0.04437378,0.0005327627,0.03576877],"study_design_scores_gemma":[0.000003921501,0.000004412381,0.00001143064,0.000004594219,0.000001748174,0.000001431925,0.000001787061,0.9922602,0.00003072524,0.00757459,0.0001039187,0.000001355303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002825992,0.0002052287,0.9960168,0.0001121619,0.00002311156,0.00002498965,0.0000146343,0.00008467009,0.0006924346],"genre_scores_gemma":[0.3687263,0.0005487055,0.625159,0.0001637648,0.0001136688,0.0004660086,0.0001692509,0.0003251865,0.004328085],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00653463,"threshold_uncertainty_score":0.01673955,"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","authors":[{"name":"Xuechen Li","is_ca":false},{"name":"Ting‐Kam Leonard Wong","is_ca":true},{"name":"Ricky T. Q. Chen","is_ca":true},{"name":"David Duvenaud","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204077,0.00111133,0.001055295,0.0006751081,0.0005038473,0.001385742,0.001242369,0.001212089,0.004838579],"category_scores_gemma":[0.00576324,0.0006545419,0.001021966,0.0005528806,0.001021073,0.001539508,0.001820759,0.002751983,0.001310677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001329009,"about_ca_system_score_gemma":0.001878975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00685316,"about_ca_topic_score_gemma":0.007534212,"domain_scores_codex":[0.9995347,0.000133449,0.0000301525,0.00008416154,0.0001726161,0.00004487348],"domain_scores_gemma":[0.9984837,0.0009180461,0.00009785652,0.000150861,0.0002746276,0.0000749356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009531799,0.00006746069,0.0009922428,0.0002664826,0.00009866171,0.0001546052,0.0001039552,0.7331274,0.007830826,0.1623934,0.007573321,0.08729634],"study_design_scores_gemma":[0.000004148698,0.000003127462,0.00003375869,0.000004354263,0.000001648335,0.000007177446,0.000002317218,0.9838934,0.0004538882,0.01488099,0.0007116825,0.000003518095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003593703,0.0002242774,0.9931809,0.0002321456,0.00005539334,0.00004212376,0.0001327305,0.000935173,0.001603707],"genre_scores_gemma":[0.2722846,0.0005411066,0.7158501,0.0004037175,0.0001914282,0.0003607075,0.0008333847,0.001445891,0.008088994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00685316,"threshold_uncertainty_score":0.01618665,"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","authors":[{"name":"Elnaz Barshan","is_ca":true},{"name":"Marc-Etienne Brunet","is_ca":true},{"name":"Gintare Karolina Dziugaite","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009727998,0.003038731,0.003450051,0.006383141,0.001500124,0.003215855,0.004073816,0.004228053,0.005398038],"category_scores_gemma":[0.04886378,0.0008942815,0.002431291,0.002623118,0.002261726,0.003658523,0.003038837,0.003528426,0.001839221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001456588,"about_ca_system_score_gemma":0.002214762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003551237,"about_ca_topic_score_gemma":0.004229085,"domain_scores_codex":[0.9939878,0.002758891,0.0003075293,0.001094659,0.001463256,0.0003878393],"domain_scores_gemma":[0.9756919,0.01962775,0.00104797,0.001558383,0.00158063,0.0004933291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001464132,0.0007894784,0.02565873,0.00108511,0.0006318701,0.0009765691,0.0009473017,0.3709819,0.00606559,0.02418375,0.01467905,0.5525365],"study_design_scores_gemma":[0.00009523045,0.0002339018,0.001571564,0.000127822,0.00008961555,0.0001981647,0.0001397843,0.9698703,0.003292668,0.02151995,0.002816926,0.00004408599],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06383695,0.002020272,0.9243937,0.0009422589,0.000114265,0.0006174627,0.0005375333,0.003363076,0.004174543],"genre_scores_gemma":[0.6036587,0.000614399,0.3869226,0.0007765336,0.0003721791,0.000881794,0.002728493,0.0007970965,0.003248141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009727998,"threshold_uncertainty_score":0.05144721,"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","authors":[{"name":"Abdullah Rashwan","is_ca":true},{"name":"Han Zhao","is_ca":false},{"name":"Pascal Poupart","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00898067,0.001895191,0.004142048,0.002207558,0.001463356,0.002760016,0.006350682,0.004618416,0.00716654],"category_scores_gemma":[0.04776167,0.002821881,0.002043086,0.002697307,0.003563936,0.008170526,0.006219055,0.005416604,0.001602621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002315988,"about_ca_system_score_gemma":0.002979514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005844118,"about_ca_topic_score_gemma":0.006149103,"domain_scores_codex":[0.9964456,0.001683521,0.0002018521,0.0008396487,0.0005605639,0.0002688874],"domain_scores_gemma":[0.9715982,0.02283414,0.001256668,0.002294913,0.001260028,0.0007559849],"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.0003160349,0.0001787593,0.0008483456,0.0001694256,0.0001465976,0.0001027611,0.0001522087,0.8042635,0.0009520503,0.1180905,0.002203972,0.07257583],"study_design_scores_gemma":[0.00001245971,0.00001218581,0.00005711919,0.000007404206,0.000009663503,0.00001291436,0.000006064499,0.9454033,0.0001721334,0.05408339,0.0002118654,0.00001149526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004743313,0.0001465481,0.9942256,0.0001716678,0.0000292025,0.00002872773,0.00005838448,0.0001779361,0.0004186332],"genre_scores_gemma":[0.4496236,0.0008063607,0.538026,0.0004326699,0.0003902621,0.0004694565,0.001010044,0.0005219689,0.00871962],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00898067,"threshold_uncertainty_score":0.04749495,"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","authors":[{"name":"Peng Xu","is_ca":false},{"name":"Bryan He","is_ca":false},{"name":"Christopher De","is_ca":false},{"name":"Ioannis Mitliagkas","is_ca":true},{"name":"Christopher Ré","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169875,0.0008111881,0.001030613,0.0006773804,0.000477311,0.001457585,0.00100474,0.0009935295,0.01447229],"category_scores_gemma":[0.005610795,0.0004483522,0.0007993242,0.0007352098,0.0009472174,0.0009223006,0.001806202,0.001781225,0.002638267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000760634,"about_ca_system_score_gemma":0.001512836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001367421,"about_ca_topic_score_gemma":0.002522013,"domain_scores_codex":[0.9991859,0.000271582,0.00002776957,0.0001069696,0.0003375772,0.00007025016],"domain_scores_gemma":[0.9985128,0.0006729584,0.0000586711,0.0003254009,0.0003352078,0.00009492964],"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.0002840627,0.0001193642,0.0007218553,0.0001182571,0.0001142249,0.0001386319,0.00009623131,0.4698056,0.003541979,0.3231404,0.01823547,0.1836839],"study_design_scores_gemma":[0.00002833762,0.00002323693,0.00006579929,0.000008091285,0.000008085955,0.00002768142,0.000004180301,0.9472063,0.0008918645,0.04749858,0.004231716,0.000005986863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01187899,0.0004089205,0.9590244,0.0006787429,0.0005875946,0.00005111416,0.00008868678,0.0008398318,0.02644158],"genre_scores_gemma":[0.4308392,0.000520118,0.5109951,0.0005361858,0.0004858306,0.0002662887,0.000356872,0.0009091154,0.05509133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01447229,"threshold_uncertainty_score":0.04841459,"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","authors":[{"name":"Ruth Urner","is_ca":true},{"name":"Shai Ben-David","is_ca":true},{"name":"Ohad Shamir","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01051696,0.001338272,0.002618544,0.001608778,0.001389634,0.003324021,0.0038038,0.003448543,0.003759255],"category_scores_gemma":[0.08113948,0.001204768,0.001287916,0.001399762,0.004165202,0.009719865,0.007494238,0.004940781,0.001606561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001720778,"about_ca_system_score_gemma":0.00157572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001090038,"about_ca_topic_score_gemma":0.001317203,"domain_scores_codex":[0.9928437,0.003393081,0.0002964035,0.001884236,0.001189448,0.000393131],"domain_scores_gemma":[0.9503491,0.03660108,0.002803766,0.005969176,0.002984118,0.001292907],"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.001548557,0.0005113286,0.02904154,0.0008647543,0.0003755114,0.0006262034,0.002724553,0.3306992,0.005973506,0.3633756,0.01476649,0.2494929],"study_design_scores_gemma":[0.0001073288,0.0001844984,0.001002825,0.00006208992,0.00004122372,0.0001743344,0.0002513359,0.711127,0.002873162,0.2810763,0.003067045,0.00003288429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06341735,0.0003717299,0.9307538,0.002083668,0.0000459597,0.00009535257,0.0002278198,0.000454102,0.002550214],"genre_scores_gemma":[0.7586411,0.0004806481,0.230027,0.001160611,0.0002628742,0.0004880005,0.0011324,0.000207994,0.007599379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01051696,"threshold_uncertainty_score":0.05561966,"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","authors":[{"name":"Waïss Azizian","is_ca":false},{"name":"Ioannis Mitliagkas","is_ca":true},{"name":"Simon Lacoste-Julien","is_ca":true},{"name":"Gauthier Gidel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007907452,0.002651866,0.002479512,0.002268609,0.001183005,0.003004567,0.003933966,0.003311688,0.006955343],"category_scores_gemma":[0.03272929,0.001280284,0.002283636,0.001425043,0.00331449,0.005594802,0.005751888,0.006508292,0.001208538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002464361,"about_ca_system_score_gemma":0.003170854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005744274,"about_ca_topic_score_gemma":0.00538434,"domain_scores_codex":[0.9964412,0.001936801,0.0001386602,0.0003522055,0.0008432955,0.0002879352],"domain_scores_gemma":[0.9865155,0.009934863,0.0005130233,0.0006926478,0.001594757,0.0007492273],"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.0001277045,0.0001750113,0.0006438888,0.0003794299,0.0001635666,0.0001373845,0.0002381623,0.2028227,0.001527211,0.7425998,0.009154691,0.04203035],"study_design_scores_gemma":[0.00001244271,0.00005071051,0.0001526494,0.0000638694,0.00002602409,0.00003428691,0.00002384628,0.8485162,0.0002005969,0.1488214,0.002079909,0.00001815443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00263069,0.001130929,0.9902611,0.0004962054,0.0001323597,0.00007492295,0.00004206991,0.00009451623,0.005137157],"genre_scores_gemma":[0.3373234,0.004049433,0.6269045,0.001281994,0.0009738141,0.001067821,0.0003941266,0.001113649,0.02689122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007907452,"threshold_uncertainty_score":0.0418191,"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","authors":[{"name":"Yuri Burda","is_ca":true},{"name":"Roger Grosse","is_ca":true},{"name":"Ruslan Salakhutdinov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006985665,0.001576334,0.001786586,0.001758836,0.001103047,0.002969047,0.003249508,0.002230618,0.006497873],"category_scores_gemma":[0.04122642,0.00117524,0.001480038,0.001086489,0.001984084,0.003596066,0.00293557,0.004303462,0.003177015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00180336,"about_ca_system_score_gemma":0.001998255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004275035,"about_ca_topic_score_gemma":0.006698849,"domain_scores_codex":[0.9955389,0.002100982,0.0001976089,0.0006475385,0.001290671,0.0002243267],"domain_scores_gemma":[0.9843048,0.01007287,0.0009546579,0.002523978,0.001851551,0.0002920955],"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.0004699752,0.0002049986,0.005573772,0.0005369461,0.000239817,0.0002479487,0.0003462174,0.5432349,0.01188392,0.1759825,0.01218001,0.249099],"study_design_scores_gemma":[0.00001537472,0.00003097771,0.0004860516,0.00004388182,0.00001902354,0.00007842761,0.00002070126,0.9552214,0.004380545,0.03706124,0.00261162,0.00003082067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007115305,0.0002033681,0.98922,0.000166595,0.0000397186,0.00004697215,0.0001301881,0.001308956,0.001768835],"genre_scores_gemma":[0.229261,0.0003347057,0.762542,0.0004796603,0.0001144016,0.0004089734,0.001326542,0.001344659,0.004188051],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006985665,"threshold_uncertainty_score":0.03694415,"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","authors":[{"name":"Luc Bégin","is_ca":true},{"name":"Pascal Germain","is_ca":true},{"name":"François Laviolette","is_ca":true},{"name":"Jean-Francis Roy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006608512,0.002345069,0.002458534,0.003370943,0.002100463,0.006029332,0.004635679,0.003854212,0.009769985],"category_scores_gemma":[0.02484542,0.001330696,0.00222265,0.003436889,0.006238237,0.01028661,0.004882609,0.009067939,0.002714633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003357328,"about_ca_system_score_gemma":0.001852914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002430376,"about_ca_topic_score_gemma":0.001579605,"domain_scores_codex":[0.9931669,0.0027832,0.0002363609,0.001120069,0.002294059,0.0003995924],"domain_scores_gemma":[0.9873465,0.008183383,0.0007172873,0.001394397,0.001904094,0.0004544372],"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.00001858833,0.00002303738,0.0001128673,0.0001049213,0.00003462472,0.00004385892,0.00007500711,0.01286017,0.0002413616,0.9690263,0.003312545,0.01414672],"study_design_scores_gemma":[0.000004975381,0.00001533568,0.00006205638,0.00003312844,0.00001054819,0.0000394659,0.000009100275,0.07877116,0.0002234252,0.9177746,0.003041791,0.00001442765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00171458,0.0009525932,0.9827861,0.00152486,0.0001561059,0.00004882368,0.0001849378,0.0001697114,0.01246217],"genre_scores_gemma":[0.4245507,0.006000541,0.5387126,0.005992797,0.00305882,0.001289506,0.001095884,0.0007257374,0.01857328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009769985,"threshold_uncertainty_score":0.0349496,"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","authors":[{"name":"Peter Clifford","is_ca":false},{"name":"Ioana A. Cosma","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002290132,0.001155068,0.001358937,0.001831788,0.0005406319,0.001704778,0.002034203,0.00124791,0.004553631],"category_scores_gemma":[0.01832577,0.0006418295,0.001001257,0.001960008,0.0008482747,0.003243809,0.003249497,0.002271709,0.002069472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006983415,"about_ca_system_score_gemma":0.001444655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001245297,"about_ca_topic_score_gemma":0.001601862,"domain_scores_codex":[0.9986371,0.0002886762,0.0001384908,0.0002798357,0.0005858008,0.00007003489],"domain_scores_gemma":[0.9958071,0.002006098,0.0003308103,0.001095067,0.0005718912,0.0001890005],"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.0003722429,0.00008995598,0.001934991,0.0003752536,0.0001519562,0.0002230351,0.000368303,0.126955,0.01725757,0.05854195,0.00640171,0.7873281],"study_design_scores_gemma":[0.00005855064,0.00008156184,0.0003466925,0.00004023539,0.00002718138,0.0002552755,0.0000518581,0.9306257,0.005751018,0.0564209,0.006306062,0.00003501026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001470706,0.0001530097,0.9973221,0.0000506216,0.00003395723,0.0000740304,0.00008114707,0.000603963,0.0002104273],"genre_scores_gemma":[0.06878362,0.0003345243,0.9280542,0.0000893787,0.0001216797,0.0003882278,0.0005579421,0.0001584423,0.001511983],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004553631,"threshold_uncertainty_score":0.01523346,"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","authors":[{"name":"G. Gy. Balázs","is_ca":false},{"name":"András György","is_ca":true},{"name":"Csaba Szepesvári","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003883183,0.001391638,0.001453211,0.0007559501,0.0003908886,0.001552075,0.001230949,0.001277869,0.002169376],"category_scores_gemma":[0.01721989,0.0007220505,0.0007782428,0.0009202847,0.001873528,0.00293407,0.001869072,0.001950543,0.001032555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008744777,"about_ca_system_score_gemma":0.0007742469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009235783,"about_ca_topic_score_gemma":0.000696148,"domain_scores_codex":[0.997663,0.001154865,0.0001073456,0.0004890912,0.0004563332,0.0001292792],"domain_scores_gemma":[0.9947618,0.003563282,0.0005347946,0.0005313499,0.0004797555,0.0001290314],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000424781,0.0001264963,0.00187891,0.0004221121,0.0001653573,0.0001329914,0.000131777,0.6000233,0.01303944,0.2114619,0.003087509,0.1691054],"study_design_scores_gemma":[0.00001186712,0.0000643029,0.0002860132,0.00002159962,0.0000117248,0.00005427968,0.00001086085,0.9616091,0.003892424,0.03302921,0.0009922255,0.00001639803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005858368,0.00031082,0.9928164,0.0001196567,0.00001736693,0.00001595418,0.00004938665,0.0001565168,0.0006555347],"genre_scores_gemma":[0.5440267,0.001434442,0.4478938,0.0004764078,0.0002877313,0.0001918545,0.0006109679,0.0003254095,0.004752697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003883183,"threshold_uncertainty_score":0.02053648,"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","authors":[{"name":"Guillaume Rabusseau","is_ca":true},{"name":"Tianyu Li","is_ca":true},{"name":"Doina Precup","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001600189,0.0006717799,0.0006756583,0.0007753371,0.0005233804,0.001259652,0.001346251,0.001097346,0.002705812],"category_scores_gemma":[0.009936062,0.0005023805,0.0006014354,0.0005922343,0.001993711,0.003722096,0.001957961,0.001458387,0.0004836918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006681143,"about_ca_system_score_gemma":0.0005932717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001288053,"about_ca_topic_score_gemma":0.001395843,"domain_scores_codex":[0.9989435,0.0004630283,0.00005959379,0.0002546798,0.0002095972,0.00006972538],"domain_scores_gemma":[0.9958178,0.002965929,0.0003504697,0.0003794471,0.000381697,0.0001047355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007933295,0.00004690435,0.0008223405,0.0001580578,0.00005494798,0.0001732946,0.0003348507,0.5093688,0.004197434,0.4283153,0.0006939429,0.05575476],"study_design_scores_gemma":[0.000004007353,0.00002618151,0.00004833456,0.000009490548,0.00000509653,0.00002627844,0.00001792802,0.8385711,0.0007293883,0.1599055,0.0006481516,0.000008454039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01591086,0.0001422951,0.9820713,0.0001031746,0.00003582074,0.00001879936,0.00002689702,0.000246956,0.001443733],"genre_scores_gemma":[0.7162279,0.0003950852,0.2793032,0.0001790009,0.00009583894,0.0001944708,0.0001397612,0.0001585675,0.003306117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002705812,"threshold_uncertainty_score":0.009051859,"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","authors":[{"name":"Mohammad Emtiyaz Khan","is_ca":false},{"name":"Lin Wu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005025552,0.001400335,0.001837169,0.001537923,0.001007302,0.002421904,0.00387117,0.002069936,0.003151442],"category_scores_gemma":[0.01860318,0.001382553,0.001812079,0.001550557,0.002433551,0.003722311,0.004171195,0.004592157,0.0008576293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001786046,"about_ca_system_score_gemma":0.003101928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006871928,"about_ca_topic_score_gemma":0.00775411,"domain_scores_codex":[0.9978198,0.001155858,0.0001009045,0.0004607348,0.000355765,0.0001070263],"domain_scores_gemma":[0.9940263,0.00436844,0.0003081272,0.0007229815,0.0004151191,0.0001591248],"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.000121553,0.000100683,0.001379233,0.0002153994,0.0002548969,0.0001306994,0.0002097464,0.5971611,0.002458527,0.2197072,0.004606123,0.1736548],"study_design_scores_gemma":[0.00000704997,0.000008932861,0.00005935575,0.000009174259,0.000007935775,0.00001601155,0.000006896491,0.9385165,0.0006111086,0.06003401,0.0007141939,0.000008810942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001053914,0.00005998309,0.9983669,0.00007899245,0.00001509057,0.00002257104,0.00001674617,0.000134606,0.0002512075],"genre_scores_gemma":[0.1421679,0.0003042804,0.8535613,0.0003130934,0.0001315578,0.0002490552,0.0002974786,0.0005413104,0.002434083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006871928,"threshold_uncertainty_score":0.02657795,"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","authors":[{"name":"David Abel","is_ca":false},{"name":"Nate Umbanhowar","is_ca":false},{"name":"Khimya Khetarpal","is_ca":true},{"name":"Dilip Arumugam","is_ca":false},{"name":"Doina Precup","is_ca":false},{"name":"Michael L. Littman","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001789238,0.0008924238,0.0007551191,0.0006508761,0.0005953131,0.001941548,0.001661951,0.001019167,0.006722853],"category_scores_gemma":[0.004625426,0.000615711,0.001566135,0.0006931228,0.001510194,0.003187372,0.004262074,0.003369358,0.001043257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008753447,"about_ca_system_score_gemma":0.001326728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001380471,"about_ca_topic_score_gemma":0.002099546,"domain_scores_codex":[0.9988556,0.0002774318,0.00009480288,0.0002281487,0.0003935902,0.0001505278],"domain_scores_gemma":[0.998218,0.0007403555,0.000119405,0.00060357,0.0001817242,0.0001370339],"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.0002193154,0.0001224571,0.0005583838,0.0001783899,0.00008169668,0.0002424957,0.0003466263,0.1609781,0.005806975,0.7132933,0.002668574,0.1155037],"study_design_scores_gemma":[0.00003139029,0.00006846241,0.0001206649,0.0000307181,0.00004248289,0.00006115897,0.00004575683,0.4112064,0.004880922,0.5767396,0.006755474,0.00001687884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006751448,0.00008771121,0.9878893,0.0001666083,0.00005748206,0.00004661067,0.0001434711,0.0007904244,0.004066946],"genre_scores_gemma":[0.5599312,0.0003685474,0.4244834,0.0003016259,0.00007328342,0.0002336618,0.0005562101,0.000378942,0.01367315],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006722853,"threshold_uncertainty_score":0.02249014,"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","authors":[{"name":"Jianqing Fan","is_ca":false},{"name":"Wenyan Gong","is_ca":false},{"name":"Chris Junchi Li","is_ca":false},{"name":"Qiang Sun","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003796307,0.0009091569,0.001399544,0.001187383,0.000391348,0.001425495,0.002460636,0.002112782,0.002341639],"category_scores_gemma":[0.02940568,0.0008115747,0.0006189216,0.001970186,0.001550048,0.003963381,0.001771451,0.003408476,0.0006584546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001003766,"about_ca_system_score_gemma":0.001028122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005705653,"about_ca_topic_score_gemma":0.00561953,"domain_scores_codex":[0.9987715,0.0006315145,0.00005741672,0.0001539605,0.0002890669,0.00009648671],"domain_scores_gemma":[0.9863452,0.0104261,0.000734345,0.001044333,0.001146883,0.0003032812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001433491,0.0001294014,0.0022051,0.0002818325,0.0001942117,0.0001942163,0.0001676985,0.4419657,0.002163909,0.4380561,0.01409939,0.1003991],"study_design_scores_gemma":[0.000006914522,0.00001026542,0.0001133137,0.0000123016,0.0000100639,0.00002655407,0.000009181357,0.9443605,0.0002404775,0.05410525,0.001099065,0.000005999826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006314,0.001623016,0.9876842,0.001952278,0.0001261021,0.00002336183,0.0001048003,0.000227359,0.001944853],"genre_scores_gemma":[0.5775858,0.00641144,0.3932167,0.001096872,0.001459347,0.0002511865,0.0009184086,0.0004471593,0.01861313],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005705653,"threshold_uncertainty_score":0.02007705,"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","authors":[{"name":"Yali Wang","is_ca":false},{"name":"Marcus A. Brubaker","is_ca":true},{"name":"Brahim Chaib-draa","is_ca":true},{"name":"Raquel Urtasun","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007861573,0.001546376,0.003303397,0.001599604,0.001139444,0.002069169,0.003534705,0.002318736,0.006913843],"category_scores_gemma":[0.02795172,0.002677065,0.002208447,0.001691211,0.002251614,0.004472518,0.003266372,0.005845265,0.0009010505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002591051,"about_ca_system_score_gemma":0.004842194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02498458,"about_ca_topic_score_gemma":0.02983041,"domain_scores_codex":[0.9979764,0.0007680492,0.0001530059,0.0005095548,0.0003815046,0.0002115183],"domain_scores_gemma":[0.9812236,0.01554084,0.0006282696,0.001017697,0.001137396,0.0004521628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004144254,0.0001622226,0.001899953,0.0002477243,0.0003141554,0.0001158672,0.0001778777,0.6986884,0.001313875,0.1867652,0.004441419,0.1054589],"study_design_scores_gemma":[0.00002139096,0.00001102406,0.0001050214,0.00000900815,0.00001465093,0.000008374479,0.000004818433,0.9247795,0.0001824363,0.0745348,0.0003209522,0.00000808848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008155867,0.0003826982,0.9899651,0.0004261889,0.00007412148,0.00002703194,0.0001051766,0.0002791128,0.0005847735],"genre_scores_gemma":[0.5129784,0.0014184,0.4699017,0.0007062839,0.0005971861,0.0004061493,0.001589025,0.0005826218,0.01182016],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02498458,"threshold_uncertainty_score":0.04967827,"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","authors":[{"name":"Hao Cheng","is_ca":false},{"name":"Yaoliang Yu","is_ca":false},{"name":"Zhang Xin-hua","is_ca":false},{"name":"Eric P. Xing","is_ca":false},{"name":"Dale Schuurmans","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002708271,0.002485118,0.002092962,0.001226551,0.00123506,0.0032271,0.003279633,0.002176936,0.01185078],"category_scores_gemma":[0.0186179,0.001090276,0.001293894,0.001655956,0.001908666,0.006566162,0.005034959,0.004529763,0.008419193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009312273,"about_ca_system_score_gemma":0.004289699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005034133,"about_ca_topic_score_gemma":0.01273732,"domain_scores_codex":[0.996298,0.0009296437,0.0002622345,0.0006260787,0.001568001,0.0003160267],"domain_scores_gemma":[0.9909934,0.002418537,0.0003738423,0.003573787,0.002194802,0.000445531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007905044,0.0003475844,0.001198204,0.0005573572,0.0001990871,0.0002515532,0.0002084223,0.08675484,0.02682126,0.09778526,0.06537721,0.7197087],"study_design_scores_gemma":[0.00009012584,0.000103001,0.0002412364,0.00003785178,0.00003705458,0.000158671,0.00006913181,0.8626813,0.008512012,0.1177792,0.01024652,0.00004398754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005027229,0.0005057336,0.9861475,0.0007936005,0.0003408075,0.00008968164,0.0005028035,0.003851591,0.002741069],"genre_scores_gemma":[0.1013329,0.0005985901,0.8839797,0.0004386129,0.0004683675,0.0001902835,0.002106812,0.0009841709,0.009900625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01185078,"threshold_uncertainty_score":0.03964478,"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","authors":[{"name":"Gintare Karolina Dziugaite","is_ca":false},{"name":"Kyle Hsu","is_ca":true},{"name":"Waseem Gharbieh","is_ca":false},{"name":"Gabriel Arpino","is_ca":false},{"name":"Daniel M. Roy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03489062,0.001366193,0.002935913,0.002034,0.002060386,0.005744502,0.00457733,0.003498996,0.005357931],"category_scores_gemma":[0.1481828,0.001622382,0.001053189,0.002053381,0.006636003,0.01753328,0.004517928,0.00795818,0.0008687823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00195762,"about_ca_system_score_gemma":0.002582758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007511761,"about_ca_topic_score_gemma":0.005523397,"domain_scores_codex":[0.985359,0.009616403,0.0006816193,0.001142872,0.002738712,0.0004614667],"domain_scores_gemma":[0.7963114,0.1849216,0.001975226,0.008309747,0.007029615,0.001452377],"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.0005147565,0.00009029557,0.003042896,0.0002735379,0.000101819,0.0001623355,0.0004213055,0.08062597,0.0002822408,0.8180159,0.007474137,0.0889948],"study_design_scores_gemma":[0.00004400447,0.00003218527,0.0001443545,0.00007789136,0.00002573609,0.00007220536,0.00004961016,0.4259282,0.0003699591,0.5708882,0.00234642,0.00002127627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01514324,0.004451425,0.9612163,0.007916621,0.000668092,0.00008286833,0.0001978593,0.0002655636,0.01005792],"genre_scores_gemma":[0.5435516,0.003658931,0.4350756,0.003985448,0.00255561,0.0002861151,0.0004108244,0.0003886968,0.01008719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03489062,"threshold_uncertainty_score":0.1845214,"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)","authors":[{"name":"Boyu Wang","is_ca":false},{"name":"Hejia Zhang","is_ca":false},{"name":"Peng Liu","is_ca":true},{"name":"Zebang Shen","is_ca":false},{"name":"Joëlle Pineau","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006009907,0.001687618,0.002089428,0.001668473,0.0007922057,0.002360484,0.00269302,0.002513707,0.002708115],"category_scores_gemma":[0.02306684,0.0007874003,0.001087687,0.003067087,0.002464815,0.003891692,0.004801105,0.004009623,0.001294089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002180883,"about_ca_system_score_gemma":0.001687382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002493673,"about_ca_topic_score_gemma":0.001568654,"domain_scores_codex":[0.9966695,0.001731445,0.0001986193,0.0006264633,0.0006130293,0.0001609272],"domain_scores_gemma":[0.9899733,0.007329929,0.0005212786,0.000882451,0.001004658,0.0002883472],"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.0001060441,0.0001421546,0.001490565,0.000628032,0.0001487753,0.0001641553,0.0002328728,0.3068748,0.001006313,0.4301027,0.01489037,0.2442131],"study_design_scores_gemma":[0.00001219525,0.00004504894,0.0001451284,0.00002728994,0.000009618054,0.0000677656,0.00002047387,0.7503044,0.0002086645,0.2456894,0.003452902,0.0000170345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001286284,0.001385705,0.9956246,0.0005090599,0.00005788836,0.00003662268,0.00004332942,0.0001172698,0.0009392342],"genre_scores_gemma":[0.2149128,0.005152517,0.7714204,0.0008864141,0.001004632,0.001061217,0.0006766842,0.0003234989,0.004561754],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006009907,"threshold_uncertainty_score":0.03178382,"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","authors":[{"name":"Waïss Azizian","is_ca":false},{"name":"Damien Scieur","is_ca":false},{"name":"Ioannis Mitliagkas","is_ca":true},{"name":"Simon Lacoste-Julien","is_ca":true},{"name":"Gauthier Gidel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001628483,0.001059089,0.0007370766,0.0007534659,0.0006640152,0.001285599,0.001037148,0.001131082,0.004459179],"category_scores_gemma":[0.007270359,0.0004673084,0.0007947183,0.0004068844,0.001856934,0.002400246,0.002296701,0.001734409,0.0007916345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009827034,"about_ca_system_score_gemma":0.001191524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001507507,"about_ca_topic_score_gemma":0.001394984,"domain_scores_codex":[0.999184,0.0003178453,0.00003331456,0.0001191066,0.000231577,0.0001141925],"domain_scores_gemma":[0.9975777,0.001300258,0.0002851868,0.000324148,0.0002808267,0.0002318844],"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.0001069928,0.00009415324,0.0005065905,0.00008949054,0.00004342408,0.000106803,0.0002376677,0.4736177,0.006772917,0.4849119,0.001666522,0.03184583],"study_design_scores_gemma":[0.00001500652,0.0000555914,0.0000588373,0.00001041001,0.000005600137,0.00002548067,0.00002487057,0.8763574,0.0008713048,0.1212188,0.001346942,0.000009780701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01820511,0.00009771715,0.9750251,0.0002171012,0.0000631939,0.00007143291,0.00002324823,0.0001615348,0.006135519],"genre_scores_gemma":[0.6687952,0.0003047037,0.3180273,0.000240849,0.00008256344,0.0003291996,0.00007192004,0.0002438178,0.01190437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004459179,"threshold_uncertainty_score":0.01491743,"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","authors":[{"name":"Jean-Francis Roy","is_ca":true},{"name":"Mario Marchand","is_ca":true},{"name":"François Laviolette","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095859,0.001988523,0.001987508,0.001376264,0.0008462335,0.002286623,0.003195415,0.002568992,0.01144219],"category_scores_gemma":[0.009336486,0.001105416,0.001290137,0.002517565,0.001152676,0.003225975,0.003336541,0.00408154,0.002920621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009739437,"about_ca_system_score_gemma":0.001925751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002981666,"about_ca_topic_score_gemma":0.004281305,"domain_scores_codex":[0.9978437,0.0007031102,0.00008791891,0.0003599126,0.0008000998,0.0002052638],"domain_scores_gemma":[0.9957967,0.002295418,0.0002000533,0.0008335801,0.000701797,0.0001724788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003267306,0.0003282859,0.0005043493,0.0002421547,0.000154115,0.000149867,0.00009652802,0.5726121,0.005083156,0.09917882,0.02857207,0.2927518],"study_design_scores_gemma":[0.00001240716,0.00002474753,0.00005629212,0.0000107373,0.00001134061,0.00003095035,0.00000567138,0.9739942,0.0008770943,0.02406389,0.000904028,0.000008688924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002217016,0.0002739627,0.9941728,0.000337808,0.0000719062,0.00002962334,0.00008860739,0.0004891006,0.002319168],"genre_scores_gemma":[0.1949602,0.0006244809,0.7870681,0.001035908,0.0005659943,0.0003076187,0.001140955,0.00094038,0.01335642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01144219,"threshold_uncertainty_score":0.03827792,"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","authors":[{"name":"Gauthier Gidel","is_ca":true},{"name":"Fabián Pedregosa","is_ca":false},{"name":"Simon Lacoste-Julien","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001425245,0.0008187848,0.001078748,0.0006706617,0.0003743225,0.0009830485,0.0009366076,0.00124578,0.002866395],"category_scores_gemma":[0.002975629,0.0004894515,0.0006630819,0.0005336534,0.001134545,0.001548094,0.001694369,0.001651103,0.001040234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005877519,"about_ca_system_score_gemma":0.001039673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001186357,"about_ca_topic_score_gemma":0.001231215,"domain_scores_codex":[0.9993479,0.00023261,0.00002939784,0.00008744307,0.0002423014,0.00006034858],"domain_scores_gemma":[0.9990956,0.0004498724,0.00008357297,0.0001278746,0.0001823164,0.00006078202],"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.0001385805,0.00006835965,0.0005597865,0.0001858527,0.00005468016,0.0002314284,0.0001655989,0.6595562,0.007604875,0.2165371,0.005221856,0.1096758],"study_design_scores_gemma":[0.000007829411,0.00002079574,0.00002877996,0.000007255039,0.000002287886,0.00002660793,0.000005833013,0.9811002,0.0005873105,0.0172366,0.0009714488,0.000005030261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003147998,0.00009039245,0.9949195,0.00009572288,0.00001834517,0.00002288022,0.00002713455,0.0001032696,0.001574669],"genre_scores_gemma":[0.2257364,0.0003059591,0.7663004,0.0001773721,0.00007900539,0.0002407577,0.0002131413,0.0001709941,0.006776082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002866395,"threshold_uncertainty_score":0.009589016,"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","authors":[{"name":"Alexander Terenin","is_ca":false},{"name":"Daniel Simpson","is_ca":true},{"name":"David Draper","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003447278,0.001151001,0.001180167,0.001303149,0.001134817,0.002439054,0.002504747,0.001585949,0.01458126],"category_scores_gemma":[0.01562145,0.0008350469,0.001153868,0.001767079,0.001444937,0.00276056,0.002317717,0.002270617,0.004389658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135201,"about_ca_system_score_gemma":0.002118467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004094969,"about_ca_topic_score_gemma":0.005848427,"domain_scores_codex":[0.9969399,0.001597705,0.00009378556,0.0005305339,0.0006846148,0.0001534071],"domain_scores_gemma":[0.9940214,0.004003997,0.0003016891,0.0009526059,0.0005194434,0.0002008062],"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.0001727079,0.0001361999,0.002427811,0.0004010947,0.0001366212,0.0002038559,0.0002970166,0.136025,0.00258836,0.6274148,0.03300861,0.1971879],"study_design_scores_gemma":[0.0000627417,0.00002772641,0.0003599242,0.00005991218,0.00003839005,0.0001855702,0.00003734471,0.6305916,0.002041211,0.3237129,0.04284832,0.00003428682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001544037,0.0003311601,0.9888903,0.0002767606,0.0001008362,0.0001229614,0.0003300367,0.00121559,0.007188232],"genre_scores_gemma":[0.1182295,0.0009773751,0.8644308,0.0005698429,0.000353453,0.0006820189,0.001618464,0.001027718,0.01211081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01458126,"threshold_uncertainty_score":0.04877919,"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","authors":[{"name":"Manjesh K. Hanawal","is_ca":false},{"name":"Csaba Szepesvári","is_ca":true},{"name":"Venkatesh Saligrama","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005579607,0.0008326934,0.0008045738,0.0005899216,0.0003765201,0.0008355551,0.0005712144,0.0005450316,0.003631985],"category_scores_gemma":[0.001272139,0.0005494116,0.0005469413,0.0008453747,0.0005590434,0.001096594,0.0009942818,0.0008078807,0.001541184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003595364,"about_ca_system_score_gemma":0.001149396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002897127,"about_ca_topic_score_gemma":0.00612811,"domain_scores_codex":[0.9995446,0.00006492124,0.00002420674,0.0001681475,0.0001597331,0.00003842028],"domain_scores_gemma":[0.9994313,0.0001242719,0.00004031436,0.0002055352,0.0001731665,0.00002551116],"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.0003895588,0.0001355951,0.001760054,0.0001505688,0.0001143684,0.0001270167,0.00009419191,0.08456396,0.07550633,0.01602072,0.01002632,0.8111114],"study_design_scores_gemma":[0.00001645933,0.0000845925,0.003434924,0.0000157531,0.00003385289,0.0002549393,0.00002603962,0.9379231,0.03053954,0.01035136,0.01729348,0.0000259112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01074371,0.0004131798,0.9836135,0.0001454084,0.0001839306,0.00004741931,0.0002182857,0.0007290904,0.003905462],"genre_scores_gemma":[0.4064335,0.001202963,0.5592855,0.0002179133,0.0002879016,0.0001540891,0.002079406,0.0002767041,0.03006205],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003631985,"threshold_uncertainty_score":0.01215017,"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","authors":[{"name":"Benjamin J. Lengerich","is_ca":false},{"name":"Sarah Tan","is_ca":false},{"name":"Chun‐Hao Chang","is_ca":true},{"name":"Giles Hooker","is_ca":false},{"name":"Rich Caruana","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007301816,0.002502973,0.001668789,0.002945048,0.0009989691,0.001632795,0.002660474,0.001861204,0.005328211],"category_scores_gemma":[0.02094912,0.001102511,0.002925471,0.002005413,0.001771066,0.002630146,0.003069074,0.00384296,0.003061656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071263,"about_ca_system_score_gemma":0.003626386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005256268,"about_ca_topic_score_gemma":0.007802418,"domain_scores_codex":[0.9971495,0.001437037,0.00018288,0.0005114329,0.0005183711,0.0002007512],"domain_scores_gemma":[0.990944,0.006573088,0.0003490967,0.001216322,0.0007796302,0.0001379407],"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.0003408577,0.0002004426,0.003383552,0.0003741066,0.0003802028,0.0003001863,0.0007004917,0.1049111,0.01227846,0.06984249,0.010367,0.7969211],"study_design_scores_gemma":[0.0000676976,0.0001083777,0.0007972171,0.00004041499,0.00007080385,0.0001841293,0.0001014723,0.8677157,0.003909223,0.1199198,0.007028613,0.0000566454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009172112,0.00002982706,0.9980925,0.00003753988,0.000006831562,0.00002332555,0.00003758671,0.0007636899,0.00009146553],"genre_scores_gemma":[0.02447086,0.00005965036,0.9737177,0.0000716106,0.00002776037,0.0002668824,0.0004126164,0.0004565799,0.0005164174],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007301816,"threshold_uncertainty_score":0.03861618,"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","authors":[{"name":"Bo Chang","is_ca":true},{"name":"Shenyi Pan","is_ca":true},{"name":"Harry Joe","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002130706,0.001161659,0.002290659,0.001534641,0.0007589155,0.001150868,0.001797131,0.001712059,0.004424837],"category_scores_gemma":[0.009852847,0.0009804608,0.001212029,0.001632996,0.0009959575,0.001972161,0.00158067,0.00252907,0.0008025835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001269312,"about_ca_system_score_gemma":0.00269041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01126126,"about_ca_topic_score_gemma":0.01378462,"domain_scores_codex":[0.9989889,0.0004485358,0.00004555482,0.000208969,0.0001883228,0.0001196484],"domain_scores_gemma":[0.9941843,0.004478721,0.000304637,0.0003114421,0.0005150188,0.0002058791],"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.00006339308,0.0000650108,0.001070046,0.00006372597,0.00006603495,0.00005052792,0.00004250201,0.9217476,0.0003608092,0.01511676,0.002550044,0.05880357],"study_design_scores_gemma":[0.000005049158,0.000005139711,0.00002917599,0.000002601142,0.00000249818,0.000004366737,0.000001965911,0.9969777,0.00004764383,0.002794228,0.000127979,0.000001702117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01319608,0.000506704,0.9837316,0.000227854,0.00003846723,0.00006980212,0.00008342166,0.0005931076,0.001552923],"genre_scores_gemma":[0.5165613,0.0005979082,0.4772241,0.0004800369,0.0001121988,0.0003900248,0.0007839735,0.0003350502,0.003515471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01126126,"threshold_uncertainty_score":0.02239144,"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","authors":[{"name":"Yeming Wen","is_ca":true},{"name":"Kevin Luk","is_ca":false},{"name":"Maxime Gazeau","is_ca":true},{"name":"Guodong Zhang","is_ca":true},{"name":"Harris Chan","is_ca":true},{"name":"Jimmy Ba","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01157494,0.001031109,0.001405502,0.001516982,0.0007544308,0.001796663,0.002845126,0.002316109,0.003630437],"category_scores_gemma":[0.09702546,0.001042913,0.0009586452,0.001525474,0.003327948,0.005023561,0.001992591,0.002698189,0.0002505281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001420317,"about_ca_system_score_gemma":0.001928835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006886044,"about_ca_topic_score_gemma":0.005110152,"domain_scores_codex":[0.9975271,0.00155744,0.00009482951,0.0002914518,0.0003740235,0.00015527],"domain_scores_gemma":[0.9160459,0.07383517,0.002908594,0.00267658,0.003630569,0.0009031068],"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.0002694834,0.0002913285,0.01558028,0.0004440994,0.0002308819,0.0004245761,0.0004859575,0.5649873,0.001713425,0.380117,0.005020155,0.03043555],"study_design_scores_gemma":[0.00001838055,0.00004952027,0.001932341,0.00005113574,0.00001704334,0.00009183487,0.00006088536,0.9671764,0.0001881526,0.02960744,0.0007883412,0.00001845159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2440673,0.004856339,0.7394854,0.003080414,0.0002312544,0.0001424758,0.0002223318,0.0003051302,0.007609454],"genre_scores_gemma":[0.9293525,0.001647205,0.06202164,0.0003313115,0.0003109737,0.0001253584,0.0005365268,0.0003561107,0.005318401],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01157494,"threshold_uncertainty_score":0.06121486,"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","authors":[{"name":"Thang Doan","is_ca":true},{"name":"Mehdi Bennani","is_ca":false},{"name":"Bogdan Mazoure","is_ca":true},{"name":"Guillaume Rabusseau","is_ca":true},{"name":"Pierre Alquier","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00396964,0.0009864081,0.001353815,0.001244679,0.001152629,0.001497043,0.002809747,0.001623203,0.002887137],"category_scores_gemma":[0.02507273,0.0006269054,0.0007627215,0.001188871,0.003567918,0.004586352,0.003095121,0.002785223,0.0004805548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001624235,"about_ca_system_score_gemma":0.00178799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00383996,"about_ca_topic_score_gemma":0.003543121,"domain_scores_codex":[0.9979749,0.0005207083,0.0001208997,0.0004698625,0.0006669278,0.0002467419],"domain_scores_gemma":[0.9865341,0.008244654,0.001489419,0.001505432,0.001467317,0.0007589615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003250063,0.0002318059,0.007574143,0.0003897895,0.0001594675,0.0005348237,0.0007453031,0.5227339,0.005233311,0.3365216,0.003914137,0.1216369],"study_design_scores_gemma":[0.00001341954,0.00009280528,0.0008319917,0.00002621966,0.00001497626,0.0001369951,0.00003853051,0.9017296,0.0008994603,0.09532253,0.0008687185,0.0000248363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03441267,0.0006141014,0.9618943,0.0005666404,0.00005339898,0.00005353062,0.00006854878,0.0002666638,0.002070083],"genre_scores_gemma":[0.8323093,0.0008874481,0.1598562,0.000389215,0.0002216263,0.0003337091,0.000277601,0.0001630677,0.005561827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00396964,"threshold_uncertainty_score":0.02099371,"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","authors":[{"name":"Pritish Kamath","is_ca":false},{"name":"Akilesh Tangella","is_ca":false},{"name":"Danica J. Sutherland","is_ca":true},{"name":"Nathan Srebro","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006193765,0.0009773239,0.001822741,0.000792436,0.0005264512,0.002843505,0.001705827,0.002151764,0.003865904],"category_scores_gemma":[0.0412639,0.0006552978,0.001205931,0.0005677934,0.003509525,0.006580564,0.003337941,0.003497261,0.001128975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022432,"about_ca_system_score_gemma":0.001269941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003077638,"about_ca_topic_score_gemma":0.001757566,"domain_scores_codex":[0.9958284,0.001576955,0.0001818839,0.001369418,0.0005711739,0.0004721855],"domain_scores_gemma":[0.9833786,0.009806916,0.00237528,0.003009974,0.0008925317,0.000536697],"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.0001471413,0.0001347011,0.008615974,0.0003023557,0.0003324424,0.0002436915,0.0004502606,0.1921377,0.002287753,0.6855067,0.008197002,0.1016443],"study_design_scores_gemma":[0.00002444287,0.00007985196,0.002208534,0.00006277852,0.00003386366,0.0001050109,0.00008683386,0.350998,0.000594232,0.6426109,0.003159299,0.000036273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06557621,0.0008797791,0.9132244,0.005442001,0.0001917894,0.00004161434,0.0002832445,0.0003767914,0.01398421],"genre_scores_gemma":[0.9076439,0.0009020704,0.08325652,0.00202354,0.0004915785,0.0001072588,0.0005140982,0.0005355141,0.00452554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006193765,"threshold_uncertainty_score":0.03275621,"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","authors":[{"name":"Hongteng Xu","is_ca":false},{"name":"Dixin Luo","is_ca":true},{"name":"Xu Chen","is_ca":false},{"name":"Lawrence Carin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004076941,0.001498658,0.001777978,0.001138098,0.001019021,0.001740926,0.002110409,0.001930769,0.004962975],"category_scores_gemma":[0.01732224,0.0009131703,0.001559773,0.001034707,0.002306494,0.004951027,0.003727996,0.003053074,0.0006118862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007712782,"about_ca_system_score_gemma":0.001058462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001961354,"about_ca_topic_score_gemma":0.00130676,"domain_scores_codex":[0.9980427,0.0007293897,0.00007329693,0.0004109939,0.0005728393,0.0001707437],"domain_scores_gemma":[0.9863311,0.009618232,0.0009407068,0.001487987,0.001118385,0.0005034879],"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.0002548335,0.00009909475,0.00289557,0.0002726098,0.0002177522,0.000705799,0.0003272974,0.3858846,0.008796091,0.5678537,0.002368495,0.03032413],"study_design_scores_gemma":[0.00002153395,0.00009541157,0.0005757897,0.00002237362,0.00004535808,0.0001780409,0.00006061374,0.8022104,0.00107614,0.1940309,0.001646445,0.00003702566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03772695,0.0008146892,0.9534394,0.0005708091,0.0001149159,0.00003475412,0.0001102961,0.0002274301,0.006960708],"genre_scores_gemma":[0.8985142,0.001353825,0.09098522,0.0006306399,0.0004550094,0.0001251628,0.0002526247,0.0001999182,0.007483419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004962975,"threshold_uncertainty_score":0.02156121,"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","authors":[{"name":"Kaiwen Wu","is_ca":true},{"name":"Gavin Weiguang Ding","is_ca":true},{"name":"Ruitong Huang","is_ca":true},{"name":"Yaoliang Yu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008480635,0.002083831,0.003179221,0.001093811,0.0005855938,0.001812715,0.003115887,0.002958973,0.005043351],"category_scores_gemma":[0.03152767,0.001752966,0.001721349,0.001004495,0.003008432,0.003689674,0.003342519,0.005407231,0.001148333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001538257,"about_ca_system_score_gemma":0.001841346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003805402,"about_ca_topic_score_gemma":0.004586785,"domain_scores_codex":[0.9967536,0.001813596,0.0001774504,0.0005528554,0.0004915845,0.0002108807],"domain_scores_gemma":[0.9807648,0.0169223,0.0004870067,0.0007340462,0.0008366921,0.0002552147],"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.0003573703,0.00008483828,0.0007703732,0.0003643979,0.0002995752,0.00009771813,0.0001525693,0.7350326,0.002100887,0.1796335,0.009783839,0.07132225],"study_design_scores_gemma":[0.00002054972,0.00004695151,0.000144774,0.00003388008,0.00001577067,0.00002315141,0.000008587639,0.9455171,0.0003854984,0.05316442,0.0006255436,0.00001385342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004845308,0.001204417,0.9903848,0.0005095751,0.0001200891,0.00003071078,0.0001215018,0.0003212668,0.002462263],"genre_scores_gemma":[0.4983419,0.002907487,0.4818344,0.001743028,0.001048176,0.0005577101,0.001596968,0.001138166,0.01083208],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008480635,"threshold_uncertainty_score":0.04485041,"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","authors":[{"name":"Botao Hao","is_ca":false},{"name":"Tor Lattimore","is_ca":false},{"name":"Csaba Szepesvári","is_ca":true},{"name":"Mengdi Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002330942,0.001074051,0.001882758,0.0003616973,0.000408253,0.001015909,0.001606502,0.001602812,0.00310397],"category_scores_gemma":[0.0142799,0.0005043797,0.0004878666,0.0004411484,0.001662245,0.001972788,0.001647748,0.002282195,0.0003751948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001278404,"about_ca_system_score_gemma":0.001409462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00327464,"about_ca_topic_score_gemma":0.002834385,"domain_scores_codex":[0.9985801,0.0005971172,0.0000527514,0.0003317843,0.0002359721,0.000202331],"domain_scores_gemma":[0.9909383,0.0070607,0.0006908505,0.0005719895,0.0003546595,0.0003835008],"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.0002400783,0.0001498752,0.001190134,0.0001267237,0.00006067125,0.0001050375,0.0000531428,0.9395552,0.0005469309,0.03516541,0.001726626,0.02108032],"study_design_scores_gemma":[0.00001914735,0.00002533522,0.00006955346,0.000005376287,0.000003439957,0.00000751935,0.000003292576,0.9848232,0.00009993629,0.01478128,0.0001591293,0.000002712475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06278317,0.0006849523,0.9291012,0.001444208,0.0001172393,0.00009825698,0.0002402032,0.0005905677,0.004940187],"genre_scores_gemma":[0.9285226,0.0002703202,0.06671134,0.0003585426,0.0001418587,0.0001803185,0.0002949898,0.00006624899,0.003453739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00327464,"threshold_uncertainty_score":0.01232737,"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","authors":[{"name":"Aristide Baratin","is_ca":true},{"name":"Thomas George","is_ca":true},{"name":"César Laurent","is_ca":true},{"name":"R Devon Hjelm","is_ca":false},{"name":"Guillaume Lajoie","is_ca":true},{"name":"Pascal Vincent","is_ca":true},{"name":"Simon Lacoste-Julien","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001081713,0.0007672302,0.000768766,0.0008154946,0.0004521281,0.001348552,0.001496723,0.001585622,0.002346389],"category_scores_gemma":[0.008074516,0.0004454933,0.0005324066,0.0008435695,0.001974137,0.003668427,0.003287372,0.002495265,0.0004889526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009964007,"about_ca_system_score_gemma":0.0006223744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007343835,"about_ca_topic_score_gemma":0.0009299656,"domain_scores_codex":[0.9992643,0.0002241455,0.00003267317,0.000179993,0.0002252484,0.00007364831],"domain_scores_gemma":[0.9971696,0.001243583,0.0005460771,0.0006720487,0.0002007642,0.0001679226],"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.00008412864,0.00006032424,0.0009331835,0.0001152816,0.00005349745,0.0001235769,0.0001707173,0.3004599,0.009996509,0.6320867,0.001879738,0.0540364],"study_design_scores_gemma":[0.00000690094,0.00003950961,0.00021272,0.000009999451,0.000005161807,0.00003599128,0.00000913989,0.8319463,0.001436743,0.1652369,0.001049408,0.00001129795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0224633,0.0001787288,0.9738547,0.0003335915,0.00004290449,0.00001572257,0.00003366937,0.0001581424,0.002919243],"genre_scores_gemma":[0.7858134,0.0003879725,0.2044023,0.0003648321,0.0002581994,0.0001498438,0.0001868184,0.0003310581,0.008105666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002346389,"threshold_uncertainty_score":0.007849455,"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","authors":[{"name":"Mathieu Sinn","is_ca":true},{"name":"Pascal Poupart","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01448064,0.001191851,0.001739214,0.003193538,0.001122702,0.002344311,0.002934228,0.002364112,0.006339276],"category_scores_gemma":[0.08057269,0.001151931,0.001713853,0.001737809,0.005093394,0.006695556,0.002754872,0.004721633,0.001015987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003612354,"about_ca_system_score_gemma":0.001903713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005437372,"about_ca_topic_score_gemma":0.003533248,"domain_scores_codex":[0.9955903,0.002081749,0.0001973738,0.000673836,0.001057172,0.0003995626],"domain_scores_gemma":[0.9264682,0.06181651,0.003483666,0.002854323,0.004556951,0.0008204898],"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.00003293573,0.00003091893,0.001630396,0.0001718085,0.00006803226,0.0001481278,0.0001999907,0.1032669,0.0006147167,0.8824044,0.00176444,0.009667389],"study_design_scores_gemma":[0.00001215847,0.00002501646,0.0005170473,0.00006229064,0.00001367647,0.00008685559,0.0000425738,0.4824249,0.0002792778,0.5151711,0.001330691,0.00003457316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01043186,0.0009439281,0.9831335,0.0008950972,0.0000705591,0.00003737359,0.0001555394,0.0003302017,0.004002002],"genre_scores_gemma":[0.708387,0.004824789,0.2625533,0.001781838,0.001354069,0.001058355,0.001905071,0.0008056281,0.01732993],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01448064,"threshold_uncertainty_score":0.07658184,"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)","authors":[{"name":"Guodong Zhang","is_ca":true},{"name":"Yuanhao Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006444142,0.00169606,0.001550065,0.001088761,0.00124514,0.002185242,0.001363131,0.001765114,0.003469512],"category_scores_gemma":[0.03999656,0.0007333848,0.0009708465,0.0006415041,0.005113989,0.003784037,0.003094444,0.004169783,0.0005661581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001781007,"about_ca_system_score_gemma":0.002563095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00295791,"about_ca_topic_score_gemma":0.002119435,"domain_scores_codex":[0.9977739,0.001160042,0.00007541524,0.0002920106,0.0004153981,0.0002832691],"domain_scores_gemma":[0.9821675,0.01477011,0.0007654498,0.0008063582,0.0009552345,0.0005352302],"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.0002542959,0.00008810157,0.001205418,0.0002636026,0.00007224459,0.0002614163,0.0002524696,0.3905961,0.002904053,0.5795569,0.00410141,0.02044401],"study_design_scores_gemma":[0.00002001389,0.00005611551,0.0001494408,0.00005985485,0.000009370485,0.00004397946,0.0000262707,0.8852212,0.0005626499,0.1129106,0.0009247198,0.00001571732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02860283,0.00125388,0.9528089,0.001853927,0.0002133674,0.0000784881,0.00005266267,0.0002241879,0.01491177],"genre_scores_gemma":[0.8377011,0.001785228,0.149107,0.0011138,0.0002325383,0.0003726078,0.0001056043,0.0004374417,0.00914468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006444142,"threshold_uncertainty_score":0.03408027,"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","authors":[{"name":"Christopher Srinivasa","is_ca":true},{"name":"Siamak Ravanbakhsh","is_ca":false},{"name":"Brendan J. Frey","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006259127,0.001258251,0.001693382,0.002895851,0.001737113,0.002965482,0.003366246,0.002179374,0.01793392],"category_scores_gemma":[0.04903873,0.001059151,0.001591077,0.005457258,0.001753134,0.007717314,0.003815652,0.004027693,0.002792739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002041027,"about_ca_system_score_gemma":0.003003272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00938533,"about_ca_topic_score_gemma":0.0154383,"domain_scores_codex":[0.9945289,0.003220089,0.0002235772,0.0006832011,0.001008334,0.0003357871],"domain_scores_gemma":[0.9632564,0.02862293,0.001204278,0.003176858,0.00304631,0.0006932205],"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.0002378242,0.000179933,0.002094622,0.0009867882,0.0003297902,0.0001924027,0.0002812723,0.07408769,0.0005796643,0.5600216,0.1036425,0.257366],"study_design_scores_gemma":[0.00005130061,0.00004239125,0.0003955026,0.0001745861,0.00007033769,0.00009361366,0.0001043462,0.3197207,0.0007584487,0.6441889,0.03437509,0.00002465619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006510377,0.003146481,0.962955,0.003992134,0.0004899127,0.0002588888,0.001743167,0.0008993509,0.02000465],"genre_scores_gemma":[0.2780663,0.004642453,0.6746991,0.003034739,0.001337972,0.0009990837,0.007408306,0.001232111,0.02857986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01793392,"threshold_uncertainty_score":0.059995,"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","authors":[{"name":"Tianyu Li","is_ca":true},{"name":"Guillaume Rabusseau","is_ca":true},{"name":"Doina Precup","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005151647,0.0005062941,0.0005283582,0.0006725621,0.0008475545,0.001663621,0.0006054461,0.0006116938,0.01087943],"category_scores_gemma":[0.002427245,0.0002434809,0.0006786896,0.0005650077,0.0009962602,0.002167138,0.00133291,0.001186752,0.002118197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001159092,"about_ca_system_score_gemma":0.0008182267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001476068,"about_ca_topic_score_gemma":0.001413848,"domain_scores_codex":[0.9996448,0.00007255139,0.000027737,0.0001272525,0.00009553879,0.00003208326],"domain_scores_gemma":[0.9990354,0.0003058812,0.00005005965,0.000214597,0.0003069001,0.00008726596],"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.00008410674,0.00004205291,0.0006029949,0.00009914309,0.00003165276,0.000126183,0.000249188,0.01825335,0.01056819,0.8968818,0.004840552,0.06822086],"study_design_scores_gemma":[0.00001000603,0.00003044182,0.0004084783,0.00002867678,0.00003042208,0.0001260785,0.00008018057,0.1484279,0.005706932,0.8077,0.03742573,0.00002525911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09333232,0.001602324,0.8077467,0.002203372,0.00126016,0.0000911133,0.0006679422,0.0009518448,0.09214414],"genre_scores_gemma":[0.7327438,0.001350865,0.1278037,0.0003614817,0.0003811609,0.0002078013,0.00113672,0.0003597237,0.1356547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01087943,"threshold_uncertainty_score":0.03639531,"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","authors":[{"name":"Haider Al-Tahan","is_ca":true},{"name":"Yalda Mohsenzadeh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001851677,0.001224972,0.0008240847,0.0007189726,0.0003036269,0.0008832323,0.002319245,0.001446684,0.002796844],"category_scores_gemma":[0.005263743,0.0004417769,0.0007510422,0.000473124,0.0008837045,0.001813502,0.001680667,0.002573234,0.001035883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005241156,"about_ca_system_score_gemma":0.0006479112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0019525,"about_ca_topic_score_gemma":0.003294135,"domain_scores_codex":[0.9992414,0.0002316579,0.00002579636,0.0002848439,0.0001426113,0.0000737728],"domain_scores_gemma":[0.9978513,0.001084998,0.000207907,0.0004216258,0.0003359622,0.00009833049],"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.0004261073,0.0005078647,0.002300685,0.0002228392,0.0001783506,0.0001250733,0.0001518901,0.3935792,0.02385513,0.01062053,0.009058293,0.558974],"study_design_scores_gemma":[0.00001299879,0.00007089737,0.0001970831,0.000008324576,0.000008210535,0.00002340222,0.00000755313,0.9934055,0.002711916,0.003083734,0.0004636786,0.000006737424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03328876,0.0004233567,0.960657,0.000244164,0.00008651672,0.00008133387,0.0001748046,0.002989824,0.002054223],"genre_scores_gemma":[0.701417,0.0002592043,0.2889733,0.0005548405,0.0002021648,0.0002126077,0.001046074,0.0003841531,0.006950619],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002796844,"threshold_uncertainty_score":0.009792745,"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","authors":[{"name":"Yue Wang","is_ca":false},{"name":"Linbo Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04135447,0.001181326,0.00339042,0.005333356,0.002764855,0.003730391,0.003110095,0.004447457,0.003910022],"category_scores_gemma":[0.1948149,0.00207176,0.003266471,0.002963342,0.01190764,0.01189923,0.006719879,0.007048744,0.0004271279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002832139,"about_ca_system_score_gemma":0.002225302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002386544,"about_ca_topic_score_gemma":0.001515651,"domain_scores_codex":[0.967232,0.01728265,0.001828624,0.007988005,0.004452176,0.001216515],"domain_scores_gemma":[0.6551909,0.3090055,0.01439374,0.01474824,0.004502794,0.002158865],"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.0001555476,0.00007539854,0.006154589,0.0002948801,0.0002570693,0.0006151511,0.0008439542,0.1245948,0.0007778182,0.8449175,0.001332892,0.01998036],"study_design_scores_gemma":[0.00002164534,0.0000175817,0.0003595484,0.00004620267,0.00003100977,0.0001979083,0.0000474144,0.2050724,0.0003087547,0.7933426,0.0005276873,0.00002726265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02477514,0.0003021337,0.9704497,0.001415249,0.00002917349,0.00007896247,0.0001658146,0.000248968,0.002534918],"genre_scores_gemma":[0.6674877,0.0004258196,0.3292096,0.0008377054,0.0001963128,0.0003493749,0.0003380921,0.0001169115,0.001038564],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04135447,"threshold_uncertainty_score":0.218706,"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","authors":[{"name":"Christian Weilbach","is_ca":true},{"name":"Boyan Beronov","is_ca":true},{"name":"Frank Wood","is_ca":true},{"name":"William T. Harvey","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01181937,0.002239459,0.002811299,0.002471355,0.001419592,0.003063153,0.005693614,0.003219127,0.01201725],"category_scores_gemma":[0.05194046,0.002083995,0.002394499,0.002955624,0.003334975,0.00678513,0.005227091,0.00661775,0.002655598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002788531,"about_ca_system_score_gemma":0.006110772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009548254,"about_ca_topic_score_gemma":0.01595769,"domain_scores_codex":[0.9940044,0.003841985,0.0003190754,0.0006809075,0.0007493009,0.0004042121],"domain_scores_gemma":[0.9632111,0.02994498,0.0008719168,0.003782377,0.001473766,0.00071586],"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.001013688,0.0004598986,0.001953684,0.0004315737,0.0003278307,0.0002272407,0.0002886482,0.3543003,0.001725695,0.4120017,0.0185292,0.2087404],"study_design_scores_gemma":[0.00006279882,0.00002773514,0.000099522,0.00002865755,0.0000254645,0.00002622489,0.00001599353,0.7994875,0.0005587651,0.1983043,0.001349356,0.00001364609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003122391,0.0003105916,0.9937571,0.0003186239,0.00007249198,0.00009666625,0.000301693,0.001353886,0.0006665088],"genre_scores_gemma":[0.1088474,0.0003503182,0.8829365,0.0004649011,0.0003000628,0.0008168658,0.002069825,0.000752868,0.00346123],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01201725,"threshold_uncertainty_score":0.06250751,"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","authors":[{"name":"Fang Huang","is_ca":true},{"name":"Zhenan Fan","is_ca":true},{"name":"Yifan Sun","is_ca":true},{"name":"Michael P. Friedlander","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003354737,0.001400914,0.001633644,0.0008350132,0.0004996562,0.001728104,0.001874681,0.001930003,0.003100656],"category_scores_gemma":[0.02247372,0.0008857293,0.0008021577,0.001201045,0.001926057,0.003215023,0.002462483,0.003567825,0.001097935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008039465,"about_ca_system_score_gemma":0.001660386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005324018,"about_ca_topic_score_gemma":0.006277763,"domain_scores_codex":[0.9983734,0.0009227452,0.00006841077,0.0001812716,0.0003461466,0.000108003],"domain_scores_gemma":[0.9931973,0.004993583,0.0002924647,0.0005661406,0.0007569906,0.0001934582],"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.0002443535,0.0001296459,0.001500806,0.0003490282,0.0001427219,0.0001914515,0.0002471075,0.5521987,0.002547332,0.3138047,0.02331962,0.1053245],"study_design_scores_gemma":[0.00002039993,0.00004270024,0.00009464793,0.00001892121,0.00001000401,0.00002272066,0.00001472466,0.9266534,0.0004407204,0.07098819,0.001686153,0.000007420076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003373056,0.0005751761,0.9935354,0.0004745027,0.00007207245,0.00002365621,0.00006403779,0.0002486359,0.001633391],"genre_scores_gemma":[0.2572109,0.0019613,0.730628,0.0007790696,0.0005902534,0.0003027066,0.0007049169,0.0007695291,0.007053308],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005324018,"threshold_uncertainty_score":0.0177418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}