Task-Sufficient Contraction: Source Selection for Machine Information Interfaces
A theory paper shows when a task-fixed source reduction preserves the full downstream rate-regret problem.
2 stories, newest first · one card per story
A theory paper shows when a task-fixed source reduction preserves the full downstream rate-regret problem.
Paper proposes training-adaptive convolutional sparse coding with a learnable sparsity coefficient for robust visual representations.
Today 1.6K readers · 2.5K views · 778 reads · all time 189K views