{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/reduce-tensor","entry":"reduce_tensor","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":32,"n_papers_ran":19,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":7,"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":22,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":5,"n_samples_unverified":9,"n_samples_fingerprinted":1,"n_places":32,"n_places_pointer_only":8,"n_places_pointer_only_link_open":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":4,"ran":7,"unverified":9},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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.20302","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20302","title":"Neural Collapse by Design: Learning Class Prototypes on the Hypersphere","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"pakoromilas/nc_by_design","path":"main_ce.py","file_url":"https://github.com/pakoromilas/nc_by_design/blob/HEAD/main_ce.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4c0a8859c4aa301e","code_sha256_prefix":"4c0a8859c4aa301e","mcp_get_code":{"code_sha256":"4c0a8859c4aa301e"}},{"arxiv_id":"2504.16023","arxiv_id_is_arxiv":true,"paper":"/paper/pointlora-low-rank-adaptation-with-token-1","title":"PointLoRA: Low-Rank Adaptation with Token Selection for Point Cloud Learning","date":"2025-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songw-zju/PointLoRA","path":"utils/dist_utils.py","file_url":"https://github.com/songw-zju/PointLoRA/blob/HEAD/utils/dist_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f9ab5e0087e7f19","code_sha256_prefix":"5f9ab5e0087e7f19","mcp_get_code":{"code_sha256":"5f9ab5e0087e7f19"}},{"arxiv_id":"2503.08363","arxiv_id_is_arxiv":true,"paper":"/paper/parametric-point-cloud-completion-for","title":"Parametric Point Cloud Completion for Polygonal Surface Reconstruction","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parametric-completion/paco","path":"utils/dist_utils.py","file_url":"https://github.com/parametric-completion/paco/blob/HEAD/utils/dist_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f9ab5e0087e7f19","code_sha256_prefix":"5f9ab5e0087e7f19","mcp_get_code":{"code_sha256":"5f9ab5e0087e7f19"}},{"arxiv_id":"2407.16286","arxiv_id_is_arxiv":true,"paper":"/paper/a-deeper-look-at-depth-pruning-of-llms","title":"A deeper look at depth pruning of LLMs","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shoaibahmed/llm_depth_pruning","path":"dist_utils.py","file_url":"https://github.com/shoaibahmed/llm_depth_pruning/blob/HEAD/dist_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shoaibahmed/llm_depth_pruning when it was checked","code_sha256":"8ca3bc5af5d77698","code_sha256_prefix":"8ca3bc5af5d77698","mcp_get_code":{"code_sha256":"8ca3bc5af5d77698"}},{"arxiv_id":"2404.06287","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactual-reasoning-for-multi-label","title":"Counterfactual Reasoning for Multi-Label Image Classification via Patching-Based Training","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiemk/mlc-pat","path":"src_files/helper_functions/distributed.py","file_url":"https://github.com/xiemk/mlc-pat/blob/HEAD/src_files/helper_functions/distributed.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xiemk/mlc-pat when it was checked","code_sha256":"14265d790751cfed","code_sha256_prefix":"14265d790751cfed","mcp_get_code":{"code_sha256":"14265d790751cfed"}},{"arxiv_id":"2403.15835","arxiv_id_is_arxiv":true,"paper":"/paper/once-for-both-single-stage-of-importance-and","title":"Once for Both: Single Stage of Importance and Sparsity Search for Vision Transformer Compression","date":"2024-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hankye/once-for-both","path":"models/layers.py","file_url":"https://github.com/hankye/once-for-both/blob/HEAD/models/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"66146bb864eaf92b","code_sha256_prefix":"66146bb864eaf92b","mcp_get_code":{"code_sha256":"66146bb864eaf92b"}},{"arxiv_id":"2311.08403","arxiv_id_is_arxiv":true,"paper":"/paper/instant3d-instant-text-to-3d-generation","title":"Instant3D: Instant Text-to-3D Generation","date":"2023-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ming1993li/instant3dcodes","path":"training/loss.py","file_url":"https://github.com/ming1993li/instant3dcodes/blob/HEAD/training/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3efe35e36ec50fd3","code_sha256_prefix":"3efe35e36ec50fd3","mcp_get_code":{"code_sha256":"3efe35e36ec50fd3"}},{"arxiv_id":"2310.15171","arxiv_id_is_arxiv":true,"paper":"/paper/robodepth-robust-out-of-distribution-depth-1","title":"RoboDepth: Robust Out-of-Distribution Depth Estimation under Corruptions","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyBlue/FSRE-Depth","path":"train_ddp.py","file_url":"https://github.com/hyBlue/FSRE-Depth/blob/HEAD/train_ddp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4c7488e70da6a280","code_sha256_prefix":"4c7488e70da6a280","mcp_get_code":{"code_sha256":"4c7488e70da6a280"}},{"arxiv_id":"2308.09245","arxiv_id_is_arxiv":true,"paper":"/paper/masked-spatio-temporal-structure-prediction","title":"Masked Spatio-Temporal Structure Prediction for Self-supervised Learning on Point Cloud Videos","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johnsonsign/mast-pre","path":"utils.py","file_url":"https://github.com/johnsonsign/mast-pre/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f0f7c378e04ba6a","code_sha256_prefix":"5f0f7c378e04ba6a","mcp_get_code":{"code_sha256":"5f0f7c378e04ba6a"}},{"arxiv_id":"2308.04583","arxiv_id_is_arxiv":true,"paper":"/paper/latr-3d-lane-detection-from-monocular-images","title":"LATR: 3D Lane Detection from Monocular Images with Transformer","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JMoonr/LATR","path":"experiments/ddp.py","file_url":"https://github.com/JMoonr/LATR/blob/HEAD/experiments/ddp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be5abd3083ea4db8","code_sha256_prefix":"be5abd3083ea4db8","mcp_get_code":{"code_sha256":"be5abd3083ea4db8"}},{"arxiv_id":"2305.17007","arxiv_id_is_arxiv":true,"paper":"/paper/improving-knowledge-distillation-via-1","title":"Improving Knowledge Distillation via Regularizing Feature Norm and Direction","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangyz1608/knowledge-distillation-via-nd","path":"ImageNet/train_dkd.py","file_url":"https://github.com/wangyz1608/knowledge-distillation-via-nd/blob/HEAD/ImageNet/train_dkd.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wangyz1608/knowledge-distillation-via-nd when it was checked","code_sha256":"b57663499e3c25d8","code_sha256_prefix":"b57663499e3c25d8","mcp_get_code":{"code_sha256":"b57663499e3c25d8"}},{"arxiv_id":"2212.03640","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuned-clip-models-are-efficient-video","title":"Fine-tuned CLIP Models are Efficient Video Learners","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muzairkhattak/vifi-clip","path":"utils/tools.py","file_url":"https://github.com/muzairkhattak/vifi-clip/blob/HEAD/utils/tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e6dd851990fe932","code_sha256_prefix":"2e6dd851990fe932","mcp_get_code":{"code_sha256":"2e6dd851990fe932"}},{"arxiv_id":"2211.09078","arxiv_id_is_arxiv":true,"paper":"/paper/learning-dense-and-continuous-optical-flow","title":"Learning Dense and Continuous Optical Flow from an Event Camera","date":"2022-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danqu130/DCEIFlow","path":"evaluate.py","file_url":"https://github.com/danqu130/DCEIFlow/blob/HEAD/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"06724a1cdbc6af8c","code_sha256_prefix":"06724a1cdbc6af8c","mcp_get_code":{"code_sha256":"06724a1cdbc6af8c"}},{"arxiv_id":"2201.01102","arxiv_id_is_arxiv":true,"paper":"/paper/towards-transferable-unrestricted-adversarial","title":"Towards Transferable Unrestricted Adversarial Examples with Minimum Changes","date":"2022-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Equationliu/GA-Attack","path":"main_bench_mark.py","file_url":"https://github.com/Equationliu/GA-Attack/blob/HEAD/main_bench_mark.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"65e1c0ed365fa761","code_sha256_prefix":"65e1c0ed365fa761","mcp_get_code":{"code_sha256":"65e1c0ed365fa761"}},{"arxiv_id":"2111.05177","arxiv_id_is_arxiv":true,"paper":"/paper/on-training-implicit-models","title":"On Training Implicit Models","date":"2021-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gsunshine/phantom_grad","path":"MDEQ/MDEQ_ImageNet/train_mdeq_imagenet.py","file_url":"https://github.com/gsunshine/phantom_grad/blob/HEAD/MDEQ/MDEQ_ImageNet/train_mdeq_imagenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f55cbb1d14054e26","code_sha256_prefix":"f55cbb1d14054e26","mcp_get_code":{"code_sha256":"f55cbb1d14054e26"}},{"arxiv_id":"2110.09903","arxiv_id_is_arxiv":true,"paper":"/paper/unrestricted-adversarial-attacks-on-imagenet","title":"Unrestricted Adversarial Attacks on ImageNet Competition","date":"2021-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"65e1c0ed365fa761","code_sha256_prefix":"65e1c0ed365fa761","mcp_get_code":{"code_sha256":"65e1c0ed365fa761"}},{"arxiv_id":"2106.06819","arxiv_id_is_arxiv":true,"paper":"/paper/d2c-diffusion-denoising-models-for-few-shot","title":"D2C: Diffusion-Denoising Models for Few-shot Conditional Generation","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiamings/d2c","path":"d2c/autoencoder/utils.py","file_url":"https://github.com/jiamings/d2c/blob/HEAD/d2c/autoencoder/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be5abd3083ea4db8","code_sha256_prefix":"be5abd3083ea4db8","mcp_get_code":{"code_sha256":"be5abd3083ea4db8"}},{"arxiv_id":"2105.07239","arxiv_id_is_arxiv":true,"paper":"/paper/ageflow-conditional-age-progression-and","title":"AgeFlow: Conditional Age Progression and Regression with Normalizing Flows","date":"2021-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hzzone/AgeFlow","path":"flow/models.py","file_url":"https://github.com/Hzzone/AgeFlow/blob/HEAD/flow/models.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Hzzone/AgeFlow when it was checked","code_sha256":"a25acbda57ff74c2","code_sha256_prefix":"a25acbda57ff74c2","mcp_get_code":{"code_sha256":"a25acbda57ff74c2"}},{"arxiv_id":"2104.10972","arxiv_id_is_arxiv":true,"paper":"/paper/imagenet-21k-pretraining-for-the-masses","title":"ImageNet-21K Pretraining for the Masses","date":"2021-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alibaba-MIIL/ImageNet21K","path":"src_files/helper_functions/distributed.py","file_url":"https://github.com/Alibaba-MIIL/ImageNet21K/blob/HEAD/src_files/helper_functions/distributed.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from xiemk/mlc-pat, and GitHub detected no licence in that repository when it was checked","code_sha256":"14265d790751cfed","code_sha256_prefix":"14265d790751cfed","mcp_get_code":{"code_sha256":"14265d790751cfed"}},{"arxiv_id":"2102.10240","arxiv_id_is_arxiv":true,"paper":"/paper/learning-neural-generative-dynamics-for-1","title":"Learning Neural Generative Dynamics for Molecular Conformation Generation","date":"2021-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepgraphlearning/cgcf-confgen","path":"models/cnf_edge/cnf.py","file_url":"https://github.com/deepgraphlearning/cgcf-confgen/blob/HEAD/models/cnf_edge/cnf.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, deepgraphlearning/cgcf-confgen when it was checked","code_sha256":"11965d5ebfe77481","code_sha256_prefix":"11965d5ebfe77481","mcp_get_code":{"code_sha256":"11965d5ebfe77481"}},{"arxiv_id":"2009.01776","arxiv_id_is_arxiv":true,"paper":"/paper/hifisinger-towards-high-fidelity-neural","title":"HiFiSinger: Towards High-Fidelity Neural Singing Voice Synthesis","date":"2020-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CODEJIN/HiFiSinger","path":"distributed.py","file_url":"https://github.com/CODEJIN/HiFiSinger/blob/HEAD/distributed.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9bfcbb1d3623ba1","code_sha256_prefix":"a9bfcbb1d3623ba1","mcp_get_code":{"code_sha256":"a9bfcbb1d3623ba1"}},{"arxiv_id":"2008.06520","arxiv_id_is_arxiv":true,"paper":"/paper/learning-gradient-fields-for-shape-generation","title":"Learning Gradient Fields for Shape Generation","date":"2020-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RuojinCai/ShapeGF","path":"train_multi_gpus.py","file_url":"https://github.com/RuojinCai/ShapeGF/blob/HEAD/train_multi_gpus.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from deepgraphlearning/cgcf-confgen, and GitHub detected no licence in that repository when it was checked","code_sha256":"11965d5ebfe77481","code_sha256_prefix":"11965d5ebfe77481","mcp_get_code":{"code_sha256":"11965d5ebfe77481"}},{"arxiv_id":"2008.05314","arxiv_id_is_arxiv":true,"paper":"/paper/tf-nas-rethinking-three-search-freedoms-of","title":"TF-NAS: Rethinking Three Search Freedoms of Latency-Constrained Differentiable Neural Architecture Search","date":"2020-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AberHu/TF-NAS","path":"train_eval_amp.py","file_url":"https://github.com/AberHu/TF-NAS/blob/HEAD/train_eval_amp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"91cd803b76cc8823","code_sha256_prefix":"91cd803b76cc8823","mcp_get_code":{"code_sha256":"91cd803b76cc8823"}},{"arxiv_id":"2008.00975","arxiv_id_is_arxiv":true,"paper":"/paper/seco-exploring-sequence-supervision-for","title":"SeCo: Exploring Sequence Supervision for Unsupervised Representation Learning","date":"2020-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YihengZhang-CV/SeCo-Sequence-Contrastive-Learning","path":"seco/util.py","file_url":"https://github.com/YihengZhang-CV/SeCo-Sequence-Contrastive-Learning/blob/HEAD/seco/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f0f7c378e04ba6a","code_sha256_prefix":"5f0f7c378e04ba6a","mcp_get_code":{"code_sha256":"5f0f7c378e04ba6a"}},{"arxiv_id":"2005.05957","arxiv_id_is_arxiv":true,"paper":"/paper/flowtron-an-autoregressive-flow-based","title":"Flowtron: an Autoregressive Flow-based Generative Network for Text-to-Speech Synthesis","date":"2020-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVIDIA/flowtron","path":"distributed.py","file_url":"https://github.com/NVIDIA/flowtron/blob/HEAD/distributed.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9bfcbb1d3623ba1","code_sha256_prefix":"a9bfcbb1d3623ba1","mcp_get_code":{"code_sha256":"a9bfcbb1d3623ba1"}},{"arxiv_id":"2002.02798","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-train-your-neural-ode","title":"How to train your neural ODE: the world of Jacobian and kinetic regularization","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-hash-code/ffjord-rnode-finalweek-mnist","path":"dist_utils.py","file_url":"https://github.com/D-hash-code/ffjord-rnode-finalweek-mnist/blob/HEAD/dist_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be51985b302891b6","code_sha256_prefix":"be51985b302891b6","mcp_get_code":{"code_sha256":"be51985b302891b6"}},{"arxiv_id":"2001.01385","arxiv_id_is_arxiv":true,"paper":"/paper/identifying-and-compensating-for-feature","title":"Identifying and Compensating for Feature Deviation in Imbalanced Deep Learning","date":"2020-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangyongshun/BagofTricks-LT","path":"lib/core/function.py","file_url":"https://github.com/zhangyongshun/BagofTricks-LT/blob/HEAD/lib/core/function.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"75000f8601e0929d","code_sha256_prefix":"75000f8601e0929d","mcp_get_code":{"code_sha256":"75000f8601e0929d"}},{"arxiv_id":"1905.11468","arxiv_id_is_arxiv":true,"paper":"/paper/scaleable-input-gradient-regularization-for","title":"Scaleable input gradient regularization for adversarial robustness","date":"2019-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cfinlay/tulip","path":"imagenet/dist_utils.py","file_url":"https://github.com/cfinlay/tulip/blob/HEAD/imagenet/dist_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c3f576afeebe9300","code_sha256_prefix":"c3f576afeebe9300","mcp_get_code":{"code_sha256":"c3f576afeebe9300"}},{"arxiv_id":"1811.00002","arxiv_id_is_arxiv":true,"paper":"/paper/waveglow-a-flow-based-generative-network-for","title":"WaveGlow: A Flow-based Generative Network for Speech Synthesis","date":"2018-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVIDIA/waveglow","path":"distributed.py","file_url":"https://github.com/NVIDIA/waveglow/blob/HEAD/distributed.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"720ec6edbf432e1e","code_sha256_prefix":"720ec6edbf432e1e","mcp_get_code":{"code_sha256":"720ec6edbf432e1e"}},{"arxiv_id":"1702.07825","arxiv_id_is_arxiv":true,"paper":"/paper/deep-voice-real-time-neural-text-to-speech","title":"Deep Voice: Real-time Neural Text-to-Speech","date":"2017-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVIDIA/nv-wavenet","path":"pytorch/distributed.py","file_url":"https://github.com/NVIDIA/nv-wavenet/blob/HEAD/pytorch/distributed.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"720ec6edbf432e1e","code_sha256_prefix":"720ec6edbf432e1e","mcp_get_code":{"code_sha256":"720ec6edbf432e1e"}},{"arxiv_id":"aaai_29654","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29654","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zcy866/CSR","path":"utils.py","file_url":"https://github.com/zcy866/CSR/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3efe35e36ec50fd3","code_sha256_prefix":"3efe35e36ec50fd3","mcp_get_code":{"code_sha256":"3efe35e36ec50fd3"}},{"arxiv_id":"Li_FCC_Feature_Clusters_Compression_for_Long-Tailed_Visual_Recognition_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Li_FCC_Feature_Clusters_Compression_for_Long-Tailed_Visual_Recognition_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lijian16/FCC","path":"lib/core/function.py","file_url":"https://github.com/lijian16/FCC/blob/HEAD/lib/core/function.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"75000f8601e0929d","code_sha256_prefix":"75000f8601e0929d","mcp_get_code":{"code_sha256":"75000f8601e0929d"}}],"record_sha256":"d848f69b3a19263948fcd6a273bbd4d090c6b5abd06764419362580de8470c16","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}