← 返回时间线

paper

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

arXiv ↗
ID
2609.19122
分类
—
首次捕获
2026-09-21
状态
unread
作者
Meng'en Qin, Yinchen Liu, Mingxuan Cui, Youlu Xing
信号
🔥 3

信号历史

  • 2026-09-21HF Daily Papers · 🔥1
  • 2026-09-22HF Daily Papers · 🔥3
暂无信号数据

摘要

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.

我的笔记

还没有笔记。

在 GitHub 上写笔记 ↗(新建 content/notes/2609.19122.md,PR 合并后本页自动更新)