{"meta":{"query_hash":"22fa33f7ea39","filters":{"venue":"neural information processing systems"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/22fa33f7ea39","api":"https://metacan.xera.ac/api/v1/cohort?venue=neural+information+processing+systems"},"results":[{"id":"W2107741520","doi":"","title":"Weighted importance sampling for off-policy learning with linear function approximation","year":2014,"lang":"en","type":"article","venue":"neural information processing systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Weighting; Computer science; Importance sampling; Sampling (signal processing); Convergence (economics); Function (biology); Bridging (networking); Artificial intelligence; Mathematical optimization; Machine learning; Function approximation; Mathematics; Statistics; Artificial neural network","score_opus":0.020501250815071665,"score_gpt":0.2586979979424325,"score_spread":0.2381967471273608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107741520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033595155,0.000045288176,0.9933459,0.00023464818,0.0003094954,0.0005470256,5.696735e-7,0.00059286586,0.0015647032],"genre_scores_gemma":[0.95991045,0.0000033912622,0.038832296,0.0003278566,0.0003431948,0.00012906449,0.00010619396,0.00001915083,0.00032840695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827385,0.00005976248,0.0006617876,0.00021165861,0.00046202572,0.00033094527],"domain_scores_gemma":[0.99812853,0.00009550097,0.00089897047,0.00027142873,0.00052995037,0.00007563071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006400385,0.00019961092,0.00020964738,0.00028363036,0.0005195138,0.0009234643,0.00034519413,0.00009606953,8.6488166e-7],"category_scores_gemma":[0.00022276708,0.00016527154,0.000040303163,0.0006244434,0.000028170496,0.005227198,0.000047061432,0.00021901003,0.000023733455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023031113,0.0000045732645,0.0005843919,0.00048437336,0.000008453634,5.330334e-8,0.0007866694,0.9183554,0.00007266143,0.011711123,0.000064083186,0.06790516],"study_design_scores_gemma":[0.000516156,0.0002619887,0.00022865848,0.00012893789,0.00000884387,0.000016681855,0.00012112899,0.96898276,0.00009761469,0.000068498426,0.029362008,0.0002067],"about_ca_topic_score_codex":0.00001019537,"about_ca_topic_score_gemma":4.99597e-7,"teacher_disagreement_score":0.95655096,"about_ca_system_score_codex":0.00010056349,"about_ca_system_score_gemma":0.00011495646,"threshold_uncertainty_score":0.89049876},"labels":[],"label_agreement":null},{"id":"W2136836265","doi":"","title":"Adaptive dropout for training deep neural networks","year":2013,"lang":"en","type":"article","venue":"neural information processing systems","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":280,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dropout (neural networks); MNIST database; Computer science; Artificial intelligence; Artificial neural network; Feature (linguistics); Boltzmann machine; Deep belief network; Restricted Boltzmann machine; Stochastic gradient descent; Pattern recognition (psychology); Convolutional neural network; Machine learning; Gradient descent; Deep learning; Backpropagation","score_opus":0.031988761766423526,"score_gpt":0.2623541483614051,"score_spread":0.23036538659498157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136836265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016844113,0.00024471484,0.99393046,0.0006971702,0.0006547029,0.0014109603,0.0000025943907,0.00060214713,0.00077284186],"genre_scores_gemma":[0.97862005,0.0000024139981,0.018892879,0.0009002767,0.00027407255,0.0011788458,0.000029702102,0.000016759055,0.00008499255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981577,0.000043467135,0.0007097769,0.00027602797,0.0002867118,0.0005263464],"domain_scores_gemma":[0.998305,0.00015306316,0.0005425934,0.0003658377,0.00047834465,0.00015516751],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00017423028,0.00024096631,0.00025136434,0.0001332559,0.0005361879,0.0010992214,0.00073744124,0.00010333191,0.000003246236],"category_scores_gemma":[0.000043985707,0.00021444114,0.000076491284,0.00059511507,0.000054973672,0.008921999,0.00010233806,0.00021328402,0.000048869904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064519004,0.000009153422,0.000027304031,0.00006638201,0.000006723537,2.7547082e-7,0.0016900268,0.40831125,0.00003837342,0.010291061,0.000878065,0.578675],"study_design_scores_gemma":[0.00028965404,0.00006830336,0.00008848021,0.000029630915,0.0000048448437,0.00004508556,0.00052256096,0.9957029,0.00001889275,0.00066669815,0.0023162502,0.00024665598],"about_ca_topic_score_codex":0.000017565986,"about_ca_topic_score_gemma":0.0000016098148,"teacher_disagreement_score":0.9769356,"about_ca_system_score_codex":0.00007187587,"about_ca_system_score_gemma":0.000035590958,"threshold_uncertainty_score":0.9999377},"labels":[],"label_agreement":null},{"id":"W2162124943","doi":"","title":"Automatic Generation of Social Tags for Music Recommendation","year":2007,"lang":"en","type":"article","venue":"neural information processing systems","topic":"Music and Audio Processing","field":"Computer Science","cited_by":184,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; CMC Microsystems (Canada)","funders":"","keywords":"Recommender system; Computer science; Information retrieval; Set (abstract data type); Baseline (sea); World Wide Web; Resource (disambiguation); Space (punctuation); Social web; Component (thermodynamics); Social media","score_opus":0.06320323338863898,"score_gpt":0.29409910127234096,"score_spread":0.23089586788370198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162124943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050100677,0.000030101159,0.94692403,0.0004890517,0.00075332366,0.00032844057,0.000003336189,0.00017303319,0.0011980039],"genre_scores_gemma":[0.98870856,3.1517675e-7,0.010322348,0.0005552922,0.00027025168,0.000030585557,0.00006606636,0.0000056555364,0.00004091623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863905,0.000024070274,0.00076681393,0.00012016987,0.00024123772,0.00020864938],"domain_scores_gemma":[0.9986271,0.00004129551,0.00079650315,0.00010008892,0.0003980815,0.000036904232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089370564,0.000111866066,0.00016858065,0.00019465656,0.00035060718,0.00042763122,0.000233123,0.00007871951,0.0000067453475],"category_scores_gemma":[0.000056056142,0.00010288101,0.000045401837,0.00038542363,0.000022911296,0.0044529904,0.00003292842,0.00006461768,0.000005912831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000441552,0.000013801867,0.000019555593,0.0008027273,0.0000046149776,8.116378e-8,0.0050549186,0.00025323482,0.002103581,0.004461475,0.0035820126,0.98369956],"study_design_scores_gemma":[0.00034320276,0.000037580725,0.00026863604,0.000052490526,0.000006043378,0.00001063856,0.00030169383,0.98618555,0.0036305164,0.00008066795,0.00895167,0.00013129377],"about_ca_topic_score_codex":0.000006955217,"about_ca_topic_score_gemma":0.0000016633679,"teacher_disagreement_score":0.98593235,"about_ca_system_score_codex":0.000057418547,"about_ca_system_score_gemma":0.000070330054,"threshold_uncertainty_score":0.41953656},"labels":[],"label_agreement":null},{"id":"W2163976407","doi":"","title":"Lower Bounds on Rate of Convergence of Cutting Plane Methods","year":2010,"lang":"en","type":"article","venue":"neural information processing systems","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Support vector machine; Cutting-plane method; Hinge loss; Convergence (economics); Rate of convergence; Conjecture; Plane (geometry); Computer science; Algorithm; Function (biology); Mathematical optimization; Mathematics; Applied mathematics; Artificial intelligence; Combinatorics; Geometry","score_opus":0.010689782648075125,"score_gpt":0.2954642392651482,"score_spread":0.28477445661707307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163976407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4811383,0.00011647226,0.51156235,0.00002710022,0.0010354104,0.00025713287,0.000012558065,0.0006096274,0.005241045],"genre_scores_gemma":[0.9880815,0.000004720722,0.011806487,0.000026710428,0.000026873387,0.000013496562,0.000009244621,0.000009301122,0.000021676213],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990296,0.000026437578,0.0006253236,0.000059267368,0.00013782422,0.00012159228],"domain_scores_gemma":[0.9992622,0.000070646856,0.00031951594,0.000148907,0.00016377188,0.000034926066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033611534,0.000110120964,0.00024274312,0.00013770898,0.000037138074,0.000034884444,0.00013355108,0.00007156354,0.0000103701495],"category_scores_gemma":[0.00011207312,0.00009358524,0.000041124207,0.00031069393,0.000046202098,0.0008932666,0.000013201934,0.0001915634,0.000005381365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005791719,0.000040139184,0.00072058995,0.0040108515,0.000058625465,0.0000010515599,0.0015380818,0.17861062,0.6019474,0.0020955668,0.0005264884,0.21039265],"study_design_scores_gemma":[0.00010333638,0.000057617573,0.00014582393,0.00014332274,0.000012236437,0.000006555427,0.00010888176,0.73095983,0.26361752,0.00009797753,0.0046014683,0.00014543475],"about_ca_topic_score_codex":0.000016082167,"about_ca_topic_score_gemma":4.331247e-7,"teacher_disagreement_score":0.5523492,"about_ca_system_score_codex":0.000014905005,"about_ca_system_score_gemma":0.0000106666985,"threshold_uncertainty_score":0.3816295},"labels":[],"label_agreement":null},{"id":"W2770008080","doi":"","title":"Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation","year":2017,"lang":"en","type":"article","venue":"neural information processing systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Regret; Sublinear function; Computer science; Algorithm; Linear regression; Constraint (computer-aided design); Task (project management); Exponential function; Mathematical optimization; Mathematics; Machine learning; Discrete mathematics","score_opus":0.25850632172385657,"score_gpt":0.4470429972754272,"score_spread":0.1885366755515706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770008080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31148985,0.0001963521,0.68138736,0.0025499244,0.0014657464,0.0021724214,0.00026906992,0.00028011386,0.00018916297],"genre_scores_gemma":[0.96892196,0.000007079455,0.027248595,0.00019509207,0.0007165697,0.00020135369,0.00039345058,0.00004125137,0.002274651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949041,0.00010759138,0.001371098,0.00046581205,0.002604946,0.0005464558],"domain_scores_gemma":[0.9924403,0.00042855515,0.0021359716,0.0011198594,0.0036597564,0.00021557052],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022742492,0.00032182864,0.00048852206,0.0005060181,0.0017760693,0.0031273025,0.0013099964,0.00018476321,0.000011200556],"category_scores_gemma":[0.0048961686,0.00019578838,0.000098591336,0.00067794626,0.00023259995,0.004613444,0.00017844352,0.0003298494,0.0000541893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007516705,0.0001569789,0.0024416568,0.00037107934,0.000022441767,0.000008401428,0.0012415476,0.47088408,0.00018244208,0.00009444678,0.0026540123,0.52119124],"study_design_scores_gemma":[0.001505864,0.0002177994,0.0035308758,0.0002833797,0.000009897922,0.000034263714,0.0008152613,0.97308725,0.0003388921,0.000063044616,0.019848865,0.00026461072],"about_ca_topic_score_codex":0.000059067886,"about_ca_topic_score_gemma":0.000015033342,"teacher_disagreement_score":0.6574321,"about_ca_system_score_codex":0.00012488132,"about_ca_system_score_gemma":0.00024370044,"threshold_uncertainty_score":0.99952346},"labels":[],"label_agreement":null}]}