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

Gaurav Srivastava 0001

dblp:49/5890-1 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0003-2237-3636ORCID · verified

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 93% Recommender systems · 7%
Artificial intelligence
1 paper
Efficient and distributed learning · 50% Representation and self-supervised learning · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › word representation › word embedding
meta-embedding
0.812024
LiMAML: Personalization of Deep Recommender Models via Meta Learning · KDD 2024
Machine learning › Efficient and distributed learning
model deployment
0.812024
LiMAML: Personalization of Deep Recommender Models via Meta Learning · KDD 2024
Information retrieval › text analysis
keyword extraction
0.512021
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search · KDD 2021
Information retrieval › query reformulation
query expansion
0.512021
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search · KDD 2021
Information retrieval
query understanding
0.512021
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search · KDD 2021
Information retrieval
retrieval models
0.512021
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search · KDD 2021
Recommender systems
content-based recommendation
0.112021
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search · KDD 2021

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

wide-and-deep · 1.5model-agnostic meta-learning · 1.5textrank · 0.5sentence-BERT embeddings · 0.5graph-based ranking · 0.5
YearPublicationVenuePosition
2024 LiMAML: Personalization of Deep Recommender Models via Meta Learning
abstract
In the realm of recommender systems, the ubiquitous adoption of deep neural networks has emerged as a dominant paradigm for modeling diverse business objectives. As user bases continue to expand, the necessity of personalization and frequent model updates have assumed paramount significance to ensure the delivery of relevant and refreshed experiences to a diverse array of members. In this work, we introduce an innovative meta-learning solution tailored to the personalization of models for individual members and other entities, coupled with the frequent updates based on the latest user interaction signals. Specifically, we leverage the Model-Agnostic Meta Learning (MAML) algorithm to adapt per-task sub-networks using recent user interaction data. Given the near infeasibility of productionizing original MAML-based models in online recommendation systems, we propose an efficient strategy to operationalize meta-learned sub-networks in production, which involves transforming them into fixed-sized vectors, termed meta embeddings, thereby enabling the seamless deployment of models with hundreds of billions of parameters for online serving. Through extensive experimentation on production data drawn from various applications at LinkedIn, we demonstrate that the proposed solution consistently outperforms the best performing baseline models of those applications, including strong baselines such as using wide-and-deep ID based personalization approach. Our approach has enabled the deployment of a range of highly personalized AI models across diverse LinkedIn applications, leading to substantial improvements in business metrics as well as refreshed experience for our members.
Prakruthi Prabhakar, Gaurav Srivastava 0001, Zeinab S. Jalali, Varun Bharill, Yunbo Ouyang, Aastha Nigam, Divya Venugopalan, Fedor Borisyuk, S. Sathiya Keerthi, Ajith Muralidharan
KDD3
2021 VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search
abstract
Numerous online stock image libraries offer high quality yet copyright free images for use in marketing campaigns. To assist advertisers in navigating such third party libraries, we study the problem of automatically fetching relevant ad images given the ad text (via a short textual query for images). Motivated by our observations in logged data on ad image search queries (given ad text), we formulate a keyword extraction problem, where a keyword extracted from the ad text (or its augmented version) serves as the ad image query. In this context, we propose VisualTextRank: an unsupervised method to (i) augment input ad text using semantically similar ads, and (ii) extract the image query from the augmented ad text. VisualTextRank builds on prior work on graph based context extraction (biased TextRank in particular) by leveraging both the text and image of similar ads for better keyword extraction, and using advertiser category specific biasing with sentence-BERT embeddings. Using data collected from the Verizon Media Native (Yahoo Gemini) ad platform's stock image search feature for onboarding advertisers, we demonstrate the superiority of VisualTextRank compared to competitive keyword extraction baselines (including an 11% accuracy lift over biased TextRank). For the case when the stock image library is restricted to English queries, we show the effectiveness of VisualTextRank on multilingual ads (translated to English) while leveraging semantically similar English ads. Online tests with a simplified version of VisualTextRank led to a 28.7% increase in the usage of stock image search, and a 41.6% increase in the advertiser onboarding rate in the Verizon Media Native ad platform.
Shaunak Mishra, Mikhail Kuznetsov, Gaurav Srivastava 0001, Maxim Sviridenko
KDD3
2019 Joint Optimization of Quantization and Structured Sparsity for Compressed Deep Neural Networks
abstract
The usage of Deep Neural Networks (DNN) on resource-constrained edge devices has been limited due to their high computation and large memory requirement. In this work, we propose an algorithm to compress DNNs by jointly optimizing structured sparsity and quantization constraints in a single DNN training framework. The proposed algorithm has been extensively validated on high/low capacity DNNs and wide/deep sparse DNNs. Further, we perform Pareto-optimal analysis to extract optimal DNN models from a large set of trained DNN models. The optimal structurally-compressed DNN model achieves ~50X weight memory reduction without test accuracy degradation, compared to floating-point uncompressed DNN.
Gaurav Srivastava 0001, Deepak Kadetotad, Shihui Yin, Visar Berisha, Chaitali Chakrabarti, Jae-sun Seo
ICASSP1
2019 ECG Authentication Neural Network Hardware Design with Collective Optimization of Low Precision and Structured Compression
abstract
For wearable devices that monitor personal health, secure access to private medical data becomes a crucial feature. Nowadays, device authentication based on biometrics such as fingerprint or iris has become increasingly popular. In this work, we investigate using electrocardiogram (ECG) signals as the biometric modality for device authentication, and we present accurate and low-power ECG-based authentication hardware. Deep neural networks (DNNs) have been employed with a cost function that maximizes inter-individual distance and minimizes intra-individual distance over time. During DNN training, we also introduce joint optimization of low-precision and structured sparsity, so that the real-time authentication hardware can consume minimal energy and area. Experimental results of custom hardware designed in 65nm LP CMOS technology exhibit low power consumption of 59.4 μW for real-time ECG authentication with a low equal error rate of 1.002% for a large 741-subject inhouse ECG database.
Sai Kiran Cherupally, Gaurav Srivastava 0001, Shihui Yin, Deepak Kadetotad, Chisung Bae, Sang Joon Kim, Jae-sun Seo
ISCAS2