{"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/papers/5","list_of":"/task/data-compression","task":"Data Compression","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":5,"pages_in_order":5,"rows_per_page":100,"rows":[401,459],"of":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"},"first_page":"/task/data-compression","prev":"/task/data-compression/papers/4","next":null,"papers":[{"url":null,"slug":"lossless-data-compression-with-transformer","title":"Lossless Data Compression with Transformer","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"quick-means-acceleration-of-k-means-by","title":"QuicK-means: Acceleration of K-means by learning a fast transform","date":"2019-08-23","arxiv_id":"1908.08713","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-end-to-end-encrypted-neural-network-for","title":"An End-to-End Encrypted Neural Network for Gradient Updates Transmission in Federated Learning","date":"2019-08-22","arxiv_id":"1908.08340","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimum-description-length-revisited","title":"Minimum Description Length Revisited","date":"2019-08-21","arxiv_id":"1908.08484","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-interpretable-compression-and","title":"An Interpretable Compression and Classification System: Theory and Applications","date":"2019-07-21","arxiv_id":"1907.08952","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-primping-routine-tiling-through-proximal","title":"The PRIMPing Routine -- Tiling through Proximal Alternating Linearized Minimization","date":"2019-06-17","arxiv_id":"1906.09722","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-sample-space-adaptive-probability","title":"Adaptive Sample-space & Adaptive Probability coding: a neural-network based approach for compression","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"integer-networks-for-data-compression-with","title":"Integer Networks for Data Compression with Latent-Variable Models","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semisupervised-clustering-by-queries-and","title":"Semisupervised Clustering by Queries and Locally Encodable Source Coding","date":"2019-03-31","arxiv_id":"1904.00507","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-learning-enhanced-by-an-entangled","title":"Physical-Layer Supervised Learning Assisted by an Entangled Sensor Network","date":"2019-01-28","arxiv_id":"1901.09566","repositories_listed":0,"syntology":null},{"url":null,"slug":"gaussian-autoencoder","title":"Gaussian AutoEncoder","date":"2018-11-12","arxiv_id":"1811.04751","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-periodicity-based-parallel-time-series","title":"A Periodicity-based Parallel Time Series Prediction Algorithm in Cloud Computing Environments","date":"2018-10-17","arxiv_id":"1810.07776","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-surface-light-fields","title":"Deep Surface Light Fields","date":"2018-10-15","arxiv_id":"1810.06514","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-chaotic-uniform-quantizer-for-speech","title":"A Novel Chaotic Uniform Quantizer for Speech Coding","date":"2018-10-11","arxiv_id":"1810.05260","repositories_listed":0,"syntology":null},{"url":null,"slug":"rate-distortion-for-model-compression-from","title":"Rate Distortion For Model Compression: From Theory To Practice","date":"2018-10-09","arxiv_id":"1810.06401","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-topic-analysis-of-traffic-camera","title":"Semantic Topic Analysis of Traffic Camera Images","date":"2018-09-27","arxiv_id":"1809.10707","repositories_listed":0,"syntology":null},{"url":null,"slug":"person-identification-using-seismic-signals","title":"Person Identification using Seismic Signals generated from Footfalls","date":"2018-09-24","arxiv_id":"1809.08783","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-information-in-extreme-measurements","title":"On the Information in Extreme Measurements for Parameter Estimation","date":"2018-09-23","arxiv_id":"1809.08662","repositories_listed":0,"syntology":null},{"url":null,"slug":"intermediate-deep-feature-compression-the","title":"Intermediate Deep Feature Compression: the Next Battlefield of Intelligent Sensing","date":"2018-09-17","arxiv_id":"1809.06196","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-iterative-method-for-classification-of","title":"An iterative method for classification of binary data","date":"2018-09-09","arxiv_id":"1809.03041","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-fourier-based-generation-of-the","title":"Fast Fourier-Based Generation of the Compression Matrix for Deterministic Compressed Sensing","date":"2018-07-01","arxiv_id":"1807.01238","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-activity-prediction-in-smart-home","title":"Human Activity Prediction in Smart Home Environments with LSTM Neural Networks","date":"2018-06-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deepn-jpeg-a-deep-neural-network-favorable","title":"DeepN-JPEG: A Deep Neural Network Favorable JPEG-based Image Compression Framework","date":"2018-03-14","arxiv_id":"1803.05788","repositories_listed":0,"syntology":null},{"url":null,"slug":"3lc-lightweight-and-effective-traffic","title":"3LC: Lightweight and Effective Traffic Compression for Distributed Machine Learning","date":"2018-02-21","arxiv_id":"1802.07389","repositories_listed":0,"syntology":null},{"url":null,"slug":"semisupervised-clustering-and-queries-and","title":"Semisupervised Clustering, AND-Queries and Locally Encodable Source Coding","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-strategies-for-recovering-inner","title":"Simple strategies for recovering inner products from coarsely quantized random projections","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"camera-aware-multi-resolution-analysis-camra","title":"Camera-Aware Multi-Resolution Analysis (CAMRA) for Raw Sensor Data Compression","date":"2017-09-25","arxiv_id":"1709.08739","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-compression-for-sentiment-analysis-via","title":"Text Compression for Sentiment Analysis via Evolutionary Algorithms","date":"2017-09-20","arxiv_id":"1709.06990","repositories_listed":0,"syntology":null},{"url":null,"slug":"limiting-the-reconstruction-capability-of","title":"Limiting the Reconstruction Capability of Generative Neural Network using Negative Learning","date":"2017-08-16","arxiv_id":"1708.08985","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-efficient-and-accurate-covariance","title":"Toward Efficient and Accurate Covariance Matrix Estimation on Compressed Data","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-the-fundamental-limits-is-easier","title":"Estimating the Fundamental Limits is Easier than Achieving the Fundamental Limits","date":"2017-07-05","arxiv_id":"1707.01203","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-impact-of-typicality-for-informative","title":"The Impact of Typicality for Informative Representative Selection","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"from-imitation-to-prediction-data-compression","title":"From Imitation to Prediction, Data Compression vs Recurrent Neural Networks for Natural Language Processing","date":"2017-05-01","arxiv_id":"1705.00697","repositories_listed":0,"syntology":null},{"url":null,"slug":"multimodal-deep-learning-approach-for-joint","title":"Multimodal deep learning approach for joint EEG-EMG data compression and classification","date":"2017-03-27","arxiv_id":"1703.08970","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-description-length-approach-to-determining","title":"A description length approach to determining the number of k-means clusters","date":"2017-02-28","arxiv_id":"1703.00039","repositories_listed":0,"syntology":null},{"url":null,"slug":"tuple-oriented-compression-for-large-scale","title":"Tuple-oriented Compression for Large-scale Mini-batch Stochastic Gradient Descent","date":"2017-02-22","arxiv_id":"1702.06943","repositories_listed":0,"syntology":null},{"url":null,"slug":"maximum-entropy-models-capture-melodic-styles","title":"Maximum entropy models capture melodic styles","date":"2016-10-11","arxiv_id":"1610.03414","repositories_listed":0,"syntology":null},{"url":null,"slug":"globally-variance-constrained-sparse","title":"Globally Variance-Constrained Sparse Representation and Its Application in Image Set Coding","date":"2016-08-17","arxiv_id":"1608.04902","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-data-compression-and-mac-protocol","title":"Joint Data Compression and MAC Protocol Design for Smartgrids with Renewable Energy","date":"2016-06-15","arxiv_id":"1606.04995","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-projection-estimation-of-discrete","title":"Random Projection Estimation of Discrete-Choice Models with Large Choice Sets","date":"2016-04-20","arxiv_id":"1604.06036","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-pca-with-compressed-data","title":"Robust PCA with compressed data","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-utility-of-clustering-in-prediction-tasks","title":"The Utility of Clustering in Prediction Tasks","date":"2015-09-21","arxiv_id":"1509.06163","repositories_listed":0,"syntology":null},{"url":null,"slug":"artificial-general-intelligence-through","title":"Artificial general intelligence through recursive data compression and grounded reasoning: a position paper","date":"2015-06-14","arxiv_id":"1506.04366","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-multi-layer-image-approximation-facial","title":"Sparse Multi-layer Image Approximation: Facial Image Compression","date":"2015-06-12","arxiv_id":"1506.03998","repositories_listed":0,"syntology":null},{"url":null,"slug":"reduced-basis-decomposition-a-certified-and","title":"Reduced Basis Decomposition: a Certified and Fast Lossy Data Compression Algorithm","date":"2015-03-19","arxiv_id":"1503.05947","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-data-compression-for-covariance-and","title":"Image Data Compression for Covariance and Histogram Descriptors","date":"2014-12-04","arxiv_id":"1412.1740","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressive-mining-fast-and-optimal-data","title":"Compressive Mining: Fast and Optimal Data Mining in the Compressed Domain","date":"2014-05-22","arxiv_id":"1405.5873","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-memcomputing-machines","title":"Universal Memcomputing Machines","date":"2014-05-05","arxiv_id":"1405.0931","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatiotemporal-sparse-bayesian-learning-with","title":"Spatiotemporal Sparse Bayesian Learning with Applications to Compressed Sensing of Multichannel Physiological Signals","date":"2014-04-21","arxiv_id":"1404.5122","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-bilayer-product-quantization-for","title":"Improving Bilayer Product Quantization for Billion-Scale Approximate Nearest Neighbors in High Dimensions","date":"2014-04-07","arxiv_id":"1404.1831","repositories_listed":0,"syntology":null},{"url":null,"slug":"authorship-analysis-based-on-data-compression","title":"Authorship Analysis based on Data Compression","date":"2014-02-14","arxiv_id":"1402.3405","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-properties-of-normalized-maximum","title":"Bayesian Properties of Normalized Maximum Likelihood and its Fast Computation","date":"2014-01-28","arxiv_id":"1401.7116","repositories_listed":0,"syntology":null},{"url":null,"slug":"anamorphic-transformation-and-its-application","title":"Anamorphic transformation and its application to time-bandwidth compression","date":"2013-08-19","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-factorization-strategies-for-higher","title":"Novel Factorization Strategies for Higher Order Tensors: Implications for Compression and Recovery of Multi-linear Data","date":"2013-07-02","arxiv_id":"1307.0805","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressive-sensing-of-sparse-tensors","title":"Compressive Sensing of Sparse Tensors","date":"2013-05-24","arxiv_id":"1305.5777","repositories_listed":0,"syntology":null},{"url":null,"slug":"smml-estimators-for-exponential-families-with","title":"SMML estimators for exponential families with continuous sufficient statistics","date":"2013-02-04","arxiv_id":"1302.0581","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-of-eeg-for-wireless","title":"Compressed Sensing of EEG for Wireless Telemonitoring with Low Energy Consumption and Inexpensive Hardware","date":"2012-06-13","arxiv_id":"1206.3493","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-for-energy-efficient-1","title":"Compressed Sensing for Energy-Efficient Wireless Telemonitoring of Noninvasive Fetal ECG via Block Sparse Bayesian Learning","date":"2012-05-07","arxiv_id":"1205.1287","repositories_listed":0,"syntology":null},{"url":null,"slug":"deciphering-subsampled-data-adaptive","title":"Deciphering subsampled data: adaptive compressive sampling as a principle of brain communication","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"0cbcf480df41b7371473be1ccefb5f1d5b54a854136ec6ee6c042930a2de8599","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}