Policy-Mask: Budget-Aware Adaptation of Diffusion Features to Discriminative Tasks
Abstract
Policy-Mask learns a budget-conditioned selection policy over diffusion timesteps, network blocks, and channels to extract compact, task-optimal features for discriminative vision tasks.
Selecting intermediate features from a frozen diffusion model for discriminative tasks is non-trivial because the useful signal is distributed across the denoising trajectory, network depth, and channels. In practice, this requires choosing a timestep, a block, and a channel subset. Existing methods either fix these choices by hand or optimize only a few extraction hyperparameters, most often the timestep, then reuse the same rule across inputs and budgets. We introduce Policy-Mask, a budget-conditioned policy trained on the downstream objective that jointly selects all three under a prescribed channel budget. Without normalization, the channel-score contribution grows with the number of selected channels and dominates the timestep and block updates. We normalize it by subset cardinality, keeping the three policy heads on comparable scales and stabilizing joint training. At matched budgets, Policy-Mask improves over fixed extraction and feature-filter baselines across segmentation, classification, and semantic correspondence, reaching 38.9 mIoU on ADE20K, 75.4% top-1 on CIFAR-100 at 128 dimensions, and 76.3 PCK@0.1 on SPair-71k. Component-wise ablations show that block selection materially affects downstream accuracy, and the highest recorded channel-budget score occurs at 256 retained channels, identifying a practical operating point for compact diffusion representations. We further adapt Policy-Mask to diffusion transformers, including PixArt-Σ and SD3.5 MMDiT, by replacing U-Net channels with image-token hidden dimensions.
Community
TLDR: Policy-Mask trains a REINFORCE policy that jointly picks the timestep, layer, and exactly b channels of a frozen diffusion model, then distills the selected features into a student that runs without the teacher. At 128 of 1280 channels, it beats full-width features from a fixed (t, l) by 1.2–1.6 mIoU on four segmentation benchmarks and outperforms RepFusion.
This is an automated message from the Librarian Bot. I found the following papers similar to this paper.
The following papers were recommended by the Semantic Scholar API
- ToPO: Token-Conditioned Preference Routing for Attention-Based Latent Diffusion Models (2026)
- Routing Policy Optimization for Online Diffusion Reinforcement Learning (2026)
- ExploreNet: Learning Where to Explore in Diffusion GRPO (2026)
- FocusOPD: Structure-Guided On-Policy Distillation for Diffusion Models (2026)
- One Block, Multiple Depths: Recurrent Vision Transformers with Depth-Programmed Experts (2026)
- IDRF: Inverse-Distilled Reward Fine-tuning of Masked Discrete Diffusion Models (2026)
- Pooling Representation Autoencoders for Efficient Diffusion (2026)
Please give a thumbs up to this comment if you found it helpful!
If you want recommendations for any Paper on Hugging Face checkout this Space
You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: @librarian-bot recommend
Get this paper in your agent:
hf papers read 2610.28889 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Datasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper