REVIEW 9 cited by
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
WebVision Database: Visual Learning and Understanding from Web Data
read the original abstract
In this paper, we present a study on learning visual recognition models from large scale noisy web data. We build a new database called WebVision, which contains more than $2.4$ million web images crawled from the Internet by using queries generated from the 1,000 semantic concepts of the benchmark ILSVRC 2012 dataset. Meta information along with those web images (e.g., title, description, tags, etc.) are also crawled. A validation set and test set containing human annotated images are also provided to facilitate algorithmic development. Based on our new database, we obtain a few interesting observations: 1) the noisy web images are sufficient for training a good deep CNN model for visual recognition; 2) the model learnt from our WebVision database exhibits comparable or even better generalization ability than the one trained from the ILSVRC 2012 dataset when being transferred to new datasets and tasks; 3) a domain adaptation issue (a.k.a., dataset bias) is observed, which means the dataset can be used as the largest benchmark dataset for visual domain adaptation. Our new WebVision database and relevant studies in this work would benefit the advance of learning state-of-the-art visual models with minimum supervision based on web data.
Forward citations
Cited by 9 Pith papers
-
Robust Trajectory Distillation: Hybrid Reweighting Meets Teacher-Inspired Targets
Introduces SGR and TIAT for robust dataset distillation that suppresses noise while preserving knowledge under noisy supervision.
-
Beyond Loss Values: Robust Dynamic Pruning via Loss Trajectory Alignment
AlignPrune uses a Dynamic Alignment Score from loss trajectories to identify noisy samples more accurately than per-sample loss, improving pruning accuracy by up to 6.3% on noisy benchmarks.
-
Dual Feature Decoupling for Fine-Grained OOD Detection
DFDNet disentangles content from style via dual modules to boost fine-grained OOD detection performance on multiple datasets.
-
CARE: Class-Adaptive Expert Consensus for Reliable Learning with Long-Tailed Noisy Labels
CARE is a parameter-efficient framework that aggregates predictions from noisy labels, VLM text embeddings, and visual features with class-frequency-based agreement thresholds to rectify labels in long-tailed noisy datasets.
-
Learning from Imperfect Text Guidance: Robust Long-Tail Visual Recognition with High-Noise Label
Weak Teacher Supervision uses vision-language model text predictions and label discrepancy checks to mitigate high-noise label-image mismatches in long-tailed visual recognition.
-
See Through the Noise: Improving Domain Generalization in Gaze Estimation
SeeTN builds a semantic embedding space with prototype transformation and affinity regularization to identify and correct noisy labels, yielding better cross-domain gaze estimation without hurting source accuracy.
-
Automatic Dataset Construction (ADC): Sample Collection, Data Curation, and Beyond
The ADC method automates the creation of large image classification datasets using LLMs and search engines, achieving 79% human agreement and reducing label noise on a 1 million image clothing dataset, while also rele...
-
Product Image Recognition with Guidance Learning and Noisy Supervision
Presents the Product-90 noisy product image dataset and a guidance learning method that combines noisy labels with teacher soft labels to train CNNs, reporting gains over prior methods on Product-90 and three public n...
-
EchoAlign: Bridging Generative and Discriminative Learning under Noisy Labels
EchoAlign adjusts instances with controllable generative models to match noisy labels and selects reliable subsets, outperforming prior methods on benchmarks especially under 30% instance-dependent noise.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.