Co-occurring keywords · papers mentioning both
Papers
AdaSVD: Singular Value Decomposition with Adaptive Mechanisms for Large Multimodal Models
CVPR 2026
BiMaCoSR: Binary One-Step Diffusion Model Leveraging Flexible Matrix Compression for Real Super-Resolution
ICML 2025
Cramming 1568 Tokens into a Single Vector and Back Again: Exploring the Limits of Embedding Space Capacity
ACL 2025
FreeMesh: Boosting Mesh Generation with Coordinates Merging
ICML 2025
Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries
ICML 2025
SpeCache: Speculative Key-Value Caching for Efficient Generation of LLMs
ICML 2025
Standardizing the Measurement of Text Diversity: A Tool and Comparative Analysis
IJCNLP 2025
Capturing the denoising effect of PCA via compression ratio
NeurIPS 2024
Dynamic Memory Compression: Retrofitting LLMs for Accelerated Inference
ICML 2024
Practical Hybrid Gradient Compression for Federated Learning Systems
IJCAI 2024
Retaining Key Information under High Compression Ratios: Query-Guided Compressor for LLMs
ACL 2024
Pruning vs Quantization: Which is Better?
NeurIPS 2023
An Information-Theoretic Justification for Model Pruning
AISTATS 2022
Reference-free Summarization Evaluation via Semantic Correlation and Compression Ratio
NAACL 2022
ROAD: Learning an Implicit Recursive Octree Auto-Decoder to Efficiently Encode 3D Shapes
CoRL 2022
A Probabilistic Approach to Neural Network Pruning
ICML 2021
Deep Reinforcement Learning for a Dictionary Based Compression Schema (Student Abstract)
AAAI 2021
With Measured Words: Simple Sentence Selection for Black-Box Optimization of Sentence Compression Algorithms
EACL 2021
Layerwise Sparse Coding for Pruned Deep Neural Networks with Extreme Compression Ratio
AAAI 2020
EASSE: Easier Automatic Sentence Simplification Evaluation
EMNLP 2019
Stochastic Neighbor Compression
ICML 2014