{"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/data-compression","name":"Data Compression","slug":"data-compression","description_markdown":null,"categories":[{"name":"Time Series","url":"/area/time-series"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":459,"papers_with_code":131,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/time-series","name":"Time Series Analysis"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":5,"rows_per_page":100,"shown":100,"of":459,"of_with_code":131,"tagged_in_all":459,"counts":{"archive_papers_tagged":459,"with_a_code_link":131,"where_syntology_ran_a_sample":33,"not_listed_spam_title":0,"listed":459,"listed_where_code_ran":33,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":32,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":32,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"items":[{"url":"/paper/xgboost-a-scalable-tree-boosting-system","slug":"xgboost-a-scalable-tree-boosting-system","title":"XGBoost: A Scalable Tree Boosting System","date":"2016-03-09","arxiv_id":"1603.02754","repositories_listed":28,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/xgboost-a-scalable-tree-boosting-system#ran","syntology_url":"https://syntology.ai/paper/1603.02754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.02754"}},"official":{"repos":["dmlc/xgboost"],"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/dnabert-2-efficient-foundation-model-and","slug":"dnabert-2-efficient-foundation-model-and","title":"DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genome","date":"2023-06-26","arxiv_id":"2306.15006","repositories_listed":6,"syntology":{"n":23,"n_ran":13,"n_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":10,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/dnabert-2-efficient-foundation-model-and#ran","syntology_url":"https://syntology.ai/paper/2306.15006","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.15006"}},"official":{"repos":["magics-lab/dnabert_2","zhihan1996/dnabert_2"],"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/entropy-law-the-story-behind-data-compression","slug":"entropy-law-the-story-behind-data-compression","title":"Entropy Law: The Story Behind Data Compression and LLM Performance","date":"2024-07-09","arxiv_id":"2407.06645","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/entropy-law-the-story-behind-data-compression#ran","syntology_url":"https://syntology.ai/paper/2407.06645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06645"}},"official":{"repos":["ustc-starteam/zip"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/an-introduction-to-neural-data-compression","slug":"an-introduction-to-neural-data-compression","title":"An Introduction to Neural Data Compression","date":"2022-02-14","arxiv_id":"2202.06533","repositories_listed":3,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/an-introduction-to-neural-data-compression#ran","syntology_url":"https://syntology.ai/paper/2202.06533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06533"}},"official":null}},{"url":"/paper/transformer-based-transform-coding","slug":"transformer-based-transform-coding","title":"Transformer-based Transform Coding","date":"2021-09-29","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/efficient-manifold-and-subspace","slug":"efficient-manifold-and-subspace","title":"Efficient Manifold and Subspace Approximations with Spherelets","date":"2017-06-26","arxiv_id":"1706.08263","repositories_listed":3,"syntology":null},{"url":"/paper/unipcgc-towards-practical-point-cloud","slug":"unipcgc-towards-practical-point-cloud","title":"UniPCGC: Towards Practical Point Cloud Geometry Compression via an Efficient Unified Approach","date":"2025-03-24","arxiv_id":"2503.18541","repositories_listed":2,"syntology":null},{"url":"/paper/tokenization-is-more-than-compression","slug":"tokenization-is-more-than-compression","title":"Tokenization Is More Than Compression","date":"2024-02-28","arxiv_id":"2402.18376","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/tokenization-is-more-than-compression#ran","syntology_url":"https://syntology.ai/paper/2402.18376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.18376"}},"official":{"repos":["kensho-technologies/pathpiece","kensho-technologies/timtc_vocabs_models"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-model-evaluation-via-matrix","slug":"large-language-model-evaluation-via-matrix","title":"Diff-eRank: A Novel Rank-Based Metric for Evaluating Large Language Models","date":"2024-01-30","arxiv_id":"2401.17139","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-model-evaluation-via-matrix#ran","syntology_url":"https://syntology.ai/paper/2401.17139","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.17139"}},"official":{"repos":["waltonfuture/Diff-eRank"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"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/bayesflow-amortized-bayesian-workflows-with","slug":"bayesflow-amortized-bayesian-workflows-with","title":"BayesFlow: Amortized Bayesian Workflows With Neural Networks","date":"2023-06-28","arxiv_id":"2306.16015","repositories_listed":2,"syntology":null},{"url":"/paper/fast-and-multi-aspect-mining-of-complex-time","slug":"fast-and-multi-aspect-mining-of-complex-time","title":"Fast and Multi-aspect Mining of Complex Time-stamped Event Streams","date":"2023-03-07","arxiv_id":"2303.03789","repositories_listed":2,"syntology":null},{"url":"/paper/ldmic-learning-based-distributed-multi-view","slug":"ldmic-learning-based-distributed-multi-view","title":"LDMIC: Learning-based Distributed Multi-view Image Coding","date":"2023-01-24","arxiv_id":"2301.09799","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ldmic-learning-based-distributed-multi-view#ran","syntology_url":"https://syntology.ai/paper/2301.09799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.09799"}},"official":{"repos":["xinjie-q/ldmic"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/qcnn-quadrature-convolutional-neural-network","slug":"qcnn-quadrature-convolutional-neural-network","title":"QuadConv: Quadrature-Based Convolutions with Applications to Non-Uniform PDE Data Compression","date":"2022-11-09","arxiv_id":"2211.05151","repositories_listed":2,"syntology":null},{"url":"/paper/dc-bench-dataset-condensation-benchmark","slug":"dc-bench-dataset-condensation-benchmark","title":"DC-BENCH: Dataset Condensation Benchmark","date":"2022-07-20","arxiv_id":"2207.09639","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":3,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 3 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dc-bench-dataset-condensation-benchmark#ran","syntology_url":"https://syntology.ai/paper/2207.09639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09639"}},"official":{"repos":["justincui03/dc_benchmark"],"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/bottlefit-learning-compressed-representations","slug":"bottlefit-learning-compressed-representations","title":"BottleFit: Learning Compressed Representations in Deep Neural Networks for Effective and Efficient Split Computing","date":"2022-01-07","arxiv_id":"2201.02693","repositories_listed":2,"syntology":null},{"url":"/paper/understanding-entropy-coding-with-asymmetric","slug":"understanding-entropy-coding-with-asymmetric","title":"Understanding Entropy Coding With Asymmetric Numeral Systems (ANS): a Statistician's Perspective","date":"2022-01-05","arxiv_id":"2201.01741","repositories_listed":2,"syntology":null},{"url":"/paper/towards-empirical-sandwich-bounds-on-the-rate-1","slug":"towards-empirical-sandwich-bounds-on-the-rate-1","title":"Towards Empirical Sandwich Bounds on the Rate-Distortion Function","date":"2021-11-23","arxiv_id":"2111.12166","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-empirical-sandwich-bounds-on-the-rate-1#ran","syntology_url":"https://syntology.ai/paper/2111.12166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12166"}},"official":{"repos":["mandt-lab/RD-sandwich","mandt-lab/empirical-RD-sandwich"],"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/supervised-compression-for-resource","slug":"supervised-compression-for-resource","title":"Supervised Compression for Resource-Constrained Edge Computing Systems","date":"2021-08-21","arxiv_id":"2108.11898","repositories_listed":2,"syntology":{"n":17,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"11 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; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/supervised-compression-for-resource#ran","syntology_url":"https://syntology.ai/paper/2108.11898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.11898"}},"official":{"repos":["yoshitomo-matsubara/supervised-compression"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/redunet-a-white-box-deep-network-from-the","slug":"redunet-a-white-box-deep-network-from-the","title":"ReduNet: A White-box Deep Network from the Principle of Maximizing Rate Reduction","date":"2021-05-21","arxiv_id":"2105.10446","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":2,"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/redunet-a-white-box-deep-network-from-the#ran","syntology_url":"https://syntology.ai/paper/2105.10446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.10446"}},"official":{"repos":["Ma-Lab-Berkeley/MCR2","Ma-Lab-Berkeley/ReduNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/norm-explicit-quantization-improving-vector","slug":"norm-explicit-quantization-improving-vector","title":"Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search","date":"2019-11-12","arxiv_id":"1911.04654","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/norm-explicit-quantization-improving-vector#ran","syntology_url":"https://syntology.ai/paper/1911.04654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04654"}},"official":{"repos":["xinyandai/product-quantization"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/2506-08306","slug":"2506-08306","title":"AstroCompress: A benchmark dataset for multi-purpose compression of astronomical data","date":"2025-06-10","arxiv_id":"2506.08306","repositories_listed":1,"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":0,"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/2506-08306#ran","syntology_url":"https://syntology.ai/paper/2506.08306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.08306"}},"official":{"repos":["tuatruog/astrocompress"],"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/stationary-mmd-points-for-cubature","slug":"stationary-mmd-points-for-cubature","title":"Stationary MMD Points for Cubature","date":"2025-05-27","arxiv_id":"2505.20754","repositories_listed":1,"syntology":null},{"url":"/paper/minilongbench-the-low-cost-long-context","slug":"minilongbench-the-low-cost-long-context","title":"MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Models","date":"2025-05-26","arxiv_id":"2505.19959","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-compression-of-neural-networks-and","slug":"efficient-compression-of-neural-networks-and","title":"Efficient compression of neural networks and datasets","date":"2025-05-23","arxiv_id":"2505.17469","repositories_listed":1,"syntology":null},{"url":"/paper/dd-ranking-rethinking-the-evaluation-of","slug":"dd-ranking-rethinking-the-evaluation-of","title":"DD-Ranking: Rethinking the Evaluation of Dataset Distillation","date":"2025-05-19","arxiv_id":"2505.13300","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dd-ranking-rethinking-the-evaluation-of#ran","syntology_url":"https://syntology.ai/paper/2505.13300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.13300"}},"official":{"repos":["nus-hpc-ai-lab/dd-ranking"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/replaycad-generative-diffusion-replay-for","slug":"replaycad-generative-diffusion-replay-for","title":"ReplayCAD: Generative Diffusion Replay for Continual Anomaly Detection","date":"2025-05-10","arxiv_id":"2505.06603","repositories_listed":1,"syntology":null},{"url":"/paper/hybridgs-high-efficiency-gaussian-splatting","slug":"hybridgs-high-efficiency-gaussian-splatting","title":"HybridGS: High-Efficiency Gaussian Splatting Data Compression using Dual-Channel Sparse Representation and Point Cloud Encoder","date":"2025-05-03","arxiv_id":"2505.01938","repositories_listed":1,"syntology":null},{"url":"/paper/an-extrapolated-and-provably-convergent","slug":"an-extrapolated-and-provably-convergent","title":"An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function","date":"2025-03-31","arxiv_id":"2503.23832","repositories_listed":1,"syntology":null},{"url":"/paper/remote-inference-over-dynamic-links-via","slug":"remote-inference-over-dynamic-links-via","title":"Remote Inference over Dynamic Links via Adaptive Rate Deep Task-Oriented Vector Quantization","date":"2025-01-05","arxiv_id":"2501.02521","repositories_listed":1,"syntology":null},{"url":"/paper/l3tc-leveraging-rwkv-for-learned-lossless-low","slug":"l3tc-leveraging-rwkv-for-learned-lossless-low","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","date":"2024-12-21","arxiv_id":"2412.16642","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-compression-of-sparse-accelerator","slug":"efficient-compression-of-sparse-accelerator","title":"Efficient Compression of Sparse Accelerator Data Using Implicit Neural Representations and Importance Sampling","date":"2024-12-02","arxiv_id":"2412.01754","repositories_listed":1,"syntology":null},{"url":"/paper/aidetx-a-compression-based-method-for","slug":"aidetx-a-compression-based-method-for","title":"AIDetx: a compression-based method for identification of machine-learning generated text","date":"2024-11-29","arxiv_id":"2411.19869","repositories_listed":1,"syntology":null},{"url":"/paper/variable-rate-neural-compression-for-sparse","slug":"variable-rate-neural-compression-for-sparse","title":"Variable Rate Neural Compression for Sparse Detector Data","date":"2024-11-18","arxiv_id":"2411.11942","repositories_listed":1,"syntology":null},{"url":"/paper/bvi-cr-a-multi-view-human-dataset-for","slug":"bvi-cr-a-multi-view-human-dataset-for","title":"BVI-CR: A Multi-View Human Dataset for Volumetric Video Compression","date":"2024-11-17","arxiv_id":"2411.11199","repositories_listed":1,"syntology":null},{"url":"/paper/multitok-variable-length-tokenization-for","slug":"multitok-variable-length-tokenization-for","title":"MultiTok: Variable-Length Tokenization for Efficient LLMs Adapted from LZW Compression","date":"2024-10-28","arxiv_id":"2410.21548","repositories_listed":1,"syntology":null},{"url":"/paper/in-context-learning-and-occam-s-razor","slug":"in-context-learning-and-occam-s-razor","title":"In-context learning and Occam's razor","date":"2024-10-17","arxiv_id":"2410.14086","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/in-context-learning-and-occam-s-razor#ran","syntology_url":"https://syntology.ai/paper/2410.14086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14086"}},"official":{"repos":["3rdcore/prequentialcode"],"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":["official"]}}},{"url":"/paper/large-language-model-evaluation-via-matrix-1","slug":"large-language-model-evaluation-via-matrix-1","title":"Large Language Model Evaluation via Matrix Nuclear-Norm","date":"2024-10-14","arxiv_id":"2410.10672","repositories_listed":1,"syntology":null},{"url":"/paper/all-in-one-image-coding-for-joint-human","slug":"all-in-one-image-coding-for-joint-human","title":"All-in-One Image Coding for Joint Human-Machine Vision with Multi-Path Aggregation","date":"2024-09-29","arxiv_id":"2409.19660","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":4,"n_instrument":8,"n_unverified":3,"n_honours":2,"n_violates":1,"n_no_contract":1,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 1 violated, 1 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/all-in-one-image-coding-for-joint-human#ran","syntology_url":"https://syntology.ai/paper/2409.19660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19660"}},"official":{"repos":["NJUVISION/MPA"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/alphazip-neural-network-enhanced-lossless","slug":"alphazip-neural-network-enhanced-lossless","title":"AlphaZip: Neural Network-Enhanced Lossless Text Compression","date":"2024-09-23","arxiv_id":"2409.15046","repositories_listed":1,"syntology":null},{"url":"/paper/learned-compression-for-images-and-point","slug":"learned-compression-for-images-and-point","title":"Learned Compression for Images and Point Clouds","date":"2024-09-12","arxiv_id":"2409.08376","repositories_listed":1,"syntology":null},{"url":"/paper/bwt-construction-and-search-at-the-terabase","slug":"bwt-construction-and-search-at-the-terabase","title":"BWT construction and search at the terabase scale","date":"2024-09-01","arxiv_id":"2409.00613","repositories_listed":1,"syntology":null},{"url":"/paper/edge-learning-based-collaborative-automatic","slug":"edge-learning-based-collaborative-automatic","title":"Edge Learning Based Collaborative Automatic Modulation Classification for Hierarchical Cognitive Radio Networks","date":"2024-07-30","arxiv_id":"2407.20772","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-training-data-with-lossy-image","slug":"scaling-training-data-with-lossy-image","title":"Scaling Training Data with Lossy Image Compression","date":"2024-07-25","arxiv_id":"2407.17954","repositories_listed":1,"syntology":null},{"url":"/paper/a-benchmark-for-gaussian-splatting","slug":"a-benchmark-for-gaussian-splatting","title":"A Benchmark for Gaussian Splatting Compression and Quality Assessment Study","date":"2024-07-19","arxiv_id":"2407.14197","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-is-compression","slug":"understanding-is-compression","title":"Lossless data compression by large models","date":"2024-06-24","arxiv_id":"2407.07723","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"6 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/understanding-is-compression#ran","syntology_url":"https://syntology.ai/paper/2407.07723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.07723"}},"official":{"repos":["mcGill-NLP/medal"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/language-models-resist-alignment","slug":"language-models-resist-alignment","title":"Language Models Resist Alignment: Evidence From Data Compression","date":"2024-06-10","arxiv_id":"2406.06144","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/language-models-resist-alignment#ran","syntology_url":"https://syntology.ai/paper/2406.06144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06144"}},"official":{"repos":["pku-alignment/llms-resist-alignment"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-7k-parameter-model-for-underwater-image","slug":"a-7k-parameter-model-for-underwater-image","title":"A 7K Parameter Model for Underwater Image Enhancement based on Transmission Map Prior","date":"2024-05-25","arxiv_id":"2405.16197","repositories_listed":1,"syntology":null},{"url":"/paper/raq-vae-rate-adaptive-vector-quantized","slug":"raq-vae-rate-adaptive-vector-quantized","title":"Rate-Adaptive Quantization: A Multi-Rate Codebook Adaptation for Vector Quantization-based Generative Models","date":"2024-05-23","arxiv_id":"2405.14222","repositories_listed":1,"syntology":null},{"url":"/paper/tripod-three-complementary-inductive-biases","slug":"tripod-three-complementary-inductive-biases","title":"Tripod: Three Complementary Inductive Biases for Disentangled Representation Learning","date":"2024-04-16","arxiv_id":"2404.10282","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tripod-three-complementary-inductive-biases#ran","syntology_url":"https://syntology.ai/paper/2404.10282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10282"}},"official":{"repos":["kylehkhsu/tripod"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/sketchinr-a-first-look-into-sketches-as","slug":"sketchinr-a-first-look-into-sketches-as","title":"SketchINR: A First Look into Sketches as Implicit Neural Representations","date":"2024-03-14","arxiv_id":"2403.09344","repositories_listed":1,"syntology":null},{"url":"/paper/blockchain-enabled-variational-information","slug":"blockchain-enabled-variational-information","title":"Blockchain-Enabled Variational Information Bottleneck for IoT Networks","date":"2024-03-10","arxiv_id":"2403.06129","repositories_listed":1,"syntology":null},{"url":"/paper/3d-point-cloud-compression-with-recurrent","slug":"3d-point-cloud-compression-with-recurrent","title":"3D Point Cloud Compression with Recurrent Neural Network and Image Compression Methods","date":"2024-02-18","arxiv_id":"2402.11680","repositories_listed":1,"syntology":null},{"url":"/paper/texshape-information-theoretic-sentence","slug":"texshape-information-theoretic-sentence","title":"TexShape: Information Theoretic Sentence Embedding for Language Models","date":"2024-02-05","arxiv_id":"2402.05132","repositories_listed":1,"syntology":null},{"url":"/paper/flexible-variational-information-bottleneck","slug":"flexible-variational-information-bottleneck","title":"Flexible Variational Information Bottleneck: Achieving Diverse Compression with a Single Training","date":"2024-02-02","arxiv_id":"2402.01238","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-large-language-models-for-1","slug":"evaluating-large-language-models-for-1","title":"Evaluating Large Language Models for Generalization and Robustness via Data Compression","date":"2024-02-01","arxiv_id":"2402.00861","repositories_listed":1,"syntology":null},{"url":"/paper/residual-quantization-with-implicit-neural","slug":"residual-quantization-with-implicit-neural","title":"Residual Quantization with Implicit Neural Codebooks","date":"2024-01-26","arxiv_id":"2401.14732","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":3,"n_instrument":7,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":13,"phrase":"10 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; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/residual-quantization-with-implicit-neural#ran","syntology_url":"https://syntology.ai/paper/2401.14732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14732"}},"official":{"repos":["facebookresearch/qinco"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/rscnet-dynamic-csi-compression-for-cloud","slug":"rscnet-dynamic-csi-compression-for-cloud","title":"RSCNet: Dynamic CSI Compression for Cloud-based WiFi Sensing","date":"2024-01-19","arxiv_id":"2402.04888","repositories_listed":1,"syntology":null},{"url":"/paper/machine-perceptual-quality-evaluating-the","slug":"machine-perceptual-quality-evaluating-the","title":"Machine Perceptual Quality: Evaluating the Impact of Severe Lossy Compression on Audio and Image Models","date":"2024-01-15","arxiv_id":"2401.07957","repositories_listed":1,"syntology":null},{"url":"/paper/communication-cost-reduction-for-subgraph","slug":"communication-cost-reduction-for-subgraph","title":"Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions","date":"2023-12-12","arxiv_id":"2312.07055","repositories_listed":1,"syntology":null},{"url":"/paper/white-box-transformers-via-sparse-rate-1","slug":"white-box-transformers-via-sparse-rate-1","title":"White-Box Transformers via Sparse Rate Reduction: Compression Is All There Is?","date":"2023-11-22","arxiv_id":"2311.13110","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/white-box-transformers-via-sparse-rate-1#ran","syntology_url":"https://syntology.ai/paper/2311.13110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.13110"}},"official":null}},{"url":"/paper/convolve-and-conquer-data-comparison-with","slug":"convolve-and-conquer-data-comparison-with","title":"Convolve and Conquer: Data Comparison with Wiener Filters","date":"2023-11-11","arxiv_id":"2311.06558","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/convolve-and-conquer-data-comparison-with#ran","syntology_url":"https://syntology.ai/paper/2311.06558","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.06558"}},"official":{"repos":["dpelacani/AWLoss"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hopfield-enhanced-deep-neural-networks-for","slug":"hopfield-enhanced-deep-neural-networks-for","title":"Hopfield-Enhanced Deep Neural Networks for Artifact-Resilient Brain State Decoding","date":"2023-11-06","arxiv_id":"2311.03421","repositories_listed":1,"syntology":null},{"url":"/paper/fast-machine-learning-method-with-vector","slug":"fast-machine-learning-method-with-vector","title":"Fast Machine Learning Method with Vector Embedding on Orthonormal Basis and Spectral Transform","date":"2023-10-27","arxiv_id":"2310.18424","repositories_listed":1,"syntology":null},{"url":"/paper/fast-2d-bicephalous-convolutional-autoencoder","slug":"fast-2d-bicephalous-convolutional-autoencoder","title":"Fast 2D Bicephalous Convolutional Autoencoder for Compressing 3D Time Projection Chamber Data","date":"2023-10-23","arxiv_id":"2310.15026","repositories_listed":1,"syntology":null},{"url":"/paper/mirage-model-agnostic-graph-distillation-for","slug":"mirage-model-agnostic-graph-distillation-for","title":"Mirage: Model-Agnostic Graph Distillation for Graph Classification","date":"2023-10-14","arxiv_id":"2310.09486","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/mirage-model-agnostic-graph-distillation-for#ran","syntology_url":"https://syntology.ai/paper/2310.09486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09486"}},"official":{"repos":["idea-iitd/mirage"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/recombiner-robust-and-enhanced-compression","slug":"recombiner-robust-and-enhanced-compression","title":"RECOMBINER: Robust and Enhanced Compression with Bayesian Implicit Neural Representations","date":"2023-09-29","arxiv_id":"2309.17182","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/recombiner-robust-and-enhanced-compression#ran","syntology_url":"https://syntology.ai/paper/2309.17182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.17182"}},"official":{"repos":["cambridge-mlg/recombiner"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/compact-fractal-based-heuristic-pixel","slug":"compact-fractal-based-heuristic-pixel","title":"CompaCT: Fractal-Based Heuristic Pixel Segmentation for Lossless Compression of High-Color DICOM Medical Images","date":"2023-08-24","arxiv_id":"2308.13097","repositories_listed":1,"syntology":null},{"url":"/paper/data-compression-and-inference-in-cosmology","slug":"data-compression-and-inference-in-cosmology","title":"Data Compression and Inference in Cosmology with Self-Supervised Machine Learning","date":"2023-08-18","arxiv_id":"2308.09751","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-flow-networks","slug":"bayesian-flow-networks","title":"Bayesian Flow Networks","date":"2023-08-14","arxiv_id":"2308.07037","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":5,"n_instrument":8,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"13 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; 8 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bayesian-flow-networks#ran","syntology_url":"https://syntology.ai/paper/2308.07037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.07037"}},"official":{"repos":["nnaisense/bayesian-flow-networks"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/event-based-vision-for-early-prediction-of","slug":"event-based-vision-for-early-prediction-of","title":"Event-based Vision for Early Prediction of Manipulation Actions","date":"2023-07-26","arxiv_id":"2307.14332","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-with-passive-optical-nonlinear","slug":"deep-learning-with-passive-optical-nonlinear","title":"Nonlinear optical encoding enabled by recurrent linear scattering","date":"2023-07-17","arxiv_id":"2307.08558","repositories_listed":1,"syntology":null},{"url":"/paper/compressed-sensing-a-discrete-optimization","slug":"compressed-sensing-a-discrete-optimization","title":"Compressed Sensing: A Discrete Optimization Approach","date":"2023-06-05","arxiv_id":"2306.04647","repositories_listed":1,"syntology":null},{"url":"/paper/repeated-random-sampling-for-minimizing-the","slug":"repeated-random-sampling-for-minimizing-the","title":"Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learning","date":"2023-05-28","arxiv_id":"2305.18424","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-renormalization","slug":"bayesian-renormalization","title":"Bayesian Renormalization","date":"2023-05-17","arxiv_id":"2305.10491","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-via-manifold","slug":"representation-learning-via-manifold","title":"Representation Learning via Manifold Flattening and Reconstruction","date":"2023-05-02","arxiv_id":"2305.01777","repositories_listed":1,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":13,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 1 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/representation-learning-via-manifold#ran","syntology_url":"https://syntology.ai/paper/2305.01777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.01777"}},"official":{"repos":["michael-psenka/manifold-linearization"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/frankensplit-saliency-guided-neural-feature","slug":"frankensplit-saliency-guided-neural-feature","title":"FrankenSplit: Efficient Neural Feature Compression with Shallow Variational Bottleneck Injection for Mobile Edge Computing","date":"2023-02-21","arxiv_id":"2302.10681","repositories_listed":1,"syntology":null},{"url":"/paper/trading-information-between-latents-in","slug":"trading-information-between-latents-in","title":"Trading Information between Latents in Hierarchical Variational Autoencoders","date":"2023-02-09","arxiv_id":"2302.04855","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/trading-information-between-latents-in#ran","syntology_url":"https://syntology.ai/paper/2302.04855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.04855"}},"official":{"repos":["timxzz/hit"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-hybrid-learning-techniques-for","slug":"scalable-hybrid-learning-techniques-for","title":"Scalable Hybrid Learning Techniques for Scientific Data Compression","date":"2022-12-21","arxiv_id":"2212.10733","repositories_listed":1,"syntology":null},{"url":"/paper/squeeze-flow-of-micro-droplets-convolutional","slug":"squeeze-flow-of-micro-droplets-convolutional","title":"Squeeze flow of micro-droplets: convolutional neural network with trainable and tunable refinement","date":"2022-11-16","arxiv_id":"2211.09061","repositories_listed":1,"syntology":null},{"url":"/paper/tinc-tree-structured-implicit-neural","slug":"tinc-tree-structured-implicit-neural","title":"TINC: Tree-structured Implicit Neural Compression","date":"2022-11-12","arxiv_id":"2211.06689","repositories_listed":1,"syntology":null},{"url":"/paper/heartspot-privatized-and-explainable-data","slug":"heartspot-privatized-and-explainable-data","title":"HeartSpot: Privatized and Explainable Data Compression for Cardiomegaly Detection","date":"2022-10-05","arxiv_id":"2210.02241","repositories_listed":1,"syntology":null},{"url":"/paper/sci-a-spectrum-concentrated-implicit-neural","slug":"sci-a-spectrum-concentrated-implicit-neural","title":"SCI: A Spectrum Concentrated Implicit Neural Compression for Biomedical Data","date":"2022-09-30","arxiv_id":"2209.15180","repositories_listed":1,"syntology":null},{"url":"/paper/lossless-simd-compression-of-lidar-range-and","slug":"lossless-simd-compression-of-lidar-range-and","title":"Lossless SIMD Compression of LiDAR Range and Attribute Scan Sequences","date":"2022-09-16","arxiv_id":"2209.08196","repositories_listed":1,"syntology":null},{"url":"/paper/to-compute-or-not-to-compute-adaptive-smart","slug":"to-compute-or-not-to-compute-adaptive-smart","title":"To Compute or not to Compute? Adaptive Smart Sensing in Resource-Constrained Edge Computing","date":"2022-09-05","arxiv_id":"2209.02166","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-neural-network-cnn-to-reduce","slug":"convolutional-neural-network-cnn-to-reduce","title":"Convolutional Neural Network (CNN) to reduce construction loss in JPEG compression caused by Discrete Fourier Transform (DFT)","date":"2022-08-26","arxiv_id":"2209.03475","repositories_listed":1,"syntology":null},{"url":"/paper/lossy-compression-of-multidimensional-medical","slug":"lossy-compression-of-multidimensional-medical","title":"Lossy compression of multidimensional medical images using sinusoidal activation networks: an evaluation study","date":"2022-08-02","arxiv_id":"2208.01602","repositories_listed":1,"syntology":null},{"url":"/paper/tackling-provably-hard-representative","slug":"tackling-provably-hard-representative","title":"Tackling Provably Hard Representative Selection via Graph Neural Networks","date":"2022-05-20","arxiv_id":"2205.10403","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-distribution-aware-testing-of","slug":"hierarchical-distribution-aware-testing-of","title":"Hierarchical Distribution-Aware Testing of Deep Learning","date":"2022-05-17","arxiv_id":"2205.08589","repositories_listed":1,"syntology":null},{"url":"/paper/neural-estimation-of-the-rate-distortion","slug":"neural-estimation-of-the-rate-distortion","title":"Neural Estimation of the Rate-Distortion Function With Applications to Operational Source Coding","date":"2022-04-04","arxiv_id":"2204.01612","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/neural-estimation-of-the-rate-distortion#ran","syntology_url":"https://syntology.ai/paper/2204.01612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.01612"}},"official":{"repos":["leieric/nerd-rcc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sc2-supervised-compression-for-split","slug":"sc2-supervised-compression-for-split","title":"SC2 Benchmark: Supervised Compression for Split Computing","date":"2022-03-16","arxiv_id":"2203.08875","repositories_listed":1,"syntology":null},{"url":"/paper/dct-former-efficient-self-attention","slug":"dct-former-efficient-self-attention","title":"DCT-Former: Efficient Self-Attention with Discrete Cosine Transform","date":"2022-03-02","arxiv_id":"2203.01178","repositories_listed":1,"syntology":null},{"url":"/paper/memory-replay-with-data-compression-for-1","slug":"memory-replay-with-data-compression-for-1","title":"Memory Replay with Data Compression for Continual Learning","date":"2022-02-14","arxiv_id":"2202.06592","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/memory-replay-with-data-compression-for-1#ran","syntology_url":"https://syntology.ai/paper/2202.06592","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06592"}},"official":{"repos":["lywang3081/MRDC"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-physics-informed-vector-quantized","slug":"a-physics-informed-vector-quantized","title":"A Physics-Informed Vector Quantized Autoencoder for Data Compression of Turbulent Flow","date":"2022-01-10","arxiv_id":"2201.03617","repositories_listed":1,"syntology":null},{"url":"/paper/uniform-in-phase-space-data-selection-with","slug":"uniform-in-phase-space-data-selection-with","title":"Uniform-in-Phase-Space Data Selection with Iterative Normalizing Flows","date":"2021-12-28","arxiv_id":"2112.15446","repositories_listed":1,"syntology":null},{"url":"/paper/lossless-compression-with-probabilistic-1","slug":"lossless-compression-with-probabilistic-1","title":"Lossless Compression with Probabilistic Circuits","date":"2021-11-23","arxiv_id":"2111.11632","repositories_listed":1,"syntology":null},{"url":"/paper/comet-a-novel-memory-efficient-deep-learning","slug":"comet-a-novel-memory-efficient-deep-learning","title":"COMET: A Novel Memory-Efficient Deep Learning Training Framework by Using Error-Bounded Lossy Compression","date":"2021-11-18","arxiv_id":"2111.09562","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-data-compression-for-3d-sparse-tpc","slug":"efficient-data-compression-for-3d-sparse-tpc","title":"Efficient Data Compression for 3D Sparse TPC via Bicephalous Convolutional Autoencoder","date":"2021-11-09","arxiv_id":"2111.05423","repositories_listed":1,"syntology":null},{"url":"/paper/compressing-sensor-data-for-remote-assistance","slug":"compressing-sensor-data-for-remote-assistance","title":"Compressing Sensor Data for Remote Assistance of Autonomous Vehicles using Deep Generative Models","date":"2021-11-05","arxiv_id":"2111.03201","repositories_listed":1,"syntology":null},{"url":"/paper/ssmf-shifting-seasonal-matrix-factorization","slug":"ssmf-shifting-seasonal-matrix-factorization","title":"SSMF: Shifting Seasonal Matrix Factorization","date":"2021-10-25","arxiv_id":"2110.12763","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/ssmf-shifting-seasonal-matrix-factorization#ran","syntology_url":"https://syntology.ai/paper/2110.12763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.12763"}},"official":{"repos":["kokikwbt/ssmf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}}],"syntology_records":31,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":33,"papers_where_code_ran_first_page":"/task/data-compression/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":5,"url":"/task/data-compression/papers/2","json":"/task/data-compression/papers/2.json","rows":100},{"order":"archive","page":3,"of":5,"url":"/task/data-compression/papers/3","json":"/task/data-compression/papers/3.json","rows":100},{"order":"archive","page":4,"of":5,"url":"/task/data-compression/papers/4","json":"/task/data-compression/papers/4.json","rows":100},{"order":"archive","page":5,"of":5,"url":"/task/data-compression/papers/5","json":"/task/data-compression/papers/5.json","rows":59},{"order":"ran","page":1,"of":1,"url":"/task/data-compression/papers/ran/1","json":"/task/data-compression/papers/ran/1.json","rows":33}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"3fc1aaf1ffdea60f6939edd210a5e49ae0d33f7ee9b403721b1326c34099f656","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}