{"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/2","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":2,"pages_in_order":5,"rows_per_page":100,"rows":[101,200],"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","next":"/task/data-compression/papers/3","papers":[{"url":"/paper/sparse-plus-low-rank-matrix-decomposition-a","slug":"sparse-plus-low-rank-matrix-decomposition-a","title":"Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach","date":"2021-09-26","arxiv_id":"2109.12701","repositories_listed":1,"syntology":null},{"url":"/paper/text-ranking-and-classification-using-data","slug":"text-ranking-and-classification-using-data","title":"Text Ranking and Classification using Data Compression","date":"2021-09-23","arxiv_id":"2109.11577","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-federated-learning-7","slug":"communication-efficient-federated-learning-7","title":"Communication-Efficient Federated Learning via Predictive Coding","date":"2021-08-02","arxiv_id":"2108.00918","repositories_listed":1,"syntology":null},{"url":"/paper/a-statistical-extension-of-byte-pair-encoding","slug":"a-statistical-extension-of-byte-pair-encoding","title":"A Statistical Extension of Byte-Pair Encoding","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/quantum-data-compression-and-quantum-cross","slug":"quantum-data-compression-and-quantum-cross","title":"Quantum Data Compression and Quantum Cross Entropy","date":"2021-06-25","arxiv_id":"2106.13823","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-co-teaching-with-compression","slug":"boosting-co-teaching-with-compression","title":"Boosting Co-teaching with Compression Regularization for Label Noise","date":"2021-04-28","arxiv_id":"2104.13766","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/boosting-co-teaching-with-compression#ran","syntology_url":"https://syntology.ai/paper/2104.13766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.13766"}},"official":null}},{"url":"/paper/efficient-sparse-coding-using-hierarchical","slug":"efficient-sparse-coding-using-hierarchical","title":"Efficient Sparse Coding using Hierarchical Riemannian Pursuit","date":"2021-04-21","arxiv_id":"2104.10314","repositories_listed":1,"syntology":null},{"url":"/paper/microshift-an-efficient-image-compression","slug":"microshift-an-efficient-image-compression","title":"Microshift: An Efficient Image Compression Algorithm for Hardware","date":"2021-04-20","arxiv_id":"2104.09820","repositories_listed":1,"syntology":null},{"url":"/paper/a-semi-agnostic-ansatz-with-variable","slug":"a-semi-agnostic-ansatz-with-variable","title":"A semi-agnostic ansatz with variable structure for quantum machine learning","date":"2021-03-11","arxiv_id":"2103.06712","repositories_listed":1,"syntology":null},{"url":"/paper/graph-autoencoder-for-graph-compression-and","slug":"graph-autoencoder-for-graph-compression-and","title":"Graph Autoencoder for Graph Compression and Representation Learning","date":"2021-03-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/coin-compression-with-implicit-neural","slug":"coin-compression-with-implicit-neural","title":"COIN: COmpression with Implicit Neural representations","date":"2021-03-03","arxiv_id":"2103.03123","repositories_listed":1,"syntology":null},{"url":"/paper/improving-lossless-compression-rates-via","slug":"improving-lossless-compression-rates-via","title":"Improving Lossless Compression Rates via Monte Carlo Bits-Back Coding","date":"2021-02-22","arxiv_id":"2102.11086","repositories_listed":1,"syntology":null},{"url":"/paper/you-only-compress-once-optimal-data","slug":"you-only-compress-once-optimal-data","title":"You Only Compress Once: Optimal Data Compression for Estimating Linear Models","date":"2021-02-22","arxiv_id":"2102.11297","repositories_listed":1,"syntology":null},{"url":"/paper/successive-pruning-for-model-compression-via","slug":"successive-pruning-for-model-compression-via","title":"An Information-Theoretic Justification for Model Pruning","date":"2021-02-16","arxiv_id":"2102.08329","repositories_listed":1,"syntology":null},{"url":"/paper/cqnet-complex-input-quantized-neural-network","slug":"cqnet-complex-input-quantized-neural-network","title":"CLNet: Complex Input Lightweight Neural Network designed for Massive MIMO CSI Feedback","date":"2021-02-15","arxiv_id":"2102.07507","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-image-reconstruction-over-t","slug":"generalized-image-reconstruction-over-t","title":"Generalized Image Reconstruction over T-Algebra","date":"2021-01-17","arxiv_id":"2101.06650","repositories_listed":1,"syntology":null},{"url":"/paper/neural-joint-entropy-estimation","slug":"neural-joint-entropy-estimation","title":"Neural Joint Entropy Estimation","date":"2020-12-21","arxiv_id":"2012.11197","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-federated-learning-3","slug":"communication-efficient-federated-learning-3","title":"Communication-Efficient Federated Learning with Compensated Overlap-FedAvg","date":"2020-12-12","arxiv_id":"2012.06706","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-variational-auto-encoders-1","slug":"self-supervised-variational-auto-encoders-1","title":"Self-Supervised Variational Auto-Encoders","date":"2020-10-05","arxiv_id":"2010.02014","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-supervised-variational-auto-encoders-1#ran","syntology_url":"https://syntology.ai/paper/2010.02014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02014"}},"official":{"repos":["ioangatop/srVAE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/betula-numerically-stable-cf-trees-for-birch","slug":"betula-numerically-stable-cf-trees-for-birch","title":"BETULA: Numerically Stable CF-Trees for BIRCH Clustering","date":"2020-06-23","arxiv_id":"2006.12881","repositories_listed":1,"syntology":null},{"url":"/paper/lite-audio-visual-speech-enhancement","slug":"lite-audio-visual-speech-enhancement","title":"Lite Audio-Visual Speech Enhancement","date":"2020-05-24","arxiv_id":"2005.11769","repositories_listed":1,"syntology":null},{"url":"/paper/towards-deep-neural-network-compression-via","slug":"towards-deep-neural-network-compression-via","title":"Neural network compression via learnable wavelet transforms","date":"2020-04-20","arxiv_id":"2004.09569","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-deepfakes-with-metric-learning","slug":"detecting-deepfakes-with-metric-learning","title":"Detecting Deepfakes with Metric Learning","date":"2020-03-19","arxiv_id":"2003.08645","repositories_listed":1,"syntology":null},{"url":"/paper/corad-correlation-aware-compression-of","slug":"corad-correlation-aware-compression-of","title":"CORAD: Correlation-Aware Compression of Massive Time Series using Sparse Dictionary Coding","date":"2019-12-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/lfzip-lossy-compression-of-multivariate","slug":"lfzip-lossy-compression-of-multivariate","title":"LFZip: Lossy compression of multivariate floating-point time series data via improved prediction","date":"2019-11-01","arxiv_id":"1911.00208","repositories_listed":1,"syntology":null},{"url":"/paper/pareto-optimal-data-compression-for-binary","slug":"pareto-optimal-data-compression-for-binary","title":"Pareto-optimal data compression for binary classification tasks","date":"2019-08-23","arxiv_id":"1908.08961","repositories_listed":1,"syntology":null},{"url":"/paper/deepzip-lossless-data-compression-using","slug":"deepzip-lossless-data-compression-using","title":"DeepZip: Lossless Data Compression using Recurrent Neural Networks","date":"2018-11-20","arxiv_id":"1811.08162","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/deepzip-lossless-data-compression-using#ran","syntology_url":"https://syntology.ai/paper/1811.08162","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.08162"}},"official":{"repos":["mohit1997/DeepZip"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/matrix-factorization-on-gpus-with-memory","slug":"matrix-factorization-on-gpus-with-memory","title":"Matrix Factorization on GPUs with Memory Optimization and Approximate Computing","date":"2018-08-11","arxiv_id":"1808.03843","repositories_listed":1,"syntology":null},{"url":"/paper/saife-unsupervised-wireless-spectrum-anomaly","slug":"saife-unsupervised-wireless-spectrum-anomaly","title":"SAIFE: Unsupervised Wireless Spectrum Anomaly Detection with Interpretable Features","date":"2018-07-22","arxiv_id":"1807.08316","repositories_listed":1,"syntology":null},{"url":"/paper/xgboost-scalable-gpu-accelerated-learning","slug":"xgboost-scalable-gpu-accelerated-learning","title":"XGBoost: Scalable GPU Accelerated Learning","date":"2018-06-29","arxiv_id":"1806.11248","repositories_listed":1,"syntology":null},{"url":"/paper/segmap-3d-segment-mapping-using-data-driven","slug":"segmap-3d-segment-mapping-using-data-driven","title":"SegMap: 3D Segment Mapping using Data-Driven Descriptors","date":"2018-04-25","arxiv_id":"1804.09557","repositories_listed":1,"syntology":null},{"url":null,"slug":"uncover-treasures-in-dct-advancing-jpeg","title":"Uncover Treasures in DCT: Advancing JPEG Quality Enhancement by Exploiting Latent Correlations","date":"2025-06-26","arxiv_id":"2506.21171","repositories_listed":0,"syntology":null},{"url":null,"slug":"gratnet-a-photorealistic-neural-shader-for","title":"GratNet: A Photorealistic Neural Shader for Diffractive Surfaces","date":"2025-06-18","arxiv_id":"2506.15815","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-k-medoids-as-general-vector","title":"Kernel $k$-Medoids as General Vector Quantization","date":"2025-06-05","arxiv_id":"2506.04786","repositories_listed":0,"syntology":null},{"url":null,"slug":"fourier-modulated-implicit-neural","title":"Fourier-Modulated Implicit Neural Representation for Multispectral Satellite Image Compression","date":"2025-06-02","arxiv_id":"2506.01234","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-analysis-2","title":"Information-theoretic Generalization Analysis for VQ-VAEs: A Role of Latent Variables","date":"2025-05-26","arxiv_id":"2505.19470","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-novel-representations-of-variable","title":"Learning novel representations of variable sources from multi-modal $\\textit{Gaia}$ data via autoencoders","date":"2025-05-22","arxiv_id":"2505.16320","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-progressive-image-compression-and","title":"Combining Progressive Image Compression and Random Access in DNA Data Storage","date":"2025-05-21","arxiv_id":"2505.15632","repositories_listed":0,"syntology":null},{"url":null,"slug":"2505-11441","title":"Is Compression Really Linear with Code Intelligence?","date":"2025-05-16","arxiv_id":"2505.11441","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-based-low-rank-matrix","title":"Clustering-based Low-Rank Matrix Approximation: An Adaptive Theoretical Analysis with Application to Data Compression","date":"2025-05-13","arxiv_id":"2505.08256","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-scalable-iot-deployment-for-visual","title":"Towards Scalable IoT Deployment for Visual Anomaly Detection via Efficient Compression","date":"2025-05-11","arxiv_id":"2505.07119","repositories_listed":0,"syntology":null},{"url":null,"slug":"event-based-neural-spike-detection-using","title":"Event-based Neural Spike Detection Using Spiking Neural Networks for Neuromorphic iBMI Systems","date":"2025-05-10","arxiv_id":"2505.06544","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-gaussian-splatting-data-compression-with","title":"3D Gaussian Splatting Data Compression with Mixture of Priors","date":"2025-05-06","arxiv_id":"2505.03310","repositories_listed":0,"syntology":null},{"url":null,"slug":"convolutional-autoencoders-for-data","title":"Convolutional Autoencoders for Data Compression and Anomaly Detection in Small Satellite Technologies","date":"2025-04-29","arxiv_id":"2505.00040","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-autoencoder-for-multivariate-time","title":"Quantum Autoencoder for Multivariate Time Series Anomaly Detection","date":"2025-04-24","arxiv_id":"2504.17548","repositories_listed":0,"syntology":null},{"url":null,"slug":"fpga-based-neural-network-accelerators-for","title":"FPGA-Based Neural Network Accelerators for Space Applications: A Survey","date":"2025-04-22","arxiv_id":"2504.16173","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepselective-feature-gating-and","title":"DeepSelective: Feature Gating and Representation Matching for Interpretable Clinical Prediction","date":"2025-04-15","arxiv_id":"2504.11264","repositories_listed":0,"syntology":null},{"url":null,"slug":"guided-wave-based-structural-awareness-under","title":"Guided Wave-Based Structural Awareness Under Varying Operating States via Manifold Representations","date":"2025-04-15","arxiv_id":"2504.11235","repositories_listed":0,"syntology":null},{"url":null,"slug":"vae-based-feature-disentanglement-for-data","title":"VAE-based Feature Disentanglement for Data Augmentation and Compression in Generalized GNSS Interference Classification","date":"2025-04-14","arxiv_id":"2504.10556","repositories_listed":0,"syntology":null},{"url":null,"slug":"representing-flow-fields-with-divergence-free","title":"Representing Flow Fields with Divergence-Free Kernels for Reconstruction","date":"2025-04-02","arxiv_id":"2504.01913","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-multiple-response-regression-and","title":"Nonlinear Multiple Response Regression and Learning of Latent Spaces","date":"2025-03-27","arxiv_id":"2503.21608","repositories_listed":0,"syntology":null},{"url":null,"slug":"highly-efficient-direct-analytics-on-semantic","title":"Highly Efficient Direct Analytics on Semantic-aware Time Series Data Compression","date":"2025-03-17","arxiv_id":"2503.13246","repositories_listed":0,"syntology":null},{"url":null,"slug":"seisrdt-latent-diffusion-model-based-on","title":"SeisRDT: Latent Diffusion Model Based On Representation Learning For Seismic Data Interpolation And Reconstruction","date":"2025-03-17","arxiv_id":"2503.21791","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-fog-computing-enabled-eeg-data","title":"Edge-Fog Computing-Enabled EEG Data Compression via Asymmetrical Variational Discrete Cosine Transform Network","date":"2025-03-13","arxiv_id":"2503.09961","repositories_listed":0,"syntology":null},{"url":null,"slug":"2503-01505","title":"Lossy Neural Compression for Geospatial Analytics: A Review","date":"2025-03-03","arxiv_id":"2503.01505","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-autoencoders-for-image-classification","title":"Quantum autoencoders for image classification","date":"2025-02-21","arxiv_id":"2502.15254","repositories_listed":0,"syntology":null},{"url":null,"slug":"guaranteed-conditional-diffusion-3d-block","title":"Guaranteed Conditional Diffusion: 3D Block-based Models for Scientific Data Compression","date":"2025-02-18","arxiv_id":"2502.12951","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-optimal-power-flow-on-a-data-budget","title":"Solving Optimal Power Flow on a Data-Budget: Feature Selection on Smart Meter Data","date":"2025-02-10","arxiv_id":"2502.06683","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-feature-division-multiple-access-for-1","title":"Semantic Feature Division Multiple Access for Digital Semantic Broadcast Channels","date":"2025-02-06","arxiv_id":"2502.03949","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-quantum-neural-networks-with-amplitude","title":"Hybrid Quantum Neural Networks with Amplitude Encoding: Advancing Recovery Rate Predictions","date":"2025-01-27","arxiv_id":"2501.15828","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-bearing-sensor-data-compression-via","title":"Efficient Bearing Sensor Data Compression via an Asymmetrical Autoencoder with a Lifting Wavelet Transform Layer","date":"2025-01-20","arxiv_id":"2501.11737","repositories_listed":0,"syntology":null},{"url":null,"slug":"mathematical-model-of-parameters-relevance-in","title":"Mathematical model of parameters relevance in adaptive level-crossing sampling for electrocardiogram signals","date":"2025-01-18","arxiv_id":"2501.10829","repositories_listed":0,"syntology":null},{"url":null,"slug":"artificial-intelligence-in-creative","title":"Artificial Intelligence in Creative Industries: Advances Prior to 2025","date":"2025-01-06","arxiv_id":"2501.02725","repositories_listed":0,"syntology":null},{"url":null,"slug":"foundation-model-for-lossy-compression-of","title":"Foundation Model for Lossy Compression of Spatiotemporal Scientific Data","date":"2024-12-22","arxiv_id":"2412.17184","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-implicit-neural-compression","title":"Quantum Implicit Neural Compression","date":"2024-12-19","arxiv_id":"2412.19828","repositories_listed":0,"syntology":null},{"url":null,"slug":"learned-data-compression-challenges-and","title":"Learned Data Compression: Challenges and Opportunities for the Future","date":"2024-12-14","arxiv_id":"2412.10770","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-scale-node-embeddings-for-graph","title":"Multi-Scale Node Embeddings for Graph Modeling and Generation","date":"2024-12-05","arxiv_id":"2412.04354","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-high-dimensional-inverse-problems-1","title":"Solving High-dimensional Inverse Problems Using Amortized Likelihood-free Inference with Noisy and Incomplete Data","date":"2024-12-05","arxiv_id":"2412.04565","repositories_listed":0,"syntology":null},{"url":null,"slug":"construction-of-generalized-samplets-in","title":"Construction of generalized samplets in Banach spaces","date":"2024-12-01","arxiv_id":"2412.00954","repositories_listed":0,"syntology":null},{"url":null,"slug":"hemgs-a-hybrid-entropy-model-for-3d-gaussian","title":"HEMGS: A Hybrid Entropy Model for 3D Gaussian Splatting Data Compression","date":"2024-11-27","arxiv_id":"2411.18473","repositories_listed":0,"syntology":null},{"url":null,"slug":"transcompressor-llm-powered-multimodal-data","title":"TransCompressor: LLM-Powered Multimodal Data Compression for Smart Transportation","date":"2024-11-25","arxiv_id":"2411.16020","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-fast-dbscan-via-spectrum-preserving","title":"Enabling DBSCAN for Very Large-Scale High-Dimensional Spaces","date":"2024-11-18","arxiv_id":"2411.11421","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-compression-and","title":"Towards efficient compression and communication for prototype-based decentralized learning","date":"2024-11-14","arxiv_id":"2411.09267","repositories_listed":0,"syntology":null},{"url":null,"slug":"rendering-oriented-3d-point-cloud-attribute","title":"Rendering-Oriented 3D Point Cloud Attribute Compression using Sparse Tensor-based Transformer","date":"2024-11-12","arxiv_id":"2411.07899","repositories_listed":0,"syntology":null},{"url":null,"slug":"hiha-introducing-hierarchical-harmonic","title":"HiHa: Introducing Hierarchical Harmonic Decomposition to Implicit Neural Compression for Atmospheric Data","date":"2024-11-09","arxiv_id":"2411.06155","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-method-based-on-generative-adversarial","title":"A method based on Generative Adversarial Networks for disentangling physical and chemical properties of stars in astronomical spectra","date":"2024-11-08","arxiv_id":"2411.05960","repositories_listed":0,"syntology":null},{"url":null,"slug":"don-t-look-twice-faster-video-transformers","title":"Don't Look Twice: Faster Video Transformers with Run-Length Tokenization","date":"2024-11-07","arxiv_id":"2411.05222","repositories_listed":0,"syntology":null},{"url":null,"slug":"sann-psz-spatially-adaptive-neural-network","title":"SANN-PSZ: Spatially Adaptive Neural Network for Head-Tracked Personal Sound Zones","date":"2024-11-01","arxiv_id":"2411.00772","repositories_listed":0,"syntology":null},{"url":null,"slug":"integration-of-communication-and","title":"Integration of Communication and Computational Imaging","date":"2024-10-25","arxiv_id":"2410.19415","repositories_listed":0,"syntology":null},{"url":null,"slug":"dmvc-multi-camera-video-compression-network","title":"DMVC: Multi-Camera Video Compression Network aimed at Improving Deep Learning Accuracy","date":"2024-10-24","arxiv_id":"2410.18400","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-information-g-theory-for-range","title":"Semantic Information G Theory for Range Control with Tradeoff between Purposiveness and Efficiency","date":"2024-10-19","arxiv_id":"2411.05789","repositories_listed":0,"syntology":null},{"url":null,"slug":"compression-using-discrete-multi-level","title":"Compression using Discrete Multi-Level Divisor Transform for Heterogeneous Sensor Data","date":"2024-10-18","arxiv_id":"2410.14287","repositories_listed":0,"syntology":null},{"url":null,"slug":"matryoshkakv-adaptive-kv-compression-via","title":"MatryoshkaKV: Adaptive KV Compression via Trainable Orthogonal Projection","date":"2024-10-16","arxiv_id":"2410.14731","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-scalable-image-feature-compression-a","title":"Toward Scalable Image Feature Compression: A Content-Adaptive and Diffusion-Based Approach","date":"2024-10-08","arxiv_id":"2410.06149","repositories_listed":0,"syntology":null},{"url":null,"slug":"transformers-learn-variable-order-markov","title":"Transformers learn variable-order Markov chains in-context","date":"2024-10-07","arxiv_id":"2410.05493","repositories_listed":0,"syntology":null},{"url":null,"slug":"channel-aware-throughput-maximization-for","title":"Channel-Aware Throughput Maximization for Cooperative Data Fusion in CAV","date":"2024-10-06","arxiv_id":"2410.04320","repositories_listed":0,"syntology":null},{"url":null,"slug":"anomaly-detection-from-a-tensor-train","title":"Anomaly Detection from a Tensor Train Perspective","date":"2024-09-23","arxiv_id":"2409.15030","repositories_listed":0,"syntology":null},{"url":null,"slug":"blockchain-enabled-variational-information-1","title":"Blockchain-Enabled Variational Information Bottleneck for Data Extraction Based on Mutual Information in Internet of Vehicles","date":"2024-09-20","arxiv_id":"2409.17287","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-compression-using-rank-1-lattices-for","title":"Data Compression using Rank-1 Lattices for Parameter Estimation in Machine Learning","date":"2024-09-20","arxiv_id":"2409.13453","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-mer-based-approaches-to-bridging","title":"k-mer-based approaches to bridging pangenomics and population genetics","date":"2024-09-18","arxiv_id":"2409.11683","repositories_listed":0,"syntology":null},{"url":null,"slug":"rate-constrained-quantization-for","title":"Rate-Constrained Quantization for Communication-Efficient Federated Learning","date":"2024-09-10","arxiv_id":"2409.06319","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-based-machine-learning-methods-for","title":"Attention Based Machine Learning Methods for Data Reduction with Guaranteed Error Bounds","date":"2024-09-09","arxiv_id":"2409.05357","repositories_listed":0,"syntology":null},{"url":null,"slug":"ndp-next-distribution-prediction-as-a-more","title":"NDP: Next Distribution Prediction as a More Broad Target","date":"2024-08-30","arxiv_id":"2408.17377","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-kernel-principal-components-analysis","title":"Self-Adaptive Quantum Kernel Principal Components Analysis for Compact Readout of Chemiresistive Sensor Arrays","date":"2024-08-28","arxiv_id":"2409.00115","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandwidth-aware-and-overlap-weighted","title":"Bandwidth-Aware and Overlap-Weighted Compression for Communication-Efficient Federated Learning","date":"2024-08-27","arxiv_id":"2408.14736","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-pcgc-large-language-model-based-point","title":"LLM-PCGC: Large Language Model-based Point Cloud Geometry Compression","date":"2024-08-16","arxiv_id":"2408.08682","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-variational-bayes-based-on-a","title":"Semantic Variational Bayes Based on a Semantic Information Theory for Solving Latent Variables","date":"2024-08-12","arxiv_id":"2408.13122","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-the-low-rank-decomposed-models","title":"Accelerating the Low-Rank Decomposed Models","date":"2024-07-24","arxiv_id":"2407.20266","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-foundation-models-as-data","title":"Training Foundation Models as Data Compression: On Information, Model Weights and Copyright Law","date":"2024-07-18","arxiv_id":"2407.13493","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-electrocardiogram-signal-analysis","title":"Enhancing Electrocardiogram Signal Analysis Using NLP-Inspired Techniques: A Novel Approach with Embedding and Self-Attention","date":"2024-07-15","arxiv_id":"2407.11102","repositories_listed":0,"syntology":null}],"record_sha256":"915c7aefcc5c540a26eb0e4902916e08fc273ca8241ba2b502d36bc790e97cb8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}