{"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":"/task/quantization/papers/2","list_of":"/task/quantization","task":"Quantization","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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_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_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":50,"rows_per_page":100,"rows":[101,200],"of":4925,"counts":{"archive_papers_tagged":4925,"with_a_code_link":1596,"where_syntology_ran_a_sample":515,"not_listed_spam_title":0,"listed":4925,"listed_where_code_ran":515,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":452,"every_run_a_failure_of_syntologys_instrument":63,"listed_with_a_run_with_no_instrument_failure":452,"listed_every_run_a_failure_of_syntologys_instrument":63,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/quantization","prev":"/task/quantization","next":"/task/quantization/papers/3","papers":[{"url":"/paper/soft-weight-sharing-for-neural-network","slug":"soft-weight-sharing-for-neural-network","title":"Soft Weight-Sharing for Neural Network Compression","date":"2017-02-13","arxiv_id":"1702.04008","repositories_listed":3,"syntology":null},{"url":"/paper/incremental-network-quantization-towards","slug":"incremental-network-quantization-towards","title":"Incremental Network Quantization: Towards Lossless CNNs with Low-Precision Weights","date":"2017-02-10","arxiv_id":"1702.03044","repositories_listed":3,"syntology":null},{"url":"/paper/model-preserving-adaptive-rounding","slug":"model-preserving-adaptive-rounding","title":"Model-Preserving Adaptive Rounding","date":"2025-05-29","arxiv_id":"2505.22988","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/model-preserving-adaptive-rounding#ran","syntology_url":"https://syntology.ai/paper/2505.22988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.22988"}},"official":{"repos":["cornell-relaxml/yaqa"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/sageattention2-a-more-efficient","slug":"sageattention2-a-more-efficient","title":"SageAttention2++: A More Efficient Implementation of SageAttention2","date":"2025-05-27","arxiv_id":"2505.21136","repositories_listed":2,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 5 unverified","sample_list":"/paper/sageattention2-a-more-efficient#ran","syntology_url":"https://syntology.ai/paper/2505.21136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.21136"}},"official":{"repos":["thu-ml/SageAttention"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/unitts-an-end-to-end-tts-system-without","slug":"unitts-an-end-to-end-tts-system-without","title":"UniTTS: An end-to-end TTS system without decoupling of acoustic and semantic information","date":"2025-05-23","arxiv_id":"2505.17426","repositories_listed":2,"syntology":null},{"url":"/paper/optimizing-binary-and-ternary-neural-network","slug":"optimizing-binary-and-ternary-neural-network","title":"Optimizing Binary and Ternary Neural Network Inference on RRAM Crossbars using CIM-Explorer","date":"2025-05-20","arxiv_id":"2505.14303","repositories_listed":2,"syntology":null},{"url":"/paper/litelmguard-seamless-and-lightweight-on","slug":"litelmguard-seamless-and-lightweight-on","title":"LiteLMGuard: Seamless and Lightweight On-Device Prompt Filtering for Safeguarding Small Language Models against Quantization-induced Risks and Vulnerabilities","date":"2025-05-08","arxiv_id":"2505.05619","repositories_listed":2,"syntology":null},{"url":"/paper/gptqv2-efficient-finetuning-free-quantization","slug":"gptqv2-efficient-finetuning-free-quantization","title":"GPTAQ: Efficient Finetuning-Free Quantization for Asymmetric Calibration","date":"2025-04-03","arxiv_id":"2504.02692","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/gptqv2-efficient-finetuning-free-quantization#ran","syntology_url":"https://syntology.ai/paper/2504.02692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.02692"}},"official":{"repos":["intelligent-computing-lab-yale/gptaq","intelligent-computing-lab-yale/gptqv2"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/hac-towards-100x-compression-of-3d-gaussian","slug":"hac-towards-100x-compression-of-3d-gaussian","title":"HAC++: Towards 100X Compression of 3D Gaussian Splatting","date":"2025-01-21","arxiv_id":"2501.12255","repositories_listed":2,"syntology":null},{"url":"/paper/evaluating-single-event-upsets-in-deep-neural","slug":"evaluating-single-event-upsets-in-deep-neural","title":"Evaluating Single Event Upsets in Deep Neural Networks for Semantic Segmentation: an embedded system perspective","date":"2024-12-04","arxiv_id":"2412.03630","repositories_listed":2,"syntology":null},{"url":"/paper/tokenflow-unified-image-tokenizer-for","slug":"tokenflow-unified-image-tokenizer-for","title":"TokenFlow: Unified Image Tokenizer for Multimodal Understanding and Generation","date":"2024-12-04","arxiv_id":"2412.03069","repositories_listed":2,"syntology":{"n":20,"n_ran":14,"n_constructed":0,"n_ran_checked":10,"n_instrument":4,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":7,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/tokenflow-unified-image-tokenizer-for#ran","syntology_url":"https://syntology.ai/paper/2412.03069","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.03069"}},"official":{"repos":["ByteFlow-AI/TokenFlow"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/taming-scalable-visual-tokenizer-for","slug":"taming-scalable-visual-tokenizer-for","title":"Taming Scalable Visual Tokenizer for Autoregressive Image Generation","date":"2024-12-03","arxiv_id":"2412.02692","repositories_listed":2,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":8,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":7,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/taming-scalable-visual-tokenizer-for#ran","syntology_url":"https://syntology.ai/paper/2412.02692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.02692"}},"official":{"repos":["tencentarc/seed-voken"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/pushing-the-limits-of-large-language-model","slug":"pushing-the-limits-of-large-language-model","title":"Pushing the Limits of Large Language Model Quantization via the Linearity Theorem","date":"2024-11-26","arxiv_id":"2411.17525","repositories_listed":2,"syntology":{"n":36,"n_ran":21,"n_constructed":0,"n_ran_checked":21,"n_instrument":0,"n_unverified":15,"n_honours":0,"n_violates":1,"n_no_contract":20,"n_pointer_only":1,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 1 violated, 20 with no contract checked; 0 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/pushing-the-limits-of-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2411.17525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17525"}},"official":null}},{"url":"/paper/symphonyqg-towards-symphonious-integration-of","slug":"symphonyqg-towards-symphonious-integration-of","title":"SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search","date":"2024-11-19","arxiv_id":"2411.12229","repositories_listed":2,"syntology":null},{"url":"/paper/sageattention2-technical-report-accurate-4","slug":"sageattention2-technical-report-accurate-4","title":"SageAttention2: Efficient Attention with Thorough Outlier Smoothing and Per-thread INT4 Quantization","date":"2024-11-17","arxiv_id":"2411.10958","repositories_listed":2,"syntology":{"n":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 6 unverified","sample_list":"/paper/sageattention2-technical-report-accurate-4#ran","syntology_url":"https://syntology.ai/paper/2411.10958","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.10958"}},"official":{"repos":["thu-ml/SageAttention"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":[]}}},{"url":"/paper/addressing-representation-collapse-in-vector","slug":"addressing-representation-collapse-in-vector","title":"Addressing Representation Collapse in Vector Quantized Models with One Linear Layer","date":"2024-11-04","arxiv_id":"2411.02038","repositories_listed":2,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":5,"n_no_contract":9,"n_pointer_only":2,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 5 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/addressing-representation-collapse-in-vector#ran","syntology_url":"https://syntology.ai/paper/2411.02038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02038"}},"official":{"repos":["youngsheen/SimVQ"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/lorann-low-rank-matrix-factorization-for","slug":"lorann-low-rank-matrix-factorization-for","title":"LoRANN: Low-Rank Matrix Factorization for Approximate Nearest Neighbor Search","date":"2024-10-24","arxiv_id":"2410.18926","repositories_listed":2,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/lorann-low-rank-matrix-factorization-for#ran","syntology_url":"https://syntology.ai/paper/2410.18926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.18926"}},"official":{"repos":["ejaasaari/lorann","ejaasaari/lorann-experiments"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/optimal-quantization-for-matrix","slug":"optimal-quantization-for-matrix","title":"Optimal Quantization for Matrix Multiplication","date":"2024-10-17","arxiv_id":"2410.13780","repositories_listed":2,"syntology":null},{"url":"/paper/duoattention-efficient-long-context-llm","slug":"duoattention-efficient-long-context-llm","title":"DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Heads","date":"2024-10-14","arxiv_id":"2410.10819","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/duoattention-efficient-long-context-llm#ran","syntology_url":"https://syntology.ai/paper/2410.10819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10819"}},"official":{"repos":["mit-han-lab/duo-attention"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/s-ste-continuous-pruning-function-for","slug":"s-ste-continuous-pruning-function-for","title":"S-STE: Continuous Pruning Function for Efficient 2:4 Sparse Pre-training","date":"2024-09-13","arxiv_id":"2409.09099","repositories_listed":2,"syntology":null},{"url":"/paper/jamba-1-5-hybrid-transformer-mamba-models-at","slug":"jamba-1-5-hybrid-transformer-mamba-models-at","title":"Jamba-1.5: Hybrid Transformer-Mamba Models at Scale","date":"2024-08-22","arxiv_id":"2408.12570","repositories_listed":2,"syntology":null},{"url":"/paper/marlin-mixed-precision-auto-regressive","slug":"marlin-mixed-precision-auto-regressive","title":"MARLIN: Mixed-Precision Auto-Regressive Parallel Inference on Large Language Models","date":"2024-08-21","arxiv_id":"2408.11743","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/marlin-mixed-precision-auto-regressive#ran","syntology_url":"https://syntology.ai/paper/2408.11743","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.11743"}},"official":{"repos":["ist-daslab/marlin","ist-daslab/sparse-marlin"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/metaaug-meta-data-augmentation-for-post","slug":"metaaug-meta-data-augmentation-for-post","title":"MetaAug: Meta-Data Augmentation for Post-Training Quantization","date":"2024-07-20","arxiv_id":"2407.14726","repositories_listed":2,"syntology":null},{"url":"/paper/flashattention-3-fast-and-accurate-attention","slug":"flashattention-3-fast-and-accurate-attention","title":"FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precision","date":"2024-07-11","arxiv_id":"2407.08608","repositories_listed":2,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":13,"n_pointer_only":10,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 2 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/flashattention-3-fast-and-accurate-attention#ran","syntology_url":"https://syntology.ai/paper/2407.08608","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.08608"}},"official":{"repos":["dao-ailab/flash-attention"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/q-galore-quantized-galore-with-int4","slug":"q-galore-quantized-galore-with-int4","title":"Q-GaLore: Quantized GaLore with INT4 Projection and Layer-Adaptive Low-Rank Gradients","date":"2024-07-11","arxiv_id":"2407.08296","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/q-galore-quantized-galore-with-int4#ran","syntology_url":"https://syntology.ai/paper/2407.08296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.08296"}},"official":{"repos":["VITA-Group/Q-GaLore"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/autoregressive-image-generation-without","slug":"autoregressive-image-generation-without","title":"Autoregressive Image Generation without Vector Quantization","date":"2024-06-17","arxiv_id":"2406.11838","repositories_listed":2,"syntology":{"n":13,"n_ran":8,"n_constructed":5,"n_ran_checked":6,"n_instrument":2,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/autoregressive-image-generation-without#ran","syntology_url":"https://syntology.ai/paper/2406.11838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11838"}},"official":{"repos":["lth14/mar"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/qtip-quantization-with-trellises-and","slug":"qtip-quantization-with-trellises-and","title":"QTIP: Quantization with Trellises and Incoherence Processing","date":"2024-06-17","arxiv_id":"2406.11235","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/qtip-quantization-with-trellises-and#ran","syntology_url":"https://syntology.ai/paper/2406.11235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11235"}},"official":{"repos":["Cornell-RelaxML/qtip"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/image-and-video-tokenization-with-binary","slug":"image-and-video-tokenization-with-binary","title":"Image and Video Tokenization with Binary Spherical Quantization","date":"2024-06-11","arxiv_id":"2406.07548","repositories_listed":2,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":9,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/image-and-video-tokenization-with-binary#ran","syntology_url":"https://syntology.ai/paper/2406.07548","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07548"}},"official":{"repos":["zhaoyue-zephyrus/bsq-vit"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gradient-based-automatic-per-weight-mixed","slug":"gradient-based-automatic-per-weight-mixed","title":"Gradient-based Automatic Mixed Precision Quantization for Neural Networks On-Chip","date":"2024-05-01","arxiv_id":"2405.00645","repositories_listed":2,"syntology":null},{"url":"/paper/semantic-routing-for-enhanced-performance-of","slug":"semantic-routing-for-enhanced-performance-of","title":"Semantic Routing for Enhanced Performance of LLM-Assisted Intent-Based 5G Core Network Management and Orchestration","date":"2024-04-24","arxiv_id":"2404.15869","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/semantic-routing-for-enhanced-performance-of#ran","syntology_url":"https://syntology.ai/paper/2404.15869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15869"}},"official":null}},{"url":"/paper/how-good-are-low-bit-quantized-llama3-models","slug":"how-good-are-low-bit-quantized-llama3-models","title":"An empirical study of LLaMA3 quantization: from LLMs to MLLMs","date":"2024-04-22","arxiv_id":"2404.14047","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/how-good-are-low-bit-quantized-llama3-models#ran","syntology_url":"https://syntology.ai/paper/2404.14047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.14047"}},"official":{"repos":["macaronlin/llama3-quantization"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/mixlora-enhancing-large-language-models-fine","slug":"mixlora-enhancing-large-language-models-fine","title":"MixLoRA: Enhancing Large Language Models Fine-Tuning with LoRA-based Mixture of Experts","date":"2024-04-22","arxiv_id":"2404.15159","repositories_listed":2,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/mixlora-enhancing-large-language-models-fine#ran","syntology_url":"https://syntology.ai/paper/2404.15159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15159"}},"official":{"repos":["TUDB-Labs/MixLoRA","mikecovlee/mLoRA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/signsgd-with-federated-voting","slug":"signsgd-with-federated-voting","title":"SignSGD with Federated Voting","date":"2024-03-25","arxiv_id":"2403.16372","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/signsgd-with-federated-voting#ran","syntology_url":"https://syntology.ai/paper/2403.16372","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.16372"}},"official":null}},{"url":"/paper/hac-hash-grid-assisted-context-for-3d","slug":"hac-hash-grid-assisted-context-for-3d","title":"HAC: Hash-grid Assisted Context for 3D Gaussian Splatting Compression","date":"2024-03-21","arxiv_id":"2403.14530","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-fine-tuning-of-compressed-neural","slug":"adversarial-fine-tuning-of-compressed-neural","title":"Adversarial Fine-tuning of Compressed Neural Networks for Joint Improvement of Robustness and Efficiency","date":"2024-03-14","arxiv_id":"2403.09441","repositories_listed":2,"syntology":null},{"url":"/paper/gear-an-efficient-kv-cache-compression","slug":"gear-an-efficient-kv-cache-compression","title":"GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM","date":"2024-03-08","arxiv_id":"2403.05527","repositories_listed":2,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":15,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/gear-an-efficient-kv-cache-compression#ran","syntology_url":"https://syntology.ai/paper/2403.05527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.05527"}},"official":{"repos":["haokang-timmy/gear"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/behavior-generation-with-latent-actions","slug":"behavior-generation-with-latent-actions","title":"Behavior Generation with Latent Actions","date":"2024-03-05","arxiv_id":"2403.03181","repositories_listed":2,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":2,"n_no_contract":4,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/behavior-generation-with-latent-actions#ran","syntology_url":"https://syntology.ai/paper/2403.03181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03181"}},"official":{"repos":["jayLEE0301/vq_bet_official"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/intactkv-improving-large-language-model","slug":"intactkv-improving-large-language-model","title":"IntactKV: Improving Large Language Model Quantization by Keeping Pivot Tokens Intact","date":"2024-03-02","arxiv_id":"2403.01241","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/intactkv-improving-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2403.01241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01241"}},"official":{"repos":["ruikangliu/IntactKV"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/llm-inference-unveiled-survey-and-roofline","slug":"llm-inference-unveiled-survey-and-roofline","title":"LLM Inference Unveiled: Survey and Roofline Model Insights","date":"2024-02-26","arxiv_id":"2402.16363","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llm-inference-unveiled-survey-and-roofline#ran","syntology_url":"https://syntology.ai/paper/2402.16363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.16363"}},"official":{"repos":["hahnyuan/llm-viewer"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/laco-large-language-model-pruning-via-layer","slug":"laco-large-language-model-pruning-via-layer","title":"LaCo: Large Language Model Pruning via Layer Collapse","date":"2024-02-17","arxiv_id":"2402.11187","repositories_listed":2,"syntology":null},{"url":"/paper/bitdistiller-unleashing-the-potential-of-sub","slug":"bitdistiller-unleashing-the-potential-of-sub","title":"BitDistiller: Unleashing the Potential of Sub-4-Bit LLMs via Self-Distillation","date":"2024-02-16","arxiv_id":"2402.10631","repositories_listed":2,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/bitdistiller-unleashing-the-potential-of-sub#ran","syntology_url":"https://syntology.ai/paper/2402.10631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10631"}},"official":{"repos":["dd-duda/bitdistiller"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/signsgd-with-federated-defense-harnessing","slug":"signsgd-with-federated-defense-harnessing","title":"SignSGD with Federated Defense: Harnessing Adversarial Attacks through Gradient Sign Decoding","date":"2024-02-02","arxiv_id":"2402.01340","repositories_listed":2,"syntology":null},{"url":"/paper/kvquant-towards-10-million-context-length-llm","slug":"kvquant-towards-10-million-context-length-llm","title":"KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantization","date":"2024-01-31","arxiv_id":"2401.18079","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kvquant-towards-10-million-context-length-llm#ran","syntology_url":"https://syntology.ai/paper/2401.18079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.18079"}},"official":{"repos":["squeezeailab/kvquant"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-sparse-fine-tuning-to-large-language","slug":"scaling-sparse-fine-tuning-to-large-language","title":"Scaling Sparse Fine-Tuning to Large Language Models","date":"2024-01-29","arxiv_id":"2401.16405","repositories_listed":2,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/scaling-sparse-fine-tuning-to-large-language#ran","syntology_url":"https://syntology.ai/paper/2401.16405","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16405"}},"official":{"repos":["alanansell/peft","ducdauge/sft-llm"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/rosa-accurate-parameter-efficient-fine-tuning","slug":"rosa-accurate-parameter-efficient-fine-tuning","title":"RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptation","date":"2024-01-09","arxiv_id":"2401.04679","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/rosa-accurate-parameter-efficient-fine-tuning#ran","syntology_url":"https://syntology.ai/paper/2401.04679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.04679"}},"official":{"repos":["ist-daslab/rosa"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/tinygpt-v-efficient-multimodal-large-language","slug":"tinygpt-v-efficient-multimodal-large-language","title":"TinyGPT-V: Efficient Multimodal Large Language Model via Small Backbones","date":"2023-12-28","arxiv_id":"2312.16862","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tinygpt-v-efficient-multimodal-large-language#ran","syntology_url":"https://syntology.ai/paper/2312.16862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16862"}},"official":{"repos":["dlyuangod/tinygpt-v"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/falcon-feature-label-constrained-graph-net","slug":"falcon-feature-label-constrained-graph-net","title":"FALCON: Feature-Label Constrained Graph Net Collapse for Memory Efficient GNNs","date":"2023-12-27","arxiv_id":"2312.16542","repositories_listed":2,"syntology":null},{"url":"/paper/leanvec-search-your-vectors-faster-by-making","slug":"leanvec-search-your-vectors-faster-by-making","title":"LeanVec: Searching vectors faster by making them fit","date":"2023-12-26","arxiv_id":"2312.16335","repositories_listed":2,"syntology":null},{"url":"/paper/tinysam-pushing-the-envelope-for-efficient","slug":"tinysam-pushing-the-envelope-for-efficient","title":"TinySAM: Pushing the Envelope for Efficient Segment Anything Model","date":"2023-12-21","arxiv_id":"2312.13789","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/tinysam-pushing-the-envelope-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2312.13789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13789"}},"official":{"repos":["xinghaochen/tinysam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/compact-3d-scene-representation-via-self","slug":"compact-3d-scene-representation-via-self","title":"Compact 3D Scene Representation via Self-Organizing Gaussian Grids","date":"2023-12-19","arxiv_id":"2312.13299","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compact-3d-scene-representation-via-self#ran","syntology_url":"https://syntology.ai/paper/2312.13299","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13299"}},"official":{"repos":["fraunhoferhhi/Self-Organizing-Gaussians"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/zeroquant-4-2-redefining-llms-quantization","slug":"zeroquant-4-2-redefining-llms-quantization","title":"ZeroQuant(4+2): Redefining LLMs Quantization with a New FP6-Centric Strategy for Diverse Generative Tasks","date":"2023-12-14","arxiv_id":"2312.08583","repositories_listed":2,"syntology":null},{"url":"/paper/smoothquant-accurate-and-efficient-4-bit-post","slug":"smoothquant-accurate-and-efficient-4-bit-post","title":"SmoothQuant+: Accurate and Efficient 4-bit Post-Training WeightQuantization for LLM","date":"2023-12-06","arxiv_id":"2312.03788","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-llm-inference-on-cpus","slug":"efficient-llm-inference-on-cpus","title":"Efficient LLM Inference on CPUs","date":"2023-11-01","arxiv_id":"2311.00502","repositories_listed":2,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/efficient-llm-inference-on-cpus#ran","syntology_url":"https://syntology.ai/paper/2311.00502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.00502"}},"official":{"repos":["intel/intel-extension-for-transformers"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/bitnet-scaling-1-bit-transformers-for-large","slug":"bitnet-scaling-1-bit-transformers-for-large","title":"BitNet: Scaling 1-bit Transformers for Large Language Models","date":"2023-10-17","arxiv_id":"2310.11453","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bitnet-scaling-1-bit-transformers-for-large#ran","syntology_url":"https://syntology.ai/paper/2310.11453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.11453"}},"official":null}},{"url":"/paper/qllm-accurate-and-efficient-low-bitwidth","slug":"qllm-accurate-and-efficient-low-bitwidth","title":"QLLM: Accurate and Efficient Low-Bitwidth Quantization for Large Language Models","date":"2023-10-12","arxiv_id":"2310.08041","repositories_listed":2,"syntology":{"n":16,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/qllm-accurate-and-efficient-low-bitwidth#ran","syntology_url":"https://syntology.ai/paper/2310.08041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.08041"}},"official":{"repos":["modeltc/qllm","ziplab/qllm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/cachegen-fast-context-loading-for-language","slug":"cachegen-fast-context-loading-for-language","title":"CacheGen: KV Cache Compression and Streaming for Fast Large Language Model Serving","date":"2023-10-11","arxiv_id":"2310.07240","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cachegen-fast-context-loading-for-language#ran","syntology_url":"https://syntology.ai/paper/2310.07240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07240"}},"official":{"repos":["uchi-jcl/cachegen"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pb-llm-partially-binarized-large-language","slug":"pb-llm-partially-binarized-large-language","title":"PB-LLM: Partially Binarized Large Language Models","date":"2023-09-29","arxiv_id":"2310.00034","repositories_listed":2,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/pb-llm-partially-binarized-large-language#ran","syntology_url":"https://syntology.ai/paper/2310.00034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00034"}},"official":{"repos":["hahnyuan/binaryllm","hahnyuan/pb-llm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-post-training-quantization-with-fp8","slug":"efficient-post-training-quantization-with-fp8","title":"Efficient Post-training Quantization with FP8 Formats","date":"2023-09-26","arxiv_id":"2309.14592","repositories_listed":2,"syntology":null},{"url":"/paper/qa-lora-quantization-aware-low-rank","slug":"qa-lora-quantization-aware-low-rank","title":"QA-LoRA: Quantization-Aware Low-Rank Adaptation of Large Language Models","date":"2023-09-26","arxiv_id":"2309.14717","repositories_listed":2,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/qa-lora-quantization-aware-low-rank#ran","syntology_url":"https://syntology.ai/paper/2309.14717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.14717"}},"official":null}},{"url":"/paper/co-evolving-vector-quantization-for-id-based","slug":"co-evolving-vector-quantization-for-id-based","title":"Learning Category Trees for ID-Based Recommendation: Exploring the Power of Differentiable Vector Quantization","date":"2023-08-31","arxiv_id":"2308.16761","repositories_listed":2,"syntology":null},{"url":"/paper/reprogramming-under-constraints-revisiting","slug":"reprogramming-under-constraints-revisiting","title":"Uncovering the Hidden Cost of Model Compression","date":"2023-08-29","arxiv_id":"2308.14969","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reprogramming-under-constraints-revisiting#ran","syntology_url":"https://syntology.ai/paper/2308.14969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14969"}},"official":{"repos":["landskape-ai/reprogram_lt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/omniquant-omnidirectionally-calibrated","slug":"omniquant-omnidirectionally-calibrated","title":"OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Models","date":"2023-08-25","arxiv_id":"2308.13137","repositories_listed":2,"syntology":{"n":16,"n_ran":10,"n_constructed":1,"n_ran_checked":8,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/omniquant-omnidirectionally-calibrated#ran","syntology_url":"https://syntology.ai/paper/2308.13137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.13137"}},"official":{"repos":["opengvlab/omniquant"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/federated-classification-in-hyperbolic-spaces","slug":"federated-classification-in-hyperbolic-spaces","title":"Federated Classification in Hyperbolic Spaces via Secure Aggregation of Convex Hulls","date":"2023-08-14","arxiv_id":"2308.06895","repositories_listed":2,"syntology":null},{"url":"/paper/rmp-loss-regularizing-membrane-potential","slug":"rmp-loss-regularizing-membrane-potential","title":"RMP-Loss: Regularizing Membrane Potential Distribution for Spiking Neural Networks","date":"2023-08-13","arxiv_id":"2308.06787","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rmp-loss-regularizing-membrane-potential#ran","syntology_url":"https://syntology.ai/paper/2308.06787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.06787"}},"official":null}},{"url":"/paper/feature-modulation-transformer-cross","slug":"feature-modulation-transformer-cross","title":"Exploring Frequency-Inspired Optimization in Transformer for Efficient Single Image Super-Resolution","date":"2023-08-09","arxiv_id":"2308.05022","repositories_listed":2,"syntology":null},{"url":"/paper/anonymizing-speech-evaluating-and-designing","slug":"anonymizing-speech-evaluating-and-designing","title":"Anonymizing Speech: Evaluating and Designing Speaker Anonymization Techniques","date":"2023-08-05","arxiv_id":"2308.04455","repositories_listed":2,"syntology":null},{"url":"/paper/variation-aware-vision-transformer","slug":"variation-aware-vision-transformer","title":"Quantization Variation: A New Perspective on Training Transformers with Low-Bit Precision","date":"2023-07-01","arxiv_id":"2307.00331","repositories_listed":2,"syntology":null},{"url":"/paper/mert-acoustic-music-understanding-model-with","slug":"mert-acoustic-music-understanding-model-with","title":"MERT: Acoustic Music Understanding Model with Large-Scale Self-supervised Training","date":"2023-05-31","arxiv_id":"2306.00107","repositories_listed":2,"syntology":null},{"url":"/paper/a-transfer-learning-and-explainable-solution","slug":"a-transfer-learning-and-explainable-solution","title":"A Transfer Learning and Explainable Solution to Detect mpox from Smartphones images","date":"2023-05-29","arxiv_id":"2305.18489","repositories_listed":2,"syntology":null},{"url":"/paper/multiquant-a-novel-multi-branch-topology","slug":"multiquant-a-novel-multi-branch-topology","title":"MBQuant: A Novel Multi-Branch Topology Method for Arbitrary Bit-width Network Quantization","date":"2023-05-14","arxiv_id":"2305.08117","repositories_listed":2,"syntology":null},{"url":"/paper/object-discovery-from-motion-guided-tokens","slug":"object-discovery-from-motion-guided-tokens","title":"Object Discovery from Motion-Guided Tokens","date":"2023-03-27","arxiv_id":"2303.15555","repositories_listed":2,"syntology":{"n":29,"n_ran":18,"n_constructed":12,"n_ran_checked":14,"n_instrument":4,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":29,"phrase":"18 ran (of which 12 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 4 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/object-discovery-from-motion-guided-tokens#ran","syntology_url":"https://syntology.ai/paper/2303.15555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.15555"}},"official":{"repos":["zpbao/discovery_obj_move","zpbao/motok"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":12,"n_ran_no_instrument_failure":14,"n_unverified":11,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/a-comprehensive-study-on-post-training","slug":"a-comprehensive-study-on-post-training","title":"ZeroQuant-V2: Exploring Post-training Quantization in LLMs from Comprehensive Study to Low Rank Compensation","date":"2023-03-15","arxiv_id":"2303.08302","repositories_listed":2,"syntology":null},{"url":"/paper/neural-vector-fields-implicit-representation","slug":"neural-vector-fields-implicit-representation","title":"Neural Vector Fields: Implicit Representation by Explicit Learning","date":"2023-03-08","arxiv_id":"2303.04341","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-vector-fields-implicit-representation#ran","syntology_url":"https://syntology.ai/paper/2303.04341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.04341"}},"official":{"repos":["Wi-sc/NVF"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/optimal-ann-snn-conversion-for-high-accuracy-1","slug":"optimal-ann-snn-conversion-for-high-accuracy-1","title":"Optimal ANN-SNN Conversion for High-accuracy and Ultra-low-latency Spiking Neural Networks","date":"2023-03-08","arxiv_id":"2303.04347","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimal-ann-snn-conversion-for-high-accuracy-1#ran","syntology_url":"https://syntology.ai/paper/2303.04347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.04347"}},"official":{"repos":["putshua/SNN_conversion_QCFS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/vector-quantized-time-series-generation-with","slug":"vector-quantized-time-series-generation-with","title":"Vector Quantized Time Series Generation with a Bidirectional Prior Model","date":"2023-03-08","arxiv_id":"2303.04743","repositories_listed":2,"syntology":{"n":16,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":13,"n_pointer_only":3,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 2 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vector-quantized-time-series-generation-with#ran","syntology_url":"https://syntology.ai/paper/2303.04743","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.04743"}},"official":{"repos":["danelee2601/supervised-fcn","ml4its/timevqvae"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/qarv-quantization-aware-resnet-vae-for-lossy","slug":"qarv-quantization-aware-resnet-vae-for-lossy","title":"QARV: Quantization-Aware ResNet VAE for Lossy Image Compression","date":"2023-02-16","arxiv_id":"2302.08899","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/qarv-quantization-aware-resnet-vae-for-lossy#ran","syntology_url":"https://syntology.ai/paper/2302.08899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08899"}},"official":{"repos":["gitlab.com/viper-purdue/qarv-release"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"url":"/paper/qcm-sgm-improved-quantized-compressed-sensing","slug":"qcm-sgm-improved-quantized-compressed-sensing","title":"QCM-SGM+: Improved Quantized Compressed Sensing With Score-Based Generative Models","date":"2023-02-02","arxiv_id":"2302.00919","repositories_listed":2,"syntology":null},{"url":"/paper/toward-accurate-post-training-quantization","slug":"toward-accurate-post-training-quantization","title":"Toward Accurate Post-Training Quantization for Image Super Resolution","date":"2023-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/make-repvgg-greater-again-a-quantization","slug":"make-repvgg-greater-again-a-quantization","title":"Make RepVGG Greater Again: A Quantization-aware Approach","date":"2022-12-03","arxiv_id":"2212.01593","repositories_listed":2,"syntology":null},{"url":"/paper/quala-minilm-a-quantized-length-adaptive","slug":"quala-minilm-a-quantized-length-adaptive","title":"QuaLA-MiniLM: a Quantized Length Adaptive MiniLM","date":"2022-10-31","arxiv_id":"2210.17114","repositories_listed":2,"syntology":null},{"url":"/paper/movq-modulating-quantized-vectors-for-high","slug":"movq-modulating-quantized-vectors-for-high","title":"MoVQ: Modulating Quantized Vectors for High-Fidelity Image Generation","date":"2022-09-19","arxiv_id":"2209.09002","repositories_listed":2,"syntology":null},{"url":"/paper/quantnas-for-super-resolution-searching-for","slug":"quantnas-for-super-resolution-searching-for","title":"QuantNAS for super resolution: searching for efficient quantization-friendly architectures against quantization noise","date":"2022-08-31","arxiv_id":"2208.14839","repositories_listed":2,"syntology":null},{"url":"/paper/lossy-image-compression-with-quantized","slug":"lossy-image-compression-with-quantized","title":"Lossy Image Compression with Quantized Hierarchical VAEs","date":"2022-08-27","arxiv_id":"2208.13056","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lossy-image-compression-with-quantized#ran","syntology_url":"https://syntology.ai/paper/2208.13056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.13056"}},"official":{"repos":["duanzhiihao/lossy-vae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-nearest-convolution-for-real-time","slug":"fast-nearest-convolution-for-real-time","title":"Fast Nearest Convolution for Real-Time Efficient Image Super-Resolution","date":"2022-08-24","arxiv_id":"2208.11609","repositories_listed":2,"syntology":null},{"url":"/paper/denseshift-towards-accurate-and-transferable","slug":"denseshift-towards-accurate-and-transferable","title":"DenseShift: Towards Accurate and Efficient Low-Bit Power-of-Two Quantization","date":"2022-08-20","arxiv_id":"2208.09708","repositories_listed":2,"syntology":null},{"url":"/paper/quantized-training-of-gradient-boosting","slug":"quantized-training-of-gradient-boosting","title":"Quantized Training of Gradient Boosting Decision Trees","date":"2022-07-20","arxiv_id":"2207.09682","repositories_listed":2,"syntology":null},{"url":"/paper/nuqmm-quantized-matmul-for-efficient","slug":"nuqmm-quantized-matmul-for-efficient","title":"LUT-GEMM: Quantized Matrix Multiplication based on LUTs for Efficient Inference in Large-Scale Generative Language Models","date":"2022-06-20","arxiv_id":"2206.09557","repositories_listed":2,"syntology":null},{"url":"/paper/towards-efficient-active-learning-of-pdfa","slug":"towards-efficient-active-learning-of-pdfa","title":"Towards Efficient Active Learning of PDFA","date":"2022-06-17","arxiv_id":"2206.09004","repositories_listed":2,"syntology":null},{"url":"/paper/domain-adaptation-for-memory-efficient-dense","slug":"domain-adaptation-for-memory-efficient-dense","title":"Injecting Domain Adaptation with Learning-to-hash for Effective and Efficient Zero-shot Dense Retrieval","date":"2022-05-23","arxiv_id":"2205.11498","repositories_listed":2,"syntology":null},{"url":"/paper/communication-efficient-adaptive-federated","slug":"communication-efficient-adaptive-federated","title":"Communication-Efficient Adaptive Federated Learning","date":"2022-05-05","arxiv_id":"2205.02719","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/communication-efficient-adaptive-federated#ran","syntology_url":"https://syntology.ai/paper/2205.02719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.02719"}},"official":null}},{"url":"/paper/distill-vq-learning-retrieval-oriented-vector","slug":"distill-vq-learning-retrieval-oriented-vector","title":"Distill-VQ: Learning Retrieval Oriented Vector Quantization By Distilling Knowledge from Dense Embeddings","date":"2022-04-01","arxiv_id":"2204.00185","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/distill-vq-learning-retrieval-oriented-vector#ran","syntology_url":"https://syntology.ai/paper/2204.00185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.00185"}},"official":{"repos":["staoxiao/libvq"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dq-bart-efficient-sequence-to-sequence-model","slug":"dq-bart-efficient-sequence-to-sequence-model","title":"DQ-BART: Efficient Sequence-to-Sequence Model via Joint Distillation and Quantization","date":"2022-03-21","arxiv_id":"2203.11239","repositories_listed":2,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/dq-bart-efficient-sequence-to-sequence-model#ran","syntology_url":"https://syntology.ai/paper/2203.11239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.11239"}},"official":{"repos":["amazon-research/dq-bart"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["listed"]}}},{"url":"/paper/qdrop-randomly-dropping-quantization-for-1","slug":"qdrop-randomly-dropping-quantization-for-1","title":"QDrop: Randomly Dropping Quantization for Extremely Low-bit Post-Training Quantization","date":"2022-03-11","arxiv_id":"2203.05740","repositories_listed":2,"syntology":{"n":19,"n_ran":14,"n_constructed":5,"n_ran_checked":6,"n_instrument":8,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"14 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 8 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/qdrop-randomly-dropping-quantization-for-1#ran","syntology_url":"https://syntology.ai/paper/2203.05740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05740"}},"official":{"repos":["modeltc/mqbench","wimh966/QDrop"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/retriever-learning-content-style-1","slug":"retriever-learning-content-style-1","title":"Retriever: Learning Content-Style Representation as a Token-Level Bipartite Graph","date":"2022-02-24","arxiv_id":"2202.12307","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/retriever-learning-content-style-1#ran","syntology_url":"https://syntology.ai/paper/2202.12307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.12307"}},"official":{"repos":["xrenaa/Retriever"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/few-bit-backward-quantized-gradients-of","slug":"few-bit-backward-quantized-gradients-of","title":"Few-Bit Backward: Quantized Gradients of Activation Functions for Memory Footprint Reduction","date":"2022-02-01","arxiv_id":"2202.00441","repositories_listed":2,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/few-bit-backward-quantized-gradients-of#ran","syntology_url":"https://syntology.ai/paper/2202.00441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.00441"}},"official":{"repos":["SkoltechAI/fewbit"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/post-training-quantization-for-neural","slug":"post-training-quantization-for-neural","title":"Post-training Quantization for Neural Networks with Provable Guarantees","date":"2022-01-26","arxiv_id":"2201.11113","repositories_listed":2,"syntology":null},{"url":"/paper/heam-high-efficiency-approximate-multiplier","slug":"heam-high-efficiency-approximate-multiplier","title":"HEAM: High-Efficiency Approximate Multiplier Optimization for Deep Neural Networks","date":"2022-01-20","arxiv_id":"2201.08022","repositories_listed":2,"syntology":null},{"url":"/paper/progressively-optimized-bi-granular-document","slug":"progressively-optimized-bi-granular-document","title":"Progressively Optimized Bi-Granular Document Representation for Scalable Embedding Based Retrieval","date":"2022-01-14","arxiv_id":"2201.05409","repositories_listed":2,"syntology":null},{"url":"/paper/pocketnn-integer-only-training-and-inference","slug":"pocketnn-integer-only-training-and-inference","title":"PocketNN: Integer-only Training and Inference of Neural Networks via Direct Feedback Alignment and Pocket Activations in Pure C++","date":"2022-01-08","arxiv_id":"2201.02863","repositories_listed":2,"syntology":null},{"url":"/paper/ernie-vilg-unified-generative-pre-training","slug":"ernie-vilg-unified-generative-pre-training","title":"ERNIE-ViLG: Unified Generative Pre-training for Bidirectional Vision-Language Generation","date":"2021-12-31","arxiv_id":"2112.15283","repositories_listed":2,"syntology":null}],"record_sha256":"beb6c11ef9a073ee645cc423ca34cd8f722f4f75b40ccff44fa304378509b7f3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}