{"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/gaussian-kernel","entry":"gaussian_kernel","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":51,"n_papers_ran":25,"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":48,"n_samples_ran":23,"n_samples_fingerprinted":16,"n_places":53,"n_places_pointer_only":17,"by_status":{"ran_honours":5,"ran_violates":1,"ran_draft_wrong":4,"ran_fixture":3,"ran":10,"unverified":25},"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":"2609.00738","paper":"/paper/arxiv-2609-00738","title":"Escaping Redundant Reasoning: Structure-Aware Search for Inference-Time LLMs","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"GitHubLuCheng/basin","path":"basin/embedding/similarity.py","file_url":"https://github.com/GitHubLuCheng/basin/blob/HEAD/basin/embedding/similarity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"016f39c07c73576f","mcp_get_code":{"code_sha256":"016f39c07c73576f"}},{"arxiv_id":"2607.03871","paper":"/paper/arxiv-2607-03871","title":"A Gradient Flow Perspective on Minimum MMD Estimation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"seulkang0518/MDF_AL","path":"jnp_main.py","file_url":"https://github.com/seulkang0518/MDF_AL/blob/HEAD/jnp_main.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d92b0a79bba2cba4","mcp_get_code":{"code_sha256":"d92b0a79bba2cba4"}},{"arxiv_id":"2605.05993","paper":"/paper/arxiv-2605-05993","title":"TabCF: Distributional Control Function Estimation with Tabular Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"CausalML/DeepGMM","path":"baselines/agmm/deep_gmm.py","file_url":"https://github.com/CausalML/DeepGMM/blob/HEAD/baselines/agmm/deep_gmm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"40939406cc6a9f16","mcp_get_code":{"code_sha256":"40939406cc6a9f16"}},{"arxiv_id":"2602.12317","paper":"/paper/arxiv-2602-12317","title":"Free Lunch in Medical Image Foundation Model Pre-training via Randomized Synthesis and Disentanglement","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"yweibs/RaSD","path":"pretrain/train_RaSD/utils/gen_img.py","file_url":"https://github.com/yweibs/RaSD/blob/HEAD/pretrain/train_RaSD/utils/gen_img.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f401780f978e9846","mcp_get_code":{"code_sha256":"f401780f978e9846"}},{"arxiv_id":"2601.17103","paper":"/paper/arxiv-2601-17103","title":"Performance uncertainty in medical image analysis: a large-scale investigation of confidence intervals","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"aramis-lab/CIs_Medical_Imaging","path":"src/kernels/gaussian.py","file_url":"https://github.com/aramis-lab/CIs_Medical_Imaging/blob/HEAD/src/kernels/gaussian.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"73016539ac8a3be7","mcp_get_code":{"code_sha256":"73016539ac8a3be7"}},{"arxiv_id":"2509.25507","paper":"/paper/arxiv-2509-25507","title":"One-shot Conditional Sampling: MMD meets Nearest Neighbors","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"anirbanc96/cgmmd","path":"Ablation/nn_bandwidth/Kernels.py","file_url":"https://github.com/anirbanc96/cgmmd/blob/HEAD/Ablation/nn_bandwidth/Kernels.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4bd0b303457583b9","mcp_get_code":{"code_sha256":"4bd0b303457583b9"}},{"arxiv_id":"2507.06161","paper":"/paper/normalizing-diffusion-kernels-with-optimal","title":"Normalizing Diffusion Kernels with Optimal Transport","date":"2025-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RobinMagnet/SinkhornKernels","path":"sinkhornkernels/kernels.py","file_url":"https://github.com/RobinMagnet/SinkhornKernels/blob/HEAD/sinkhornkernels/kernels.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ca1dbb9dd33ed73d","mcp_get_code":{"code_sha256":"ca1dbb9dd33ed73d"}},{"arxiv_id":"2504.02259","paper":"/paper/re-thinking-temporal-search-for-long-form","title":"Re-thinking Temporal Search for Long-Form Video Understanding","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longvideohaystack/tstar","path":"LVHaystackBench/val_tstar_results.py","file_url":"https://github.com/longvideohaystack/tstar/blob/HEAD/LVHaystackBench/val_tstar_results.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"95559112c5b7be75","mcp_get_code":{"code_sha256":"95559112c5b7be75"}},{"arxiv_id":"2503.14459","paper":"/paper/doubly-robust-identification-of-treatment","title":"Doubly robust identification of treatment effects from multiple environments","date":"2025-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaabmar/RAMEN","path":"RAMEN/models/ramen.py","file_url":"https://github.com/jaabmar/RAMEN/blob/HEAD/RAMEN/models/ramen.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1c4221b5f7ba7e83","mcp_get_code":{"code_sha256":"1c4221b5f7ba7e83"}},{"arxiv_id":"2503.01822","paper":"/paper/projecting-assumptions-the-duality-between","title":"Projecting Assumptions: The Duality Between Sparse Autoencoders and Concept Geometry","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KempnerInstitute/Overcomplete","path":"overcomplete/sae/jump_sae.py","file_url":"https://github.com/KempnerInstitute/Overcomplete/blob/HEAD/overcomplete/sae/jump_sae.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb509c068da815e4","mcp_get_code":{"code_sha256":"cb509c068da815e4"}},{"arxiv_id":"2412.02099","paper":"/paper/accdiffusion-v2-towards-more-accurate-higher","title":"AccDiffusion v2: Towards More Accurate Higher-Resolution Diffusion Extrapolation","date":"2024-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzhxmu/accdiffusion_v2","path":"accdiffusion_plus.py","file_url":"https://github.com/lzhxmu/accdiffusion_v2/blob/HEAD/accdiffusion_plus.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"426a6e743be91d5f","mcp_get_code":{"code_sha256":"426a6e743be91d5f"}},{"arxiv_id":"2411.16969","paper":"/paper/zoomldm-latent-diffusion-model-for-multi","title":"ZoomLDM: Latent Diffusion Model for multi-scale image generation","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvlab-stonybrook/ZoomLDM","path":"large_image_gen/utils.py","file_url":"https://github.com/cvlab-stonybrook/ZoomLDM/blob/HEAD/large_image_gen/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cd927cf05827a83d","mcp_get_code":{"code_sha256":"cd927cf05827a83d"}},{"arxiv_id":"2410.23595","paper":"/paper/disentangling-interpretable-factors-with","title":"Disentangling Interpretable Factors with Supervised Independent Subspace Principal Component Analysis","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiayuSuPKU/sispca","path":"sispca/model.py","file_url":"https://github.com/JiayuSuPKU/sispca/blob/HEAD/sispca/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1f9ef96229ba4b75","mcp_get_code":{"code_sha256":"1f9ef96229ba4b75"}},{"arxiv_id":"2410.22872","paper":"/paper/data-subsampling-for-poisson-regression-with","title":"Data subsampling for Poisson regression with pth-root-link","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tim907/poisson-regression","path":"efficient_poisson_regression/metrics.py","file_url":"https://github.com/Tim907/poisson-regression/blob/HEAD/efficient_poisson_regression/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c8c367cbc656fc9a","mcp_get_code":{"code_sha256":"c8c367cbc656fc9a"}},{"arxiv_id":"2410.06055","paper":"/paper/ap-ldm-attentive-and-progressive-latent","title":"AP-LDM: Attentive and Progressive Latent Diffusion Model for Training-Free High-Resolution Image Generation","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kmittle/RepLDM","path":"InferencePipelines/RepLDM/pipeline_repldm_sdxl.py","file_url":"https://github.com/kmittle/RepLDM/blob/HEAD/InferencePipelines/RepLDM/pipeline_repldm_sdxl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"426a6e743be91d5f","mcp_get_code":{"code_sha256":"426a6e743be91d5f"}},{"arxiv_id":"2410.06055","paper":"/paper/ap-ldm-attentive-and-progressive-latent","title":"AP-LDM: Attentive and Progressive Latent Diffusion Model for Training-Free High-Resolution Image Generation","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kmittle/ap-ldm","path":"InferencePipelines/FreeScale/scale_attention.py","file_url":"https://github.com/kmittle/ap-ldm/blob/HEAD/InferencePipelines/FreeScale/scale_attention.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"86e9169096b0fed4","mcp_get_code":{"code_sha256":"86e9169096b0fed4"}},{"arxiv_id":"2409.16407","paper":"/paper/towards-representation-learning-for-weighting","title":"Towards Representation Learning for Weighting Problems in Design-Based Causal Inference","date":"2024-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oscarclivio/representations_weighting","path":"src/metrics.py","file_url":"https://github.com/oscarclivio/representations_weighting/blob/HEAD/src/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"eb06aba842f4f9ef","mcp_get_code":{"code_sha256":"eb06aba842f4f9ef"}},{"arxiv_id":"2409.02919","paper":"/paper/hiprompt-tuning-free-higher-resolution","title":"HiPrompt: Tuning-free Higher-Resolution Generation with Hierarchical MLLM Prompts","date":"2024-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liuxinyv/HiPrompt","path":"hiprompt_sdxl_llava.py","file_url":"https://github.com/Liuxinyv/HiPrompt/blob/HEAD/hiprompt_sdxl_llava.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"426a6e743be91d5f","mcp_get_code":{"code_sha256":"426a6e743be91d5f"}},{"arxiv_id":"2408.16543","paper":"/paper/statistical-and-geometrical-properties-of","title":"Statistical and Geometrical properties of regularized Kernel Kullback-Leibler divergence","date":"2024-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clementinechazal/KKL-divergence-gradient-flows","path":"Regularized/kale_flow_master/kernel_wasserstein_flows/kernel_wasserstein_flows/kernels.py","file_url":"https://github.com/clementinechazal/KKL-divergence-gradient-flows/blob/HEAD/Regularized/kale_flow_master/kernel_wasserstein_flows/kernel_wasserstein_flows/kernels.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6fb23c47226c3604","mcp_get_code":{"code_sha256":"6fb23c47226c3604"}},{"arxiv_id":"2407.10738","paper":"/paper/accdiffusion-an-accurate-method-for-higher","title":"AccDiffusion: An Accurate Method for Higher-Resolution Image Generation","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzhxmu/AccDiffusion","path":"accdiffusion_sdxl.py","file_url":"https://github.com/lzhxmu/AccDiffusion/blob/HEAD/accdiffusion_sdxl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"426a6e743be91d5f","mcp_get_code":{"code_sha256":"426a6e743be91d5f"}},{"arxiv_id":"2406.08938","paper":"/paper/mirror-and-preconditioned-gradient-descent-in","title":"Mirror and Preconditioned Gradient Descent in Wasserstein Space","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clbonet/Mirror_and_Preconditioned_Gradient_Descent_in_Wasserstein_Space","path":"lib_jax/mmdf.py","file_url":"https://github.com/clbonet/Mirror_and_Preconditioned_Gradient_Descent_in_Wasserstein_Space/blob/HEAD/lib_jax/mmdf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"de0ddc485474c498","mcp_get_code":{"code_sha256":"de0ddc485474c498"}},{"arxiv_id":"2405.18997","paper":"/paper/kernel-semi-implicit-variational-inference","title":"Kernel Semi-Implicit Variational Inference","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longinyu/ksivi","path":"utils/kernels.py","file_url":"https://github.com/longinyu/ksivi/blob/HEAD/utils/kernels.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"447cd6e519ab757f","mcp_get_code":{"code_sha256":"447cd6e519ab757f"}},{"arxiv_id":"2405.18792","paper":"/paper/kernel-metric-learning-for-in-sample-off","title":"Kernel Metric Learning for In-Sample Off-Policy Evaluation of Deterministic RL Policies","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haanvid/kmifqe","path":"KMIFQE.py","file_url":"https://github.com/haanvid/kmifqe/blob/HEAD/KMIFQE.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"375fe0e2f099808a","mcp_get_code":{"code_sha256":"375fe0e2f099808a"}},{"arxiv_id":"2405.18045","paper":"/paper/bridging-mini-batch-and-asymptotic-analysis","title":"Bridging Mini-Batch and Asymptotic Analysis in Contrastive Learning: From InfoNCE to Kernel-Based Losses","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pakoromilas/DHEL-KCL","path":"utils.py","file_url":"https://github.com/pakoromilas/DHEL-KCL/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"01e2c8ff869dd49d","mcp_get_code":{"code_sha256":"01e2c8ff869dd49d"}},{"arxiv_id":"2405.02266","paper":"/paper/on-the-test-time-zero-shot-generalization-of","title":"On the test-time zero-shot generalization of vision-language models: Do we really need prompt learning?","date":"2024-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxzanella/mta","path":"mta.py","file_url":"https://github.com/maxzanella/mta/blob/HEAD/mta.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"abf7adc7e3aac64a","mcp_get_code":{"code_sha256":"abf7adc7e3aac64a"}},{"arxiv_id":"2401.16024","paper":"/paper/probabilistic-abduction-for-visual-abstract","title":"Probabilistic Abduction for Visual Abstract Reasoning via Learning Rules in Vector-symbolic Architectures","date":"2024-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/learn-vector-symbolic-architectures-rule-formulations","path":"src/attribute_level_backend.py","file_url":"https://github.com/ibm/learn-vector-symbolic-architectures-rule-formulations/blob/HEAD/src/attribute_level_backend.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"1c8dd285caf66c7d","mcp_get_code":{"code_sha256":"1c8dd285caf66c7d"}},{"arxiv_id":"2312.01097","paper":"/paper/planning-as-in-painting-a-diffusion-based","title":"Planning as In-Painting: A Diffusion-Based Embodied Task Planning Framework for Environments under Uncertainty","date":"2023-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeyy5588/planning-as-inpainting","path":"datasets/alfred.py","file_url":"https://github.com/joeyy5588/planning-as-inpainting/blob/HEAD/datasets/alfred.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"40966c231d479773","mcp_get_code":{"code_sha256":"40966c231d479773"}},{"arxiv_id":"2312.01097","paper":"/paper/planning-as-in-painting-a-diffusion-based","title":"Planning as In-Painting: A Diffusion-Based Embodied Task Planning Framework for Environments under Uncertainty","date":"2023-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeyy5588/planning-as-inpainting","path":"datasets/gridworld_heatmap.py","file_url":"https://github.com/joeyy5588/planning-as-inpainting/blob/HEAD/datasets/gridworld_heatmap.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ee3a6cf6057e204e","mcp_get_code":{"code_sha256":"ee3a6cf6057e204e"}},{"arxiv_id":"2312.00194","paper":"/paper/robust-concept-erasure-via-kernelized-rate-1","title":"Robust Concept Erasure via Kernelized Rate-Distortion Maximization","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brcsomnath/KRaM","path":"src/metrics.py","file_url":"https://github.com/brcsomnath/KRaM/blob/HEAD/src/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c4b2effb5d8110a1","mcp_get_code":{"code_sha256":"c4b2effb5d8110a1"}},{"arxiv_id":"2311.16973","paper":"/paper/demofusion-democratising-high-resolution","title":"DemoFusion: Democratising High-Resolution Image Generation With No $$$","date":"2023-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PRIS-CV/DemoFusion","path":"pipeline_demofusion_sdxl_controlnet.py","file_url":"https://github.com/PRIS-CV/DemoFusion/blob/HEAD/pipeline_demofusion_sdxl_controlnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"426a6e743be91d5f","mcp_get_code":{"code_sha256":"426a6e743be91d5f"}},{"arxiv_id":"2310.14344","paper":"/paper/what-s-in-a-prior-learned-proximal-networks","title":"What's in a Prior? Learned Proximal Networks for Inverse Problems","date":"2023-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sulam-group/learned-proximal-networks","path":"lpn/operators/blur.py","file_url":"https://github.com/sulam-group/learned-proximal-networks/blob/HEAD/lpn/operators/blur.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c8dfbf8c31f8fd0d","mcp_get_code":{"code_sha256":"c8dfbf8c31f8fd0d"}},{"arxiv_id":"2309.12819","paper":"/paper/doubly-robust-proximal-causal-learning-for","title":"Doubly Robust Proximal Causal Learning for Continuous Treatments","date":"2023-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yezichu/pcl_continuous_treatment","path":"utils/kernel.py","file_url":"https://github.com/yezichu/pcl_continuous_treatment/blob/HEAD/utils/kernel.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed2c5f8630d24404","mcp_get_code":{"code_sha256":"ed2c5f8630d24404"}},{"arxiv_id":"2211.04533","paper":"/paper/harmonizing-the-object-recognition-strategies","title":"Harmonizing the object recognition strategies of deep neural networks with humans","date":"2022-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"serre-lab/harmonization","path":"harmonization/common/blur.py","file_url":"https://github.com/serre-lab/harmonization/blob/HEAD/harmonization/common/blur.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f95baae9c000390","mcp_get_code":{"code_sha256":"4f95baae9c000390"}},{"arxiv_id":"2210.13373","paper":"/paper/local-metric-learning-for-off-policy","title":"Local Metric Learning for Off-Policy Evaluation in Contextual Bandits with Continuous Actions","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haanvid/kmis","path":"off_pol_eval_functs.py","file_url":"https://github.com/haanvid/kmis/blob/HEAD/off_pol_eval_functs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0f48c368746fcb00","mcp_get_code":{"code_sha256":"0f48c368746fcb00"}},{"arxiv_id":"2206.08780","paper":"/paper/spherical-sliced-wasserstein","title":"Spherical Sliced-Wasserstein","date":"2022-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clbonet/Spherical_Sliced-Wasserstein","path":"SWAE/xp_swae.py","file_url":"https://github.com/clbonet/Spherical_Sliced-Wasserstein/blob/HEAD/SWAE/xp_swae.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dc6fed6be8b7877e","mcp_get_code":{"code_sha256":"dc6fed6be8b7877e"}},{"arxiv_id":"2203.13568","paper":"/paper/p-generalized-probit-regression-and-scalable","title":"$p$-Generalized Probit Regression and Scalable Maximum Likelihood Estimation via Sketching and Coresets","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cxan96/efficient-probit-regression","path":"efficient_probit_regression/metrics.py","file_url":"https://github.com/cxan96/efficient-probit-regression/blob/HEAD/efficient_probit_regression/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c8c367cbc656fc9a","mcp_get_code":{"code_sha256":"c8c367cbc656fc9a"}},{"arxiv_id":"2106.03340","paper":"/paper/instrument-space-selection-for-kernel-maximum","title":"Instrument Space Selection for Kernel Maximum Moment Restriction","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RuiZhang2016/Instrument-Space-Selection-for-Kernel-Maximum-Moment-Restriction","path":"our_method/lisc_linear.py","file_url":"https://github.com/RuiZhang2016/Instrument-Space-Selection-for-Kernel-Maximum-Moment-Restriction/blob/HEAD/our_method/lisc_linear.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c345cceb5f51f7cb","mcp_get_code":{"code_sha256":"c345cceb5f51f7cb"}},{"arxiv_id":"2106.01098","paper":"/paper/evaluation-metrics-for-graph-generative","title":"Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"borgwardtlab/ggme","path":"src/metrics/kernels.py","file_url":"https://github.com/borgwardtlab/ggme/blob/HEAD/src/metrics/kernels.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":"31a99a406af1fcf6","mcp_get_code":{"code_sha256":"31a99a406af1fcf6"}},{"arxiv_id":"2106.00320","paper":"/paper/distribution-matching-for-rationalization","title":"Distribution Matching for Rationalization","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kochsnow/distribution-matching-rationality","path":"core/dist.py","file_url":"https://github.com/kochsnow/distribution-matching-rationality/blob/HEAD/core/dist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"554a1badcccb0448","mcp_get_code":{"code_sha256":"554a1badcccb0448"}},{"arxiv_id":"2105.11645","paper":"/paper/feature-space-targeted-attacks-by-statistic","title":"Feature Space Targeted Attacks by Statistic Alignment","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaya-cheng/PAA-GAA","path":"fp_attack_den121.py","file_url":"https://github.com/yaya-cheng/PAA-GAA/blob/HEAD/fp_attack_den121.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":"f783efd94b081745","mcp_get_code":{"code_sha256":"f783efd94b081745"}},{"arxiv_id":"2005.07097","paper":"/paper/ambient-sound-helps-audiovisual-crowd","title":"Ambient Sound Helps: Audiovisual Crowd Counting in Extreme Conditions","date":"2020-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qingzwang/AudioVisualCrowdCounting","path":"misc/ssim_loss.py","file_url":"https://github.com/qingzwang/AudioVisualCrowdCounting/blob/HEAD/misc/ssim_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1572a091b2b5d602","mcp_get_code":{"code_sha256":"1572a091b2b5d602"}},{"arxiv_id":"2005.05659","paper":"/paper/stillleben-realistic-scene-synthesis-for-deep","title":"Stillleben: Realistic Scene Synthesis for Deep Learning in Robotics","date":"2020-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIS-Bonn/stillleben","path":"python/stillleben/diff.py","file_url":"https://github.com/AIS-Bonn/stillleben/blob/HEAD/python/stillleben/diff.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eccc758395dac1a4","mcp_get_code":{"code_sha256":"eccc758395dac1a4"}},{"arxiv_id":"2004.11660","paper":"/paper/disentangled-and-controllable-face-image","title":"Disentangled and Controllable Face Image Generation via 3D Imitative-Contrastive Learning","date":"2020-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/DisentangledFaceGAN","path":"training/loss_control.py","file_url":"https://github.com/microsoft/DisentangledFaceGAN/blob/HEAD/training/loss_control.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"66f866bbf81a287d","mcp_get_code":{"code_sha256":"66f866bbf81a287d"}},{"arxiv_id":"2003.14407","paper":"/paper/probabilistic-pixel-adaptive-refinement","title":"Probabilistic Pixel-Adaptive Refinement Networks","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/ppac_refinement","path":"src/models_refine/refinement_networks.py","file_url":"https://github.com/visinf/ppac_refinement/blob/HEAD/src/models_refine/refinement_networks.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":"57ad6170ea367d6e","mcp_get_code":{"code_sha256":"57ad6170ea367d6e"}},{"arxiv_id":"2001.02589","paper":"/paper/machine-learning-enables-completely-automatic","title":"Machine learning enables completely automatic tuning of a quantum device faster than human experts","date":"2020-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oxquantum-repo/Tuning_old","path":"registration_core.py","file_url":"https://github.com/oxquantum-repo/Tuning_old/blob/HEAD/registration_core.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a2f01c3070ff282f","mcp_get_code":{"code_sha256":"a2f01c3070ff282f"}},{"arxiv_id":"1911.02549","paper":"/paper/mlperf-inference-benchmark","title":"MLPerf Inference Benchmark","date":"2019-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlcommons/inference","path":"vision/medical_imaging/3d-unet-kits19/inference_utils.py","file_url":"https://github.com/mlcommons/inference/blob/HEAD/vision/medical_imaging/3d-unet-kits19/inference_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":"dd5f36b69e453200","mcp_get_code":{"code_sha256":"dd5f36b69e453200"}},{"arxiv_id":"1905.07790","paper":"/paper/correlation-coefficients-and-semantic-textual","title":"Correlation Coefficients and Semantic Textual Similarity","date":"2019-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Babylonpartners/corrsim","path":"similarity/cka.py","file_url":"https://github.com/Babylonpartners/corrsim/blob/HEAD/similarity/cka.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":"8977dd7933a6415a","mcp_get_code":{"code_sha256":"8977dd7933a6415a"}},{"arxiv_id":"1812.03282","paper":"/paper/spatial-temporal-person-re-identification","title":"Spatial-Temporal Person Re-identification","date":"2018-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SurajDonthi/Multi-Camera-Person-Re-Identification","path":"mtmct_reid/metrics.py","file_url":"https://github.com/SurajDonthi/Multi-Camera-Person-Re-Identification/blob/HEAD/mtmct_reid/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fcbb1dec4242c64e","mcp_get_code":{"code_sha256":"fcbb1dec4242c64e"}},{"arxiv_id":"1506.02564","paper":"/paper/gradient-free-hamiltonian-monte-carlo-with","title":"Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Families","date":"2015-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karlnapf/kernel_exp_family","path":"kernel_exp_family/kernels/kernels.py","file_url":"https://github.com/karlnapf/kernel_exp_family/blob/HEAD/kernel_exp_family/kernels/kernels.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":"1a4110008b634268","mcp_get_code":{"code_sha256":"1a4110008b634268"}},{"arxiv_id":"0905.2635","paper":"/paper/point-set-registration-coherent-point-drift","title":"Point-Set Registration: Coherent Point Drift","date":"2009-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siavashk/pycpd","path":"pycpd/utility.py","file_url":"https://github.com/siavashk/pycpd/blob/HEAD/pycpd/utility.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f1931c292e385c7","mcp_get_code":{"code_sha256":"4f1931c292e385c7"}},{"arxiv_id":"aaai_27987","paper":null,"title":"arXiv:aaai_27987","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ajevnisek/optimize-and-reduce","path":"models/pyramid.py","file_url":"https://github.com/ajevnisek/optimize-and-reduce/blob/HEAD/models/pyramid.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2951c06021603cd6","mcp_get_code":{"code_sha256":"2951c06021603cd6"}},{"arxiv_id":"Li_Data_Valuation_and_Detections_in_Federated_Learning_CVPR_2024_paper","paper":null,"title":"arXiv:Li_Data_Valuation_and_Detections_in_Federated_Learning_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"muz1lee/MOTdata","path":"geomloss/kernel_samples.py","file_url":"https://github.com/muz1lee/MOTdata/blob/HEAD/geomloss/kernel_samples.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e48a4e3b1a768ff6","mcp_get_code":{"code_sha256":"e48a4e3b1a768ff6"}},{"arxiv_id":"Danier_ST-MFNet_A_Spatio-Temporal_Multi-Flow_Network_for_Frame_Interpolation_CVPR_2022_paper","paper":null,"title":"arXiv:Danier_ST-MFNet_A_Spatio-Temporal_Multi-Flow_Network_for_Frame_Interpolation_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"danielism97/ST-MFNet","path":"utility.py","file_url":"https://github.com/danielism97/ST-MFNet/blob/HEAD/utility.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3157c8f51fa54ff6","mcp_get_code":{"code_sha256":"3157c8f51fa54ff6"}}]}