Search Results for author:
Found 8 papers, 0 papers with code
Modeling Collaborator: Enabling Subjective Vision Classification With Minimal Human Effort via LLM Tool-Use
Our framework leverages recent advances in foundation models, both large language models and vision-language models, to carve out the concept space through conversation and by automatically labeling training data points.
Scaling Up LLM Reviews for Google Ads Content Moderation
This study proposes a method for scaling up LLM reviews for content moderation in Google Ads.
Visual Program Distillation: Distilling Tools and Programmatic Reasoning into Vision-Language Models
We propose Visual Program Distillation (VPD), an instruction tuning framework that produces a vision-language model (VLM) capable of solving complex visual tasks with a single forward pass.
Ranked #1 on
Meme Classification
on Hateful Memes
Towards Understanding the Effect of Pretraining Label Granularity
Furthermore, we perform comprehensive experiments using the label hierarchies of iNaturalist 2021 and observe that the following conditions, in addition to proper choice of label granularity, enable the transfer to work well in practice: 1) the pretraining dataset needs to have a meaningful label hierarchy, and 2) the pretraining and target label functions need to align well.
Agile Modeling: From Concept to Classifier in Minutes
In reaction, we introduce the problem of Agile Modeling: the process of turning any subjective visual concept into a computer vision model through a real-time user-in-the-loop interactions.
NoiseRank: Unsupervised Label Noise Reduction with Dependence Models
Label noise is increasingly prevalent in datasets acquired from noisy channels.
Ranked #22 on
Image Classification
on Clothing1M
(using extra training data)
Adaptive Image Denoising by Mixture Adaptation
We propose an adaptive learning procedure to learn patch-based image priors for image denoising.
Adaptive Image Denoising by Targeted Databases
First, we determine the basis function of the denoising filter by solving a group sparsity minimization problem.
