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

Eric Kim

dblp:119/4775 · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 6 · 1 since 2021Databases, data management, data science and information retrieval · 3 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Systems, architecture and hardware · 1Human-computer interaction and ubiquitous computing · 1

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
4 papers
Graph learning · 23% Image recognition and object detection · 18% Language models and text generation · 18%
Databases, data mining, and information retrieval
4 papers
Recommender systems · 95% Information retrieval · 5%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
pre-trained language model
0.912025
Words That Unite The World: A Unified Framework for Deciphering Central Bank Communications · NeurIPS 2025
Natural language and speech › Information extraction and text analysis
stance detection
0.912025
Words That Unite The World: A Unified Framework for Deciphering Central Bank Communications · NeurIPS 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
Words That Unite The World: A Unified Framework for Deciphering Central Bank Communications · NeurIPS 2025
Machine learning › Graph learning › network embedding
bipartite graph embedding
0.612022
MultiBiSage: A Web-Scale Recommendation System Using Multiple Bipartite Graphs at Pinterest · Proc. VLDB Endow. 2022
Machine learning › Graph learning
graph neural network
0.612022
MultiBiSage: A Web-Scale Recommendation System Using Multiple Bipartite Graphs at Pinterest · Proc. VLDB Endow. 2022
Recommender systems
graph-based recommendation
0.612022
MultiBiSage: A Web-Scale Recommendation System Using Multiple Bipartite Graphs at Pinterest · Proc. VLDB Endow. 2022
Recommender systems › graph-based recommendation
heterogeneous information network recommendation
0.612022
MultiBiSage: A Web-Scale Recommendation System Using Multiple Bipartite Graphs at Pinterest · Proc. VLDB Endow. 2022
Computer vision › Image recognition and object detection
visual search
0.412020
Shop The Look: Building a Large Scale Visual Shopping System at Pinterest · KDD 2020
Recommender systems
fashion recommendation
0.412020
Bootstrapping Complete The Look at Pinterest · KDD 2020
Recommender systems › e-commerce recommendation
complementary recommendation
0.412019
Complete the Look: Scene-Based Complementary Product Recommendation · CVPR 2019
Recommender systems › fashion recommendation
fashion compatibility modeling
0.412019
Complete the Look: Scene-Based Complementary Product Recommendation · CVPR 2019
Recommender systems
social recommendation
0.212022
MultiBiSage: A Web-Scale Recommendation System Using Multiple Bipartite Graphs at Pinterest · Proc. VLDB Endow. 2022
Robotics › Legged, aerial and field robots
persistent surveillance
0.212013
Maximal persistent surveillance under safety constraints · ICRA 2013
Machine learning › Efficient and distributed learning
inference serving
0.112020
Shop The Look: Building a Large Scale Visual Shopping System at Pinterest · KDD 2020
Recommender systems
content-based recommendation
0.112020
Bootstrapping Complete The Look at Pinterest · KDD 2020
Information retrieval
ranking
0.112020
Shop The Look: Building a Large Scale Visual Shopping System at Pinterest · KDD 2020
Machine learning › Reinforcement learning
markov decision process
0.012013
Maximal persistent surveillance under safety constraints · ICRA 2013

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

