## What does this PR do? **Type of change:** new feature **Overview:** Training and inference code for Dynamic Memory Sparsification (DMS) - method from NeurIPS 2025 paper [Inference-Time Hyper-Scaling with KV Cache Compression](https://neurips.cc/virtual/2025/loc/san-diego/poster/119605) ## Usage Detailed in `experimental/dms/README.md` and `experimental/dms/ARCHITECTURE.md` ## Testing DMS tests in `experimental/dms/tests` covering: * prefill * generation * gradient propagation * chunked prefill ## Before your PR is "*Ready for review*" <!-- If you haven't finished some of the above items you can still open `Draft` PR. --> - **Make sure you read and follow [Contributor guidelines](https://github.com/NVIDIA/Model-Optimizer/blob/main/CONTRIBUTING.md)** and your commits are signed. - **Is this change backward compatible?**: Yes - **Did you write any new necessary tests?**: Yes - **Did you add or update any necessary documentation?**: Yes - **Did you update [Changelog](https://github.com/NVIDIA/Model-Optimizer/blob/main/CHANGELOG.rst)?**: No, DMS is currently experimental feature with description in `experimental/dms` ## Additional Information A minimal, optimized implementation of the DMS algorithm for KV-cache compression, as described in: > **Inference-Time Hyper-Scaling with KV Cache Compression** > Adrian Łańcucki, Konrad Staniszewski, Piotr Nawrot, Edoardo M. Ponti > Paper: [https://arxiv.org/abs/2506.05345](https://arxiv.org/abs/2506.05345) > NeurIPS: [https://neurips.cc/virtual/2025/loc/san-diego/poster/119605](https://neurips.cc/virtual/2025/loc/san-diego/poster/119605) Inference-time scaling trades efficiency for improved reasoning by generating longer sequences. In Transformer LLMs, generation cost is often bottlenecked by the size of the key-value (KV) cache. DMS addresses this by learning a KV cache eviction policy that compresses the cache while preserving accuracy. ## How it works DMS learns a per-head eviction policy that determines which KV cache entries to keep during generation. Rather than immediately discarding tokens, DMS delays eviction decisions, implicitly merging representations and preserving critical information. During training, the compression ratio is gradually increased from 1× to a target value (e.g., 8×), using knowledge distillation to match the outputs of an uncompressed teacher model. <!-- This is an auto-generated comment: release notes by coderabbit.ai --> ## Summary by CodeRabbit * **New Features** * Introduces Dynamic Memory Sparsification (DMS), an algorithm for efficient LLM inference and training with adaptive attention gating. * Adds DMS-enabled Qwen3 models with memory-efficient KV cache management and paged block-based storage. * Includes student-teacher distillation training infrastructure with noise scheduling and compression ratio control. * Provides configuration system and training/evaluation scripts for DMS adaptation. * **Documentation** * Added architecture guide, README, and example inference notebook. * **Tests** * Added comprehensive test suite for chunked prefill, cache management, and prefill/inference validation. <!-- end of auto-generated comment: release notes by coderabbit.ai --> --------- Signed-off-by: Konrad Staniszewski <kstaniszewsk@nvidia.com> Signed-off-by: kstaniszewsknv <kstaniszewsk@nvidia.com> Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>
Experimental Optimization Techniques
Experimental optimization algorithms and research prototypes under active development.
Purpose
For new optimization techniques (quantization, pruning, sparsity, etc.) that are:
- Novel or research-stage algorithms
- Not yet production-ready
- May have unstable APIs
⚠️ Warning: Experimental features are not guaranteed to work across releases. APIs may change or features may be removed without notice. Use at your own risk.
Requirements
Each experimental technique must include:
- README.md - Explains what the technique does, how to use it, current status, model support, and references
- Working code - Clear, readable implementation
- Comprehensive tests - Good test coverage demonstrating correctness
- Detailed documentation - Clear docs on usage, APIs, and behavior
- Example - Demonstrating usage
- Model support list - Which models/frameworks are supported
- Deployment info - Supported deployment frameworks (TensorRT-LLM, vLLM, SGLang, etc.) and whether custom kernels are required
- requirements.txt - Additional dependencies beyond base modelopt
- License headers - Apache 2.0 headers on all Python files
Example Structures
Organize your code however makes sense. Here are some examples:
Simple flat structure:
experimental/my_technique/
├── README.md
├── requirements.txt
├── my_technique.py
├── test_my_technique.py
└── example.py
Package structure:
experimental/my_technique/
├── README.md
├── requirements.txt
├── my_technique/
│ ├── __init__.py
│ ├── core.py
│ └── config.py
├── tests/
│ └── test_core.py
└── examples/
└── example_usage.py
Quality Standards
Experimental code must meet quality standards:
- Comprehensive test coverage required
- Clear documentation required
- Pass all pre-commit checks
PR Guidelines
Keep PRs focused and reviewable:
- Split large features: Break complex techniques into multiple PRs if needed
- Reasonable scope: PRs with tens of thousands of lines are difficult to review
- Incremental development: Consider submitting core functionality first, then enhancements
- If your technique is large, discuss the implementation plan in an issue first
Example Documentation Template
Your technique's README.md should include:
# Your Technique Name
Brief description of the optimization technique.
## Model Support
| Model/Framework | Supported | Notes |
|-----------------|-----------|-------|
| LLMs (Llama, GPT, etc.) | ✅ | Tested on Llama 3.1 |
| Diffusion Models | ❌ | Not yet supported |
| Vision Models | ✅ | Experimental |
## Deployment
| Framework | Supported | Notes |
|-----------|-----------|-------|
| TensorRT-LLM | ✅ | Requires custom kernel |
| vLLM | ❌ | Not yet supported |
| SGLang | ✅ | Uses standard ops |
## Usage
\`\`\`python
from experimental.my_technique import my_optimize
...
\`\`\`
## Status
Current state: Prototype
Known issues:
- Issue 1
- Issue 2
## References
- [Paper](link)
- [Code repository](link)
- [Project page](link)
- [Related work](link)
Path to Production
When a technique is ready for production (proven effective, stable API, full tests, comprehensive docs), it can be promoted to the main modelopt package.
Contributors: Open an issue proposing graduation with evidence of effectiveness and stability.
Users: If you find an experimental feature valuable, open a GitHub issue requesting promotion to production. User demand is a key signal for production readiness.
Questions?
Open a GitHub issue with [experimental] prefix.