{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/cross-entropy","entry":"cross_entropy","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":92,"n_papers_ran":45,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":75,"n_samples_ran":32,"n_samples_fingerprinted":13,"n_places":96,"n_places_pointer_only":33,"by_status":{"ran_honours":5,"ran_violates":3,"ran_draft_wrong":6,"ran_fixture":4,"ran":14,"unverified":43},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2605.26068","paper":"/paper/arxiv-2605-26068","title":"Rethinking Weak Supervision in Anomaly Detection: A Comprehensive Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"SUFE-AILAB/WSADBench","path":"WSADBench/baseline/ARNet/fit.py","file_url":"https://github.com/SUFE-AILAB/WSADBench/blob/HEAD/WSADBench/baseline/ARNet/fit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"47f390b96dcfa119","mcp_get_code":{"code_sha256":"47f390b96dcfa119"}},{"arxiv_id":"2604.25599","paper":"/paper/arxiv-2604-25599","title":"PLMGH: What Matters in PLM-GNN Hybrids for Code Classification and Vulnerability Detection","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"PlayeerOne/PLMGH","path":"model/gnn_classifier.py","file_url":"https://github.com/PlayeerOne/PLMGH/blob/HEAD/model/gnn_classifier.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"64e83a2a64136d78","mcp_get_code":{"code_sha256":"64e83a2a64136d78"}},{"arxiv_id":"2604.11214","paper":"/paper/arxiv-2604-11214","title":"HiEdit: Lifelong Model Editing with Hierarchical Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"yangfanww/hiedit","path":"util.py","file_url":"https://github.com/yangfanww/hiedit/blob/HEAD/util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f149ae7dfa17cc97","mcp_get_code":{"code_sha256":"f149ae7dfa17cc97"}},{"arxiv_id":"2602.21550","paper":"/paper/arxiv-2602-21550","title":"Extending Sequence Length is Not All You Need: Effective Integration of Multimodal Signals for Gene Expression Prediction","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"yangzhao1230/Prism","path":"caduceus/modeling_caduceus.py","file_url":"https://github.com/yangzhao1230/Prism/blob/HEAD/caduceus/modeling_caduceus.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"83de732cfd3e479f","mcp_get_code":{"code_sha256":"83de732cfd3e479f"}},{"arxiv_id":"2601.11441","paper":"/paper/arxiv-2601-11441","title":"Hierarchical Orthogonal Residual Spread for Precise Massive Editing in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"XiaojieGu/HORSE","path":"editor/horse.py","file_url":"https://github.com/XiaojieGu/HORSE/blob/HEAD/editor/horse.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f149ae7dfa17cc97","mcp_get_code":{"code_sha256":"f149ae7dfa17cc97"}},{"arxiv_id":"2510.06195","paper":"/paper/arxiv-2510-06195","title":"Latent Speech-Text Transformer","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"facebookresearch/lst","path":"lst/base_transformer.py","file_url":"https://github.com/facebookresearch/lst/blob/HEAD/lst/base_transformer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"1d34daf1ab8748db","mcp_get_code":{"code_sha256":"1d34daf1ab8748db"}},{"arxiv_id":"2509.15188","paper":"/paper/arxiv-2509-15188","title":"Fast and Fluent Diffusion Language Models via Convolutional Decoding and Rejective Fine-tuning","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"ybseo-ac/Conv","path":"models/dimamba.py","file_url":"https://github.com/ybseo-ac/Conv/blob/HEAD/models/dimamba.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"38b9682eb110eda2","mcp_get_code":{"code_sha256":"38b9682eb110eda2"}},{"arxiv_id":"2506.22624","paper":"/paper/seg-r1-segmentation-can-be-surprisingly","title":"Seg-R1: Segmentation Can Be Surprisingly Simple with Reinforcement Learning","date":"2025-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"geshang777/FOCUS","path":"focus/modeling/matcher.py","file_url":"https://github.com/geshang777/FOCUS/blob/HEAD/focus/modeling/matcher.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"63e6e57b587c3aa8","mcp_get_code":{"code_sha256":"63e6e57b587c3aa8"}},{"arxiv_id":"2505.18883","paper":"/paper/partition-generative-modeling-masked-modeling","title":"Partition Generative Modeling: Masked Modeling Without Masks","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/mdlm","path":"models/dimamba.py","file_url":"https://github.com/kuleshov-group/mdlm/blob/HEAD/models/dimamba.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"38b9682eb110eda2","mcp_get_code":{"code_sha256":"38b9682eb110eda2"}},{"arxiv_id":"2505.17257","paper":"/paper/janusdna-a-powerful-bi-directional-hybrid-dna","title":"JanusDNA: A Powerful Bi-directional Hybrid DNA Foundation Model","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Qihao-Duan/JanusDNA","path":"caduceus/modeling_caduceus.py","file_url":"https://github.com/Qihao-Duan/JanusDNA/blob/HEAD/caduceus/modeling_caduceus.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"83de732cfd3e479f","mcp_get_code":{"code_sha256":"83de732cfd3e479f"}},{"arxiv_id":"2412.12886","paper":"/paper/timecheat-a-channel-harmony-strategy-for","title":"TimeCHEAT: A Channel Harmony Strategy for Irregularly Sampled Multivariate Time Series Analysis","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alrash/TimeCHEAT","path":"evaluate.py","file_url":"https://github.com/Alrash/TimeCHEAT/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"24abdd41a941d6f6","mcp_get_code":{"code_sha256":"24abdd41a941d6f6"}},{"arxiv_id":"2412.10193","paper":"/paper/simple-guidance-mechanisms-for-discrete","title":"Simple Guidance Mechanisms for Discrete Diffusion Models","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/discrete-diffusion-guidance","path":"models/dimamba.py","file_url":"https://github.com/kuleshov-group/discrete-diffusion-guidance/blob/HEAD/models/dimamba.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"487d2cdc607e7b22","mcp_get_code":{"code_sha256":"487d2cdc607e7b22"}},{"arxiv_id":"2412.09871","paper":"/paper/byte-latent-transformer-patches-scale-better","title":"Byte Latent Transformer: Patches Scale Better Than Tokens","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/blt","path":"bytelatent/base_transformer.py","file_url":"https://github.com/facebookresearch/blt/blob/HEAD/bytelatent/base_transformer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1d34daf1ab8748db","mcp_get_code":{"code_sha256":"1d34daf1ab8748db"}},{"arxiv_id":"2412.04445","paper":"/paper/moto-latent-motion-token-as-the-bridging","title":"Moto: Latent Motion Token as the Bridging Language for Learning Robot Manipulation from Videos","date":"2024-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tencentarc/moto","path":"moto_gpt/src/trainers/trainer_utils.py","file_url":"https://github.com/tencentarc/moto/blob/HEAD/moto_gpt/src/trainers/trainer_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"0a82d67c3d16fdf7","mcp_get_code":{"code_sha256":"0a82d67c3d16fdf7"}},{"arxiv_id":"2410.22113","paper":"/paper/where-do-large-learning-rates-lead-us","title":"Where Do Large Learning Rates Lead Us?","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isadrtdinov/understanding-large-lrs","path":"convolutional_networks/custom_training_utils.py","file_url":"https://github.com/isadrtdinov/understanding-large-lrs/blob/HEAD/convolutional_networks/custom_training_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"92278c6d1c2ed4ba","mcp_get_code":{"code_sha256":"92278c6d1c2ed4ba"}},{"arxiv_id":"2410.05448","paper":"/paper/task-diversity-shortens-the-icl-plateau","title":"Task Diversity Shortens the ICL Plateau","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sehyunkwon/task-diversity-icl","path":"src/bool_task.py","file_url":"https://github.com/sehyunkwon/task-diversity-icl/blob/HEAD/src/bool_task.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"41065e1207ba1b0d","mcp_get_code":{"code_sha256":"41065e1207ba1b0d"}},{"arxiv_id":"2410.05448","paper":"/paper/task-diversity-shortens-the-icl-plateau","title":"Task Diversity Shortens the ICL Plateau","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sehyunkwon/task-diversity-icl","path":"src/continuous_task.py","file_url":"https://github.com/sehyunkwon/task-diversity-icl/blob/HEAD/src/continuous_task.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"797281bf91c00aef","mcp_get_code":{"code_sha256":"797281bf91c00aef"}},{"arxiv_id":"2407.11902","paper":"/paper/encapsulating-knowledge-in-one-prompt","title":"Encapsulating Knowledge in One Prompt","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liqiiiii/encapsulating-knowledge-in-one-prompt","path":"datafree/criterions.py","file_url":"https://github.com/liqiiiii/encapsulating-knowledge-in-one-prompt/blob/HEAD/datafree/criterions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5116e4067eb03c3e","mcp_get_code":{"code_sha256":"5116e4067eb03c3e"}},{"arxiv_id":"2407.08216","paper":"/paper/multimodal-contrastive-learning-for-spatial","title":"Multimodal contrastive learning for spatial gene expression prediction using histology images","date":"2024-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shizhiceng/mclstexp","path":"baselines/Bleep/models.py","file_url":"https://github.com/shizhiceng/mclstexp/blob/HEAD/baselines/Bleep/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"63e6e57b587c3aa8","mcp_get_code":{"code_sha256":"63e6e57b587c3aa8"}},{"arxiv_id":"2407.06322","paper":"/paper/magmax-leveraging-model-merging-for-seamless","title":"MagMax: Leveraging Model Merging for Seamless Continual Learning","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielm1405/magmax","path":"lwf.py","file_url":"https://github.com/danielm1405/magmax/blob/HEAD/lwf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"87c06b895809b585","mcp_get_code":{"code_sha256":"87c06b895809b585"}},{"arxiv_id":"2405.03862","paper":"/paper/conformity-confabulation-and-impersonation","title":"Persona Inconstancy in Multi-Agent LLM Collaboration: Conformity, Confabulation, and Impersonation","date":"2024-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baltaci-r/CulturedAgents","path":"utils.py","file_url":"https://github.com/baltaci-r/CulturedAgents/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f31edb7287c07ca","mcp_get_code":{"code_sha256":"6f31edb7287c07ca"}},{"arxiv_id":"2405.00754","paper":"/paper/clipartt-light-weight-adaptation-of-clip-to","title":"CLIPArTT: Adaptation of CLIP to New Domains at Test Time","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dosowiechi/clipartt","path":"models/tent.py","file_url":"https://github.com/dosowiechi/clipartt/blob/HEAD/models/tent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d858deb1b3a2d3ba","mcp_get_code":{"code_sha256":"d858deb1b3a2d3ba"}},{"arxiv_id":"2404.04538","paper":"/paper/soft-prompting-with-graph-of-thought-for","title":"Soft-Prompting with Graph-of-Thought for Multi-modal Representation Learning","date":"2024-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shishicode/agot","path":"trainers/AGoT.py","file_url":"https://github.com/shishicode/agot/blob/HEAD/trainers/AGoT.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d858deb1b3a2d3ba","mcp_get_code":{"code_sha256":"d858deb1b3a2d3ba"}},{"arxiv_id":"2403.03234","paper":"/paper/caduceus-bi-directional-equivariant-long","title":"Caduceus: Bi-Directional Equivariant Long-Range DNA Sequence Modeling","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/caduceus","path":"caduceus/modeling_caduceus.py","file_url":"https://github.com/kuleshov-group/caduceus/blob/HEAD/caduceus/modeling_caduceus.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"83de732cfd3e479f","mcp_get_code":{"code_sha256":"83de732cfd3e479f"}},{"arxiv_id":"2403.02683","paper":"/paper/learning-to-defer-to-a-population-a-meta","title":"Learning to Defer to a Population: A Meta-Learning Approach","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvtailor/meta-l2d","path":"lib/losses.py","file_url":"https://github.com/dvtailor/meta-l2d/blob/HEAD/lib/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b7973ff91fa76798","mcp_get_code":{"code_sha256":"b7973ff91fa76798"}},{"arxiv_id":"2402.07754","paper":"/paper/diffusion-of-thoughts-chain-of-thought","title":"Diffusion of Thoughts: Chain-of-Thought Reasoning in Diffusion Language Models","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkunlp/diffusion-of-thoughts","path":"lib/ops.py","file_url":"https://github.com/hkunlp/diffusion-of-thoughts/blob/HEAD/lib/ops.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9107f75d51daf1f9","mcp_get_code":{"code_sha256":"9107f75d51daf1f9"}},{"arxiv_id":"2401.08552","paper":"/paper/explaining-time-series-via-contrastive-and","title":"Explaining Time Series via Contrastive and Locally Sparse Perturbations","date":"2024-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zichuan-liu/ContraLSP","path":"utils/losses.py","file_url":"https://github.com/zichuan-liu/ContraLSP/blob/HEAD/utils/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"35d4ddeeaaf09552","mcp_get_code":{"code_sha256":"35d4ddeeaaf09552"}},{"arxiv_id":"2312.16682","paper":"/paper/some-things-are-more-cringe-than-others","title":"Some things are more CRINGE than others: Iterative Preference Optimization with the Pairwise Cringe Loss","date":"2023-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/RAM","path":"projects/mta/transformer.py","file_url":"https://github.com/facebookresearch/RAM/blob/HEAD/projects/mta/transformer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1d34daf1ab8748db","mcp_get_code":{"code_sha256":"1d34daf1ab8748db"}},{"arxiv_id":"2312.02517","paper":"/paper/simplifying-neural-network-training-under-1","title":"Simplifying Neural Network Training Under Class Imbalance","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ravidziv/SimplifyingImbalancedTraining","path":"imbalanced/losses.py","file_url":"https://github.com/ravidziv/SimplifyingImbalancedTraining/blob/HEAD/imbalanced/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fc2aaf6fd20bc53f","mcp_get_code":{"code_sha256":"fc2aaf6fd20bc53f"}},{"arxiv_id":"2311.04661","paper":"/paper/massive-editing-for-large-language-models-via","title":"Massive Editing for Large Language Models via Meta Learning","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenmientan/malmen","path":"util.py","file_url":"https://github.com/chenmientan/malmen/blob/HEAD/util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f149ae7dfa17cc97","mcp_get_code":{"code_sha256":"f149ae7dfa17cc97"}},{"arxiv_id":"2310.19677","paper":"/paper/moca-measuring-human-language-model-alignment-1","title":"MoCa: Measuring Human-Language Model Alignment on Causal and Moral Judgment Tasks","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cicl-stanford/moca","path":"moca/evaluator.py","file_url":"https://github.com/cicl-stanford/moca/blob/HEAD/moca/evaluator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"69c1143dd064286c","mcp_get_code":{"code_sha256":"69c1143dd064286c"}},{"arxiv_id":"2310.19470","paper":"/paper/grokking-tickets-lottery-tickets-accelerate","title":"Bridging Lottery Ticket and Grokking: Understanding Grokking from Inner Structure of Networks","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gouki510/grokking-tickets","path":"vis_activate.py","file_url":"https://github.com/gouki510/grokking-tickets/blob/HEAD/vis_activate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"146ea7fc2ba9c7e2","mcp_get_code":{"code_sha256":"146ea7fc2ba9c7e2"}},{"arxiv_id":"2310.19089","paper":"/paper/pushdown-layers-encoding-recursive-structure","title":"Pushdown Layers: Encoding Recursive Structure in Transformer Language Models","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"murtyshikhar/pushdown-layers","path":"layers/cross_entropy_label_smoothing.py","file_url":"https://github.com/murtyshikhar/pushdown-layers/blob/HEAD/layers/cross_entropy_label_smoothing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"de36bbda5931ac11","mcp_get_code":{"code_sha256":"de36bbda5931ac11"}},{"arxiv_id":"2310.00258","paper":"/paper/unleash-data-generation-for-efficient-and","title":"NAYER: Noisy Layer Data Generation for Efficient and Effective Data-free Knowledge Distillation","date":"2023-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmtuan1307/nayer","path":"datafree/criterions.py","file_url":"https://github.com/tmtuan1307/nayer/blob/HEAD/datafree/criterions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5116e4067eb03c3e","mcp_get_code":{"code_sha256":"5116e4067eb03c3e"}},{"arxiv_id":"2309.17310","paper":"/paper/leave-one-out-distinguishability-in-machine","title":"Leave-one-out Distinguishability in Machine Learning","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"privacytrustlab/lood_in_ml","path":"exact_nngp/compute_LOOD.py","file_url":"https://github.com/privacytrustlab/lood_in_ml/blob/HEAD/exact_nngp/compute_LOOD.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ddc730f825d30aeb","mcp_get_code":{"code_sha256":"ddc730f825d30aeb"}},{"arxiv_id":"2309.10790","paper":null,"title":"arXiv:2309.10790","date":null,"month_inferred_from_arxiv_id":"2023-09","title_source":null,"repo":"csmile-1006/ARP","path":"arp_dt/ARPDT.py","file_url":"https://github.com/csmile-1006/ARP/blob/HEAD/arp_dt/ARPDT.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef0abd7fbdc81c5e","mcp_get_code":{"code_sha256":"ef0abd7fbdc81c5e"}},{"arxiv_id":"2309.03989","paper":"/paper/cdfsl-v-cross-domain-few-shot-learning-for","title":"CDFSL-V: Cross-Domain Few-Shot Learning for Videos","date":"2023-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sarinda251/CDFSL-V","path":"trainCurr.py","file_url":"https://github.com/Sarinda251/CDFSL-V/blob/HEAD/trainCurr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"313b36759f77aa0f","mcp_get_code":{"code_sha256":"313b36759f77aa0f"}},{"arxiv_id":"2308.04431","paper":"/paper/when-more-is-less-incorporating-additional","title":"When More is Less: Incorporating Additional Datasets Can Hurt Performance By Introducing Spurious Correlations","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basedrhys/ood-generalization","path":"clinicaldg/algorithms.py","file_url":"https://github.com/basedrhys/ood-generalization/blob/HEAD/clinicaldg/algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"b6530052a755f0c1","mcp_get_code":{"code_sha256":"b6530052a755f0c1"}},{"arxiv_id":"2306.01859","paper":"/paper/spatially-resolved-gene-expression-prediction","title":"Spatially Resolved Gene Expression Prediction from H&E Histology Images via Bi-modal Contrastive Learning","date":"2023-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bowang-lab/bleep","path":"models.py","file_url":"https://github.com/bowang-lab/bleep/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"63e6e57b587c3aa8","mcp_get_code":{"code_sha256":"63e6e57b587c3aa8"}},{"arxiv_id":"2305.18887","paper":"/paper/how-does-information-bottleneck-help-deep","title":"How Does Information Bottleneck Help Deep Learning?","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xu-ji/information-bottleneck","path":"dnn/swag_repo/swag/losses.py","file_url":"https://github.com/xu-ji/information-bottleneck/blob/HEAD/dnn/swag_repo/swag/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"fc2aaf6fd20bc53f","mcp_get_code":{"code_sha256":"fc2aaf6fd20bc53f"}},{"arxiv_id":"2305.18497","paper":null,"title":"arXiv:2305.18497","date":null,"month_inferred_from_arxiv_id":"2023-05","title_source":null,"repo":"fan1dy/collaboration-consensus","path":"client.py","file_url":"https://github.com/fan1dy/collaboration-consensus/blob/HEAD/client.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c7949cb0f566dd0e","mcp_get_code":{"code_sha256":"c7949cb0f566dd0e"}},{"arxiv_id":"2305.17190","paper":"/paper/multiplication-free-transformer-training-via-1","title":"Multiplication-Free Transformer Training via Piecewise Affine Operations","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/piecewise-affine-multiplication","path":"pam/pam_opt.py","file_url":"https://github.com/epfml/piecewise-affine-multiplication/blob/HEAD/pam/pam_opt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7e941323d268d90d","mcp_get_code":{"code_sha256":"7e941323d268d90d"}},{"arxiv_id":"2305.16338","paper":"/paper/think-before-you-act-decision-transformers","title":"Think Before You Act: Decision Transformers with Working Memory","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luciferkonn/dt_mem","path":"src/model.py","file_url":"https://github.com/luciferkonn/dt_mem/blob/HEAD/src/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7a16e89219207505","mcp_get_code":{"code_sha256":"7a16e89219207505"}},{"arxiv_id":"2305.13948","paper":"/paper/decoupled-kullback-leibler-divergence-loss","title":"Decoupled Kullback-Leibler Divergence Loss","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiequancui/dkl","path":"DKLv1/Adv-training-dkl/train_dkl_cifar10.py","file_url":"https://github.com/jiequancui/dkl/blob/HEAD/DKLv1/Adv-training-dkl/train_dkl_cifar10.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"59f6b4ce1de254e2","mcp_get_code":{"code_sha256":"59f6b4ce1de254e2"}},{"arxiv_id":"2305.04536","paper":"/paper/lmpt-prompt-tuning-with-class-specific","title":"LMPT: Prompt Tuning with Class-Specific Embedding Loss for Long-tailed Multi-Label Visual Recognition","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"richard-peng-xia/LMPT","path":"lmpt/dbl.py","file_url":"https://github.com/richard-peng-xia/LMPT/blob/HEAD/lmpt/dbl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"54aba0c2f41301bd","mcp_get_code":{"code_sha256":"54aba0c2f41301bd"}},{"arxiv_id":"2305.04120","paper":"/paper/a-latent-diffusion-model-for-protein","title":"A Latent Diffusion Model for Protein Structure Generation","date":"2023-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divelab/AIRS","path":"OpenBio/ATGC_Gen/caduceus/modeling_caduceus.py","file_url":"https://github.com/divelab/AIRS/blob/HEAD/OpenBio/ATGC_Gen/caduceus/modeling_caduceus.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"83de732cfd3e479f","mcp_get_code":{"code_sha256":"83de732cfd3e479f"}},{"arxiv_id":"2303.08500","paper":"/paper/the-devil-s-advocate-shattering-the-illusion","title":"The Devil's Advocate: Shattering the Illusion of Unexploitable Data using Diffusion Models","date":"2023-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmdolatabadi/avatar","path":"ISS_augs.py","file_url":"https://github.com/hmdolatabadi/avatar/blob/HEAD/ISS_augs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4cabce0764d52cf1","mcp_get_code":{"code_sha256":"4cabce0764d52cf1"}},{"arxiv_id":"2301.06387","paper":"/paper/pecan-leveraging-policy-ensemble-for-context","title":"PECAN: Leveraging Policy Ensemble for Context-Aware Zero-Shot Human-AI Coordination","date":"2023-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LxzGordon/pecan_human_AI_coordination","path":"overcookedgym/human_aware_rl/human_aware_rl/utils.py","file_url":"https://github.com/LxzGordon/pecan_human_AI_coordination/blob/HEAD/overcookedgym/human_aware_rl/human_aware_rl/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9ed8cfc43ed32bfd","mcp_get_code":{"code_sha256":"9ed8cfc43ed32bfd"}},{"arxiv_id":"2210.13431","paper":"/paper/instruction-following-agents-with-jointly-pre","title":"Instruction-Following Agents with Multimodal Transformer","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhao499/instructrl","path":"instructrl/model.py","file_url":"https://github.com/lhao499/instructrl/blob/HEAD/instructrl/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef0abd7fbdc81c5e","mcp_get_code":{"code_sha256":"ef0abd7fbdc81c5e"}},{"arxiv_id":"2208.05647","paper":"/paper/ppmn-pixel-phrase-matching-network-for-one","title":"PPMN: Pixel-Phrase Matching Network for One-Stage Panoptic Narrative Grounding","date":"2022-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dzh19990407/ppmn","path":"models/knet/cross_entropy_loss.py","file_url":"https://github.com/dzh19990407/ppmn/blob/HEAD/models/knet/cross_entropy_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0183726dd361cb88","mcp_get_code":{"code_sha256":"0183726dd361cb88"}},{"arxiv_id":"2203.03897","paper":"/paper/geodesic-multi-modal-mixup-for-robust-fine","title":"Geodesic Multi-Modal Mixup for Robust Fine-Tuning","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"63e6e57b587c3aa8","mcp_get_code":{"code_sha256":"63e6e57b587c3aa8"}},{"arxiv_id":"2201.12904","paper":"/paper/coin-data-agnostic-neural-compression","title":"COIN++: Neural Compression Across Modalities","date":"2022-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emiliendupont/coinpp","path":"entropy_coding.py","file_url":"https://github.com/emiliendupont/coinpp/blob/HEAD/entropy_coding.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9000986359fde15d","mcp_get_code":{"code_sha256":"9000986359fde15d"}},{"arxiv_id":"2112.11088","paper":"/paper/epnet-cascade-bi-directional-fusion-for-multi","title":"EPNet++: Cascade Bi-directional Fusion for Multi-Modal 3D Object Detection","date":"2021-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"happinesslz/epnetv2","path":"lib/net/cross_entropy_loss.py","file_url":"https://github.com/happinesslz/epnetv2/blob/HEAD/lib/net/cross_entropy_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"505a1e5bfde0143b","mcp_get_code":{"code_sha256":"505a1e5bfde0143b"}},{"arxiv_id":"2110.03740","paper":"/paper/adaptive-early-learning-correction-for","title":"Adaptive Early-Learning Correction for Segmentation from Noisy Annotations","date":"2021-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"ab1c43d5635c2cf0","mcp_get_code":{"code_sha256":"ab1c43d5635c2cf0"}},{"arxiv_id":"2106.06560","paper":"/paper/hr-nas-searching-efficient-high-resolution","title":"HR-NAS: Searching Efficient High-Resolution Neural Architectures with Lightweight Transformers","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dingmyu/HR-NAS","path":"mmseg/loss.py","file_url":"https://github.com/dingmyu/HR-NAS/blob/HEAD/mmseg/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"156683f98b5dd1b4","mcp_get_code":{"code_sha256":"156683f98b5dd1b4"}},{"arxiv_id":"2104.01677","paper":"/paper/a-contrastive-rule-for-meta-learning","title":"A contrastive rule for meta-learning","date":"2021-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smonsays/contrastive-meta-learning","path":"bandit/energy/loss.py","file_url":"https://github.com/smonsays/contrastive-meta-learning/blob/HEAD/bandit/energy/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d27c55374c7a7997","mcp_get_code":{"code_sha256":"d27c55374c7a7997"}},{"arxiv_id":"2103.13646","paper":"/paper/contrast-to-divide-self-supervised-pre-1","title":"Contrast to Divide: Self-Supervised Pre-Training for Learning with Noisy Labels","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ContrastToDivide/C2D","path":"cross_entropy.py","file_url":"https://github.com/ContrastToDivide/C2D/blob/HEAD/cross_entropy.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a8fa6f956d6f3de1","mcp_get_code":{"code_sha256":"a8fa6f956d6f3de1"}},{"arxiv_id":"2103.00020","paper":"/paper/learning-transferable-visual-models-from","title":"Learning Transferable Visual Models From Natural Language Supervision","date":"2021-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moein-shariatnia/OpenAI-CLIP","path":"CLIP.py","file_url":"https://github.com/moein-shariatnia/OpenAI-CLIP/blob/HEAD/CLIP.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"63e6e57b587c3aa8","mcp_get_code":{"code_sha256":"63e6e57b587c3aa8"}},{"arxiv_id":"2012.06575","paper":"/paper/entropy-maximization-and-meta-classification","title":"Entropy Maximization and Meta Classification for Out-Of-Distribution Detection in Semantic Segmentation","date":"2020-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juricaruntas/meta-ood","path":"ood_training.py","file_url":"https://github.com/juricaruntas/meta-ood/blob/HEAD/ood_training.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d26b88cdc1bb2436","mcp_get_code":{"code_sha256":"d26b88cdc1bb2436"}},{"arxiv_id":"2011.03856","paper":"/paper/learning-to-model-and-ignore-dataset-bias","title":"Learning to Model and Ignore Dataset Bias with Mixed Capacity Ensembles","date":"2020-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chrisc36/autobias","path":"autobias/modules/classifier_ensembles.py","file_url":"https://github.com/chrisc36/autobias/blob/HEAD/autobias/modules/classifier_ensembles.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fc370fba23e6b428","mcp_get_code":{"code_sha256":"fc370fba23e6b428"}},{"arxiv_id":"2010.07930","paper":"/paper/auto-seg-loss-searching-metric-surrogates-for-1","title":"Auto Seg-Loss: Searching Metric Surrogates for Semantic Segmentation","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fundamentalvision/Auto-Seg-Loss","path":"mmseg/models/losses/cross_entropy_loss.py","file_url":"https://github.com/fundamentalvision/Auto-Seg-Loss/blob/HEAD/mmseg/models/losses/cross_entropy_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"505a1e5bfde0143b","mcp_get_code":{"code_sha256":"505a1e5bfde0143b"}},{"arxiv_id":"2009.08325","paper":"/paper/noisy-concurrent-training-for-efficient","title":"Noisy Concurrent Training for Efficient Learning under Label Noise","date":"2020-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NeurAI-Lab/NCT","path":"utilities/losses.py","file_url":"https://github.com/NeurAI-Lab/NCT/blob/HEAD/utilities/losses.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"294113702e5ed1ab","mcp_get_code":{"code_sha256":"294113702e5ed1ab"}},{"arxiv_id":"2007.13970","paper":"/paper/weakly-supervised-3d-object-detection-from-1","title":"Weakly Supervised 3D Object Detection from Point Clouds","date":"2020-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zengyi-Qin/Weakly-Supervised-3D-Object-Detection","path":"core/utils.py","file_url":"https://github.com/Zengyi-Qin/Weakly-Supervised-3D-Object-Detection/blob/HEAD/core/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"784325468fd5f2e2","mcp_get_code":{"code_sha256":"784325468fd5f2e2"}},{"arxiv_id":"2007.13970","paper":"/paper/weakly-supervised-3d-object-detection-from-1","title":"Weakly Supervised 3D Object Detection from Point Clouds","date":"2020-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zengyi-Qin/Weakly-Supervised-3D-Object-Detection","path":"teacher/utils.py","file_url":"https://github.com/Zengyi-Qin/Weakly-Supervised-3D-Object-Detection/blob/HEAD/teacher/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c3f4e6de07570910","mcp_get_code":{"code_sha256":"c3f4e6de07570910"}},{"arxiv_id":"2007.00151","paper":"/paper/early-learning-regularization-prevents","title":"Early-Learning Regularization Prevents Memorization of Noisy Labels","date":"2020-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shengliu66/ELR","path":"ELR/model/loss.py","file_url":"https://github.com/shengliu66/ELR/blob/HEAD/ELR/model/loss.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ab1c43d5635c2cf0","mcp_get_code":{"code_sha256":"ab1c43d5635c2cf0"}},{"arxiv_id":"2006.09481","paper":"/paper/efficient-nonparametric-statistical-inference","title":"Efficient nonparametric statistical inference on population feature importance using Shapley values","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bdwilliamson/vimpy","path":"vimpy/spvim.py","file_url":"https://github.com/bdwilliamson/vimpy/blob/HEAD/vimpy/spvim.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"64ed85c06ce35e76","mcp_get_code":{"code_sha256":"64ed85c06ce35e76"}},{"arxiv_id":"2004.06871","paper":"/paper/tod-bert-pre-trained-natural-language","title":"TOD-BERT: Pre-trained Natural Language Understanding for Task-Oriented Dialogue","date":"2020-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonwu0731/ToD-BERT","path":"utils/loss_function/masked_cross_entropy.py","file_url":"https://github.com/jasonwu0731/ToD-BERT/blob/HEAD/utils/loss_function/masked_cross_entropy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":false,"code_sha256_prefix":"e155e413c186170f","mcp_get_code":{"code_sha256":"e155e413c186170f"}},{"arxiv_id":"2002.09437","paper":"/paper/calibrating-deep-neural-networks-using-focal","title":"Calibrating Deep Neural Networks using Focal Loss","date":"2020-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"torrvision/focal_calibration","path":"Losses/loss.py","file_url":"https://github.com/torrvision/focal_calibration/blob/HEAD/Losses/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f5c5480cc1592d7","mcp_get_code":{"code_sha256":"3f5c5480cc1592d7"}},{"arxiv_id":"1912.12191","paper":"/paper/explain-your-move-understanding-agent-actions-1","title":"Explain Your Move: Understanding Agent Actions Using Specific and Relevant Feature Attribution","date":"2019-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rl-interpretation/understandingRL","path":"visualize_atari/saliency.py","file_url":"https://github.com/rl-interpretation/understandingRL/blob/HEAD/visualize_atari/saliency.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"636e79ded1f9a112","mcp_get_code":{"code_sha256":"636e79ded1f9a112"}},{"arxiv_id":"1912.12191","paper":"/paper/explain-your-move-understanding-agent-actions-1","title":"Explain Your Move: Understanding Agent Actions Using Specific and Relevant Feature Attribution","date":"2019-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nikaashpuri/sarfa-saliency","path":"sarfa_saliency.py","file_url":"https://github.com/nikaashpuri/sarfa-saliency/blob/HEAD/sarfa_saliency.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e3db66ce577ec4b4","mcp_get_code":{"code_sha256":"e3db66ce577ec4b4"}},{"arxiv_id":"1910.14599","paper":"/paper/adversarial-nli-a-new-benchmark-for-natural","title":"Adversarial NLI: A New Benchmark for Natural Language Understanding","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tlatkowski/multihead-siamese-nets","path":"layers/losses.py","file_url":"https://github.com/tlatkowski/multihead-siamese-nets/blob/HEAD/layers/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"23cb3e71982991f4","mcp_get_code":{"code_sha256":"23cb3e71982991f4"}},{"arxiv_id":"1910.02551","paper":"/paper/improving-dataset-distillation","title":"Soft-Label Dataset Distillation and Text Dataset Distillation","date":"2019-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilia10000/dataset-distillation","path":"basics.py","file_url":"https://github.com/ilia10000/dataset-distillation/blob/HEAD/basics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"971a7e33288dbfc5","mcp_get_code":{"code_sha256":"971a7e33288dbfc5"}},{"arxiv_id":"1909.11855","paper":"/paper/unsupervised-universal-self-attention-network","title":"Universal Graph Transformer Self-Attention Networks","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daiquocnguyen/Graph-Transformer","path":"UGformerV2_PyTorch/train_UGformerV2.py","file_url":"https://github.com/daiquocnguyen/Graph-Transformer/blob/HEAD/UGformerV2_PyTorch/train_UGformerV2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"339e9f8214d3d974","mcp_get_code":{"code_sha256":"339e9f8214d3d974"}},{"arxiv_id":"1909.10773","paper":"/paper/sign-opt-a-query-efficient-hard-label","title":"Sign-OPT: A Query-Efficient Hard-label Adversarial Attack","date":"2019-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmhcbb/attackbox","path":"allmodels.py","file_url":"https://github.com/cmhcbb/attackbox/blob/HEAD/allmodels.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1fe2b779e490a552","mcp_get_code":{"code_sha256":"1fe2b779e490a552"}},{"arxiv_id":"1907.04502","paper":"/paper/deepxde-a-deep-learning-library-for-solving","title":"DeepXDE: A deep learning library for solving differential equations","date":"2019-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PhysicsTeacher13/Deepxde","path":"deepxde/math_ops.py","file_url":"https://github.com/PhysicsTeacher13/Deepxde/blob/HEAD/deepxde/math_ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2c419a89a220d342","mcp_get_code":{"code_sha256":"2c419a89a220d342"}},{"arxiv_id":"1906.04569","paper":"/paper/dropconnect-is-effective-in-modeling","title":"DropConnect Is Effective in Modeling Uncertainty of Bayesian Deep Networks","date":"2019-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hula-ai/mc_dropconnect","path":"classification/utils/loss_utils.py","file_url":"https://github.com/hula-ai/mc_dropconnect/blob/HEAD/classification/utils/loss_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"44ac9d5605856657","mcp_get_code":{"code_sha256":"44ac9d5605856657"}},{"arxiv_id":"1903.05503","paper":"/paper/hardness-aware-deep-metric-learning","title":"Hardness-Aware Deep Metric Learning","date":"2019-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neka-nat/pytorch-hdml","path":"hdml/loss.py","file_url":"https://github.com/neka-nat/pytorch-hdml/blob/HEAD/hdml/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f36467f220e7ed7","mcp_get_code":{"code_sha256":"3f36467f220e7ed7"}},{"arxiv_id":"1902.02476","paper":"/paper/a-simple-baseline-for-bayesian-uncertainty-in","title":"A Simple Baseline for Bayesian Uncertainty in Deep Learning","date":"2019-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wjmaddox/swa_gaussian","path":"swag/losses.py","file_url":"https://github.com/wjmaddox/swa_gaussian/blob/HEAD/swag/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"fc2aaf6fd20bc53f","mcp_get_code":{"code_sha256":"fc2aaf6fd20bc53f"}},{"arxiv_id":"1901.07659","paper":"/paper/a-machine-learning-benchmark-for-facies","title":"A Machine Learning Benchmark for Facies Classification","date":"2019-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ADharaUTEXAS123007/FaciesClassificationSEG","path":"core/loss.py","file_url":"https://github.com/ADharaUTEXAS123007/FaciesClassificationSEG/blob/HEAD/core/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"69bbbd5738c7bb71","mcp_get_code":{"code_sha256":"69bbbd5738c7bb71"}},{"arxiv_id":"1901.04713","paper":"/paper/global-to-local-memory-pointer-networks-for","title":"Global-to-local Memory Pointer Networks for Task-Oriented Dialogue","date":"2019-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scoyer/fg2seq","path":"utils/masked_cross_entropy.py","file_url":"https://github.com/scoyer/fg2seq/blob/HEAD/utils/masked_cross_entropy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e155e413c186170f","mcp_get_code":{"code_sha256":"e155e413c186170f"}},{"arxiv_id":"1811.04187","paper":"/paper/the-global-convergence-of-the-alternating","title":"Accelerated Gradient-free Neural Network Training by Multi-convex Alternating Optimization","date":null,"month_inferred_from_arxiv_id":"2018-11","title_source":"archive","repo":"xianggebenben/mdlam","path":"mDLAM.py","file_url":"https://github.com/xianggebenben/mdlam/blob/HEAD/mDLAM.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7671bae0a2497878","mcp_get_code":{"code_sha256":"7671bae0a2497878"}},{"arxiv_id":"1809.03627","paper":"/paper/clustergan-latent-space-clustering-in","title":"ClusterGAN : Latent Space Clustering in Generative Adversarial Networks","date":"2018-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhampel/clusterGAN","path":"clusgan/utils.py","file_url":"https://github.com/zhampel/clusterGAN/blob/HEAD/clusgan/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5fa04821aa2f9416","mcp_get_code":{"code_sha256":"5fa04821aa2f9416"}},{"arxiv_id":"1804.06992","paper":"/paper/infrared-and-visible-image-fusion-using-a","title":"Infrared and Visible Image Fusion using a Deep Learning Framework","date":"2018-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JorgeFCS/Deep-Learning-fire-segmentation","path":"Models/loss_functions.py","file_url":"https://github.com/JorgeFCS/Deep-Learning-fire-segmentation/blob/HEAD/Models/loss_functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3707bc0d98adcbee","mcp_get_code":{"code_sha256":"3707bc0d98adcbee"}},{"arxiv_id":"1710.09829","paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naturomics/CapsLayer","path":"capslayer/ops/losses/losses.py","file_url":"https://github.com/naturomics/CapsLayer/blob/HEAD/capslayer/ops/losses/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"512bf4bce2286e2e","mcp_get_code":{"code_sha256":"512bf4bce2286e2e"}},{"arxiv_id":"1710.09829","paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"razvanalex/CapsLayer","path":"capslayer/ops/losses/losses.py","file_url":"https://github.com/razvanalex/CapsLayer/blob/HEAD/capslayer/ops/losses/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"aeb7fd30067180af","mcp_get_code":{"code_sha256":"aeb7fd30067180af"}},{"arxiv_id":"1703.05175","paper":"/paper/prototypical-networks-for-few-shot-learning","title":"Prototypical Networks for Few-shot Learning","date":"2017-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minseop-aitrics/FewshotLearning","path":"ProtoNet/lib/networks.py","file_url":"https://github.com/minseop-aitrics/FewshotLearning/blob/HEAD/ProtoNet/lib/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f4fb81c626a087a4","mcp_get_code":{"code_sha256":"f4fb81c626a087a4"}},{"arxiv_id":"1703.04046","paper":"/paper/deepsleepnet-a-model-for-automatic-sleep","title":"DeepSleepNet: a Model for Automatic Sleep Stage Scoring based on Raw Single-Channel EEG","date":"2017-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akaraspt/deepsleepnet","path":"tensorlayer/cost.py","file_url":"https://github.com/akaraspt/deepsleepnet/blob/HEAD/tensorlayer/cost.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0e00a572f223b76d","mcp_get_code":{"code_sha256":"0e00a572f223b76d"}},{"arxiv_id":"1703.03400","paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minseop-aitrics/FewshotLearning","path":"MAML/lib/networks.py","file_url":"https://github.com/minseop-aitrics/FewshotLearning/blob/HEAD/MAML/lib/networks.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"826e48b56e489fae","mcp_get_code":{"code_sha256":"826e48b56e489fae"}},{"arxiv_id":"1701.07232","paper":"/paper/learnfuzz-machine-learning-for-input-fuzzing","title":"Learn&Fuzz: Machine Learning for Input Fuzzing","date":"2017-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m-zakeri/iust_deep_fuzz","path":"data_neural_fuzz_pdf_obj.py","file_url":"https://github.com/m-zakeri/iust_deep_fuzz/blob/HEAD/data_neural_fuzz_pdf_obj.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ae82f28f41b67a2e","mcp_get_code":{"code_sha256":"ae82f28f41b67a2e"}},{"arxiv_id":"1608.04644","paper":"/paper/towards-evaluating-the-robustness-of-neural","title":"Towards Evaluating the Robustness of Neural Networks","date":"2016-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PerryXDeng/adversarial_mnist_attacks","path":"neural_network.py","file_url":"https://github.com/PerryXDeng/adversarial_mnist_attacks/blob/HEAD/neural_network.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"39df9d693fbdc4de","mcp_get_code":{"code_sha256":"39df9d693fbdc4de"}},{"arxiv_id":"1505.04597","paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jakeret/tf_unet","path":"tf_unet/unet.py","file_url":"https://github.com/jakeret/tf_unet/blob/HEAD/tf_unet/unet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"bcd0ad512f024599","mcp_get_code":{"code_sha256":"bcd0ad512f024599"}},{"arxiv_id":"1212.5701","paper":"/paper/adadelta-an-adaptive-learning-rate-method","title":"ADADELTA: An Adaptive Learning Rate Method","date":"2012-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arko98/Gradient-Descent-Algorithms","path":"Algorithms/Adagrad.py","file_url":"https://github.com/Arko98/Gradient-Descent-Algorithms/blob/HEAD/Algorithms/Adagrad.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dee768aa793f867c","mcp_get_code":{"code_sha256":"dee768aa793f867c"}},{"arxiv_id":"aaai_27969","paper":null,"title":"arXiv:aaai_27969","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TianyuGoGO/XPNG","path":"models/knet/cross_entropy_loss.py","file_url":"https://github.com/TianyuGoGO/XPNG/blob/HEAD/models/knet/cross_entropy_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0183726dd361cb88","mcp_get_code":{"code_sha256":"0183726dd361cb88"}},{"arxiv_id":"aaai_25276","paper":null,"title":"arXiv:aaai_25276","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"JinxLv/One-shot-segmentation-via-IST","path":"network/loss_functions.py","file_url":"https://github.com/JinxLv/One-shot-segmentation-via-IST/blob/HEAD/network/loss_functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2acc3dbb21701b7f","mcp_get_code":{"code_sha256":"2acc3dbb21701b7f"}},{"arxiv_id":"Park_LANIT_Language-Driven_Image-to-Image_Translation_for_Unlabeled_Data_CVPR_2023_paper","paper":null,"title":"arXiv:Park_LANIT_Language-Driven_Image-to-Image_Translation_for_Unlabeled_Data_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"KU-CVLAB/LANIT","path":"core/solver.py","file_url":"https://github.com/KU-CVLAB/LANIT/blob/HEAD/core/solver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51028b47890593e5","mcp_get_code":{"code_sha256":"51028b47890593e5"}},{"arxiv_id":"Ma_Aligning_Logits_Generatively_for_Principled_Black-Box_Knowledge_Distillation_CVPR_2024_paper","paper":null,"title":"arXiv:Ma_Aligning_Logits_Generatively_for_Principled_Black-Box_Knowledge_Distillation_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HAIV-Lab/MEKD","path":"project/AM.py","file_url":"https://github.com/HAIV-Lab/MEKD/blob/HEAD/project/AM.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"17d8c72237cdae1f","mcp_get_code":{"code_sha256":"17d8c72237cdae1f"}}]}