zero-shot learning · 1.7large language model benchmarking · 1.7few-shot learning · 1.7multi-bipartite graph decomposition · 1.1graph convolutional network · 1.1visual embedding · 0.9object detection · 0.9a/b testing · 0.9model comparison · 0.4dataset construction · 0.4attention mechanism · 0.4CNN · 0.4convex programming · 0.2controlled markov chain · 0.2
YearPublicationVenuePosition
2025 Words That Unite The World: A Unified Framework for Deciphering Central Bank Communications
abstract
Central banks around the world play a crucial role in maintaining economic stability. Deciphering policy implications in their communications is essential, especially as misinterpretations can disproportionately impact vulnerable populations. To address this, we introduce the World Central Banks (WCB) dataset, the most comprehensive monetary policy corpus to date, comprising over 380k sentences from 25 central banks across diverse geographic regions, spanning 28 years of historical data. After uniformly sampling 1k sentences per bank (25k total) across all available years, we annotate and review each sentence using dual annotators, disagreement resolutions, and secondary expert reviews. We define three tasks: Stance Detection, Temporal Classification, and UncertaintyEstimation, with each sentence annotated for all three. We benchmark seven Pretrained Language Models (PLMs) and nine Large Language Models (LLMs) (Zero-Shot, Few-Shot, and with annotation guide) on these tasks, running 15,075 benchmarking experiments. We find that a model trained on aggregated data across banks significantly surpasses a model trained on an individual bank's data, confirming the principle "the whole is greater than the sum of its parts." Additionally, rigorous human evaluations, error analyses, and predictive tasks validate our framework's economic utility. Our artifacts are accessible through the HuggingFace and GitHub under the CC-BY-NC-SA 4.0 license.
Agam Shah, Siddhant Sukhani, Huzaifa Pardawala, Saketh Budideti, Riya Bhadani, Rudra Gopal, Siddhartha Somani, Rutwik Routu, Michael Galarnyk, Soungmin Lee, Arnav Hiray, Akshar Ravichandran, Eric Kim, Pranav Aluru, Joshua Zhang, Sebastian Jaskowski, Veer Guda, Meghaj Tarte, Liqin Ye, Spencer Gosden, Rachel Yuh, Sloka Chava, Sahasra Chava, Dylan Patrick Kelly, Aiden Chiang, Harsit Mittal, Sudheer Chava
NeurIPS13
2024 An Efficient Deep Neural Network to Classify Large 3D Images With Small Objects
abstract
3D imaging enables accurate diagnosis by providing spatial information about organ anatomy. However, using 3D images to train AI models is computationally challenging because they consist of 10x or 100x more pixels than their 2D counterparts. To be trained with high-resolution 3D images, convolutional neural networks resort to downsampling them or projecting them to 2D. We propose an effective alternative, a neural network that enables efficient classification of full-resolution 3D medical images. Compared to off-the-shelf convolutional neural networks, our network, 3D Globally-Aware Multiple Instance Classifier (3D-GMIC), uses 77.98%-90.05% less GPU memory and 91.23%-96.02% less computation. While it is trained only with image-level labels, without segmentation labels, it explains its predictions by providing pixel-level saliency maps. On a dataset collected at NYU Langone Health, including 85,526 patients with full-field 2D mammography (FFDM), synthetic 2D mammography, and 3D mammography, 3D-GMIC achieves an AUC of 0.831 (95% CI: 0.769-0.887) in classifying breasts with malignant findings using 3D mammography. This is comparable to the performance of GMIC on FFDM (0.816, 95% CI: 0.737-0.878) and synthetic 2D (0.826, 95% CI: 0.754-0.884), which demonstrates that 3D-GMIC successfully classified large 3D images despite focusing computation on a smaller percentage of its input compared to GMIC. Therefore, 3D-GMIC identifies and utilizes extremely small regions of interest from 3D images consisting of hundreds of millions of pixels, dramatically reducing associated computational challenges. 3D-GMIC generalizes well to BCS-DBT, an external dataset from Duke University Hospital, achieving an AUC of 0.848 (95% CI: 0.798-0.896).
Jungkyu Park 0001, Jakub Chledowski, Stanislaw Jastrzebski, Jan Sylwester Witowski, Yanqi Xu, Linda Du, Sushma Gaddam, Eric Kim, Alana Lewin, Ujas Parikh, Anastasia Plaunova, Sardius Chen, Alexandra Millet, Kristine Pysarenko, Shalin Patel, Julia E. Goldberg, Melanie Wegener, Linda Moy, Laura Heacock, Beatriu Reig, Krzysztof J. Geras
IEEE Trans. Medical Imaging8
2022 MultiBiSage: A Web-Scale Recommendation System Using Multiple Bipartite Graphs at Pinterest
abstract
Graph Convolutional Networks (GCN) can efficiently integrate graph structure and node features to learn high-quality node embeddings. At Pinterest, we have developed and deployed PinSage, a data-efficient GCN that learns pin embeddings from the Pin-Board graph. Pinterest relies heavily on PinSage which in turn only leverages the Pin-Board graph. However, there exist several entities at Pinterest and heterogeneous interactions among these entities. These diverse entities and interactions provide important signal for recommendations and modeling. In this work, we show that training deep learning models on graphs that captures these diverse interactions can result in learning higher-quality pin embeddings than training PinSage on only the Pin-Board graph. However, building a large-scale heterogeneous graph engine that can process the entire Pinterest size data has not yet been done. In this work, we present a clever and effective solution where we break the heterogeneous graph into multiple disjoint bipartite graphs and then develop novel data-efficient MultiBiSage model that combines the signals from them. MultiBiSage can capture the graph structure of multiple bipartite graphs to learn high-quality pin embeddings. The benefit of our approach is that individual bipartite graphs can be processed with minimal changes to Pinterest's current infrastructure, while being able to combine information from all the graphs while achieving high performance. We train MultiBiSage on six bipartite graphs including our Pin-Board graph and show that it significantly outperforms the deployed latest version of PinSage on multiple user engagement metrics. We also perform experiments on two public datasets to show that MultiBiSage is generalizable and can be applied to datasets outside of Pinterest.
Saket Gurukar, Nikil Pancha, Andrew Zhai, Eric Kim, Samson Hu, Srinivasan Parthasarathy 0001, Charles Rosenberg 0001, Jure Leskovec
Proc. VLDB Endow.4
2020 CausalX: Causal eXplanations and Block Multilinear Factor Analysis
abstract
By adhering to the dictum, “No causation without manipulation (treatment, intervention)”, cause and effect data analysis represents changes in observed data in terms of changes in the causal factors. When causal factors are not amenable for active manipulation in the real world due to current technological limitations or ethical considerations, a counterfactual approach performs an intervention on the model of data formation. In the case of object representation or activity (temporal object) representation, varying object parts is generally unfeasible whether they be spatial and/or temporal. Multilinear algebra, the algebra of higher order tensors, is a suitable and transparent framework for disentangling the causal factors of data formation. Learning a part-based intrinsic causal factor representations in a multilinear framework requires applying a set of interventions on a part-based multilinear model. We propose a unified multilinear model of wholes and parts. We derive a hierarchical block multilinear factorization, the M-mode Block SVD, that computes a disentangled representation of the causal factors by optimizing simultaneously across the entire object hierarchy. Given computational efficiency considerations, we introduce an incremental bottom-up computational alternative, the Incremental M-mode Block SVD, that employs the lower level abstractions, the part representations, to represent the higher level of abstractions, the parent wholes. This incremental computational approach may also be employed to update the causal model parameters when data becomes available incrementally. The resulting object representation is an interpretable combinatorial choice of intrinsic causal factor representations related to an object's recursive hierarchy of wholes and parts that renders object recognition robust to occlusion and reduces training data requirements.
M. Alex O. Vasilescu, Eric Kim, Xiao S. Zeng
ICPR2
2020 Bootstrapping Complete The Look at Pinterest
abstract
Putting together an ideal outfit is a process that involves creativity and style intuition. This makes it a particularly difficult task to automate. Existing styling products generally involve human specialists and a highly curated set of fashion items. In this paper, we will describe how we bootstrapped the Complete The Look (CTL) system at Pinterest. This is a technology that aims to learn the subjective task of "style compatibility" in order to recommend complementary items that complete an outfit. In particular, we want to show recommendations from other categories that are compatible with an item of interest. For example, what are some heels that go well with this cocktail dress? We will introduce our outfit dataset of over 1 million outfits and 4 million objects, a subset of which we will make available to the research community, and describe the pipeline used to obtain and refresh this dataset. Furthermore, we will describe how we evaluate this subjective task and compare model performance across multiple training methods. Lastly, we will share our lessons going from experimentation to working prototype, and how to mitigate failure modes in the production environment. Our work represents one of the first examples of an industrial-scale solution for compatibility-based fashion recommendation.
Eileen Li, Eric Kim, Andrew Zhai, Josh Beal, Kunlong Gu
KDD2
2020 Shop The Look: Building a Large Scale Visual Shopping System at Pinterest
abstract
As online content becomes ever more visual, the demand for searching by visual queries grows correspondingly stronger. Shop The Look is an online shopping discovery service at Pinterest, leveraging visual search to enable users to find and buy products within an image. In this work, we provide a holistic view of how we built Shop The Look, a shopping oriented visual search system, along with lessons learned from addressing shopping needs. We discuss topics including core technology across object detection and visual embeddings, serving infrastructure for realtime inference, and data labeling methodology for training/evaluation data collection and human evaluation. The user-facing impacts of our system design choices are measured through offline evaluations, human relevance judgements, and online A/B experiments. The collective improvements amount to cumulative relative gains of over 160% in end-to-end human relevance judgements and over 80% in engagement. Shop The Look is deployed in production at Pinterest.
Raymond Shiau, Hao-Yu Wu, Eric Kim, Yue Li Du, Anqi Guo, Eileen Li, Kunlong Gu, Charles Rosenberg 0001, Andrew Zhai
KDD3
2020 Deep Neural Networks Improve Radiologists' Performance in Breast Cancer Screening
abstract
We present a deep convolutional neural network for breast cancer screening exam classification, trained, and evaluated on over 200000 exams (over 1000000 images). Our network achieves an AUC of 0.895 in predicting the presence of cancer in the breast, when tested on the screening population. We attribute the high accuracy to a few technical advances. 1) Our network's novel two-stage architecture and training procedure, which allows us to use a high-capacity patch-level network to learn from pixel-level labels alongside a network learning from macroscopic breast-level labels. 2) A custom ResNet-based network used as a building block of our model, whose balance of depth and width is optimized for high-resolution medical images. 3) Pretraining the network on screening BI-RADS classification, a related task with more noisy labels. 4) Combining multiple input views in an optimal way among a number of possible choices. To validate our model, we conducted a reader study with 14 readers, each reading 720 screening mammogram exams, and show that our model is as accurate as experienced radiologists when presented with the same data. We also show that a hybrid model, averaging the probability of malignancy predicted by a radiologist with a prediction of our neural network, is more accurate than either of the two separately. To further understand our results, we conduct a thorough analysis of our network's performance on different subpopulations of the screening population, the model's design, training procedure, errors, and properties of its internal representations. Our best models are publicly available at https://github.com/nyukat/breast_cancer_classifier.
Nan Wu 0008, Jason Phang, Jungkyu Park 0001, Yiqiu Shen, Zhe Huang 0005, Masha Zorin, Stanislaw Jastrzebski, Thibault Févry, Joe Katsnelson, Eric Kim, Stacey Wolfson, Ujas Parikh, Sushma Gaddam, Leng Leng Young Lin, Kara Ho, Joshua D. Weinstein, Beatriu Reig, Yiming Gao 0003, Hildegard Toth, Kristine Pysarenko, Alana Lewin, Jiyon Lee, Krystal Airola, Eralda Mema, Stephanie Chung, Esther Hwang, Naziya Samreen, Sungheon Gene Kim, Laura Heacock, Linda Moy, Kyunghyun Cho, Krzysztof J. Geras
IEEE Trans. Medical Imaging10
2019 Complete the Look: Scene-Based Complementary Product Recommendation
abstract
Modeling fashion compatibility is challenging due to its complexity and subjectivity. Existing work focuses on predicting compatibility between product images (e.g. an image containing a t-shirt and an image containing a pair of jeans). However, these approaches ignore real-world `scene' images (e.g. selfies); such images are hard to deal with due to their complexity, clutter, variations in lighting and pose (etc.) but on the other hand could potentially provide key context (e.g. the user's body type, or the season) for making more accurate recommendations. In this work, we propose a new task called `Complete the Look', which seeks to recommend visually compatible products based on scene images. We design an approach to extract training data for this task, and propose a novel way to learn the scene-product compatibility from fashion or interior design images. Our approach measures compatibility both globally and locally via CNNs and attention mechanisms. Extensive experiments show that our method achieves significant performance gains over alternative systems. Human evaluation and qualitative analysis are also conducted to further understand model behavior. We hope this work could lead to useful applications which link large corpora of real-world scenes with shoppable products.
Wang-Cheng Kang, Eric Kim, Jure Leskovec, Charles Rosenberg 0001, Julian J. McAuley
CVPR2
2018 Breast Density Classification with Deep Convolutional Neural Networks
abstract
Breast density classification is an essential part of breast cancer screening. Although a lot of prior work considered this problem as a task for learning algorithms, to our knowledge, all of them used small and not clinically realistic data both for training and evaluation of their models. In this work, we explored the limits of this task with a data set coming from over 200,000 breast cancer screening exams. We used this data to train and evaluate a strong convolutional neural network classifier. In a reader study, we found that our model can perform this task comparably to a human expert.
Nan Wu 0008, Krzysztof J. Geras, Yiqiu Shen, Jingyi Su, Sungheon Gene Kim, Eric Kim, Stacey Wolfson, Linda Moy, Kyunghyun Cho
ICASSP6
2013 Maximal persistent surveillance under safety constraints
abstract
This paper presents a method for the design of time-invariant memoryless control policies for robots tasked with persistent surveillance of an area in which there are forbidden regions. We model each robot as a controlled Markov chain whose state comprises its position on a finite two-dimensional lattice and the direction of motion. The goal is to find the minimum number of robots and an associated time-invariant memoryless control policy that guarantees that the largest number of states are persistently surveilled without ever visiting a forbidden state. We propose a design method that relies on a finitely parametrized convex program inspired by entropy maximization principles. For clarity of exposition, we focus on simple dynamics and state/control spaces, however the proposed methodology can be extended to more general cases. Numerical examples are provided.
Eduardo Arvelo, Eric Kim, Nuno C. Martins
ICRA2
2012 Work in progress: Outreach assessment: Measuring engagement: An integrated approach for learning
abstract
The Learn By Doing Lab (LBDL) at Cal Poly, San Luis Obispo is an on-campus laboratory where 5th through 8th grade students are taught by undergraduates who may be planning a careers in teaching. The two populations -elementary students and undergraduates - are equally important in the process. Since 2008, the lab has seen over 4000 elementary and junior high students and over 100 undergrads have participated. In most outreach assessment the number of individuals participating is an important metric, but this last Spring we experimented with a more in depth measure of effectiveness. As in any learning experience engagement in the process is an essential ingredient. Although there are several methods of measuring engagement, we chose to observe the activity of the participants as a proxy for engagement. Two industrial engineering (IE) undergraduates who themselves have been exposed to the topics of work sampling and observation studies had an opportunity to improve professional skills through this application. This involvement of undergraduates is consistent with the LBDL and Cal Poly's motto of “learn by doing.” These two students, who are also coauthors, spent multiple hours coding and randomly sampling the of the elementary and junior high students as well as the undergraduate teacher's activities. Not only did the IE students discover important insights for the LDBL they also learned how to apply work sampling in a research setting. This paper discusses the integrated learning environment and the next steps involved in these undertakings.
Lizabeth Schlemer, John Y. Oliver, Katherine C. Chen, Sofia Rodriguez Mata, Eric Kim
FIE5