{"total":51,"rows":[{"id":"2103.03123","title":"COIN: COmpression with Implicit Neural representations","created":"2021-03-03","cited_by_count":233,"area":null},{"id":"2202.06533","title":"An Introduction to Neural Data Compression","created":"2022-02-14","cited_by_count":79,"area":null},{"id":"2402.00809","title":"Position: Bayesian Deep Learning is Needed in the Age of Large-Scale AI","created":"2024-02-01","cited_by_count":62,"area":null},{"id":"2104.05168","title":"Soft then Hard: Rethinking the Quantization in Neural Image Compression","created":"2021-04-12","cited_by_count":51,"area":null},{"id":"2203.03761","title":"The Fundamental Price of Secure Aggregation in Differentially Private Federated Learning","created":"2022-03-07","cited_by_count":39,"area":null},{"id":"2101.08687","title":"Overfitting for Fun and Profit: Instance-Adaptive Data Compression","created":"2021-01-21","cited_by_count":38,"area":null},{"id":"2110.12805","title":"Algorithms for the Communication of Samples","created":"2021-10-25","cited_by_count":34,"area":null},{"id":"2403.00025","title":"On the Challenges and Opportunities in Generative AI","created":"2024-02-28","cited_by_count":31,"area":null},{"id":"2102.09270","title":"On the advantages of stochastic encoders","created":"2021-02-18","cited_by_count":28,"area":null},{"id":"2102.08329","title":"An Information-Theoretic Justification for Model Pruning","created":"2021-02-16","cited_by_count":25,"area":null},{"id":"2305.19185","title":"Compression with Bayesian Implicit Neural Representations","created":"2023-05-30","cited_by_count":25,"area":null},{"id":"2104.12456","title":"3D Scene Compression through Entropy Penalized Neural Representation Functions","created":"2021-04-26","cited_by_count":23,"area":null},{"id":"2111.00092","title":"Optimal Compression of Locally Differentially Private Mechanisms","created":"2021-10-29","cited_by_count":22,"area":null},{"id":"2102.11086","title":"Improving Lossless Compression Rates via Monte Carlo Bits-Back Coding","created":"2021-02-22","cited_by_count":19,"area":null},{"id":"2105.14594","title":"Sparse Uncertainty Representation in Deep Learning with Inducing Weights","created":"2021-05-30","cited_by_count":16,"area":null},{"id":"2105.01747","title":"Information Complexity and Generalization Bounds","created":"2021-05-04","cited_by_count":14,"area":null},{"id":"2106.02797","title":"Neural Distributed Source Coding","created":"2021-06-05","cited_by_count":13,"area":null},{"id":"2201.11817","title":"Modeling Human Exploration Through Resource-Rational Reinforcement Learning","created":"2022-01-27","cited_by_count":13,"area":null},{"id":"2310.20682","title":"Compression with Exact Error Distribution for Federated Learning","created":"2023-10-31","cited_by_count":11,"area":null},{"id":"2107.01952","title":"Partition and Code: learning how to compress graphs","created":"2021-07-05","cited_by_count":10,"area":null},{"id":"2111.05454","title":"DP-REC: Private & Communication-Efficient Federated Learning","created":"2021-11-09","cited_by_count":10,"area":null},{"id":"2306.04924","title":"Exact Optimality of Communication-Privacy-Utility Tradeoffs in Distributed Mean Estimation","created":"2023-06-08","cited_by_count":9,"area":null},{"id":"2309.17182","title":"RECOMBINER: Robust and Enhanced Compression with Bayesian Implicit Neural Representations","created":"2023-09-29","cited_by_count":9,"area":null},{"id":"2102.07725","title":"Neural Network Compression for Noisy Storage Devices","created":"2021-02-15","cited_by_count":8,"area":null},{"id":"2210.10452","title":"Rethinking Sharpness-Aware Minimization as Variational Inference","created":"2022-10-19","cited_by_count":8,"area":null},{"id":"2405.20782","title":"Universal Exact Compression of Differentially Private Mechanisms","created":"2024-05-28","cited_by_count":8,"area":null},{"id":"2204.02965","title":"LilNetX: Lightweight Networks with EXtreme Model Compression and Structured Sparsification","created":"2022-04-06","cited_by_count":7,"area":null},{"id":"2306.12625","title":"Adaptive Compression in Federated Learning via Side Information","created":"2023-06-22","cited_by_count":6,"area":null},{"id":"2402.03030","title":"Rejection-Sampled Universal Quantization for Smaller Quantization Errors","created":"2024-02-05","cited_by_count":4,"area":null},{"id":"2405.04363","title":"Some Notes on the Sample Complexity of Approximate Channel Simulation","created":"2024-05-07","cited_by_count":4,"area":null},{"id":"2405.12203","title":"Accelerating Relative Entropy Coding with Space Partitioning","created":"2024-05-20","cited_by_count":4,"area":null},{"id":"2512.06104","title":"ARC-AGI Without Pretraining","created":"2025-12-05","cited_by_count":3,"area":null},{"id":"2305.08126","title":"Semantic Communication of Learnable Concepts","created":"2023-05-14","cited_by_count":2,"area":null},{"id":"2311.17299","title":"Federated Fine-Tuning of Foundation Models via Probabilistic Masking","created":"2023-11-29","cited_by_count":2,"area":null},{"id":"2401.12587","title":"An Efficient Implicit Neural Representation Image Codec Based on Mixed Autoregressive Model for Low-Complexity Decoding","created":"2024-01-23","cited_by_count":2,"area":null},{"id":"2501.12046","title":"Communication-Efficient and Privacy-Adaptable Mechanism for Federated Learning","created":"2025-01-21","cited_by_count":2,"area":null},{"id":"2603.07615","title":"Compression as Adaptation: Implicit Visual Representation with Diffusion Foundation Models","created":"2026-03-08","cited_by_count":2,"area":null},{"id":"2206.08464","title":"PRANC: Pseudo RAndom Networks for Compacting deep models","created":"2022-06-16","cited_by_count":1,"area":null},{"id":"2210.13554","title":"Weight Fixing Networks","created":"2022-10-24","cited_by_count":1,"area":null},{"id":"2307.07816","title":"Minimal Random Code Learning with Mean-KL Parameterization","created":"2023-07-15","cited_by_count":1,"area":null},{"id":"2410.01309","title":"Getting Free Bits Back from Rotational Symmetries in LLMs","created":"2024-10-02","cited_by_count":1,"area":null},{"id":"2512.06609","title":"Training-Free Vector Quantization via Gaussian VAEs","created":"2025-12-07","cited_by_count":1,"area":null},{"id":"2601.10701","title":"Communication-Efficient and Privacy-Adaptable Mechanism -- a Federated Learning Scheme with Convergence Analysis","created":"2026-01-15","cited_by_count":1,"area":null},{"id":"2603.10750","title":"Deep Randomized Distributed Function Computation (DeepRDFC): Neural Distributed Channel Simulation","created":"2026-03-11","cited_by_count":1,"area":null},{"id":"2111.01662","title":"OSOA: One-Shot Online Adaptation of Deep Generative Models for Lossless Compression","created":"2021-11-02","cited_by_count":0,"area":null},{"id":"2406.08193","title":"Minimal Communication-Cost Statistical Learning","created":"2024-06-12","cited_by_count":0,"area":null},{"id":"2509.15805","title":"Boosting Active Learning with Knowledge Transfer","created":"2025-09-19","cited_by_count":0,"area":null},{"id":"2604.20245","title":"Secure Rate-Distortion-Perception: A Randomized Distributed Function Computation Approach for Realism","created":"2026-04-22","cited_by_count":0,"area":null},{"id":"2605.01833","title":"Remote Action Generation: Remote Control with Minimal Communication","created":"2026-05-03","cited_by_count":0,"area":null},{"id":"2609.12067","title":"Scalable Discrete-to-Continuous Channel Simulation for Compression and Privacy","created":"2026-09-10","cited_by_count":0,"area":null},{"id":"2609.13235","title":"Learning Manipulation-Sufficient Representations via Outcome Bottlenecks","created":"2026-09-02","cited_by_count":0,"area":null}],"next_cursor":null}