arxiv:2609.19122
Published on Sep 17
· Submitted by
Meng'en Qin on Sep 21
· Shenzhen University of Advanced Technology
Upvote
3
Authors:
,
,
Abstract
Visual signals require compact yet sufficient representations for robust downstream prediction. Convolutional sparse coding (CSC) provides an explicit mechanism for suppressing redundant components while preserving signal content, but its sparsity coefficient is typically fixed and manually selected. We propose a training-adaptive convolutional sparse coding framework for robust visual signal representation. Specifically, we unfold the CSC optimization with the Fast Iterative Shrinkage-Thresholding Algorithm (FISTA) and treat the sparsity coefficient as a differentiable variable jointly learned with the network parameters. From the information bottleneck perspective, this coefficient controls the trade-off between information retention and compression: the sparsity term promotes compact representations, while the reconstruction term together with task loss preserves task-relevant signal content. We further introduce a label-free post-training strategy that adjusts the compression strength for corrupted inputs with the main network parameters fixed. Experiments on CIFAR and ImageNet demonstrate competitive clean-data recognition and greatly improved robustness under different input perturbations.
View arXiv page View PDF GitHub 0 Add to collection
Community
Paper author Paper submitter 2 days ago
Visual signals require compact yet sufficient representations for robust downstream prediction.
about 23 hours ago
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
-
A deep dictionary network-based foundation model for ultra-low-dose CT denoising (2026)
-
Keep-or-Drop? Adaptive Tokenizer for Compact Video Representation (2026)
-
Resource-efficient Semantic Coding Schemes with Manifold-constrained Hyper-connections (2026)
-
SPARK: Input-Conditioned Sparse Activation Modulation for Frozen DiT-based Super-Resolution (2026)
-
Domain-Aware Pruning: Sparsity and Domain Generalization via Regularized Probabilistic Masking (2026)
Please give a thumbs up to this comment if you found it helpful!
If you want recommendations for any Paper on HF Mirror checkout this Space
You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: @librarian-bot recommend
Upload images, audio, and videos by dragging in the text input, pasting, or clicking here.
Tap or paste here to upload images
· Sign up or log in to comment
Upvote
3
Get this paper in your agent:
hf papers read 2609.19122
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
Cite arxiv.org/abs/2609.19122 in a model README.md to link it from this page.
Datasets citing this paper 0
No dataset linking this paper
Cite arxiv.org/abs/2609.19122 in a dataset README.md to link it from this page.
Spaces citing this paper 0
No Space linking this paper
Cite arxiv.org/abs/2609.19122 in a Space README.md to link it from this page.
Collections including this paper 0
No Collection including this paper
Add this paper to a collection to link it from this page.