Skip to content
NewA calmer, faster ZeroHour

Training-Adaptive Convolutional Sparse Coding via Information Bottleneck for Robust Visual Representation

Hugging Face daily papersby Meng'en Qin, Yinchen Liu, Mingxuan Cui ()1 min read1 · 1 read
AI summary · glm-5.3-flash-uncensoredSummaries by Vani AI

Paper proposes training-adaptive convolutional sparse coding with a learnable sparsity coefficient for robust visual representations.

The framework unrolls convolutional sparse coding optimization with FISTA and treats the sparsity coefficient as a differentiable variable learned jointly with network parameters, interpreted via the information bottleneck. A label-free post-training strategy adjusts compression strength for corrupted inputs with the main network frozen. Experiments on CIFAR and ImageNet show competitive clean accuracy and greatly improved robustness under input perturbations.

Key facts
  • Sparsity coefficient learned as differentiable variable via FISTA unrolling
  • Information bottleneck view balances compression and signal retention
  • Label-free post-training adapts compression for corrupted inputs
  • Validated on CIFAR and ImageNet with improved perturbation robustness
Explain this AI news with Vani AIWhat was announced, what is new and why it matters, in a new chat

From the original article

1 min read at huggingface.co

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.

Hugging Face daily papers

By Meng'en Qin, Yinchen Liu, Mingxuan Cui · huggingface.co

Read the full article at Hugging Face daily papers

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.