{"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/infonce","entry":"InfoNCE","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":15,"n_papers_ran":12,"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":13,"n_samples_ran":12,"n_samples_fingerprinted":8,"n_places":15,"n_places_pointer_only":12,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":11,"unverified":1},"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":"2603.20283","paper":"/paper/arxiv-2603-20283","title":"FastPFRec: A Fast Personalized Federated Recommendation with Secure Sharing ⋆","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"yanzhenxing123/FastPFRec","path":"util/loss_tf.py","file_url":"https://github.com/yanzhenxing123/FastPFRec/blob/HEAD/util/loss_tf.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":"73cee5051148c668","mcp_get_code":{"code_sha256":"73cee5051148c668"}},{"arxiv_id":"2411.15127","paper":"/paper/primus-pretraining-imu-encoders-with","title":"PRIMUS: Pretraining IMU Encoders with Multimodal Self-Supervision","date":"2024-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nokia-bell-labs/pretrained-imu-encoders","path":"lib/train_modules.py","file_url":"https://github.com/nokia-bell-labs/pretrained-imu-encoders/blob/HEAD/lib/train_modules.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause-Clear","inline_ok":false,"code_sha256_prefix":"e35bdb2d1a4657a0","mcp_get_code":{"code_sha256":"e35bdb2d1a4657a0"}},{"arxiv_id":"2410.05877","paper":"/paper/mdap-a-multi-view-disentangled-and-adaptive","title":"MDAP: A Multi-view Disentangled and Adaptive Preference Learning Framework for Cross-Domain Recommendation","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"the-garden-of-sinner/mdap","path":"recbole_cdr/model/cross_domain_recommender/drmtcdr.py","file_url":"https://github.com/the-garden-of-sinner/mdap/blob/HEAD/recbole_cdr/model/cross_domain_recommender/drmtcdr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2d54cf10ca8a5267","mcp_get_code":{"code_sha256":"2d54cf10ca8a5267"}},{"arxiv_id":"2406.04815","paper":"/paper/skill-aware-mutual-information-optimisation","title":"Skill-aware Mutual Information Optimisation for Generalisation in Reinforcement Learning","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uoe-agents/sami","path":"algorithm/method_step/info_nce_loss.py","file_url":"https://github.com/uoe-agents/sami/blob/HEAD/algorithm/method_step/info_nce_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a1a7cce9805bb6af","mcp_get_code":{"code_sha256":"a1a7cce9805bb6af"}},{"arxiv_id":"2405.00287","paper":"/paper/stochastic-sampling-for-contrastive-views-and","title":"SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendation","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeongwhanchoi/scone","path":"util/loss_tf.py","file_url":"https://github.com/jeongwhanchoi/scone/blob/HEAD/util/loss_tf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"73cee5051148c668","mcp_get_code":{"code_sha256":"73cee5051148c668"}},{"arxiv_id":"2403.09490","paper":"/paper/hyper-cl-conditioning-sentence","title":"Hyper-CL: Conditioning Sentence Representations with Hypernetworks","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HYU-NLP/Hyper-CL","path":"sim-kgc/models_tri_encoder.py","file_url":"https://github.com/HYU-NLP/Hyper-CL/blob/HEAD/sim-kgc/models_tri_encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2165a34b804423b0","mcp_get_code":{"code_sha256":"2165a34b804423b0"}},{"arxiv_id":"2403.05105","paper":"/paper/learning-to-rematch-mismatched-pairs-for","title":"Learning to Rematch Mismatched Pairs for Robust Cross-Modal Retrieval","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhc1997/l2rm","path":"models.py","file_url":"https://github.com/hhc1997/l2rm/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ab912266807ca3b6","mcp_get_code":{"code_sha256":"ab912266807ca3b6"}},{"arxiv_id":"2403.04287","paper":"/paper/dgr-a-general-graph-desmoothing-framework-for","title":"DGR: A General Graph Desmoothing Framework for Recommendation via Global and Local Perspectives","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"me-sonandme/DGR","path":"util/loss_tf.py","file_url":"https://github.com/me-sonandme/DGR/blob/HEAD/util/loss_tf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"73cee5051148c668","mcp_get_code":{"code_sha256":"73cee5051148c668"}},{"arxiv_id":"2401.01527","paper":"/paper/poisoning-attacks-against-recommender-systems","title":"Poisoning Attacks against Recommender Systems: A Survey","date":"2024-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coderwzw/arlib","path":"recommender/NCL.py","file_url":"https://github.com/coderwzw/arlib/blob/HEAD/recommender/NCL.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"872ccfb6b9411067","mcp_get_code":{"code_sha256":"872ccfb6b9411067"}},{"arxiv_id":"2310.03320","paper":"/paper/biobridge-bridging-biomedical-foundation","title":"BioBridge: Bridging Biomedical Foundation Models via Knowledge Graphs","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ryanwangzf/biobridge","path":"src/model.py","file_url":"https://github.com/ryanwangzf/biobridge/blob/HEAD/src/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eccecba9485b1bae","mcp_get_code":{"code_sha256":"eccecba9485b1bae"}},{"arxiv_id":"2306.10008","paper":"/paper/clip2protect-protecting-facial-privacy-using-1","title":"CLIP2Protect: Protecting Facial Privacy using Text-Guided Makeup via Adversarial Latent Search","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fahadshamshad/clip2protect","path":"adversarial_optimization.py","file_url":"https://github.com/fahadshamshad/clip2protect/blob/HEAD/adversarial_optimization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"344acc880a32cb70","mcp_get_code":{"code_sha256":"344acc880a32cb70"}},{"arxiv_id":"2303.11851","paper":"/paper/sample4geo-hard-negative-sampling-for-cross","title":"Sample4Geo: Hard Negative Sampling For Cross-View Geo-Localisation","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Skyy93/Sample4Geo","path":"sample4geo/loss.py","file_url":"https://github.com/Skyy93/Sample4Geo/blob/HEAD/sample4geo/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1857d4c1872ebe57","mcp_get_code":{"code_sha256":"1857d4c1872ebe57"}},{"arxiv_id":"2302.03357","paper":"/paper/towards-better-time-series-contrastive","title":"Towards Enhancing Time Series Contrastive Learning: A Dynamic Bad Pair Mining Approach","date":"2023-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lanxiang1017/dynamicbadpairmining_iclr24","path":"models/dbpm_model.py","file_url":"https://github.com/lanxiang1017/dynamicbadpairmining_iclr24/blob/HEAD/models/dbpm_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"13196a05922a4556","mcp_get_code":{"code_sha256":"13196a05922a4556"}},{"arxiv_id":"2203.07004","paper":"/paper/rethinking-minimal-sufficient-representation","title":"Rethinking Minimal Sufficient Representation in Contrastive Learning","date":"2022-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Haoqing-Wang/InfoCL","path":"contrastive_learning/BYOL/modules/mi_estimators.py","file_url":"https://github.com/Haoqing-Wang/InfoCL/blob/HEAD/contrastive_learning/BYOL/modules/mi_estimators.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f65fdeec48c596c4","mcp_get_code":{"code_sha256":"f65fdeec48c596c4"}},{"arxiv_id":"1807.03748","paper":"/paper/representation-learning-with-contrastive","title":"Representation Learning with Contrastive Predictive Coding","date":"2018-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Linear95/CLUB","path":"mi_estimators.py","file_url":"https://github.com/Linear95/CLUB/blob/HEAD/mi_estimators.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ef63ae1da9a9ed0b","mcp_get_code":{"code_sha256":"ef63ae1da9a9ed0b"}}]}