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

Urvashi Khandelwal

dblp:135/6699 · DBLP profile ↗
← Back
11ranked-venue papers
3as first author
4since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 10 · 3 first-author · 4 since 2021Databases, data management, data science and information retrieval · 3Graphics, computer vision, multimedia, augmented reality and games · 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
9 papers
Vision and language · 37% Language models and text generation · 22% Representation and self-supervised learning · 9%
Databases, data mining, and information retrieval
2 papers
Recommender systems · 54% Data mining · 23% Web and social media mining · 23%
Human-computer interaction and pervasive computing
1 paper
Human-AI interaction · 100%

Topics — the 19 heaviest of 24, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language
multimodal understanding
0.712023
Pix2Struct: Screenshot Parsing as Pretraining for Visual Language Understanding · ICML 2023
Machine learning › Representation and self-supervised learning
pre-training
0.712023
Pix2Struct: Screenshot Parsing as Pretraining for Visual Language Understanding · ICML 2023
Computer vision › Vision and language
vision-language pretraining
0.712023
Open-domain Visual Entity Recognition: Towards Recognizing Millions of Wikipedia Entities · ICCV 2023
Computer vision › Vision and language
visual entity recognition
0.712023
Open-domain Visual Entity Recognition: Towards Recognizing Millions of Wikipedia Entities · ICCV 2023
Natural language and speech › Machine translation › neural machine translation
nearest neighbor machine translation
0.512021
Nearest Neighbor Machine Translation · ICLR 2021
Machine learning › Learning theory › hypothesis testing
statistical power analysis
0.412020
With Little Power Comes Great Responsibility · EMNLP (1) 2020
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.412019
BAM! Born-Again Multi-Task Networks for Natural Language Understanding · ACL (1) 2019
Machine learning › Learning paradigms
multi-task learning
0.412019
BAM! Born-Again Multi-Task Networks for Natural Language Understanding · ACL (1) 2019
Natural language and speech › Language models and text generation › language modeling › long-context language modeling
context utilization
0.312018
Sharp Nearby, Fuzzy Far Away: How Neural Language Models Use Context · ACL (1) 2018
Natural language and speech › Language models and text generation
language model analysis
0.312018
Sharp Nearby, Fuzzy Far Away: How Neural Language Models Use Context · ACL (1) 2018
Natural language and speech › Language models and text generation
multimodal language model
0.212023
Pix2Struct: Screenshot Parsing as Pretraining for Visual Language Understanding · ICML 2023
Machine learning › Graph learning
heterogeneous graph
0.212014
Personalized entity recommendation: a heterogeneous information network approach · WSDM 2014
Web and social media mining
citation network analysis
0.212014
ClusCite: effective citation recommendation by information network-based clustering · KDD 2014
Recommender systems › content recommendation
citation recommendation
0.212014
ClusCite: effective citation recommendation by information network-based clustering · KDD 2014
Recommender systems › knowledge-aware recommendation
entity recommendation
0.212014
Personalized entity recommendation: a heterogeneous information network approach · WSDM 2014
Data mining › clustering
graph clustering
0.212014
ClusCite: effective citation recommendation by information network-based clustering · KDD 2014
Natural language and speech › Language models and text generation
retrieval-augmented generation
0.112021
Nearest Neighbor Machine Translation · ICLR 2021
Machine learning › Learning theory › neural network theory
memorization and generalization
0.112020
Generalization through Memorization: Nearest Neighbor Language Models · ICLR 2020
Recommender systems › collaborative filtering
implicit feedback
0.112014
Personalized entity recommendation: a heterogeneous information network approach · WSDM 2014

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

