Demo Data from VLDB 2026 / reviewers in the wild / expert
George Roumpos
dblp:204/3385 · also Georgios Roumpos
· DBLP profile ↗
4ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 1 since 2021Artificial intelligence and machine learning · 2 · 1 since 2021Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging 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.
| Databases, data mining, and information retrieval
3 papers |
Information retrieval · 75% Recommender systems · 18% Machine learning and data management · 7% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 39% Performance modeling and evaluation · 30% Hardware accelerators and domain-specific architectures · 30% | |
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% |
Topics — the 12 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval
personalized search |
1.0 | 2 | 2022 | Multi-Resolution Attention for Personalized Item Search · WSDM 2022 End-to-End Deep Attentive Personalized Item Retrieval for Online Content-sharing Platforms · WWW 2020 |
Recommender systems › neural recommendation
attention-based recommendation |
0.6 | 1 | 2022 | Multi-Resolution Attention for Personalized Item Search · WSDM 2022 |
Information retrieval › retrieval models › neural retrieval
neural ranking model |
0.6 | 1 | 2022 | Multi-Resolution Attention for Personalized Item Search · WSDM 2022 |
Information retrieval › e-commerce search
personalized product search |
0.6 | 1 | 2022 | Multi-Resolution Attention for Personalized Item Search · WSDM 2022 |
Information retrieval
ranking |
0.6 | 1 | 2022 | Multi-Resolution Attention for Personalized Item Search · WSDM 2022 |
Information retrieval › e-commerce search
item retrieval |
0.4 | 1 | 2020 | End-to-End Deep Attentive Personalized Item Retrieval for Online Content-sharing Platforms · WWW 2020 |
High-performance computing
ising model simulation |
0.4 | 1 | 2019 | High performance Monte Carlo simulation of ising model on TPU clusters · SC 2019 |
Performance modeling and evaluation › simulation
monte carlo simulation |
0.4 | 1 | 2019 | High performance Monte Carlo simulation of ising model on TPU clusters · SC 2019 |
Machine learning › Efficient and distributed learning
distributed training |
0.3 | 1 | 2017 | TensorFlow Estimators: Managing Simplicity vs. Flexibility in High-Level Machine Learning Frameworks · KDD 2017 |
Machine learning › Efficient and distributed learning
production machine learning |
0.3 | 1 | 2017 | TensorFlow Estimators: Managing Simplicity vs. Flexibility in High-Level Machine Learning Frameworks · KDD 2017 |
Recommender systems
user modeling |
0.2 | 1 | 2022 | Multi-Resolution Attention for Personalized Item Search · WSDM 2022 |
High-performance computing › numerical linear algebra
distributed matrix computation |
0.1 | 1 | 2019 | High performance Monte Carlo simulation of ising model on TPU clusters · SC 2019 |
Methods — techniques the papers use, named apart from their topics
soft-thresholding · 0.6multi-head attention · 0.6hyperparameter tuning · 0.6estimator interface · 0.6distributed training · 0.6extreme multi-class softmax · 0.4embedding · 0.4attention mechanism · 0.4tensorflow · 0.4low-precision arithmetic · 0.4BFLOAT16 · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Multi-Resolution Attention for Personalized Item SearchabstractPersonalized item search has become an essential tool for online platforms---where users interact with a large corpus of items (e.g., click, purchase, like) via a search query---to provide their users with a more satisfactory search experience. The record (or history) of users' past interactions serves as a valuable asset to achieve personalization. While user history data can span over a long period of time, only a part of the history is relevant to a user's current search intent. Moreover, since historical interactions take place at aperiodic points in time, modeling their relevance to the current search query entangles complex temporal dependencies. We propose multi-resolution attention to address these challenges for personalized item search. Our approach captures higher-order temporal relations between user queries and their history across several temporal subspaces (i.e., resolutions), each corresponding to distinct temporal ranges with adaptive time boundaries that are also learned directly from data. We achieve this by coupling the conventional multi-head attention module with a differentiable soft-thresholding mechanism, which essentially operates as a masking function in the temporal domain. Comparisons with strong baselines on an open-source benchmark dataset confirm the efficacy of our approach. Furkan Kocayusufoglu, Anima Singh, George Roumpos, Heng-Tze Cheng, Sagar Jain, Ed H. Chi, Ambuj K. Singh |
WSDM | 4 |
| 2020 | End-to-End Deep Attentive Personalized Item Retrieval for Online Content-sharing PlatformsabstractModern online content-sharing platforms host billions of items like music, videos, and products uploaded by various providers for users to discover items of their interests. To satisfy the information needs, the task of effective item retrieval (or item search ranking) given user search queries has become one of the most fundamental problems to online content-sharing platforms. Moreover, the same query can represent different search intents for different users, so personalization is also essential for providing more satisfactory search results. Different from other similar research tasks, such as ad-hoc retrieval and product retrieval with copious words and reviews, items in content-sharing platforms usually lack sufficient descriptive information and related meta-data as features. In this paper, we propose the end-to-end deep attentive model (EDAM) to deal with personalized item retrieval for online content-sharing platforms using only discrete personal item history and queries. Each discrete item in the personal item history of a user and its content provider are first mapped to embedding vectors as continuous representations. A query-aware attention mechanism is then applied to identify the relevant contexts in the user history and construct the overall personal representation for a given query. Finally, an extreme multi-class softmax classifier aggregates the representations of both query and personal item history to provide personalized search results. We conduct extensive experiments on a large-scale real-world dataset with hundreds of million users from a large video media platform at Google. The experimental results demonstrate that our proposed approach significantly outperforms several competitive baseline methods. It is also worth mentioning that this work utilizes a massive dataset from a real-world commercial content-sharing platform for personalized item retrieval to provide more insightful analysis from the industrial aspects. Jyun-Yu Jiang, George Roumpos, Heng-Tze Cheng, Xinyang Yi, Ed H. Chi, Harish Ganapathy, Nitin Jindal, Wei Wang 0010 |
WWW | 3 |
| 2019 | High performance Monte Carlo simulation of ising model on TPU clustersabstractLarge-scale deep learning benefits from an emerging class of AI accelerators. Some of these accelerators' designs are general enough for compute-intensive applications beyond AI and Cloud TPU is one such example. In this paper, we demonstrate a novel approach using TensorFlow on Cloud TPU to simulate the two-dimensional Ising Model. TensorFlow and Cloud TPU framework enable the simple and readable code to express the complicated distributed algorithm without compromising the performance. Our code implementation fits into a small Jupyter Notebook and fully utilizes Cloud TPU's efficient matrix operation and dedicated high speed inter-chip connection. The performance is highly competitive: it outperforms the best published benchmarks to our knowledge by 60% in single-core and 250% in multi-core with good linear scaling. When compared to Tesla V100 GPU, the single-core performance maintains a ~10% gain. We also demonstrate that using low precision arithmetic---bfloat16---does not compromise the correctness of the simulation results. George Roumpos, Chris Colby, John R. Anderson |
SC | 3 |
| 2017 | TensorFlow Estimators: Managing Simplicity vs. Flexibility in High-Level Machine Learning FrameworksabstractWe present a framework for specifying, training, evaluating, and deploying machine learning models. Our focus is on simplifying cutting edge machine learning for practitioners in order to bring such technologies into production. Recognizing the fast evolution of the field of deep learning, we make no attempt to capture the design space of all possible model architectures in a domain-specific language (DSL) or similar configuration language. We allow users to write code to define their models, but provide abstractions that guide developers to write models in ways conducive to productionization. We also provide a unifying Estimator interface, making it possible to write downstream infrastructure (e.g. distributed training, hyperparameter tuning) independent of the model implementation. Heng-Tze Cheng, Zakaria Haque, Lichan Hong, Mustafa Ispir, Clemens Mewald, Illia Polosukhin, George Roumpos, D. Sculley, Jamie Smith, David Soergel, Yuan Tang 0001, Philipp Tucker, Martin Wicke, Cassandra Xia, Jianwei Xie |
KDD | 7 |