Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pranit Chawla

dblp:274/1279 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
0000-0001-8058-340XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Trustworthy machine learning · 30% Language models and text generation · 23% Efficient and distributed learning · 23%
Network and information security
1 paper
Security and privacy of machine learning · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › LLM agents
computer-use agent
1.012026
WebSTAR: Scalable Data Synthesis for Computer Use Agents with Step-Level Filtering · ACL (1) 2026
Machine learning › Reinforcement learning › reinforcement learning from human feedback
process reward model
1.012026
WebSTAR: Scalable Data Synthesis for Computer Use Agents with Step-Level Filtering · ACL (1) 2026
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training
0.712023
HateProof: Are Hateful Meme Detection Systems really Robust? · WWW 2023
Machine learning › Trustworthy machine learning
robustness
0.712023
HateProof: Are Hateful Meme Detection Systems really Robust? · WWW 2023
Security and privacy of machine learning
adversarial attack
0.712023
HateProof: Are Hateful Meme Detection Systems really Robust? · WWW 2023

Methods — techniques the papers use, named apart from their topics

ensemble · 2.0contrastive learning · 2.0adversarial training · 2.0supervised fine-tuning · 1.0step-level filtering · 1.0reasoning augmentation · 1.0
YearPublicationVenuePosition
2026 WebSTAR: Scalable Data Synthesis for Computer Use Agents with Step-Level Filtering
abstract
Computer use agents (CUAs) can operate realworld digital interfaces but remain difficult to train due to the high cost of graphical user interface (GUI) interaction and the scarcity of high-quality trajectory data.Existing datasets rely on human demonstrations, limiting scalability.A natural alternative is to synthesize data from strong CUAs, yet their rollouts are highly noisy, with incorrect or suboptimal actions consisting a large proportion of the steps, making naive imitation ineffective.To tackle this challenge, we introduce a scalable data synthesis pipeline that transforms noisy rollouts into reliable supervision without human annotation.The core idea is step-level filtering, which evaluates actions individually to retain only correct steps, complemented by reasoning augmentation for improved planning.Using this pipeline, we construct WebSTAR, a dataset of 13.3K trajectories and 267K graded, reasoning-rich steps synthesized from Ope-nAI's computer-use-preview model.We train Qwen-2.5-VL-Instructmodels (7B and 32B) on WebSTAR.On WebVoyager, our 7B model surpasses SoTA open-source CUA model UI-TARS-1.5-7Bby more than 15% with only supervised finetuning.Building on step-level grading, we further create WebSCORE, a dataset of graded step-level actions, and train StepRM, a 7B multimodal process reward model distilled from o4-mini, which matches its grading quality while being far more efficient to deploy at scale.Our results establish step-level filtering as a key principle for scalable CUA training, and we introduce two new datasets (WebSTAR, WebSCORE) along with a lightweight process reward model (StepRM) as practical tools to advance robust and efficient CUAs.
Pranit Chawla, Yaser Souri, Subhojit Som
ACL (1)2
2023 HateProof: Are Hateful Meme Detection Systems really Robust?
abstract
Exploiting social media to spread hate has tremendously increased over the years. Lately, multi-modal hateful content such as memes has drawn relatively more traction than uni-modal content. Moreover, the availability of implicit content payloads makes them fairly challenging to be detected by existing hateful meme detection systems. In this paper, we present a use case study to analyze such systems’ vulnerabilities against external adversarial attacks. We find that even very simple perturbations in uni-modal and multi-modal settings performed by humans with little knowledge about the model can make the existing detection models highly vulnerable. Empirically, we find a noticeable performance drop of as high as 10% in the macro-F1 score for certain attacks. As a remedy, we attempt to boost the model’s robustness using contrastive learning as well as an adversarial training-based method - VILLA. Using an ensemble of the above two approaches, in two of our high resolution datasets, we are able to (re)gain back the performance to a large extent for certain attacks. We believe that ours is a first step toward addressing this crucial problem in an adversarial setting and would inspire more such investigations in the future.
Piush Aggarwal, Pranit Chawla, Mithun Das, Punyajoy Saha, Binny Mathew, Torsten Zesch, Animesh Mukherjee 0001
WWW2
2022 SAC: Semantic Attention Composition for Text-Conditioned Image Retrieval
abstract
The ability to efficiently search for images is essential for improving the user experiences across various products. Incorporating user feedback, via multi-modal inputs, to navigate visual search can help tailor retrieved results to specific user queries. We focus on the task of text-conditioned image retrieval that utilizes support text feedback alongside a reference image to retrieve images that concurrently satisfy constraints imposed by both inputs. The task is challenging since it requires learning composite image-text features by incorporating multiple cross-granular semantic edits from text feedback and then applying the same to visual features. To address this, we propose a novel framework SAC which resolves the above in two major steps: "where to see" (Semantic Feature Attention) and "how to change" (Semantic Feature Modification). We systematically show how our architecture streamlines the generation of text-aware image features by removing the need for various modules required by other state-of-art techniques. We present extensive quantitative, qualitative analysis, and ablation studies, to show that our architecture SAC outperforms existing techniques by achieving state-of-the-art performance on 3 benchmark datasets: FashionIQ, Shoes, and Birds-to-Words, while supporting natural language feedback of varying lengths.
Surgan Jandial, Pinkesh Badjatiya, Pranit Chawla, Ayush Chopra, Mausoom Sarkar, Balaji Krishnamurthy
WACV3