{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":80,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":80,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"0738d2126206","filters":{"venue":"International Conference on Learning Representations"}},"results":[{"id":"W2753160622","doi":"","title":"Optimization as a Model for Few-Shot Learning","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":2447,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Initialization; Artificial intelligence; Meta learning (computer science); Convergence (economics); Deep learning; Metric (unit); Artificial neural network; Machine learning; Set (abstract data type); Parametrization (atmospheric modeling); Competitive learning; Class (philosophy); Domain (mathematical analysis); Learning to learn; Mathematics; Task (project management)","retraction":null,"screen_n_in":null,"score":{"opus":0.1464190826716082,"gpt":0.4031299499396052,"spread":0.256710867267997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000421788,0.0001986207,0.0001736197,0.0002514542,0.001685853,0.001853759,0.001498806,0.00009172261,0.0002952282],"category_scores_gemma":[0.002706677,0.0002175095,0.0001354296,0.00009377798,0.00009893464,0.00128446,0.0002565402,0.0004717811,0.0001753461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007995829,"about_ca_system_score_gemma":0.0001963373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005976038,"about_ca_topic_score_gemma":0.000009775063,"domain_scores_codex":[0.9980676,0.0001094331,0.0003406507,0.0006311497,0.0005573757,0.0002937862],"domain_scores_gemma":[0.9978196,0.0002736396,0.0005207464,0.0005740474,0.0006788529,0.0001331162],"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.00002881777,0.00003866038,0.0008845227,0.000003073983,0.00003229075,0.000003652074,0.001675286,0.6952714,0.000408482,0.293347,0.0001289448,0.008177863],"study_design_scores_gemma":[0.0007308198,0.00009992647,0.0009723533,0.00004374495,0.000008408187,0.000008465822,0.0003997105,0.9863824,0.0001173739,0.007791327,0.003211174,0.0002342911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002407244,0.000004802155,0.8682398,0.006817534,0.0004874072,0.0002590188,0.000003727896,0.0002658148,0.1215147],"genre_scores_gemma":[0.9072876,0.00004364864,0.05643923,0.0002645745,0.0001197192,0.0001453235,0.00008373857,0.00002458461,0.0355916],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9048803,"threshold_uncertainty_score":0.9996138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964335273","doi":"","title":"How to Construct Deep Recurrent Neural Networks","year":2014,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Music and Audio Processing","field":"Computer Science","cited_by":582,"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":"Recurrent neural network; Computer science; Deep learning; Artificial intelligence; Construct (python library); Feedforward neural network; Feed forward; Function (biology); Artificial neural network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03925941227028947,"gpt":0.3147329136198822,"spread":0.2754735013495928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001688021,0.0001275578,0.0001147352,0.0001617805,0.0002290671,0.0009746208,0.0007609122,0.0000389148,0.0001003284],"category_scores_gemma":[0.0004743663,0.0001240069,0.00005428129,0.0002346618,0.0000493279,0.0004448814,0.0001905393,0.0003010761,0.00005004302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003503931,"about_ca_system_score_gemma":0.00003137244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001355466,"about_ca_topic_score_gemma":0.000009008383,"domain_scores_codex":[0.9986789,0.0001178089,0.0001776128,0.0004373162,0.0003776379,0.0002107125],"domain_scores_gemma":[0.9989928,0.0001843177,0.0001342791,0.0002650293,0.0002979397,0.0001256333],"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.00001041338,0.00003604565,0.003878257,0.000003513728,0.00002503041,0.000004841221,0.001274356,0.0520456,0.0003521519,0.3646266,0.001162574,0.5765806],"study_design_scores_gemma":[0.0001795376,0.00007159698,0.002611556,0.00003488198,0.000002858238,0.00001267232,0.0001590925,0.9867647,0.0001104311,0.002118067,0.007780647,0.0001539776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01079298,0.000007066521,0.9349864,0.02375981,0.00112517,0.00009404848,7.856831e-7,0.0001613146,0.02907249],"genre_scores_gemma":[0.9875556,0.000004961417,0.009368742,0.001065621,0.000263156,0.000027507,0.00001441607,0.000007856293,0.001692192],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9767626,"threshold_uncertainty_score":0.9398291,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963386218","doi":"","title":"A Structured Self-Attentive Sentence Embedding.","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Topic Modeling","field":"Computer Science","cited_by":365,"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":"Embedding; Sentence; Computer science; Natural language processing; Artificial intelligence; Logical consequence; Regularization (linguistics)","retraction":null,"screen_n_in":null,"score":{"opus":0.05458417324847135,"gpt":0.3661503131841141,"spread":0.3115661399356427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001609694,0.0001387082,0.0001185437,0.0001438523,0.0007206844,0.001207229,0.001968035,0.00005213703,0.0001747201],"category_scores_gemma":[0.0005696433,0.0001399169,0.00007505622,0.00005660464,0.00006472192,0.0009221535,0.0004465283,0.0003491981,0.0001578591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006897849,"about_ca_system_score_gemma":0.00009412341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001393074,"about_ca_topic_score_gemma":0.00001814685,"domain_scores_codex":[0.9984345,0.00007258538,0.0002250141,0.0005461299,0.0005153716,0.0002064251],"domain_scores_gemma":[0.9982703,0.00009588754,0.0003101475,0.0008310878,0.0004087544,0.00008387479],"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.00001917215,0.0001209369,0.05404845,0.000007798694,0.0001922149,0.0000850249,0.007555213,0.01184489,0.003588795,0.8878938,0.0004385885,0.0342051],"study_design_scores_gemma":[0.0003974006,0.00003781533,0.04874118,0.00005376459,0.000007172565,0.00002206959,0.000396095,0.935191,0.000536455,0.01307705,0.0013325,0.0002075071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2073344,0.000009337242,0.6191267,0.01932611,0.00284407,0.000321693,0.000009187956,0.0006591816,0.1503693],"genre_scores_gemma":[0.9729578,0.00001630551,0.02333252,0.0001273016,0.0001396573,0.00002774577,0.000009214751,0.00000851492,0.003380905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9233461,"threshold_uncertainty_score":0.9998296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2901997113","doi":"","title":"Char2Wav: End-to-End Speech Synthesis","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":335,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique; Université de Montréal","funders":"","keywords":"End-to-end principle; Computer science; Speech synthesis; Speech recognition; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.09295328918588806,"gpt":0.3624233461629727,"spread":0.2694700569770846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003325211,0.0001645955,0.0001643949,0.0003242751,0.0007593175,0.001495697,0.002037018,0.00006336731,0.004040324],"category_scores_gemma":[0.003125869,0.0001675284,0.0001125875,0.0001068603,0.00008818629,0.0007289521,0.0003470157,0.0002789852,0.002615255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006507093,"about_ca_system_score_gemma":0.00009426342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002210982,"about_ca_topic_score_gemma":0.00004806055,"domain_scores_codex":[0.9981335,0.0001131951,0.0002634465,0.00057192,0.0006729452,0.0002450409],"domain_scores_gemma":[0.9978911,0.0004387332,0.0002411832,0.0008457612,0.0004083387,0.0001749175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002338186,0.0001378234,0.006631118,0.00000359071,0.000105229,0.00009531893,0.000867534,0.00009594116,0.00429979,0.2218988,0.001731073,0.7641104],"study_design_scores_gemma":[0.001684199,0.0003893369,0.4363977,0.0007213777,0.0000789178,0.0002966625,0.00187464,0.272077,0.1285068,0.04067498,0.1150485,0.002249939],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.06219863,0.000004218702,0.07413485,0.05760833,0.001842855,0.0003206572,0.00003528175,0.0004374396,0.8034177],"genre_scores_gemma":[0.9703228,0.00002753366,0.01752426,0.0003961497,0.0001789961,0.0001036668,0.00001114344,0.00001368729,0.01142174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9081242,"threshold_uncertainty_score":0.9995409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914442349","doi":"","title":"Multiple-Attribute Text Rewriting.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":192,"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":"Rewriting; Computer science; Programming language; Natural language processing; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.04690502205995051,"gpt":0.360655210535885,"spread":0.3137501884759345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002228865,0.0001320164,0.0001030269,0.0002423004,0.0003002427,0.0004766367,0.001187382,0.0000644734,0.000303326],"category_scores_gemma":[0.001384114,0.0001286258,0.00005551616,0.0003162138,0.0001236137,0.0006098339,0.0002842635,0.00037267,0.0003893707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006462355,"about_ca_system_score_gemma":0.00007677358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008371406,"about_ca_topic_score_gemma":0.00001895768,"domain_scores_codex":[0.9985344,0.00009311931,0.0002376315,0.0004643313,0.0004582919,0.0002122406],"domain_scores_gemma":[0.9983631,0.0002488325,0.0001649146,0.0003670761,0.0007852142,0.00007091125],"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.00002878969,0.0001141156,0.01620723,0.00000628548,0.0000573104,0.00004155557,0.002578907,0.00006962722,0.01620284,0.8851615,0.004341892,0.07518992],"study_design_scores_gemma":[0.001807085,0.0008815927,0.01877838,0.0005838709,0.00002250962,0.0001964313,0.001250721,0.6728545,0.102953,0.1613309,0.03790718,0.001433863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01644558,0.00006066437,0.8882903,0.01628231,0.0009542419,0.0002330449,0.00001075705,0.001724296,0.07599878],"genre_scores_gemma":[0.9098139,0.00001113222,0.08583745,0.000367612,0.0002484739,0.00003057979,0.00002754602,0.00001026506,0.003652986],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8933684,"threshold_uncertainty_score":0.5245208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2751842161","doi":"","title":"Improving Generative Adversarial Networks with Denoising Feature Matching","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":160,"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":"Discriminator; Generator (circuit theory); Computer science; Artificial intelligence; Generative grammar; Set (abstract data type); Adversarial system; Pattern recognition (psychology); Feature (linguistics); Matching (statistics); Task (project management); Noise reduction; Encoder; Image (mathematics); Feature extraction; Machine learning; Mathematics; Power (physics); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02734760063555377,"gpt":0.2982712933071036,"spread":0.2709236926715499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000219264,0.0002008797,0.0001657988,0.0001106192,0.001560756,0.00229326,0.001236266,0.00007462953,0.00007846455],"category_scores_gemma":[0.000304702,0.0001736019,0.00007437613,0.00008042408,0.000115586,0.001428432,0.0003160682,0.0005036902,0.00002529394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006890718,"about_ca_system_score_gemma":0.0001081699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003597124,"about_ca_topic_score_gemma":0.0001073612,"domain_scores_codex":[0.9984215,0.0001418604,0.0001791787,0.0005699923,0.0004245693,0.0002629108],"domain_scores_gemma":[0.9984544,0.0001507869,0.0004067578,0.0005925857,0.0003030303,0.0000924737],"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.0001382996,0.00009559592,0.006049516,0.000003971551,0.0003037454,0.0001190849,0.003047303,0.7727026,0.005979152,0.1189009,0.001016755,0.09164307],"study_design_scores_gemma":[0.0006141909,0.0001047703,0.006669126,0.00007612257,0.00001633031,0.00001708568,0.0003539461,0.9886411,0.001147896,0.001202505,0.0008752209,0.0002817005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006258005,0.00001102198,0.9649398,0.00631319,0.0009801749,0.000147294,0.000002713923,0.0001068556,0.02124094],"genre_scores_gemma":[0.950886,0.00001706782,0.04536499,0.0001585419,0.0006397744,0.00003766918,0.0000197663,0.0000159183,0.002860288],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.944628,"threshold_uncertainty_score":0.9997391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2785948534","doi":"","title":"NerveNet: Learning Structured Policy with Graph Neural Networks","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":155,"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":"Reinforcement learning; Concatenation (mathematics); Computer science; Transfer of learning; Artificial intelligence; Graph; Benchmarking; Machine learning; Artificial neural network; Control (management); Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03155445305249521,"gpt":0.3241901345896976,"spread":0.2926356815372024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000199191,0.0002447878,0.0001743839,0.0004763326,0.000558124,0.000728846,0.001190451,0.00008664132,0.0003598428],"category_scores_gemma":[0.0004420097,0.0002229986,0.00008436919,0.0007366007,0.0002303373,0.0006319091,0.0002624069,0.0007806949,0.00009284297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009306435,"about_ca_system_score_gemma":0.0001392899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001766024,"about_ca_topic_score_gemma":0.00003002943,"domain_scores_codex":[0.997707,0.0002255176,0.0003400013,0.0005909106,0.0007317698,0.0004048015],"domain_scores_gemma":[0.998197,0.0002011452,0.0003335754,0.000456176,0.0006725632,0.0001395134],"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.00003055944,0.000014665,0.01517284,0.000001731791,0.00006474299,0.00001168991,0.0009398565,0.8629991,0.0001576712,0.1134301,0.0001022769,0.00707478],"study_design_scores_gemma":[0.0004680232,0.0005168562,0.01805655,0.00004060552,0.000007939104,0.00003467915,0.0002290695,0.9776757,0.0001279989,0.0009978125,0.001591119,0.0002536277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01786044,0.000006323301,0.9243043,0.003526348,0.0006315684,0.0001796455,0.000001010131,0.0004409599,0.0530494],"genre_scores_gemma":[0.9871295,0.00001581982,0.005333061,0.0003050997,0.0005668472,0.00002630485,0.0000519121,0.00002635578,0.006545114],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.969269,"threshold_uncertainty_score":0.9093618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2907502844","doi":"","title":"Deep reinforcement learning with relational inductive biases","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":136,"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":"Inductive bias; Statistical relational learning; Reinforcement learning; Computer science; Artificial intelligence; Inductive logic programming; Machine learning; Relational database; Multi-task learning; Data mining; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1159802418290208,"gpt":0.3604810611844719,"spread":0.244500819355451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001236572,0.0001735953,0.0001209949,0.0002608436,0.0004976129,0.0002228453,0.0003406452,0.00005351339,0.002148012],"category_scores_gemma":[0.001210589,0.0001503625,0.00005026264,0.0002583821,0.000317923,0.0004568801,0.0001086641,0.0005209415,0.0004912233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007622087,"about_ca_system_score_gemma":0.00008275975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006030314,"about_ca_topic_score_gemma":0.00002180303,"domain_scores_codex":[0.9981095,0.0001914469,0.0002715939,0.0005381445,0.0006620265,0.0002273507],"domain_scores_gemma":[0.9984136,0.0006824746,0.0002350675,0.0001686916,0.0004195604,0.00008055429],"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.0006036435,0.0002781083,0.03153994,0.000007704701,0.0001600999,0.00006581431,0.01160473,0.4860498,0.07625679,0.3830659,0.0008816113,0.009485914],"study_design_scores_gemma":[0.001473404,0.001937728,0.01413643,0.0003354794,0.00002690801,0.0001144534,0.003707639,0.8689534,0.09104052,0.00279781,0.01482489,0.0006513358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6782024,0.000003020778,0.05562949,0.003538297,0.0006671176,0.0002597945,0.00000297171,0.0002790046,0.261418],"genre_scores_gemma":[0.9869832,0.00001049723,0.0007774616,0.0003719701,0.0003305957,0.00004254809,0.00003826415,0.00001893238,0.01142649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3829036,"threshold_uncertainty_score":0.9987642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2996068536","doi":"","title":"Language GANs Falling Short","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Topic Modeling","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal; McGill University","funders":"","keywords":"Softmax function; Computer science; Sample (material); Inference; Metric (unit); Natural language generation; Quality (philosophy); Artificial intelligence; Diversity (politics); Machine learning; Ground truth; Fallacy; Sampling bias; Sample size determination; Statistics; Mathematics; Artificial neural network; Natural language","retraction":null,"screen_n_in":null,"score":{"opus":0.09059197135597538,"gpt":0.3557337931421951,"spread":0.2651418217862197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009236257,0.00009604965,0.00008843452,0.00008081189,0.0001121942,0.0002693579,0.0007996164,0.00003396595,0.0002493892],"category_scores_gemma":[0.0003213391,0.0001011003,0.00005500787,0.0001575389,0.00002126017,0.0003430465,0.0001623555,0.0003090944,0.0002275173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002843439,"about_ca_system_score_gemma":0.00005482096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004419564,"about_ca_topic_score_gemma":0.000005056891,"domain_scores_codex":[0.9988035,0.00005857104,0.0001984917,0.0004023962,0.0003937253,0.0001433342],"domain_scores_gemma":[0.9993833,0.00009568776,0.00005387369,0.000219698,0.000146413,0.000100986],"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.00002153843,0.00008365529,0.01710952,0.0000111583,0.0001087418,0.0001219397,0.03489196,0.09222154,0.02724701,0.7350851,0.0006862679,0.09241156],"study_design_scores_gemma":[0.0001472427,0.00004300845,0.00181133,0.00002106278,0.00000332397,0.000005728158,0.001131966,0.992832,0.001345406,0.001062648,0.001453372,0.0001428808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08404621,0.00001187149,0.808919,0.0231881,0.0003508608,0.0001059655,0.000003080233,0.0003906829,0.0829842],"genre_scores_gemma":[0.9875159,0.00001148755,0.0104664,0.0007811285,0.0001867961,0.00001516263,0.0000183402,0.000008035045,0.0009967835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9034697,"threshold_uncertainty_score":0.412275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2966574105","doi":"","title":"Understanding Posterior Collapse in Generative Latent Variable Models","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Topic Modeling","field":"Computer Science","cited_by":78,"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":"Latent variable; Generative grammar; Computer science; Latent variable model; Variable (mathematics); Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1761058557898787,"gpt":0.3340231839156236,"spread":0.1579173281257449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002110538,0.0001104795,0.0001231647,0.0002611708,0.0000850083,0.0003134667,0.000542112,0.00004964405,0.0003021577],"category_scores_gemma":[0.00007142661,0.0001163626,0.000035441,0.0002422071,0.00001828613,0.0007051048,0.0001781761,0.0002685484,0.0001186057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002694632,"about_ca_system_score_gemma":0.0001365705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001288772,"about_ca_topic_score_gemma":0.0000251184,"domain_scores_codex":[0.9986269,0.0001077895,0.0002585895,0.0004439696,0.0003777852,0.000184966],"domain_scores_gemma":[0.9992688,0.00013972,0.0001065949,0.0002800847,0.0001553168,0.0000495139],"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.000007841905,0.00002450966,0.00505066,0.000001841578,0.0000133106,0.000005759282,0.001454559,0.3448088,0.001772355,0.6465956,0.00002282575,0.0002419436],"study_design_scores_gemma":[0.0003999232,0.00004186925,0.0009041129,0.00005986789,0.000001445092,0.000006731809,0.0004764044,0.9359074,0.0001377255,0.06188602,0.00005841082,0.0001201192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1209686,0.000005610635,0.7889301,0.003417694,0.0007070298,0.0002483179,0.00000334986,0.00009898303,0.0856203],"genre_scores_gemma":[0.9817831,0.00001005142,0.01303253,0.0001869812,0.00003432365,0.0000286766,0.00001432084,0.000008025383,0.004902004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8608145,"threshold_uncertainty_score":0.4745131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2750933313","doi":"","title":"Distributed Second-Order Optimization using Kronecker-Factored Approximations","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":72,"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 gradient descent; Computer science; Computation; Overhead (engineering); Artificial neural network; Curvature; Algorithm; Machine learning; Scaling; Artificial intelligence; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08007162583441403,"gpt":0.3591140077257221,"spread":0.279042381891308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001893604,0.000195645,0.0001627505,0.0002949791,0.001078124,0.001440318,0.0015179,0.00009151713,0.0008622464],"category_scores_gemma":[0.001527821,0.0002128961,0.00007445255,0.0002123238,0.0001373791,0.001481162,0.0003336147,0.0002978732,0.00005022432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001397017,"about_ca_system_score_gemma":0.000151425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000660471,"about_ca_topic_score_gemma":0.000008406027,"domain_scores_codex":[0.99823,0.00009106645,0.0003743034,0.0005501402,0.000518096,0.0002363415],"domain_scores_gemma":[0.9974115,0.0001326271,0.000560761,0.0008626862,0.0009269862,0.0001054011],"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.00001255441,0.000132528,0.004335458,0.000004552681,0.00007767584,0.000007299893,0.000788675,0.5831189,0.0006132371,0.4083272,0.0002231731,0.002358747],"study_design_scores_gemma":[0.0003649997,0.00004021745,0.003976494,0.00004411042,0.000009361835,0.00001207026,0.0001052986,0.990036,0.0004701712,0.004434085,0.0002909507,0.0002162613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003326474,0.000002558586,0.9676248,0.002297752,0.0006009876,0.0002812279,0.00003258543,0.0003038108,0.02552973],"genre_scores_gemma":[0.7061213,0.000008581649,0.2923885,0.00005047815,0.0000594806,0.00005980489,0.0002285741,0.00001625462,0.00106708],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7027948,"threshold_uncertainty_score":0.9995963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2996680032","doi":"","title":"Efficient and Information-Preserving Future Frame Prediction and Beyond","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":72,"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; MNIST database; Autoencoder; Bottleneck; Artificial intelligence; Frame (networking); Machine learning; Feature extraction; Information bottleneck method; Margin (machine learning); Feature (linguistics); High memory; Key (lock); Deep learning; State (computer science); Algorithm; Mutual information","retraction":null,"screen_n_in":null,"score":{"opus":0.01964610070994115,"gpt":0.2979189959929102,"spread":0.2782728952829691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009212695,0.0001020082,0.0000811538,0.000125833,0.0002045282,0.0005023628,0.000357259,0.00004511972,0.00003605551],"category_scores_gemma":[0.0004697991,0.0001038563,0.00001734977,0.0001810563,0.00005850595,0.001323162,0.0003142227,0.0003022097,0.00001508954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002103801,"about_ca_system_score_gemma":0.00003893799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007047091,"about_ca_topic_score_gemma":4.127548e-7,"domain_scores_codex":[0.9990683,0.00004260815,0.0001981847,0.0002750703,0.0003090713,0.0001067189],"domain_scores_gemma":[0.9992748,0.00008797596,0.0001286358,0.0001396407,0.0002738939,0.00009505299],"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.00005684548,0.00006221163,0.01242275,0.00005908002,0.00006503222,0.00001030738,0.02317927,0.01076134,0.00693497,0.8365655,0.001467044,0.1084156],"study_design_scores_gemma":[0.0002131619,0.00007154164,0.006006434,0.00002749577,0.000003340505,0.00001162301,0.0007291571,0.9822553,0.0001863676,0.00593637,0.004452943,0.0001063045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01354594,0.00004824312,0.9298532,0.03755632,0.0002060899,0.0001606389,0.00001154649,0.0005138617,0.01810416],"genre_scores_gemma":[0.9079702,0.0000796134,0.09063323,0.001082137,0.0001037286,0.00002939752,0.00002217607,0.000005757484,0.00007371716],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9714939,"threshold_uncertainty_score":0.4844296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911248322","doi":"","title":"Learning to Learn with Conditional Class Dependencies","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":55,"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; Université de Sherbrooke; Dalhousie University","funders":"","keywords":"Computer science; Class (philosophy); Artificial intelligence; Machine learning; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03035484499736908,"gpt":0.3326982328008643,"spread":0.3023433878034952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002944693,0.000203739,0.0001566015,0.0003728735,0.0006326417,0.000591451,0.0009284702,0.00005957093,0.0006472527],"category_scores_gemma":[0.0006149482,0.0001852582,0.00006079061,0.0004504758,0.0001470191,0.0004847674,0.000233455,0.000708896,0.001465864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000718602,"about_ca_system_score_gemma":0.0001560284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000124376,"about_ca_topic_score_gemma":0.00004368557,"domain_scores_codex":[0.9976991,0.0002113719,0.0002531842,0.0006570443,0.0008598489,0.0003194433],"domain_scores_gemma":[0.9982767,0.0002609367,0.0001646624,0.0003151987,0.0008047437,0.0001777471],"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.0001346775,0.0002041882,0.03761658,0.000007569284,0.0002112264,0.00008783984,0.01140523,0.09083288,0.003206542,0.7975172,0.002164984,0.05661108],"study_design_scores_gemma":[0.001220534,0.002626196,0.05205874,0.000168583,0.0000178871,0.0001817984,0.002909735,0.8354447,0.001826244,0.01110489,0.09159653,0.0008441579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1089965,0.000004418586,0.6647187,0.02219601,0.0007881995,0.000258786,0.000007618108,0.0007879594,0.2022418],"genre_scores_gemma":[0.9616747,0.000004494149,0.0125623,0.0005268492,0.0003989635,0.00005398352,0.00005976012,0.00001901584,0.02469995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8526782,"threshold_uncertainty_score":0.9993116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963285940","doi":"","title":"Graph HyperNetworks for Neural Architecture Search.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":53,"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; Inference; Architecture; Artificial neural network; Network topology; Graph; Network architecture; Artificial intelligence; Machine learning; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05905441561582941,"gpt":0.3606030764095502,"spread":0.3015486607937208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001335584,0.0001478366,0.0001108274,0.0001939167,0.0004283295,0.0002479817,0.00107775,0.00005394532,0.0001160896],"category_scores_gemma":[0.00017247,0.0001454266,0.00009445792,0.0003815887,0.0001371527,0.0003124971,0.0001838289,0.0003584044,0.000108577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003681738,"about_ca_system_score_gemma":0.00004854468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001279814,"about_ca_topic_score_gemma":0.0000169194,"domain_scores_codex":[0.9984921,0.00008194859,0.000227379,0.0005552695,0.0003538564,0.0002894014],"domain_scores_gemma":[0.9983958,0.0004186074,0.0001117345,0.0004244012,0.0005457033,0.0001037752],"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.00004636589,0.00006735951,0.001137678,0.000002688743,0.00004537368,0.000003221868,0.001048094,0.07746403,0.0017102,0.8357261,0.001808335,0.08094057],"study_design_scores_gemma":[0.0004014633,0.0002347456,0.00247956,0.00002274899,0.000005748122,0.0000218704,0.000103096,0.9198883,0.0007478315,0.06268867,0.01318208,0.0002239224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01116927,0.000009296609,0.9562113,0.01309371,0.000589182,0.0003731637,0.000009444575,0.000317297,0.01822728],"genre_scores_gemma":[0.9664333,0.000015299,0.02935738,0.0004957281,0.0005815353,0.0001905318,0.0000567467,0.00001689445,0.002852542],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9552641,"threshold_uncertainty_score":0.5930326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786263712","doi":"","title":"Kronecker-factored Curvature Approximations for Recurrent Neural Networks","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":48,"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":"Kronecker delta; Recurrent neural network; Parameterized complexity; Computer science; Algorithm; Covariance; Gaussian; Inverse; Artificial neural network; Applied mathematics; Artificial intelligence; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06065494251667179,"gpt":0.3641504852356096,"spread":0.3034955427189378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014098,0.0001972201,0.0001476613,0.0001827664,0.0005584441,0.0003320818,0.001064257,0.00008409165,0.000166379],"category_scores_gemma":[0.0003640073,0.0001989797,0.0001088353,0.0004571858,0.0001401812,0.0006195631,0.0001824893,0.0004125566,0.00008852677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007895935,"about_ca_system_score_gemma":0.00005359491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006349822,"about_ca_topic_score_gemma":0.00001815146,"domain_scores_codex":[0.9982302,0.00008815087,0.0003511284,0.0006545617,0.0003598285,0.0003161528],"domain_scores_gemma":[0.9978947,0.0004096597,0.0002640242,0.0005171984,0.0007961817,0.0001182371],"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.0000657004,0.0001845354,0.00133981,0.000004816306,0.00008321337,0.00000204246,0.001166226,0.05434667,0.0007493814,0.8375815,0.004697937,0.0997782],"study_design_scores_gemma":[0.0003279961,0.0001929439,0.002017729,0.00002054893,0.000007820992,0.000007557246,0.00007149953,0.9681228,0.0002073467,0.01015865,0.01865998,0.0002050873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004192966,0.00001565636,0.9742188,0.009353999,0.001257497,0.0005722903,0.0000231525,0.0002964199,0.01006922],"genre_scores_gemma":[0.9571345,0.00002181044,0.03917479,0.0002948744,0.0006466597,0.0004148572,0.0002100771,0.00002009959,0.002082303],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9529415,"threshold_uncertainty_score":0.8114158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2995122033","doi":"","title":"Learning Disentangled Representations for CounterFactual Regression","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Causal Inference Techniques","field":"Mathematics","cited_by":40,"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":"Counterfactual thinking; Leverage (statistics); Computer science; Observational study; Selection bias; Covariate; Machine learning; Selection (genetic algorithm); Econometrics; Population; Model selection; Regression; Artificial intelligence; Statistics; Mathematics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.279971621243436,"gpt":0.4848305298920393,"spread":0.2048589086486033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002298927,0.0002813541,0.0003031041,0.0001732465,0.0004116732,0.0002089887,0.0004811863,0.0001135577,0.001175866],"category_scores_gemma":[0.007471581,0.0002710768,0.0001751348,0.0002365417,0.000123843,0.0004582152,0.0001391976,0.0006730023,0.0001009417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001149685,"about_ca_system_score_gemma":0.00009060157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002054771,"about_ca_topic_score_gemma":0.000008112226,"domain_scores_codex":[0.9976782,0.0001947865,0.0005601557,0.0006520466,0.0006074316,0.0003074365],"domain_scores_gemma":[0.9968143,0.001608772,0.0004372574,0.0002683297,0.0006837235,0.0001876755],"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.000807004,0.0003757364,0.01442048,0.0000912274,0.0003340143,0.00003520183,0.01488748,0.006120584,0.04121824,0.89101,0.01844097,0.01225907],"study_design_scores_gemma":[0.0049834,0.00272569,0.003288073,0.0008423245,0.0002648896,0.00004452811,0.03120186,0.3415065,0.0398052,0.5321841,0.04108804,0.002065397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1898557,0.00002436405,0.6462003,0.03767588,0.0009152503,0.002520359,0.0001828612,0.003130229,0.119495],"genre_scores_gemma":[0.9781236,0.00005148509,0.01543433,0.0003079081,0.0003110567,0.0003746253,0.0003079486,0.00006205786,0.00502696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7882679,"threshold_uncertainty_score":0.9999741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2995291884","doi":"","title":"On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":38,"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":"Minimax; Mathematical optimization; Convergence (economics); Gradient descent; Optimization problem; Computer science; Mathematics; Artificial intelligence; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.06320326867818603,"gpt":0.3032700120988561,"spread":0.2400667434206701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001917566,0.0001869136,0.0001425751,0.0001861039,0.0003224447,0.000503227,0.001254932,0.00006385004,0.0001990982],"category_scores_gemma":[0.001352533,0.0001644581,0.00009417839,0.0004952544,0.00008136855,0.0004111422,0.0002210125,0.0004088208,0.0001007115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006945648,"about_ca_system_score_gemma":0.00009741548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001666061,"about_ca_topic_score_gemma":6.227395e-7,"domain_scores_codex":[0.99802,0.0001480536,0.0003337112,0.0006021139,0.0006866247,0.000209518],"domain_scores_gemma":[0.9985223,0.0003716451,0.0002284579,0.0003629738,0.0003955539,0.0001190827],"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.00002099615,0.00005843339,0.0001341532,0.000002571952,0.00002973427,0.000003513849,0.001754393,0.5620769,0.00009895205,0.4330623,0.001407107,0.001350933],"study_design_scores_gemma":[0.0003449806,0.0001809128,0.0001511923,0.00003179136,0.000007048956,0.000006362327,0.0002617584,0.9956653,0.0002161137,0.002643694,0.0003231193,0.000167722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004388406,0.000004617261,0.9272605,0.01681809,0.0002544107,0.0003082803,0.000005340498,0.0004844311,0.05442548],"genre_scores_gemma":[0.8857782,0.00001543948,0.1113962,0.0017518,0.0001103306,0.0001476057,0.00009090768,0.00002125601,0.0006882107],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8853394,"threshold_uncertainty_score":0.6706406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2996151541","doi":"","title":"A Constructive Prediction of the Generalization Error Across Scales","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Generalization; Dependency (UML); Computer science; Constructive; Construct (python library); Artificial neural network; Artificial intelligence; Functional dependency; Scale (ratio); Range (aeronautics); Scaling; Generalization error; Machine learning; Algorithm; Theoretical computer science; Data mining; Mathematics; Process (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.0703062179486579,"gpt":0.3414039447837197,"spread":0.2710977268350617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005856957,0.00007597957,0.00007585913,0.00002576771,0.0002160051,0.0001095843,0.0006320665,0.00003172658,0.00004657247],"category_scores_gemma":[0.0001505673,0.00006117869,0.00006398433,0.0003329173,0.000109382,0.0002545883,0.0001759678,0.0001816687,0.00001717803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001880343,"about_ca_system_score_gemma":0.00003956012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002162365,"about_ca_topic_score_gemma":0.000006683121,"domain_scores_codex":[0.9990271,0.00008179976,0.0002186049,0.0002659916,0.0003090278,0.00009743637],"domain_scores_gemma":[0.9991907,0.00007468516,0.000194843,0.0001988265,0.0002930487,0.00004782609],"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.0000164056,0.00006469475,0.04170839,0.000006075878,0.00005635463,0.000001152044,0.004535801,0.06824885,0.0160945,0.8574606,0.001478123,0.01032907],"study_design_scores_gemma":[0.0003158169,0.00006036213,0.0675515,0.00003204477,0.000005859275,0.000007128822,0.0005851603,0.9197649,0.003611052,0.005408243,0.002560414,0.00009747663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3798777,0.00001386111,0.5453901,0.0569152,0.001084085,0.0005162417,0.0001160345,0.0002690737,0.01581773],"genre_scores_gemma":[0.9977198,0.00001207351,0.001465088,0.0003372869,0.0001257587,0.00003415426,0.00002394485,0.000004912448,0.0002769517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8520523,"threshold_uncertainty_score":0.2494794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3138602767","doi":"","title":"Isolating Sources of Disentanglement in Variational Autoencoders.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":35,"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":"Autoencoder; Hyperparameter; Mutual information; Correlation; Classifier (UML); Latent variable; Artificial intelligence; Total correlation; Computer science; Pattern recognition (psychology); Machine learning; Mathematics; Deep learning","retraction":null,"screen_n_in":null,"score":{"opus":0.03819528323690188,"gpt":0.3194879893338113,"spread":0.2812927060969095,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002233259,0.00008993857,0.0001057327,0.0002080038,0.000119229,0.0001156431,0.0004583623,0.00002871803,0.0005809174],"category_scores_gemma":[0.0002948719,0.00008965715,0.00004717671,0.0002551128,0.00008172644,0.0003662569,0.0001306346,0.0001336968,0.00003635418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004555264,"about_ca_system_score_gemma":0.00007610318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001556362,"about_ca_topic_score_gemma":0.00005844789,"domain_scores_codex":[0.998781,0.0001285886,0.0003017175,0.0002911587,0.000359726,0.0001377539],"domain_scores_gemma":[0.9990875,0.0001922984,0.0001897601,0.0001737335,0.0003213314,0.00003535631],"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.00005185013,0.0003222107,0.1231121,0.000005954455,0.0001271114,0.00001223783,0.01136554,0.1632985,0.007944396,0.670671,0.0006252543,0.02246386],"study_design_scores_gemma":[0.0002811344,0.00009514495,0.03428851,0.00004328583,0.000002864607,0.000001986557,0.0004624157,0.9562677,0.002346745,0.005701827,0.0004113856,0.00009705518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02669551,0.000006163908,0.9203491,0.003875943,0.0005160992,0.0001152024,0.000005113083,0.00004904091,0.0483878],"genre_scores_gemma":[0.9721096,0.00000720905,0.02706301,0.00008362857,0.0001578078,0.00002364225,0.00001080803,0.000004785441,0.0005395099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9454141,"threshold_uncertainty_score":0.6360638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2996067004","doi":"","title":"Generalization of Two-layer Neural Networks: An Asymptotic Viewpoint","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":34,"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":"Initialization; Generalization; Gradient descent; Layer (electronics); Artificial neural network; Population; Mathematics; Computer science; Flow (mathematics); Applied mathematics; Mathematical analysis; Artificial intelligence; Geometry; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.08250555733982355,"gpt":0.3510375405511749,"spread":0.2685319832113514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001312739,0.0001351424,0.0001470909,0.0001649575,0.0000999498,0.0001755927,0.0007951525,0.00004185088,0.000217608],"category_scores_gemma":[0.0003583629,0.0001413284,0.00006304714,0.0003961961,0.00005498263,0.0006153673,0.0001458241,0.0002075101,0.00001638034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000325418,"about_ca_system_score_gemma":0.00004535435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003468486,"about_ca_topic_score_gemma":0.000002480527,"domain_scores_codex":[0.9984488,0.0001663813,0.0003780089,0.0004240898,0.0004351533,0.0001475885],"domain_scores_gemma":[0.998717,0.0001016604,0.0002732697,0.0002738909,0.0005111152,0.0001230418],"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.000008108605,0.00004148878,0.001728785,0.000002200372,0.00001721742,0.000002271201,0.0009353567,0.5710766,0.00116436,0.4224079,0.00008383945,0.002531901],"study_design_scores_gemma":[0.0002881578,0.0002020057,0.001287945,0.00001896936,0.000006782557,0.000004952465,0.00007738733,0.9932674,0.0009568249,0.003717728,0.0000443369,0.0001275149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007542129,0.000008076632,0.9818614,0.005441787,0.0002940619,0.000184045,0.000002970623,0.0003131048,0.004352426],"genre_scores_gemma":[0.9681268,0.00001566452,0.03074509,0.0007685212,0.0001164217,0.00003347968,0.00007537912,0.00001318772,0.0001055089],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9605846,"threshold_uncertainty_score":0.5763205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3127129507","doi":"","title":"Incremental few-shot learning via vector quantization in deep embedded space","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":34,"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":"Forgetting; Overfitting; Learning vector quantization; Computer science; Artificial intelligence; Regularization (linguistics); Machine learning; Quantization (signal processing); Incremental learning; Support vector machine; Deep learning; Reproducing kernel Hilbert space; Vector quantization; Kernel (algebra); Pattern recognition (psychology); Artificial neural network; Algorithm; Mathematics; Hilbert space","retraction":null,"screen_n_in":null,"score":{"opus":0.05821540092947535,"gpt":0.3431383331195025,"spread":0.2849229321900272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004235792,0.0002221542,0.0002147881,0.0004294666,0.0003288959,0.0006267849,0.000617152,0.00009790132,0.001211619],"category_scores_gemma":[0.0012403,0.0002631466,0.0001022096,0.0008134986,0.00006177299,0.0008350495,0.0002503374,0.0008047812,0.000381577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001938363,"about_ca_system_score_gemma":0.0002035913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001232909,"about_ca_topic_score_gemma":0.0001462135,"domain_scores_codex":[0.9970813,0.0005653178,0.0004873026,0.000734827,0.0007920592,0.0003392085],"domain_scores_gemma":[0.9983792,0.0003667818,0.0002814746,0.0003304014,0.0005164876,0.0001256187],"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.0000787325,0.0004528345,0.07750378,0.00001849234,0.000133883,0.0002989361,0.01535898,0.2102705,0.06171115,0.5972294,0.000143911,0.03679938],"study_design_scores_gemma":[0.001129232,0.0001042401,0.0517048,0.0001000844,0.000008060953,0.00005326228,0.004130879,0.9327525,0.003621521,0.002240414,0.003754246,0.0004007769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1128116,0.00006028738,0.7700199,0.0076736,0.001219807,0.0002808157,0.00000264515,0.0004689672,0.1074624],"genre_scores_gemma":[0.9840883,0.00006357382,0.01042651,0.0002557852,0.0000974249,0.00004530342,0.0001606301,0.00002339234,0.004839083],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8712767,"threshold_uncertainty_score":0.9999821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962876041","doi":"","title":"An Exploration of Softmax Alternatives Belonging to the Spherical Loss Family","year":2016,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Topic Modeling","field":"Computer Science","cited_by":30,"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":"Softmax function; Probabilistic logic; Function (biology); Categorical variable; MNIST database; Computer science; Range (aeronautics); Mathematics; Algorithm; Artificial neural network; Artificial intelligence; Pattern recognition (psychology); Discrete mathematics; Machine learning; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1042967105268677,"gpt":0.3749509464872322,"spread":0.2706542359603645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002469793,0.00009657998,0.00009297267,0.0001183021,0.0001342514,0.0001545977,0.001068131,0.00002638479,0.00007527637],"category_scores_gemma":[0.0003615372,0.00006391116,0.00004428669,0.0001782813,0.00005252846,0.00133356,0.000146668,0.0001232433,0.00008730679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000473758,"about_ca_system_score_gemma":0.00006599554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008961965,"about_ca_topic_score_gemma":0.00001971111,"domain_scores_codex":[0.9985802,0.0001492535,0.0002639621,0.0003689985,0.0004962398,0.0001413728],"domain_scores_gemma":[0.9987567,0.000252541,0.0001431905,0.0004138473,0.0003654039,0.00006833099],"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.00002464052,0.00009173237,0.01097644,0.00000202764,0.00004214205,0.000007061269,0.007217684,0.04341233,0.03243806,0.7676459,0.00009066498,0.1380513],"study_design_scores_gemma":[0.001072137,0.0005702073,0.05795035,0.0003154335,0.00001321648,0.00001479631,0.004116753,0.8480596,0.01568765,0.06769388,0.003925782,0.0005801721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1158389,0.000002784511,0.862653,0.01672734,0.0003365822,0.000111796,0.000003238653,0.00008056028,0.004245845],"genre_scores_gemma":[0.9830117,0.00001620272,0.01576108,0.0001848437,0.0001238532,0.00004348687,0.000004059839,0.000007296859,0.0008474843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8671728,"threshold_uncertainty_score":0.2606221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2923289556","doi":"","title":"A new dog learns old tricks: RL finds classic optimization algorithms","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":29,"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":"Computer science; Optimization algorithm; Algorithm; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04493808541385731,"gpt":0.3381104561314346,"spread":0.2931723707175773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002664274,0.0001926355,0.0001767432,0.0004695986,0.0001950593,0.0007662723,0.001055901,0.0001010262,0.004122612],"category_scores_gemma":[0.0002954765,0.0001966721,0.0001054444,0.0006416918,0.00003560618,0.0009998586,0.0002277646,0.0005148779,0.001198583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001095393,"about_ca_system_score_gemma":0.000310628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000137297,"about_ca_topic_score_gemma":0.000006273259,"domain_scores_codex":[0.9976742,0.0001837733,0.0003786669,0.0006504612,0.0008150934,0.0002978154],"domain_scores_gemma":[0.9983796,0.0002304591,0.0002240721,0.0004684504,0.0005105902,0.0001868223],"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.00001404456,0.00009015739,0.004365931,0.000004623503,0.00005804302,0.000006903191,0.001626993,0.7592593,0.0002558879,0.207577,0.00234053,0.0244006],"study_design_scores_gemma":[0.0008975734,0.0001618243,0.001528435,0.00004707376,0.000004831233,0.000009516308,0.0002671394,0.9873877,0.0001141276,0.001796608,0.007555102,0.0002300575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000678296,0.000008499437,0.8744918,0.008504178,0.0008317069,0.0003184947,0.000004096541,0.0003061216,0.1148568],"genre_scores_gemma":[0.6021023,0.0001747007,0.1813392,0.0007133868,0.0002675867,0.00007548089,0.000238914,0.00004102979,0.2150473],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6931525,"threshold_uncertainty_score":0.9995791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2907257898","doi":"","title":"Transferring Knowledge to Smaller Network with Class-Distance Loss","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":22,"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; Class (philosophy); Computer network; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04954684195011518,"gpt":0.3549417961186118,"spread":0.3053949541684967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002526576,0.0001686905,0.0001485445,0.0001175603,0.0009609982,0.001054843,0.001690017,0.00004647614,0.000159004],"category_scores_gemma":[0.0002628855,0.0001541874,0.00005817389,0.0001298729,0.00008204305,0.0004924643,0.0002185638,0.0003775322,0.0003368907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005226488,"about_ca_system_score_gemma":0.0001002546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001550418,"about_ca_topic_score_gemma":0.0003251465,"domain_scores_codex":[0.998472,0.00009674312,0.0002035201,0.0005495957,0.0003815183,0.000296593],"domain_scores_gemma":[0.9985433,0.0001346648,0.0001444147,0.0007171069,0.0003127749,0.0001477554],"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.00008002238,0.000110721,0.07368802,0.000007693813,0.00008985251,0.00005196009,0.004140714,0.1204707,0.0001018358,0.7558079,0.001266708,0.04418391],"study_design_scores_gemma":[0.001317946,0.0004193759,0.3412787,0.0004327388,0.00001564182,0.00004488896,0.000276429,0.5424349,0.000154387,0.005422191,0.1074971,0.0007056203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05056421,0.0000123073,0.5511149,0.02030572,0.0008069147,0.0001879171,0.000002960325,0.0002809707,0.3767242],"genre_scores_gemma":[0.9762975,0.000008397379,0.005980692,0.0001801149,0.0002500856,0.00005193225,0.000009423626,0.00001555532,0.01720628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9257333,"threshold_uncertainty_score":0.9999822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2996091952","doi":"","title":"Augmenting Genetic Algorithms with Deep Neural Networks for Exploring the Chemical Space","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Machine Learning in Materials Science","field":"Materials Science","cited_by":20,"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":"Chemical space; Interpretability; Computer science; Genetic algorithm; Discriminator; Artificial neural network; Artificial intelligence; Space (punctuation); Quality control and genetic algorithms; Machine learning; Algorithm; Meta-optimization; Bioinformatics; Drug discovery","retraction":null,"screen_n_in":null,"score":{"opus":0.07105698301146753,"gpt":0.3216329128371807,"spread":0.2505759298257131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003106584,0.0001773322,0.0001538902,0.00004638927,0.0004151646,0.0005642874,0.0007398655,0.00003254277,0.0007340028],"category_scores_gemma":[0.0008697201,0.0001304454,0.00005829665,0.0001790427,0.0001785683,0.000288777,0.0001597826,0.0003242474,0.00006664963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003755504,"about_ca_system_score_gemma":0.00003522939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005534992,"about_ca_topic_score_gemma":0.000005136592,"domain_scores_codex":[0.9981653,0.0001568472,0.0002915596,0.0005454859,0.0005199066,0.0003209205],"domain_scores_gemma":[0.9987429,0.0004521841,0.0002317425,0.0002039469,0.0002561381,0.000113125],"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.0001468978,0.00002672414,0.003720119,0.00001072114,0.00002111736,0.000009325643,0.002345581,0.8576559,0.1259451,0.005521872,0.00009194157,0.004504652],"study_design_scores_gemma":[0.00034511,0.0001357335,0.002766065,0.00002388696,0.0000157745,0.00001365462,0.0007443212,0.9878227,0.007347053,0.000152472,0.0004594279,0.0001738498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6719767,0.00001061728,0.3112144,0.01365289,0.0007635036,0.0003969502,0.000008154304,0.0002128456,0.001763969],"genre_scores_gemma":[0.9823799,0.000005534208,0.0161379,0.0003884345,0.0005633308,0.000268855,0.00002627983,0.000026182,0.0002036069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3104032,"threshold_uncertainty_score":0.8036816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963682248","doi":"","title":"Reinterpreting Importance-Weighted Autoencoders","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":19,"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":"Upper and lower bounds; Interpretation (philosophy); Computer science; Marginal distribution; Artificial intelligence; Distribution (mathematics); Algorithm; Mathematics; Pattern recognition (psychology); Statistics; Random variable","retraction":null,"screen_n_in":null,"score":{"opus":0.04670941002473038,"gpt":0.3662012404771157,"spread":0.3194918304523853,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003863799,0.0001919026,0.0001701042,0.0002016973,0.001246207,0.001390564,0.002740838,0.00007704328,0.0005942436],"category_scores_gemma":[0.002230436,0.0001980306,0.0001085253,0.00009381909,0.0001509086,0.001342558,0.0006346776,0.0006974728,0.000227534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001077894,"about_ca_system_score_gemma":0.0001172507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001928051,"about_ca_topic_score_gemma":0.00002534563,"domain_scores_codex":[0.9979672,0.0001444783,0.0003459114,0.0006469178,0.0006092826,0.0002862365],"domain_scores_gemma":[0.997697,0.0002316964,0.0005984521,0.001024588,0.000343352,0.0001049055],"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.0000324934,0.00006287186,0.1285356,0.000005127403,0.0001096125,0.0001074715,0.002720104,0.0229497,0.0005806718,0.8219168,0.0006477999,0.0223317],"study_design_scores_gemma":[0.0004313447,0.0000538595,0.03527179,0.00008483288,0.00000684076,0.00001749275,0.0003151324,0.9465137,0.000156162,0.01478726,0.00210251,0.0002590659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02273813,0.000005546925,0.5926329,0.01452006,0.001614351,0.0001539803,0.000002579719,0.0004417851,0.3678906],"genre_scores_gemma":[0.9661712,0.00001597983,0.02754092,0.0001711828,0.0002008932,0.00003165152,0.00002080053,0.00001797168,0.00582941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.943433,"threshold_uncertainty_score":0.9996461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2904014149","doi":"","title":"Finding Flatter Minima with SGD","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Parallel Computing and Optimization Techniques","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":"Université de Montréal","funders":"","keywords":"Maxima and minima; Computer science; Artificial intelligence; Mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0514478710076336,"gpt":0.3483785570925074,"spread":0.2969306860848738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001495746,0.0001174707,0.00009028044,0.0002339667,0.0002775456,0.0003745242,0.0007106547,0.00003993314,0.0003265864],"category_scores_gemma":[0.000127414,0.0001051628,0.0000349432,0.0002595771,0.00009802163,0.0003720422,0.0001360035,0.0002110862,0.0002766325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003771685,"about_ca_system_score_gemma":0.00006699921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002549666,"about_ca_topic_score_gemma":0.000007007877,"domain_scores_codex":[0.9988049,0.00007712637,0.0001908236,0.0003924841,0.0003631311,0.0001715864],"domain_scores_gemma":[0.9989278,0.000116222,0.0001409855,0.000292481,0.0004641078,0.00005846056],"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.0001193856,0.0002769679,0.04918191,0.000008984355,0.000227355,0.00006790343,0.01006991,0.02024417,0.003031957,0.8518962,0.01908701,0.04578825],"study_design_scores_gemma":[0.0005864131,0.0005294085,0.0124647,0.0001400278,0.000007353925,0.00005131841,0.000228669,0.962369,0.00517142,0.005702202,0.01234207,0.0004074706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0145914,0.000001978538,0.8108089,0.005079582,0.0002584369,0.00008709991,0.000001150149,0.0004598781,0.1687116],"genre_scores_gemma":[0.9153085,0.000005910161,0.0785519,0.0004140075,0.0001522076,0.00002087537,0.00001417453,0.000009171077,0.005523214],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9421248,"threshold_uncertainty_score":0.4288416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2923023063","doi":"","title":"Modeling the Long Term Future in Model-Based Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","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":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Reinforcement learning; Term (time); Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05336023462993137,"gpt":0.3395181485785783,"spread":0.2861579139486469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005063282,0.0002171859,0.0001511911,0.0003592349,0.0005176333,0.0005611787,0.00145409,0.00008671531,0.0002038395],"category_scores_gemma":[0.0003475939,0.0001855391,0.00009041037,0.0004140927,0.0001182707,0.0005557809,0.0002818466,0.0009150184,0.0001747551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001710398,"about_ca_system_score_gemma":0.0002157337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006324796,"about_ca_topic_score_gemma":0.00003980559,"domain_scores_codex":[0.9976076,0.0001927146,0.000478996,0.0005234884,0.000834597,0.0003625433],"domain_scores_gemma":[0.9985235,0.0001630833,0.0002088102,0.0005286888,0.000499045,0.00007691718],"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.00001867914,0.00002069089,0.007520299,0.000003340925,0.00002029792,0.000006164452,0.001942255,0.9346972,0.0001621565,0.05304562,0.00002929044,0.002533969],"study_design_scores_gemma":[0.0004504243,0.000127357,0.002403097,0.00008758438,0.000005412826,0.000003825444,0.0003157911,0.9955931,0.0001409408,0.0004990416,0.0001727456,0.0002006313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02236455,0.000006875473,0.9443343,0.005369393,0.0005962415,0.0002340254,3.31721e-7,0.0001927883,0.02690149],"genre_scores_gemma":[0.9910206,0.00002751913,0.004062769,0.0004029264,0.0002984362,0.00006261072,0.00003843227,0.00001914502,0.004067599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.968656,"threshold_uncertainty_score":0.7566066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963200642","doi":"","title":"Sparsely-Connected Neural Networks: Towards Efficient VLSI Implementation of Deep Neural Networks","year":2016,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"MNIST database; Computer science; Artificial neural network; Deep learning; Convolutional neural network; Artificial intelligence; Energy consumption","retraction":null,"screen_n_in":null,"score":{"opus":0.05047194812276975,"gpt":0.3403865215796997,"spread":0.2899145734569299,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002072884,0.0002601242,0.0002394538,0.0002578732,0.0002547301,0.0001597762,0.00117382,0.00008161584,0.0003959055],"category_scores_gemma":[0.0001985979,0.0002173703,0.0001423141,0.0006380718,0.0001472168,0.0005200868,0.0003239184,0.0003284295,0.00002677974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001190357,"about_ca_system_score_gemma":0.00004523897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006965066,"about_ca_topic_score_gemma":0.00005151883,"domain_scores_codex":[0.9973571,0.0002261582,0.0006582409,0.0007257159,0.0006061238,0.0004266725],"domain_scores_gemma":[0.9975248,0.0005663675,0.0005405812,0.0005834406,0.0006367002,0.0001480917],"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.00003244981,0.00007259606,0.004805436,0.000002081341,0.00004664224,0.000005883775,0.0003052262,0.7098384,0.001135795,0.09755117,0.00008025337,0.1861241],"study_design_scores_gemma":[0.0007200735,0.0001461811,0.02727582,0.00002327008,0.00001447624,0.00001284788,0.0001884124,0.969323,0.0006225783,0.001314387,0.0001254429,0.0002334956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09134344,0.00002328518,0.8986691,0.006798029,0.0007731317,0.0004094206,0.00001035343,0.0002834915,0.001689721],"genre_scores_gemma":[0.9962163,0.00004662007,0.002865635,0.0001863865,0.0002198424,0.0001590208,0.00006178694,0.00002411087,0.0002202914],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9048728,"threshold_uncertainty_score":0.8864102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2995128076","doi":"","title":"A Closer Look at the Optimization Landscapes of Generative Adversarial Networks","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":17,"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":"Concatenation (mathematics); Computer science; Adversarial system; Generative grammar; Generator (circuit theory); Saddle point; Point (geometry); Visualization; Artificial intelligence; Field (mathematics); Deep learning; Bridge (graph theory); Machine learning; Theoretical computer science; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0342901584745485,"gpt":0.28078537204376,"spread":0.2464952135692115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001370555,0.000121287,0.0001318915,0.00005041752,0.0002454492,0.0001600866,0.0005994256,0.00004552475,0.0008141882],"category_scores_gemma":[0.0003307843,0.00009321832,0.00008820007,0.0002349506,0.0000715011,0.0003208533,0.0002485867,0.0002054201,0.0000352406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003100003,"about_ca_system_score_gemma":0.00006081971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003597077,"about_ca_topic_score_gemma":0.0000176957,"domain_scores_codex":[0.998686,0.0002405477,0.000255813,0.0003418521,0.0003434852,0.0001323661],"domain_scores_gemma":[0.9988963,0.0002664365,0.0002240461,0.0002009581,0.0003489933,0.00006326377],"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.00004106197,0.00002048546,0.0007638909,9.564237e-7,0.00006613704,0.000002320475,0.001441893,0.9757748,0.000672345,0.01755337,0.001803296,0.001859399],"study_design_scores_gemma":[0.0003160431,0.00008367646,0.0004682032,0.00001118356,0.00001066133,0.000001647415,0.0002360586,0.9957632,0.001399403,0.0001885319,0.001425426,0.00009594798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002092613,0.0000257156,0.9653345,0.01832916,0.0004033906,0.0001578575,0.000006985263,0.00005306766,0.01359665],"genre_scores_gemma":[0.98882,0.00007021487,0.009157435,0.0005675043,0.0003750098,0.00003532034,0.00005349475,0.000008395968,0.0009125831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9867274,"threshold_uncertainty_score":0.891479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963202404","doi":"","title":"FigureQA: An Annotated Figure Dataset for Visual Reasoning","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":16,"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; Polytechnique Montréal","funders":"","keywords":"Computer science; Plot (graphics); Visual reasoning; Artificial intelligence; Task (project management); Intersection (aeronautics); Bar chart; Scatter plot; Bounding overwatch; Minimum bounding box; Natural language processing; Smoothness; Baseline (sea); Machine learning; Line (geometry); Image (mathematics); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07102971897405239,"gpt":0.4403949223429446,"spread":0.3693652033688922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003457318,0.0001869429,0.0001551756,0.0001765211,0.001476495,0.001558258,0.002304506,0.00007969995,0.0002313067],"category_scores_gemma":[0.001860901,0.0001970988,0.00007019724,0.00009035876,0.00009781904,0.001314464,0.0002846577,0.0004397226,0.0002058216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005351559,"about_ca_system_score_gemma":0.0001124493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007007679,"about_ca_topic_score_gemma":0.00004433479,"domain_scores_codex":[0.9981803,0.0001201604,0.0002857967,0.0007332156,0.0004147912,0.0002657225],"domain_scores_gemma":[0.9975749,0.0002649681,0.0004320012,0.001098222,0.0004843697,0.0001455671],"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.0001057529,0.0005289077,0.04216962,0.00001534549,0.0001772226,0.00002241521,0.002304567,0.02182831,0.008557227,0.8562774,0.005655949,0.06235727],"study_design_scores_gemma":[0.0005948783,0.0001579013,0.1140107,0.00004030804,0.000009454819,0.000008252257,0.0001149297,0.8674757,0.0003806553,0.003798467,0.0131649,0.0002438993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2190443,0.00000939625,0.6907077,0.03950058,0.001396963,0.001287121,0.0009371951,0.0008671492,0.04624958],"genre_scores_gemma":[0.9740696,0.000006276371,0.02035116,0.0001987272,0.0002062851,0.0002615113,0.003135849,0.00002047948,0.001750124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8524789,"threshold_uncertainty_score":0.9998235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2994886105","doi":"","title":"Progressive Memory Banks for Incremental Domain Adaptation","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Computer science; Recurrent neural network; Domain adaptation; Parameterized complexity; Domain (mathematical analysis); Artificial intelligence; Artificial neural network; Adaptation (eye); Machine learning; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.09777329092838097,"gpt":0.3433704679106314,"spread":0.2455971769822504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002363832,0.0001699397,0.000147892,0.0001561849,0.0003258935,0.0004533116,0.0007355727,0.00006061395,0.0003835105],"category_scores_gemma":[0.0006663388,0.0001810866,0.0001095429,0.0002616862,0.00006498369,0.0006696894,0.0001371287,0.0003262285,0.0001982643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006940841,"about_ca_system_score_gemma":0.0001391253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001674074,"about_ca_topic_score_gemma":0.000002899144,"domain_scores_codex":[0.9981329,0.0001602349,0.0003451711,0.000564079,0.0005677395,0.0002298441],"domain_scores_gemma":[0.9986583,0.0002828224,0.0002777756,0.0001930677,0.0004262998,0.0001617253],"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.0002257306,0.0001660335,0.00168161,0.00002219041,0.0001758735,0.00004633839,0.03175338,0.03945927,0.009276599,0.8443804,0.001596442,0.07121614],"study_design_scores_gemma":[0.00149716,0.0003741612,0.002880777,0.00004577072,0.00001010074,0.00001354231,0.006078982,0.9706646,0.0009378116,0.006343808,0.01083134,0.0003219724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01446895,0.00002129446,0.9136764,0.02501817,0.0005103875,0.0005965792,0.00001418923,0.0004061707,0.04528783],"genre_scores_gemma":[0.9459119,0.000006570234,0.0511983,0.001172862,0.000218083,0.0002060607,0.0001490731,0.00001795019,0.001119173],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.931443,"threshold_uncertainty_score":0.7384497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2753228334","doi":"","title":"Online Bayesian Transfer Learning for Sequential Data Modeling","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":14,"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":"Hidden Markov model; Computer science; Artificial intelligence; Sequence (biology); Population; Context (archaeology); Machine learning; Sequence learning; Bayesian probability; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.2214864104494036,"gpt":0.4322454878549099,"spread":0.2107590774055063,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004973911,0.0001720032,0.0001605282,0.0001864398,0.001019247,0.001427575,0.004643749,0.00007436871,0.00008736163],"category_scores_gemma":[0.001503627,0.0001848241,0.00007238729,0.00004991921,0.00007956049,0.001837898,0.0008540447,0.0005423949,0.00002276453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004599972,"about_ca_system_score_gemma":0.0001386568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002961139,"about_ca_topic_score_gemma":0.00006710414,"domain_scores_codex":[0.9980847,0.0001168947,0.0003198895,0.0007911942,0.0004391806,0.0002481497],"domain_scores_gemma":[0.9976089,0.000200808,0.0001610656,0.001572315,0.0003731425,0.00008375937],"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.000106141,0.0004729198,0.003725065,0.00002554489,0.0003057769,0.00004460653,0.002719493,0.07324625,0.004336208,0.6542604,0.001826239,0.2589314],"study_design_scores_gemma":[0.0003707061,0.00009282017,0.0004502658,0.00007528422,0.00001249299,0.000008776703,0.0001279342,0.9888248,0.0002557001,0.005906337,0.003680679,0.0001941586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009094243,0.000003830909,0.9725016,0.007441327,0.0004448367,0.0002179522,0.0001220655,0.0004025323,0.009771599],"genre_scores_gemma":[0.9229544,0.00003775014,0.07368387,0.00008707881,0.0002079117,0.00005076521,0.001251819,0.00002026159,0.001706116],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9155786,"threshold_uncertainty_score":0.9996091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786406308","doi":"","title":"Espresso: Efficient Forward Propagation for Binary Deep Neural Networks","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; CUDA; Convolutional neural network; Memory footprint; Parallel computing; Binary number; Deep learning; Artificial neural network; Matrix multiplication; Artificial intelligence; Operating system; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.0384290167936386,"gpt":0.3438460892558937,"spread":0.3054170724622551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001734066,0.0001756879,0.0001307708,0.0001889691,0.0005511699,0.0002819451,0.0009481361,0.00006542169,0.00008407126],"category_scores_gemma":[0.0003060662,0.0001764065,0.00009498589,0.0003950857,0.0001415821,0.0003862807,0.0002123028,0.0002686082,0.00007888459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007901042,"about_ca_system_score_gemma":0.00003617492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008812057,"about_ca_topic_score_gemma":0.000009404709,"domain_scores_codex":[0.9982457,0.00008964004,0.0003332213,0.0006359578,0.0003863193,0.0003091846],"domain_scores_gemma":[0.9980044,0.0003989808,0.0002519253,0.0004534553,0.0007881204,0.0001030596],"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.00005414596,0.0001000932,0.0004875465,0.000002953084,0.00003063111,0.000002366806,0.0005635658,0.6278361,0.001577246,0.3325568,0.0004935177,0.03629505],"study_design_scores_gemma":[0.0003540498,0.0002126843,0.001860763,0.00001668295,0.000007295438,0.000008115101,0.00006966018,0.9901053,0.0005996698,0.004498456,0.002087211,0.0001801321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01304596,0.00001197254,0.9729536,0.005693659,0.0008672475,0.0006108079,0.000005161838,0.0003299905,0.006481602],"genre_scores_gemma":[0.980784,0.000008944166,0.01683557,0.0002918633,0.0004905313,0.0004694552,0.00008844581,0.00001969781,0.00101149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.967738,"threshold_uncertainty_score":0.7193646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3012851896","doi":"","title":"Convergence of Gradient Methods on Bilinear Zero-Sum Games","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":13,"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":"Convergence (economics); Bilinear interpolation; Zero (linguistics); Applied mathematics; Adversarial system; Computer science; Mathematical optimization; Generative grammar; Zero-sum game; Mathematics; Algorithm; Artificial intelligence; Nash equilibrium","retraction":null,"screen_n_in":null,"score":{"opus":0.3522170929303683,"gpt":0.5526990798639185,"spread":0.2004819869335502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001150612,0.0001668606,0.0002910095,0.0004031394,0.0001522154,0.0001728644,0.001176991,0.0000617754,0.0039604],"category_scores_gemma":[0.01984337,0.0001380377,0.0001581314,0.0008006141,0.0002724519,0.0002947562,0.0002213058,0.0005466045,0.0008289014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005349196,"about_ca_system_score_gemma":0.0001469548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000410602,"about_ca_topic_score_gemma":0.000003230278,"domain_scores_codex":[0.9955195,0.0006446224,0.0007251569,0.0007358527,0.002138214,0.0002367073],"domain_scores_gemma":[0.9944951,0.003065334,0.0004130041,0.0004244944,0.00139457,0.0002074914],"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.001113701,0.0006898414,0.04408732,0.00002395216,0.0003522298,0.00008701502,0.01394064,0.3822491,0.04386877,0.1979071,0.01167786,0.3040026],"study_design_scores_gemma":[0.00115552,0.001112199,0.02076418,0.0000832807,0.0000154998,0.000008549847,0.005394798,0.8362018,0.03966288,0.05318099,0.04198847,0.0004318272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1087376,0.00004240012,0.8092452,0.02968906,0.001475111,0.0005980488,0.0001071381,0.0001790989,0.04992635],"genre_scores_gemma":[0.9831194,0.00005355162,0.01121988,0.000270848,0.0001206008,0.00003319541,0.00002638476,0.00001622359,0.005139867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8743818,"threshold_uncertainty_score":0.9999491,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3130843035","doi":"","title":"Conservative Safety Critics for Exploration","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":12,"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":"Reinforcement learning; Computer science; Convergence (economics); Task (project management); Suite; Upper and lower bounds; Artificial intelligence; Machine learning; Mathematical optimization; Engineering; Mathematics; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.117497022015405,"gpt":0.379141317792146,"spread":0.261644295776741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002116543,0.0001302834,0.000129035,0.0001253811,0.0003106437,0.0004787887,0.0005230504,0.00005692994,0.0002231388],"category_scores_gemma":[0.002070685,0.0001476235,0.00008642254,0.0002454846,0.00007975584,0.0008343218,0.0001477986,0.0002632783,0.0001068828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009041642,"about_ca_system_score_gemma":0.0002562981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000154374,"about_ca_topic_score_gemma":0.00001086767,"domain_scores_codex":[0.9984492,0.0001425669,0.0003423723,0.0004255035,0.0004452711,0.0001950974],"domain_scores_gemma":[0.997215,0.0007006772,0.0001719606,0.0003388001,0.001506478,0.00006711167],"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.00001489497,0.00003472692,0.000645059,0.000005101281,0.00004670355,0.000009367834,0.001216881,0.2514834,0.0006253039,0.7428561,0.000745949,0.00231654],"study_design_scores_gemma":[0.0006166069,0.0001128152,0.001109663,0.00005639896,0.0000094078,0.00001123181,0.001614878,0.9587225,0.002720407,0.0152824,0.01953899,0.0002046517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003861848,0.000005540693,0.9230995,0.02075612,0.0007723424,0.0001768135,0.00000884677,0.0001654453,0.05462917],"genre_scores_gemma":[0.9106532,0.00007504399,0.06302591,0.0008563285,0.0001613198,0.0001261145,0.0003716069,0.00001858234,0.02471186],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9102671,"threshold_uncertainty_score":0.601991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2907134525","doi":"","title":"Gradient-based Optimization of Neural Network Architecture.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Neural Networks and Applications","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":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Computer science; Artificial neural network; Architecture; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03574961797958973,"gpt":0.3145263233935287,"spread":0.2787767054139389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001130697,0.0001065156,0.0001018732,0.000130571,0.0002147273,0.0001282417,0.0006848766,0.00003587425,0.0002346039],"category_scores_gemma":[0.0000880099,0.0001026277,0.00006683599,0.0004141591,0.0001285083,0.0001768197,0.00009474131,0.0001915559,0.00003124191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001952866,"about_ca_system_score_gemma":0.00005060516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002855473,"about_ca_topic_score_gemma":0.00001205112,"domain_scores_codex":[0.9988335,0.00008990417,0.0002557726,0.0003305769,0.0003160766,0.0001741818],"domain_scores_gemma":[0.9988241,0.0001746695,0.0002074199,0.0003233748,0.0004086898,0.00006181037],"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.00001127684,0.00004114631,0.001677064,0.000001195163,0.00001262534,9.808722e-7,0.0001427566,0.8320982,0.0003010699,0.1589604,0.0004304294,0.006322925],"study_design_scores_gemma":[0.0002016871,0.000131504,0.003037244,0.00002697511,0.000004168931,0.000003539574,0.00002004353,0.9903184,0.0004982967,0.004565666,0.001093142,0.00009937523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01450878,0.000006028033,0.9607181,0.006318843,0.0005266394,0.0001606582,0.000004001959,0.0001474213,0.01760953],"genre_scores_gemma":[0.9623868,0.000005985483,0.03651797,0.0002692417,0.000248046,0.00003521913,0.00004118578,0.000008203679,0.0004872822],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9478781,"threshold_uncertainty_score":0.4185034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2908176537","doi":"","title":"STOCHASTIC GRADIENT LANGEVIN DYNAMICS THAT EXPLOIT NEURAL NETWORK STRUCTURE","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":8,"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":"Langevin dynamics; Exploit; Computer science; Artificial neural network; Dynamics (music); Statistical physics; Langevin equation; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04822018521992996,"gpt":0.3171347456967895,"spread":0.2689145604768595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007962803,0.0001527061,0.0001150739,0.00009928142,0.0003855097,0.0003680972,0.0009041183,0.00005075494,0.0003043922],"category_scores_gemma":[0.00006431549,0.0001441497,0.00006224822,0.0003007305,0.0001074641,0.0003403471,0.0002147171,0.0003427197,0.0001264253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007109128,"about_ca_system_score_gemma":0.00003707245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000419896,"about_ca_topic_score_gemma":0.0001384166,"domain_scores_codex":[0.9986086,0.00007595161,0.0001981488,0.0004615302,0.0003886106,0.0002671123],"domain_scores_gemma":[0.9989308,0.0001585765,0.0001581698,0.0003907644,0.0002626246,0.00009902647],"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.00001585064,0.00005239859,0.003662915,0.000001907781,0.00004829243,0.000007870463,0.0008317984,0.1074274,0.0002244329,0.8538458,0.0039497,0.0299316],"study_design_scores_gemma":[0.0001655432,0.00008806729,0.006243217,0.00002881022,0.000006162889,0.00002005495,0.0001716894,0.9744543,0.00004334424,0.01715428,0.001454059,0.000170402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1418742,0.00002261564,0.8064275,0.01813746,0.002635048,0.0004446006,0.00003653491,0.0005534934,0.0298686],"genre_scores_gemma":[0.9941586,0.000007992114,0.002657837,0.0003693156,0.000598754,0.00004440129,0.00009611907,0.00001284716,0.00205415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8670269,"threshold_uncertainty_score":0.5878255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963359059","doi":"","title":"Variational Message Passing with Structured Inference Networks.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Generative Adversarial Networks and Image Synthesis","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":"University of British Columbia","funders":"","keywords":"Inference; Graphical model; Computer science; Message passing; Theoretical computer science; Approximate inference; Variable elimination; Probabilistic logic; Algorithm; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02879153737919618,"gpt":0.3079606261640736,"spread":0.2791690887848774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001809188,0.0001780751,0.0001387365,0.0001614694,0.0004641381,0.0006744466,0.0007298024,0.00005923953,0.0008890122],"category_scores_gemma":[0.0002946565,0.0001521638,0.00004865457,0.0003552059,0.0001661871,0.0007612238,0.0001548712,0.0002963156,0.00007373423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005635167,"about_ca_system_score_gemma":0.0001480756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006273153,"about_ca_topic_score_gemma":0.00005391594,"domain_scores_codex":[0.9983064,0.0001777398,0.0002399962,0.0005173182,0.0005160583,0.0002424724],"domain_scores_gemma":[0.9983031,0.0002898319,0.0002061369,0.000330989,0.0007793015,0.00009065447],"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.00008930377,0.0001044817,0.01422877,0.000002359583,0.0002359319,0.00002433666,0.002014135,0.29161,0.001742048,0.646888,0.001296645,0.04176399],"study_design_scores_gemma":[0.0003554166,0.0001630265,0.02760217,0.00004410026,0.000009162437,0.000009867151,0.0001195425,0.9642183,0.0005987037,0.004691644,0.001972152,0.0002159772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002713796,0.000005058921,0.9527256,0.003041938,0.0006490547,0.0001109814,0.00000387599,0.0001411027,0.04060853],"genre_scores_gemma":[0.9625701,0.00001125058,0.03511761,0.0002659703,0.0005221129,0.00004070061,0.00003563632,0.00001176982,0.001424793],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9598563,"threshold_uncertainty_score":0.973406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786478526","doi":"","title":"Adversarial Policy Gradient for Alternating Markov Games","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","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":"University of Alberta","funders":"","keywords":"Reinforcement learning; Artificial neural network; Computer science; Markov decision process; Markov chain; Gradient descent; Mathematical optimization; Temporal difference learning; Artificial intelligence; Markov process; Machine learning; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05030579220343445,"gpt":0.3677090667664834,"spread":0.317403274563049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003048087,0.0001733175,0.0001392882,0.0004093356,0.0004046644,0.0005135774,0.001172314,0.00005880692,0.0002070365],"category_scores_gemma":[0.001739506,0.0001808347,0.0001120708,0.0002839671,0.0001294544,0.0005105786,0.0002638427,0.0002624299,0.000197394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001551978,"about_ca_system_score_gemma":0.0001988369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001370964,"about_ca_topic_score_gemma":0.000009269274,"domain_scores_codex":[0.9981179,0.00009509576,0.0003625843,0.0005187051,0.0005746507,0.000331034],"domain_scores_gemma":[0.998107,0.0003809718,0.0002916499,0.0003968338,0.0007213083,0.0001022282],"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.00005587476,0.00005264203,0.003097879,0.000006553353,0.00011782,0.000005023688,0.003055187,0.09530484,0.001172774,0.8742134,0.001622507,0.02129552],"study_design_scores_gemma":[0.0007769259,0.0003773253,0.002612217,0.00005524354,0.000007716234,0.0000101523,0.0002614154,0.9709676,0.0008990321,0.006106345,0.01769534,0.0002306844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006322321,0.000002242926,0.8893006,0.007155095,0.001743713,0.0002850305,0.00000549309,0.0002510566,0.09493446],"genre_scores_gemma":[0.9567552,0.00001355437,0.02975092,0.00036565,0.001178023,0.00008053984,0.00004776444,0.00001830382,0.01179002],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9504329,"threshold_uncertainty_score":0.7374223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963633076","doi":"","title":"Learning to encode motion using spatio-temporal synchrony","year":2014,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Vision and Imaging","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","funders":"","keywords":"Computer science; Artificial intelligence; ENCODE; Motion (physics); Motion estimation; Margin (machine learning); Task (project management); Sequence (biology); Machine learning; Pattern recognition (psychology); Computer vision; Fraction (chemistry)","retraction":null,"screen_n_in":null,"score":{"opus":0.04797624201467336,"gpt":0.3647122563108589,"spread":0.3167360142961855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003159226,0.000158607,0.0001387304,0.0003630402,0.0003755477,0.0004219535,0.0006538719,0.00004178748,0.0002715673],"category_scores_gemma":[0.001024775,0.0001701162,0.0000663254,0.0003349866,0.0000374312,0.0007638684,0.0002329082,0.0003192636,0.0003171851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001188363,"about_ca_system_score_gemma":0.00006040607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001,"about_ca_topic_score_gemma":0.00001011579,"domain_scores_codex":[0.9981516,0.0002205925,0.0003000799,0.0005464078,0.0005400442,0.000241255],"domain_scores_gemma":[0.9988129,0.000165741,0.0001882005,0.0003029216,0.0003891833,0.0001410735],"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.0000305861,0.00009869099,0.0501545,0.000007394112,0.00003860229,0.0000114486,0.005248651,0.5289373,0.008452409,0.1521737,0.0002308712,0.2546158],"study_design_scores_gemma":[0.0002424644,0.0001069022,0.006089289,0.00006968275,0.000003188878,0.00001125055,0.0003699681,0.9843838,0.00073103,0.002575578,0.005223584,0.0001932441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0588088,0.000001813906,0.9198969,0.003128205,0.000541903,0.0001216536,0.000001015326,0.0002609844,0.01723873],"genre_scores_gemma":[0.9277166,0.000003941228,0.06977465,0.0003335742,0.0001420891,0.0000169236,0.00002996125,0.00001469699,0.001967576],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8689078,"threshold_uncertainty_score":0.6937137,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3041421878","doi":"","title":"Solving ODE with Universal Flows: Approximation Theory for Flow-Based Models","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":6,"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":"Ode; Computer science; Flow (mathematics); Applied mathematics; Mathematical optimization; Mathematical economics; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.2281806528029223,"gpt":0.4208250527881581,"spread":0.1926443999852357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743437,0.0001434832,0.0001606424,0.0002300299,0.0003260234,0.0003902029,0.0006107568,0.00006113241,0.0008232688],"category_scores_gemma":[0.001590155,0.0001204023,0.0001056602,0.0004179807,0.00007493944,0.0005122639,0.00005159248,0.0002148804,0.00008707419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005361134,"about_ca_system_score_gemma":0.0001524841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001349645,"about_ca_topic_score_gemma":0.000007351794,"domain_scores_codex":[0.9978431,0.0001507515,0.000409744,0.000555008,0.000886265,0.0001551024],"domain_scores_gemma":[0.9966366,0.001559512,0.0002779775,0.0002832242,0.001128793,0.0001138882],"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.0001818271,0.00003972593,0.0004292962,0.000002215898,0.00002167082,8.432685e-7,0.001118906,0.6507304,0.0006498086,0.3361853,0.0006336339,0.01000637],"study_design_scores_gemma":[0.0005406751,0.0001171566,0.0002018526,0.00001995334,0.00001220362,7.741707e-7,0.00180891,0.9096332,0.0005330336,0.08373632,0.003262216,0.0001337525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00904134,0.000002720768,0.9491389,0.01248563,0.000063237,0.0004818805,0.00005475505,0.0002165221,0.028515],"genre_scores_gemma":[0.9549391,0.000002553456,0.04256287,0.0005908649,0.0001056367,0.0001760011,0.0001753624,0.00001915508,0.001428482],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9458978,"threshold_uncertainty_score":0.9014215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2966262171","doi":"","title":"Reproducibility in Machine Learning for Health","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Explainable Artificial Intelligence (XAI)","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 Toronto","funders":"","keywords":"Computer science; Field (mathematics); Reproducibility; Machine learning; Scale (ratio); Artificial intelligence; Data science; Human health; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.088447391195338,"gpt":0.3988270749660196,"spread":0.3103796837706816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001786499,0.0001387795,0.0001959412,0.0003109144,0.0001800866,0.000244988,0.000822329,0.00004706817,0.0002963558],"category_scores_gemma":[0.002490199,0.0001490142,0.00008144734,0.0003698334,0.00003674125,0.0005762472,0.0001766974,0.0004745653,0.0003323602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001939276,"about_ca_system_score_gemma":0.0001991486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007190017,"about_ca_topic_score_gemma":0.000210899,"domain_scores_codex":[0.9972726,0.0002597478,0.0004683511,0.00129925,0.0003858019,0.0003142259],"domain_scores_gemma":[0.9979575,0.0004835168,0.0002399813,0.000899038,0.0003421408,0.00007777596],"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.00008671122,0.0002622262,0.2028249,0.0000282133,0.00003372753,0.000006747331,0.005980202,0.1112167,0.002268328,0.6442588,0.000271284,0.03276218],"study_design_scores_gemma":[0.0003811439,0.0003594693,0.02218014,0.000081828,0.000001352544,0.00000574378,0.0008062394,0.9491829,0.001757704,0.01675257,0.008263385,0.0002275199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3815531,0.00009703071,0.4541762,0.07863376,0.002760839,0.002455533,0.00001680848,0.0007883348,0.0795184],"genre_scores_gemma":[0.9870693,0.00003059558,0.004501123,0.0003653475,0.0000571588,0.00009942318,0.00005191075,0.00001278451,0.007812345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8379661,"threshold_uncertainty_score":0.6076622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2903153676","doi":"","title":"Leveraging Constraint Logic Programming for Neural Guided Program Synthesis.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"AI-based Problem Solving and Planning","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":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Computer science; Logic programming; Programming language; Constraint programming; Concurrent constraint logic programming; Constraint logic programming; Logic program; Constraint satisfaction; Constraint (computer-aided design); Inductive programming; Theoretical computer science; Artificial intelligence; Functional logic programming; Programming paradigm; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1236522775266924,"gpt":0.3885364596589281,"spread":0.2648841821322356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000452359,0.00017423,0.0001508126,0.0002064727,0.0005182873,0.0006935803,0.0008035755,0.00006324384,0.0001395616],"category_scores_gemma":[0.001129668,0.0001712309,0.0001013085,0.0002116446,0.0001611021,0.000350228,0.0001242484,0.0002757833,0.00006606172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000592261,"about_ca_system_score_gemma":0.0001333303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005667821,"about_ca_topic_score_gemma":0.000005243412,"domain_scores_codex":[0.9982767,0.000128358,0.0003335947,0.0005542255,0.0003622258,0.0003449322],"domain_scores_gemma":[0.9980715,0.0006536625,0.0002200696,0.0002901502,0.0006686281,0.00009596955],"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.00005046102,0.0002401875,0.009080806,0.00002566309,0.0001557826,0.00002745943,0.004904666,0.01282465,0.001242486,0.3906494,0.002430985,0.5783674],"study_design_scores_gemma":[0.0003744684,0.0003682814,0.001304787,0.0001405614,0.00001327063,0.00004277035,0.0004946864,0.977428,0.0009364016,0.006469619,0.01213614,0.0002909734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0321359,0.00001723649,0.9006863,0.01751255,0.001412418,0.00107768,0.00001149675,0.001350865,0.04579559],"genre_scores_gemma":[0.8805373,0.000002157156,0.117743,0.0002210447,0.0002249537,0.0003724718,0.0000364542,0.00001271052,0.0008498396],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9646034,"threshold_uncertainty_score":0.6982594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2787038193","doi":"","title":"Boundary Seeking GANs","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Generative Adversarial Networks and Image Synthesis","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":"Université de Montréal; University of Waterloo","funders":"","keywords":"Discriminator; Generator (circuit theory); Boundary (topology); Measure (data warehouse); Computer science; Decision boundary; Image (mathematics); Differentiable function; Stability (learning theory); Generative grammar; Scale (ratio); Artificial intelligence; Character (mathematics); Pattern recognition (psychology); Algorithm; Mathematics; Machine learning; Data mining; Mathematical analysis; Geometry; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.04253164387224141,"gpt":0.3256573984082439,"spread":0.2831257545360025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001685486,0.0001074672,0.00008727701,0.0001420439,0.0004083138,0.0005371855,0.0006682251,0.00003572238,0.0009636235],"category_scores_gemma":[0.0002724184,0.0001059219,0.00005787909,0.0002100953,0.0001257653,0.0005385923,0.000158768,0.0001994584,0.0005133149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004109326,"about_ca_system_score_gemma":0.00008635797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005705133,"about_ca_topic_score_gemma":0.00001863999,"domain_scores_codex":[0.9988113,0.0001187104,0.0001787445,0.0003754899,0.0003383222,0.0001774058],"domain_scores_gemma":[0.9989837,0.0001301543,0.0001027066,0.0002740466,0.0004466486,0.00006271565],"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.0000535627,0.0002261358,0.0112513,0.000004294864,0.0002592361,0.00004528329,0.009239326,0.01060366,0.03754551,0.7720639,0.01416394,0.1445439],"study_design_scores_gemma":[0.0002871034,0.0001688373,0.01124227,0.00004407017,0.000006312097,0.00001355956,0.0003528607,0.9269804,0.003725295,0.01097248,0.04596815,0.0002386209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004891486,0.00000628696,0.7903957,0.006049637,0.00112319,0.00006960284,0.000002333736,0.0001518915,0.1973099],"genre_scores_gemma":[0.980822,0.00001429586,0.01169125,0.0003725034,0.0005337502,0.00002419835,0.00001188749,0.000007919728,0.006522154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9759306,"threshold_uncertainty_score":0.9999496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964469479","doi":"","title":"Understanding the Relation Between Maximum-Entropy Inverse Reinforcement Learning and Behaviour Cloning.","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","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":"University of Toronto","funders":"","keywords":"Reinforcement learning; Principle of maximum entropy; Cloning (programming); Artificial intelligence; Computer science; Relation (database); Inverse; Entropy (arrow of time); Mathematics; Machine learning; Data mining; Physics; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.0945946462711303,"gpt":0.3266313768676395,"spread":0.2320367305965092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005207479,0.000201213,0.0001647496,0.0002684733,0.0005541941,0.0007066284,0.0006778677,0.00008962461,0.0003624565],"category_scores_gemma":[0.0003753715,0.0001778774,0.00007485493,0.000276397,0.0000992838,0.0007333627,0.0003640385,0.0009185713,0.0002879362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002562065,"about_ca_system_score_gemma":0.00008076348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005631406,"about_ca_topic_score_gemma":0.000003193406,"domain_scores_codex":[0.9977406,0.0002344445,0.00041385,0.0004937571,0.0008252705,0.0002921347],"domain_scores_gemma":[0.9984158,0.0005586263,0.0003910572,0.0003441362,0.0001976184,0.0000927928],"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.000009659366,0.000006086881,0.2304466,0.000004130556,0.00005825371,0.000003306779,0.002115101,0.5475546,0.0002835965,0.2190419,0.00007723915,0.0003994886],"study_design_scores_gemma":[0.0006801739,0.0002447456,0.0585156,0.00009689059,0.00002522459,0.000010492,0.002387169,0.9310957,0.00008713722,0.005112426,0.001475852,0.000268652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04894954,0.000005737455,0.8974964,0.004103926,0.0005940521,0.0003921388,7.994494e-7,0.0002307291,0.0482267],"genre_scores_gemma":[0.9870116,0.00005244823,0.001936415,0.0001110747,0.00008419365,0.00002151569,0.00006707069,0.00001802834,0.01069762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9380621,"threshold_uncertainty_score":0.725363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2995372087","doi":"","title":"Learning the Arrow of Time for Problems in Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","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":"Université de Montréal","funders":"","keywords":"Arrow; Arrow of time; Computer science; Reinforcement learning; Markov decision process; Reachability; Artificial intelligence; Machine learning; Class (philosophy); Function (biology); Markov process; Selection (genetic algorithm); Process (computing); Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05955057235187068,"gpt":0.3172682931974696,"spread":0.2577177208455989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005441699,0.0001839488,0.0002199406,0.0001966911,0.0002517054,0.0002440646,0.001162859,0.000065185,0.0002247611],"category_scores_gemma":[0.002136931,0.0001630901,0.0001039366,0.0004311133,0.00008864843,0.0004090534,0.0002710261,0.0007991255,0.0001207361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007002158,"about_ca_system_score_gemma":0.0001230649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004974317,"about_ca_topic_score_gemma":0.000002902915,"domain_scores_codex":[0.9977693,0.0002372691,0.0005993201,0.0004495223,0.0006563553,0.0002882312],"domain_scores_gemma":[0.9980472,0.0007191609,0.0004989118,0.0002456129,0.0004087607,0.00008036873],"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.00002243277,0.00001735856,0.006602733,0.00001668122,0.00004274648,0.000001583866,0.006137292,0.9505544,0.003073388,0.03184057,0.0001270384,0.001563802],"study_design_scores_gemma":[0.0005921012,0.0005697722,0.001260863,0.00008935545,0.000007452999,0.000002132561,0.0007124101,0.9905544,0.0005023136,0.000438917,0.005105117,0.0001651878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007360958,0.00001102135,0.9454944,0.01317117,0.0002168591,0.0007088621,0.000001067367,0.0002037459,0.03283199],"genre_scores_gemma":[0.990382,0.000040954,0.002130624,0.0002251217,0.00008191261,0.0001214853,0.00005675653,0.00001920282,0.006941912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9830211,"threshold_uncertainty_score":0.6650621,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2995040055","doi":"","title":"Reinforcement Learning with Competitive Ensembles of Information-Constrained Primitives","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","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":"Université de Montréal","funders":"","keywords":"Reinforcement learning; Computer science; Context (archaeology); Generalization; Artificial intelligence; Decomposition; State (computer science); Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03585979767524092,"gpt":0.2877329669438369,"spread":0.251873169268596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001525364,0.0001866415,0.000205888,0.0002227433,0.0001887255,0.0002795904,0.0007389823,0.00004907088,0.0003145221],"category_scores_gemma":[0.0007991072,0.0001756447,0.00007086123,0.0003477122,0.0001561734,0.001181583,0.0001988193,0.0004815327,0.0001254831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000481561,"about_ca_system_score_gemma":0.0002001652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002726371,"about_ca_topic_score_gemma":0.000001273728,"domain_scores_codex":[0.9980873,0.0001288065,0.0004905353,0.0002948297,0.0007886778,0.0002098133],"domain_scores_gemma":[0.9980388,0.0003272547,0.000540937,0.0002056575,0.0007667891,0.0001205277],"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.00004243339,0.00001205305,0.003023672,0.00001174607,0.00007806011,0.000003993664,0.005840524,0.642129,0.00050258,0.3469694,0.00003193253,0.001354612],"study_design_scores_gemma":[0.0009839728,0.0008597904,0.003833747,0.0001541729,0.00001456706,0.000009849221,0.004964504,0.9822478,0.002497911,0.000198552,0.003961774,0.0002733667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003317977,0.000002275644,0.820886,0.004574232,0.00009730372,0.0002202034,0.000002427266,0.0001884749,0.1707112],"genre_scores_gemma":[0.9880551,0.0000277035,0.01056406,0.0003589468,0.00004024322,0.00002729353,0.0001018807,0.000009455542,0.0008152847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9847372,"threshold_uncertainty_score":0.7162581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2908074561","doi":"","title":"An Evaluation of Fisher Approximations Beyond Kronecker Factorization","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":5,"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":"Kronecker delta; Factorization; Approximations of π; Computer science; Mathematics; Algorithm; Applied mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.08524321913795825,"gpt":0.3911625733095208,"spread":0.3059193541715626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002349436,0.00009733649,0.0000890118,0.0001366066,0.0001646583,0.00008028906,0.0001644666,0.00003472101,0.01239348],"category_scores_gemma":[0.00005039925,0.00009828547,0.00005037142,0.0001610685,0.00009045129,0.0003775902,0.00001888085,0.0001562112,0.00008604932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002964905,"about_ca_system_score_gemma":0.00008172578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007779894,"about_ca_topic_score_gemma":0.000006258455,"domain_scores_codex":[0.9986903,0.0001668429,0.0002523368,0.0002548859,0.0005322024,0.0001034295],"domain_scores_gemma":[0.9983252,0.00004215252,0.0002004306,0.0001900044,0.001187559,0.00005469868],"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.00009838449,0.0008504645,0.1126059,0.000004717007,0.0002748033,2.708152e-7,0.006496137,0.09236436,0.02915359,0.5803784,0.001922755,0.1758503],"study_design_scores_gemma":[0.0005901091,0.0001380223,0.01727376,0.00002500205,0.00004852127,7.218534e-7,0.001645117,0.9473031,0.006650809,0.02517534,0.0009801147,0.0001694509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6217246,0.000001863365,0.09809952,0.0006983052,0.0007588482,0.0002816793,0.00003008331,0.00004290854,0.2783622],"genre_scores_gemma":[0.9969469,0.000001584183,0.0005561862,0.00002096013,0.0005032195,0.00004921214,0.0004801773,0.00001116598,0.001430535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8549387,"threshold_uncertainty_score":0.9885093,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2787849668","doi":"","title":"Extending the Framework of Equilibrium Propagation to General Dynamics","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":5,"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":"Computer science; Backpropagation; Feed forward; Generalization; Function (biology); Learning rule; Artificial neural network; Simple (philosophy); Degree (music); Algorithm; Point (geometry); Symmetry (geometry); Artificial intelligence; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.06141614500765161,"gpt":0.3636815414519436,"spread":0.302265396444292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001599203,0.00009446353,0.00008044769,0.0001482397,0.0002131623,0.0001290553,0.0003650671,0.00003967272,0.0003686519],"category_scores_gemma":[0.002194275,0.00007398196,0.0000497976,0.0003216867,0.0001550662,0.0001646898,0.0001070263,0.0002485232,0.0001285739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000621985,"about_ca_system_score_gemma":0.00003712723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004157829,"about_ca_topic_score_gemma":0.00001539262,"domain_scores_codex":[0.99874,0.0001354433,0.0002330519,0.0003197762,0.0004275102,0.000144238],"domain_scores_gemma":[0.9989375,0.000369029,0.0001642885,0.0002095855,0.0002735771,0.00004599286],"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.00006754852,0.00004270065,0.002205975,0.000002488053,0.000008500864,0.000001985102,0.0006190746,0.004454615,0.2909216,0.6930441,0.0001505227,0.008480798],"study_design_scores_gemma":[0.0001780058,0.0004067374,0.01454639,0.0000890845,0.000009735578,0.00001637024,0.0003808098,0.8862692,0.06990054,0.02680938,0.001209268,0.0001845246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9158772,9.105406e-7,0.03623969,0.01074431,0.001335149,0.0002786049,0.00001992242,0.00007339401,0.03543086],"genre_scores_gemma":[0.9937069,0.000006289699,0.0005569888,0.0005124349,0.0002977154,0.00003162727,0.00001821705,0.0000125649,0.00485722],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8818145,"threshold_uncertainty_score":0.403648,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}