Pith. sign in

REVIEW 3 cited by

Robust and Generalizable Visual Representation Learning via Random Convolutions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.13003 v3 pith:HCVTMNFB submitted 2020-07-25 cs.CV cs.LG

classification cs.CVcs.LG
keywords convolutionsrandommethodrobustdomaindomainsimageslocal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

While successful for various computer vision tasks, deep neural networks have shown to be vulnerable to texture style shifts and small perturbations to which humans are robust. In this work, we show that the robustness of neural networks can be greatly improved through the use of random convolutions as data augmentation. Random convolutions are approximately shape-preserving and may distort local textures. Intuitively, randomized convolutions create an infinite number of new domains with similar global shapes but random local textures. Therefore, we explore using outputs of multi-scale random convolutions as new images or mixing them with the original images during training. When applying a network trained with our approach to unseen domains, our method consistently improves the performance on domain generalization benchmarks and is scalable to ImageNet. In particular, in the challenging scenario of generalizing to the sketch domain in PACS and to ImageNet-Sketch, our method outperforms state-of-art methods by a large margin. More interestingly, our method can benefit downstream tasks by providing a more robust pretrained visual representation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Adversarial Data Augmentation for Single Domain Generalization via Lyapunov Exponent-Guided Optimization

    cs.CV 2025-07 reject novelty 5.0 of 10

    LEAwareSGD modulates the learning rate with a Lyapunov exponent estimate and claims state-of-the-art accuracy on three single-domain generalization benchmarks, but the method is underspecified and its hyperparameters ...

  2. ConStyX: Content Style Augmentation for Generalizable Medical Image Segmentation

    eess.IV 2025-06 conditional novelty 5.0 of 10

    ConStyX augments deep features in both content and style and re-weights them by similarity and confidence, improving single-domain generalization for optic disc and cup segmentation.

  3. Fully Automated SAM for Single-source Domain Generalization in Medical Image Segmentation

    cs.CV 2025-07 conditional novelty 4.0 of 10

    FA-SAM automates SAM-based medical segmentation across domains by generating prompt boxes with an uncertainty-enhanced network and fusing image and prompt embeddings.

Pith tools