pixel-based pretraining · 1.3generic keyboard and mouse action space · 1.3nearest neighbor retrieval · 0.9k-NN · 0.9visual language model · 0.7variable-resolution input · 0.7multimodal pretraining · 0.7masked screenshot parsing · 0.7autoregressive recognition · 0.7meta-analysis · 0.4network embedding · 0.2joint optimization · 0.2heterogeneous network clustering · 0.2heterogeneous information network · 0.2
YearPublicationVenuePosition
2023 Open-domain Visual Entity Recognition: Towards Recognizing Millions of Wikipedia Entities
abstract
Large-scale multi-modal pre-training models such as CLIP [30] and PaLI [8] exhibit strong generalization on various visual domains and tasks. However, existing image classification benchmarks often evaluate recognition on a specific domain (e.g., outdoor images) or a specific task (e.g., classifying plant species), which falls short of evaluating whether pre-trained foundational models are universal visual recognizers. To address this, we formally present the task of Open-domain Visual Entity recognitioN (Oven), where a model need to link an image onto a Wikipedia entity with respect to a text query. We construct Oven-Wiki‡by repurposing 14 existing datasets with all labels grounded onto one single label space: Wikipedia entities. Oven-Wiki challenges models to select among six million possible Wikipedia entities, making it a general visual recognition benchmark with the largest number of labels. Our study on state-ofthe-art pre-trained models reveals large headroom in generalizing to the massive-scale label space. We show that a PaLI-based auto-regressive visual recognition model performs surprisingly well, even on Wikipedia entities that have never been seen during fine-tuning. We also find existing pretrained models yield different strengths: while PaLI-based models obtain higher overall performance, CLIP-based models are better at recognizing tail entities.
Hexiang Hu, Yi Luan, Yang Chen 0065, Urvashi Khandelwal, Mandar Joshi, Kenton Lee, Kristina Toutanova, Ming-Wei Chang
ICCV4
2023 Pix2Struct: Screenshot Parsing as Pretraining for Visual Language Understanding
abstract
Visually-situated language is ubiquitous---sources range from textbooks with diagrams to web pages with images and tables, to mobile apps with buttons and forms. Perhaps due to this diversity, previous work has typically relied on domain-specific recipes with limited sharing of the underlying data, model architectures, and objectives. We present Pix2Struct, a pretrained image-to-text model for purely visual language understanding, which can be finetuned on tasks containing visually-situated language. Pix2Struct is pretrained by learning to parse masked screenshots of web pages into simplified HTML. The web, with its richness of visual elements cleanly reflected in the HTML structure, provides a large source of pretraining data well suited to the diversity of downstream tasks. Intuitively, this objective subsumes common pretraining signals such as OCR, language modeling, and image captioning. In addition to the novel pretraining strategy, we introduce a variable-resolution input representation and a more flexible integration of language and vision inputs, where language prompts such as questions are rendered directly on top of the input image. For the first time, we show that a single pretrained model can achieve state-of-the-art results in six out of nine tasks across four domains: documents, illustrations, user interfaces, and natural images.
Kenton Lee, Mandar Joshi, Iulia Turc, Hexiang Hu, Fangyu Liu 0001, Julian Martin Eisenschlos, Urvashi Khandelwal, Peter Shaw 0004, Ming-Wei Chang, Kristina Toutanova
ICML7
2023 From Pixels to UI Actions: Learning to Follow Instructions via Graphical User Interfaces
abstract
Much of the previous work towards digital agents for graphical user interfaces (GUIs) has relied on text-based representations (derived from HTML or other structured data sources), which are not always readily available. These input representations have been often coupled with custom, task-specific action spaces. This paper focuses on creating agents that interact with the digital world using the same conceptual interface that humans commonly use — via pixel-based screenshots and a generic action space corresponding to keyboard and mouse actions. Building upon recent progress in pixel-based pretraining, we show, for the first time, that it is possible for such agents to outperform human crowdworkers on the MiniWob++ benchmark of GUI-based instruction following tasks.
Peter Shaw 0004, Mandar Joshi, James Cohan, Jonathan Berant, Panupong Pasupat, Hexiang Hu, Urvashi Khandelwal, Kenton Lee, Kristina Toutanova
NeurIPS7
2021 Nearest Neighbor Machine Translation
Urvashi Khandelwal, Angela Fan, Daniel Jurafsky, Luke Zettlemoyer, Mike Lewis
ICLR1
2020 With Little Power Comes Great Responsibility
abstract
Despite its importance to experimental design, statistical power (the probability that, given a real effect, an experiment will reject the null hypothesis) has largely been ignored by the NLP community.Underpowered experiments make it more difficult to discern the difference between statistical noise and meaningful model improvements, and increase the chances of exaggerated findings.By metaanalyzing a set of existing NLP papers and datasets, we characterize typical power for a variety of settings and conclude that underpowered experiments are common in the NLP literature.In particular, for several tasks in the popular GLUE benchmark, small test sets mean that most attempted comparisons to state of the art models will not be adequately powered.Similarly, based on reasonable assumptions, we find that the most typical experimental design for human rating studies will be underpowered to detect small model differences, of the sort that are frequently studied.For machine translation, we find that typical test sets of 2000 sentences have approximately 75% power to detect differences of 1 BLEU point.To improve the situation going forward, we give an overview of best practices for power analysis in NLP and release a series of notebooks to assist with future power analyses.1
Dallas Card, Peter Henderson 0002, Urvashi Khandelwal, Robin Jia, Kyle Mahowald, Daniel Jurafsky
EMNLP (1)3
2020 Generalization through Memorization: Nearest Neighbor Language Models
Urvashi Khandelwal, Omer Levy, Daniel Jurafsky, Luke Zettlemoyer, Mike Lewis
ICLR1
2019 BAM! Born-Again Multi-Task Networks for Natural Language Understanding
abstract
It can be challenging to train multi-task neural networks that outperform or even match their single-task counterparts.To help address this, we propose using knowledge distillation where single-task models teach a multi-task model.We enhance this training with teacher annealing, a novel method that gradually transitions the model from distillation to supervised learning, helping the multi-task model surpass its single-task teachers.We evaluate our approach by multi-task fine-tuning BERT on the GLUE benchmark.Our method consistently improves over standard single-task and multi-task training.
Kevin Clark, Minh-Thang Luong, Urvashi Khandelwal, Christopher D. Manning, Quoc V. Le
ACL (1)3
2018 Sharp Nearby, Fuzzy Far Away: How Neural Language Models Use Context
abstract
We know very little about how neural language models (LM) use prior linguistic context.In this paper, we investigate the role of context in an LSTM LM, through ablation studies.Specifically, we analyze the increase in perplexity when prior context words are shuffled, replaced, or dropped.On two standard datasets, Penn Treebank and WikiText-2, we find that the model is capable of using about 200 tokens of context on average, but sharply distinguishes nearby context (recent 50 tokens) from the distant history.The model is highly sensitive to the order of words within the most recent sentence, but ignores word order in the long-range context (beyond 50 tokens), suggesting the distant past is modeled only as a rough semantic field or topic.We further find that the neural caching model (Grave et al., 2017b) especially helps the LSTM to copy words from within this distant context.Overall, our analysis not only provides a better understanding of how neural LMs use their context, but also sheds light on recent success from cache-based models.
Urvashi Khandelwal, He He 0001, Peng Qi 0003, Daniel Jurafsky
ACL (1)1
2014 ClusCite: effective citation recommendation by information network-based clustering
abstract
Citation recommendation is an interesting but challenging research problem. Most existing studies assume that all papers adopt the same criterion and follow the same behavioral pattern in deciding relevance and authority of a paper. However, in reality, papers have distinct citation behavioral patterns when looking for different references, depending on paper content, authors and target venues. In this study, we investigate the problem in the context of heterogeneous bibliographic networks and propose a novel cluster-based citation recommendation framework, called ClusCite, which explores the principle that citations tend to be softly clustered into interest groups based on multiple types of relationships in the network. Therefore, we predict each query's citations based on related interest groups, each having its own model for paper authority and relevance. Specifically, we learn group memberships for objects and the significance of relevance features for each interest group, while also propagating relative authority between objects, by solving a joint optimization problem. Experiments on both DBLP and PubMed datasets demonstrate the power of the proposed approach, with 17.68% improvement in Recall@50 and 9.57% growth in MRR over the best performing baseline.
Xiang Ren 0001, Xiao Yu 0007, Urvashi Khandelwal, Quanquan Gu, Jiawei Han 0001
KDD4
2014 Personalized entity recommendation: a heterogeneous information network approach
abstract
Among different hybrid recommendation techniques, network-based entity recommendation methods, which utilize user or item relationship information, are beginning to attract increasing attention recently. Most of the previous studies in this category only consider a single relationship type, such as friendships in a social network. In many scenarios, the entity recommendation problem exists in a heterogeneous information network environment. Different types of relationships can be potentially used to improve the recommendation quality. In this paper, we study the entity recommendation problem in heterogeneous information networks. Specifically, we propose to combine heterogeneous relationship information for each user differently and aim to provide high-quality personalized recommendation results using user implicit feedback data and personalized recommendation models.
Xiao Yu 0007, Xiang Ren 0001, Yizhou Sun, Quanquan Gu, Bradley Sturt, Urvashi Khandelwal, Brandon Norick, Jiawei Han 0001
WSDM6
2013 Recommendation in heterogeneous information networks with implicit user feedback
abstract
Recent studies suggest that by using additional user or item relationship information when building hybrid recommender systems, the recommendation quality can be largely improved. However, most such studies only consider a single type of relationship, e.g., social network. Notice that in many applications, the recommendation problem exists in an attribute-rich heterogeneous information network environment. In this paper, we study the entity recommendation problem in heterogeneous information networks. We propose to combine various relationship information from the network with user feedback to provide high quality recommendation results.
Xiao Yu 0007, Xiang Ren 0001, Yizhou Sun, Bradley Sturt, Urvashi Khandelwal, Quanquan Gu, Brandon Norick, Jiawei Han 0001
RecSys5