{"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/loss","entry":"loss","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":50,"n_papers_ran":20,"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":52,"n_samples_ran":22,"n_samples_fingerprinted":13,"n_places":54,"n_places_pointer_only":14,"by_status":{"ran_honours":6,"ran_violates":6,"ran_draft_wrong":3,"ran_fixture":1,"ran":6,"unverified":30},"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":"2604.04567","paper":"/paper/arxiv-2604-04567","title":"Generative Modeling under Non-Monotone MAR Missingness via Approximate Wasserstein Gradient Flows","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"yujhml/MIRI-Imputation","path":"src/imputer.py","file_url":"https://github.com/yujhml/MIRI-Imputation/blob/HEAD/src/imputer.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":"5bc00938c66e0254","mcp_get_code":{"code_sha256":"5bc00938c66e0254"}},{"arxiv_id":"2601.05137","paper":"/paper/arxiv-2601-05137","title":"Neural Algorithmic Reasoning for Approximate k-Coloring with Recursive Warm Starts","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Weber-GeoML/ColoringGNNs","path":"full_gcn.py","file_url":"https://github.com/Weber-GeoML/ColoringGNNs/blob/HEAD/full_gcn.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":"bf8d3da6f0cd5d30","mcp_get_code":{"code_sha256":"bf8d3da6f0cd5d30"}},{"arxiv_id":"2508.04409","paper":"/paper/arxiv-2508-04409","title":"The Relative Instability of Model Comparison with Cross-validation","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"alexandre-bayle/ricv","path":"cv_num_exper.py","file_url":"https://github.com/alexandre-bayle/ricv/blob/HEAD/cv_num_exper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ceb46fbec14d96ab","mcp_get_code":{"code_sha256":"ceb46fbec14d96ab"}},{"arxiv_id":"2506.05454","paper":"/paper/zeroth-order-optimization-finds-flat-minima","title":"Zeroth-Order Optimization Finds Flat Minima","date":"2025-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liang137/FlatZero","path":"test_func/run_toy.py","file_url":"https://github.com/Liang137/FlatZero/blob/HEAD/test_func/run_toy.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"68cef691420d81ee","mcp_get_code":{"code_sha256":"68cef691420d81ee"}},{"arxiv_id":"2412.11521","paper":"/paper/on-the-ability-of-deep-networks-to-learn","title":"On the Ability of Deep Networks to Learn Symmetries from Data: A Neural Kernel Theory","date":"2024-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrea-perin/gpsymm","path":"mlp_trained.py","file_url":"https://github.com/andrea-perin/gpsymm/blob/HEAD/mlp_trained.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7f1d2d2eaaff7f24","mcp_get_code":{"code_sha256":"7f1d2d2eaaff7f24"}},{"arxiv_id":"2412.02311","paper":"/paper/simulation-based-inference-has-its-own","title":"Simulation-based inference has its own Dodelson-Schneider effect (but it knows that it does)","date":null,"month_inferred_from_arxiv_id":"2024-12","title_source":"archive","repo":"homerjed/sbiax","path":"sbiax/compression/nn.py","file_url":"https://github.com/homerjed/sbiax/blob/HEAD/sbiax/compression/nn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2e6b27b854242c96","mcp_get_code":{"code_sha256":"2e6b27b854242c96"}},{"arxiv_id":"2411.00109","paper":"/paper/prospective-learning-learning-for-a-dynamic","title":"Prospective Learning: Learning for a Dynamic Future","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurodata/prolearn","path":"binary/scenario1.py","file_url":"https://github.com/neurodata/prolearn/blob/HEAD/binary/scenario1.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a69ec6ed4b5fcbbd","mcp_get_code":{"code_sha256":"a69ec6ed4b5fcbbd"}},{"arxiv_id":"2410.22949","paper":"/paper/mutaplm-protein-language-modeling-for","title":"MutaPLM: Protein Language Modeling for Mutation Explanation and Engineering","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PharMolix/MutaPLM","path":"metrics.py","file_url":"https://github.com/PharMolix/MutaPLM/blob/HEAD/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7dea4b6c70748bd1","mcp_get_code":{"code_sha256":"7dea4b6c70748bd1"}},{"arxiv_id":"2409.14981","paper":"/paper/on-the-specialization-of-neural-modules","title":"On The Specialization of Neural Modules","date":"2024-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raillab/specialization_of_neural_modules","path":"cmnist/dense/cmnist_dense.py","file_url":"https://github.com/raillab/specialization_of_neural_modules/blob/HEAD/cmnist/dense/cmnist_dense.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a663197acfc463d3","mcp_get_code":{"code_sha256":"a663197acfc463d3"}},{"arxiv_id":"2409.04478","paper":"/paper/evaluating-open-source-sparse-autoencoders-on","title":"Evaluating Open-Source Sparse Autoencoders on Disentangling Factual Knowledge in GPT-2 Small","date":"2024-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maheepchaudhary/sae-ravel","path":"src/eval_sae.py","file_url":"https://github.com/maheepchaudhary/sae-ravel/blob/HEAD/src/eval_sae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aae0fa540b925c47","mcp_get_code":{"code_sha256":"aae0fa540b925c47"}},{"arxiv_id":"2408.17396","paper":"/paper/fairness-aware-estimation-of-graphical-models","title":"Fairness-Aware Estimation of Graphical Models","date":"2024-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pennshenlab/fair_gms","path":"GRAPH_Framework-main/utils/GRAPH/covariance.py","file_url":"https://github.com/pennshenlab/fair_gms/blob/HEAD/GRAPH_Framework-main/utils/GRAPH/covariance.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d4ca96158400da5d","mcp_get_code":{"code_sha256":"d4ca96158400da5d"}},{"arxiv_id":"2408.17396","paper":"/paper/fairness-aware-estimation-of-graphical-models","title":"Fairness-Aware Estimation of Graphical Models","date":"2024-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pennshenlab/fair_gms","path":"GRAPH_Framework-main/utils/GRAPH/ising.py","file_url":"https://github.com/pennshenlab/fair_gms/blob/HEAD/GRAPH_Framework-main/utils/GRAPH/ising.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac2bd3f200c6567a","mcp_get_code":{"code_sha256":"ac2bd3f200c6567a"}},{"arxiv_id":"2408.17396","paper":"/paper/fairness-aware-estimation-of-graphical-models","title":"Fairness-Aware Estimation of Graphical Models","date":"2024-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pennshenlab/fair_gms","path":"GRAPH_Framework-main/utils/GRAPH/precision.py","file_url":"https://github.com/pennshenlab/fair_gms/blob/HEAD/GRAPH_Framework-main/utils/GRAPH/precision.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"afb898f1b9f28dda","mcp_get_code":{"code_sha256":"afb898f1b9f28dda"}},{"arxiv_id":"2406.09069","paper":"/paper/on-the-robustness-of-global-feature-effect","title":"On the Robustness of Global Feature Effect Explanations","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hbaniecki/robust-feature-effects","path":"src/loss.py","file_url":"https://github.com/hbaniecki/robust-feature-effects/blob/HEAD/src/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"831e0df4b6f765d1","mcp_get_code":{"code_sha256":"831e0df4b6f765d1"}},{"arxiv_id":"2402.12264","paper":"/paper/uncertainty-quantification-in-fine-tuned-llms","title":"Uncertainty quantification in fine-tuned LLMs using LoRA ensembles","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oleksandr-balabanov/equivariant-posteriors","path":"lib/classification_metrics.py","file_url":"https://github.com/oleksandr-balabanov/equivariant-posteriors/blob/HEAD/lib/classification_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d378e469c299815f","mcp_get_code":{"code_sha256":"d378e469c299815f"}},{"arxiv_id":"2402.03495","paper":"/paper/partially-stochastic-infinitely-deep-bayesian","title":"Partially Stochastic Infinitely Deep Bayesian Neural Networks","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sergio20f/part_stoch_inf_deep","path":"sdebnn_classification.py","file_url":"https://github.com/sergio20f/part_stoch_inf_deep/blob/HEAD/sdebnn_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"af7df44b7c8caf77","mcp_get_code":{"code_sha256":"af7df44b7c8caf77"}},{"arxiv_id":"2402.03220","paper":"/paper/the-benefits-of-reusing-batches-for-gradient","title":"The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IdePHICS/benefit-reusing-batch","path":"dmft.py","file_url":"https://github.com/IdePHICS/benefit-reusing-batch/blob/HEAD/dmft.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ee4033ae07851e27","mcp_get_code":{"code_sha256":"ee4033ae07851e27"}},{"arxiv_id":"2309.01213","paper":"/paper/implicit-regularization-of-deep-residual","title":"Implicit regularization of deep residual networks towards neural ODEs","date":"2023-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michaelsdr/implicit-regularization-resnets-nodes","path":"finite_training_time_convergence.py","file_url":"https://github.com/michaelsdr/implicit-regularization-resnets-nodes/blob/HEAD/finite_training_time_convergence.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e75157a4fa4aa8b","mcp_get_code":{"code_sha256":"9e75157a4fa4aa8b"}},{"arxiv_id":"2309.01213","paper":"/paper/implicit-regularization-of-deep-residual","title":"Implicit regularization of deep residual networks towards neural ODEs","date":"2023-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michaelsdr/implicit-regularization-resnets-nodes","path":"infinite_training_time.py","file_url":"https://github.com/michaelsdr/implicit-regularization-resnets-nodes/blob/HEAD/infinite_training_time.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5c9c60032bf7c292","mcp_get_code":{"code_sha256":"5c9c60032bf7c292"}},{"arxiv_id":"2306.13924","paper":"/paper/structuring-representation-geometry-with","title":"Structuring Representation Geometry with Rotationally Equivariant Contrastive Learning","date":"2023-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sharut/care","path":"imagenet100/model/loss.py","file_url":"https://github.com/sharut/care/blob/HEAD/imagenet100/model/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e8ed9ddd670ec26","mcp_get_code":{"code_sha256":"1e8ed9ddd670ec26"}},{"arxiv_id":"2303.14443","paper":"/paper/no-more-reviewer-2-subverting-automatic-paper","title":"No more Reviewer #2: Subverting Automatic Paper-Reviewer Assignment using Adversarial Learning","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rub-syssec/adversarial-papers","path":"src/featurespace/loss.py","file_url":"https://github.com/rub-syssec/adversarial-papers/blob/HEAD/src/featurespace/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dad61bce0b70cf63","mcp_get_code":{"code_sha256":"dad61bce0b70cf63"}},{"arxiv_id":"2303.06595","paper":"/paper/a-convergent-single-loop-algorithm-for","title":"A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data","date":"2023-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pythonot/pot","path":"examples/gromov/plot_gromov.py","file_url":"https://github.com/pythonot/pot/blob/HEAD/examples/gromov/plot_gromov.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"68f28b95be7dc320","mcp_get_code":{"code_sha256":"68f28b95be7dc320"}},{"arxiv_id":"2303.00957","paper":"/paper/preference-transformer-modeling-human","title":"Preference Transformer: Modeling Human Preferences using Transformers for RL","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csmile-1006/preferencetransformer","path":"critic.py","file_url":"https://github.com/csmile-1006/preferencetransformer/blob/HEAD/critic.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"13df74f8d96dca61","mcp_get_code":{"code_sha256":"13df74f8d96dca61"}},{"arxiv_id":"2211.02250","paper":"/paper/real-time-target-sound-extraction","title":"Real-Time Target Sound Extraction","date":"2022-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vb000/waveformer","path":"src/training/dcc_tf.py","file_url":"https://github.com/vb000/waveformer/blob/HEAD/src/training/dcc_tf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f56296e4096f5491","mcp_get_code":{"code_sha256":"f56296e4096f5491"}},{"arxiv_id":"2210.13447","paper":"/paper/precision-machine-learning","title":"Precision Machine Learning","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejmichaud/precision-ml","path":"scripts/precision-netfit-gridsearch.py","file_url":"https://github.com/ejmichaud/precision-ml/blob/HEAD/scripts/precision-netfit-gridsearch.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":"eb71dde3d030ca96","mcp_get_code":{"code_sha256":"eb71dde3d030ca96"}},{"arxiv_id":"2209.09315","paper":"/paper/deep-linear-networks-can-benignly-overfit","title":"Deep Linear Networks can Benignly Overfit when Shallow Ones Do","date":"2022-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niladri-chatterji/benign-deep-linear","path":"src/utils.py","file_url":"https://github.com/niladri-chatterji/benign-deep-linear/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c1e7b0156d6a652","mcp_get_code":{"code_sha256":"3c1e7b0156d6a652"}},{"arxiv_id":"2206.13517","paper":"/paper/progen2-exploring-the-boundaries-of-protein","title":"ProGen2: Exploring the Boundaries of Protein Language Models","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/jaxformer","path":"jaxformer/models/decoder/inter/model.py","file_url":"https://github.com/salesforce/jaxformer/blob/HEAD/jaxformer/models/decoder/inter/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"943b81269283516d","mcp_get_code":{"code_sha256":"943b81269283516d"}},{"arxiv_id":"2206.04745","paper":"/paper/mildly-conservative-q-learning-for-offline","title":"Mildly Conservative Q-Learning for Offline Reinforcement Learning","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikostrikov/implicit_q_learning","path":"critic.py","file_url":"https://github.com/ikostrikov/implicit_q_learning/blob/HEAD/critic.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"13df74f8d96dca61","mcp_get_code":{"code_sha256":"13df74f8d96dca61"}},{"arxiv_id":"2202.01288","paper":"/paper/imitation-learning-by-estimating-expertise-of","title":"Imitation Learning by Estimating Expertise of Demonstrators","date":"2022-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanford-iliad/ileed","path":"ileed/functions/loss.py","file_url":"https://github.com/stanford-iliad/ileed/blob/HEAD/ileed/functions/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dcfb85d177090972","mcp_get_code":{"code_sha256":"dcfb85d177090972"}},{"arxiv_id":"2110.13502","paper":"/paper/shared-independent-component-analysis-for","title":"Shared Independent Component Analysis for Multi-Subject Neuroimaging","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugorichard/shica","path":"shica/shicaj.py","file_url":"https://github.com/hugorichard/shica/blob/HEAD/shica/shicaj.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"f7ebefe54a10d4b9","mcp_get_code":{"code_sha256":"f7ebefe54a10d4b9"}},{"arxiv_id":"2110.06169","paper":"/paper/offline-reinforcement-learning-with-implicit","title":"Offline Reinforcement Learning with Implicit Q-Learning","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Manchery/iql-pytorch","path":"IQL.py","file_url":"https://github.com/Manchery/iql-pytorch/blob/HEAD/IQL.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"162c85e425a085c5","mcp_get_code":{"code_sha256":"162c85e425a085c5"}},{"arxiv_id":"2109.03082","paper":"/paper/perceptual-video-compression-with-recurrent","title":"Perceptual Learned Video Compression with Recurrent Conditional GAN","date":"2021-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RenYang-home/OpenDVC","path":"motion.py","file_url":"https://github.com/RenYang-home/OpenDVC/blob/HEAD/motion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"fde9eefed7367d3a","mcp_get_code":{"code_sha256":"fde9eefed7367d3a"}},{"arxiv_id":"2106.09779","paper":"/paper/locally-differentially-private-federated","title":"Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex Losses","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lowya/private-federated-learning-without-a-trusted-server","path":"multiclasslogistic_convexFL_obesity.py","file_url":"https://github.com/lowya/private-federated-learning-without-a-trusted-server/blob/HEAD/multiclasslogistic_convexFL_obesity.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"code_sha256_prefix":"738fe963944ac923","mcp_get_code":{"code_sha256":"738fe963944ac923"}},{"arxiv_id":"2105.12837","paper":"/paper/fooling-partial-dependence-via-data-poisoning","title":"Fooling Partial Dependence via Data Poisoning","date":"2021-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MI2DataLab/fooling-partial-dependence","path":"code/loss.py","file_url":"https://github.com/MI2DataLab/fooling-partial-dependence/blob/HEAD/code/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2c250a23d7c082e5","mcp_get_code":{"code_sha256":"2c250a23d7c082e5"}},{"arxiv_id":"2103.03230","paper":"/paper/barlow-twins-self-supervised-learning-via","title":"Barlow Twins: Self-Supervised Learning via Redundancy Reduction","date":"2021-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaborvecsei/Barlow-Twins","path":"barlow_twins/loss.py","file_url":"https://github.com/gaborvecsei/Barlow-Twins/blob/HEAD/barlow_twins/loss.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bba1fbd383276faa","mcp_get_code":{"code_sha256":"bba1fbd383276faa"}},{"arxiv_id":"2008.03703","paper":"/paper/what-neural-networks-memorize-and-why","title":"What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimation","date":"2020-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/heldout-influence-estimation","path":"mnist-example/mnist_infl_mem.py","file_url":"https://github.com/google-research/heldout-influence-estimation/blob/HEAD/mnist-example/mnist_infl_mem.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":"8f1d8f0c8fede07a","mcp_get_code":{"code_sha256":"8f1d8f0c8fede07a"}},{"arxiv_id":"2007.01162","paper":"/paper/tilted-empirical-risk-minimization","title":"Tilted Empirical Risk Minimization","date":"2020-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"litian96/TERM","path":"hierarchical/mixed_level1.py","file_url":"https://github.com/litian96/TERM/blob/HEAD/hierarchical/mixed_level1.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cc0284ce34bec031","mcp_get_code":{"code_sha256":"cc0284ce34bec031"}},{"arxiv_id":"2006.13560","paper":"/paper/learning-for-video-compression-with-recurrent","title":"Learning for Video Compression with Recurrent Auto-Encoder and Recurrent Probability Model","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RenYang-home/RLVC","path":"motion.py","file_url":"https://github.com/RenYang-home/RLVC/blob/HEAD/motion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"fde9eefed7367d3a","mcp_get_code":{"code_sha256":"fde9eefed7367d3a"}},{"arxiv_id":"2005.09007","paper":"/paper/u-2-net-going-deeper-with-nested-u-structure","title":"U$^2$-Net: Going Deeper with Nested U-Structure for Salient Object Detection","date":"2020-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Akhilesh64/Image-Segmentation-U-2-Net","path":"U2-net.py","file_url":"https://github.com/Akhilesh64/Image-Segmentation-U-2-Net/blob/HEAD/U2-net.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"14100923eb6556ac","mcp_get_code":{"code_sha256":"14100923eb6556ac"}},{"arxiv_id":"1912.09533","paper":"/paper/towards-verifying-robustness-of-neural","title":"Towards Verifying Robustness of Neural Networks Against Semantic Perturbations","date":"2019-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JeetMo/Semantify-NN","path":"utils/save_nlayer_weights.py","file_url":"https://github.com/JeetMo/Semantify-NN/blob/HEAD/utils/save_nlayer_weights.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cccee9750469bb0a","mcp_get_code":{"code_sha256":"cccee9750469bb0a"}},{"arxiv_id":"1911.10036","paper":"/paper/low-variance-black-box-gradient-estimates-for","title":"Low-variance Black-box Gradient Estimates for the Plackett-Luce Distribution","date":"2019-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agadetsky/pytorch-pl-variance-reduction","path":"toy_experiment.py","file_url":"https://github.com/agadetsky/pytorch-pl-variance-reduction/blob/HEAD/toy_experiment.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":"7ccf5c554ef3c0de","mcp_get_code":{"code_sha256":"7ccf5c554ef3c0de"}},{"arxiv_id":"1904.07850","paper":"/paper/objects-as-points","title":"Objects as Points","date":"2019-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuannianz/keras-CenterNet","path":"losses.py","file_url":"https://github.com/xuannianz/keras-CenterNet/blob/HEAD/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":"4983bb45b0c2630b","mcp_get_code":{"code_sha256":"4983bb45b0c2630b"}},{"arxiv_id":"1811.11433","paper":"/paper/beyond-phams-algorithm-for-joint","title":"Beyond Pham's algorithm for joint diagonalization","date":"2018-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pierreablin/qndiag","path":"qndiag/qndiag.py","file_url":"https://github.com/pierreablin/qndiag/blob/HEAD/qndiag/qndiag.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9d7c6cb66a0b70e6","mcp_get_code":{"code_sha256":"9d7c6cb66a0b70e6"}},{"arxiv_id":"1811.02759","paper":"/paper/learning-to-steer-by-mimicking-features-from","title":"Learning to Steer by Mimicking Features from Heterogeneous Auxiliary Networks","date":"2018-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cardwing/Codes-for-Steering-Control","path":"steering-control/resnet.py","file_url":"https://github.com/cardwing/Codes-for-Steering-Control/blob/HEAD/steering-control/resnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"94defdbecd90aed8","mcp_get_code":{"code_sha256":"94defdbecd90aed8"}},{"arxiv_id":"1802.05365","paper":"/paper/deep-contextualized-word-representations","title":"Deep contextualized word representations","date":"2018-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuanjing-zhu/elmo","path":"Models/eLMO.py","file_url":"https://github.com/yuanjing-zhu/elmo/blob/HEAD/Models/eLMO.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"893138168f6ab89b","mcp_get_code":{"code_sha256":"893138168f6ab89b"}},{"arxiv_id":"1703.04309","paper":"/paper/end-to-end-learning-of-geometry-and-context","title":"End-to-End Learning of Geometry and Context for Deep Stereo Regression","date":"2017-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyf12389/GC-Net","path":"gc_net.py","file_url":"https://github.com/zyf12389/GC-Net/blob/HEAD/gc_net.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cff4e700bf510be5","mcp_get_code":{"code_sha256":"cff4e700bf510be5"}},{"arxiv_id":"1612.07695","paper":"/paper/multinet-real-time-joint-semantic-reasoning","title":"MultiNet: Real-time Joint Semantic Reasoning for Autonomous Driving","date":"2016-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MarvinTeichmann/KittiSeg","path":"decoder/kitti_multiloss.py","file_url":"https://github.com/MarvinTeichmann/KittiSeg/blob/HEAD/decoder/kitti_multiloss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6260781662996ee2","mcp_get_code":{"code_sha256":"6260781662996ee2"}},{"arxiv_id":"1612.07695","paper":"/paper/multinet-real-time-joint-semantic-reasoning","title":"MultiNet: Real-time Joint Semantic Reasoning for Autonomous Driving","date":"2016-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ziyuan400/video_segmentation","path":"decoder/kitti_multiloss.py","file_url":"https://github.com/ziyuan400/video_segmentation/blob/HEAD/decoder/kitti_multiloss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d4594ee8df53488c","mcp_get_code":{"code_sha256":"d4594ee8df53488c"}},{"arxiv_id":"1609.01064","paper":"/paper/a-deep-multi-level-network-for-saliency","title":"A Deep Multi-Level Network for Saliency Prediction","date":"2016-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcellacornia/mlnet","path":"model.py","file_url":"https://github.com/marcellacornia/mlnet/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"52375b788589b77b","mcp_get_code":{"code_sha256":"52375b788589b77b"}},{"arxiv_id":"1511.06422","paper":"/paper/all-you-need-is-a-good-init","title":"All you need is a good init","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JonasWechsler/DeepLearningLab5","path":"cifar10/cifar10.py","file_url":"https://github.com/JonasWechsler/DeepLearningLab5/blob/HEAD/cifar10/cifar10.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7b7d1b28f254c06c","mcp_get_code":{"code_sha256":"7b7d1b28f254c06c"}},{"arxiv_id":"1511.00561","paper":"/paper/segnet-a-deep-convolutional-encoder-decoder","title":"SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation","date":"2015-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkuanlun350/Tensorflow-SegNet","path":"model.py","file_url":"https://github.com/tkuanlun350/Tensorflow-SegNet/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f36542af7f46dc5a","mcp_get_code":{"code_sha256":"f36542af7f46dc5a"}},{"arxiv_id":"1409.1556","paper":"/paper/very-deep-convolutional-networks-for-large","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","date":"2014-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"soumith/convnet-benchmarks","path":"tensorflow/benchmark_alexnet.py","file_url":"https://github.com/soumith/convnet-benchmarks/blob/HEAD/tensorflow/benchmark_alexnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7a45a62c48e395fa","mcp_get_code":{"code_sha256":"7a45a62c48e395fa"}},{"arxiv_id":"1207.1114","paper":"/paper/a-fast-projected-fixed-point-algorithm-for","title":"A Fast Projected Fixed-Point Algorithm for Large Graph Matching","date":"2012-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emanuele/DSPFP","path":"DSPFP.py","file_url":"https://github.com/emanuele/DSPFP/blob/HEAD/DSPFP.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"453938f6ea1c0d79","mcp_get_code":{"code_sha256":"453938f6ea1c0d79"}},{"arxiv_id":"aaai_21590","paper":null,"title":"arXiv:aaai_21590","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"hbaniecki/manipulating-shap","path":"alg/loss.py","file_url":"https://github.com/hbaniecki/manipulating-shap/blob/HEAD/alg/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"977490aad39c7b85","mcp_get_code":{"code_sha256":"977490aad39c7b85"}}]}