VLDB 2026 Research / reviewers in the wild / expert
Oren Sar Shalom
dblp:34/8612
· DBLP profile ↗
15ranked-venue papers in the field
6as first author
5since 2021 · last 2025
0000-0002-5242-3932ORCID · corroborated
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 14 (6 first)Data Mining & Knowledge Discovery · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Addressing Multiple Hypothesis Bias in CTR Prediction for Ad Selection
Oren Sar Shalom, Neil Daftary |
RecSys | 1 |
| 2023 | Semi-supervised Adversarial Learning for Complementary Item RecommendationabstractComplementary item recommendations are a ubiquitous feature of modern e-commerce sites. Such recommendations are highly effective when they are based on collaborative signals like co-purchase statistics. In certain online marketplaces, however, e.g., on online auction sites, constantly new items are added to the catalog. In such cases, complementary item recommendations are often based on item side-information due to a lack of interaction data. In this work, we propose a novel approach that can leverage both item side-information and labeled complementary item pairs to generate effective complementary recommendations for cold items, i.e., for items for which no co-purchase statistics yet exist. Given that complementary items typically have to be of a different category than the seed item, we technically maintain a latent space for each item category. Simultaneously, we learn to project distributed item representations into these category spaces to determine suitable recommendations. The main learning process in our architecture utilizes labeled pairs of complementary items. In addition, we adopt ideas from Cycle Generative Adversarial Networks (CycleGAN) to leverage available item information even in case no labeled data exists for a given item and category. Experiments on three e-commerce datasets show that our method is highly effective. Koby Bibas, Oren Sar Shalom, Dietmar Jannach |
WWW | 2 |
| 2022 | Collaborative Image UnderstandingabstractAutomatically understanding the contents of an image is a highly relevant problem in practice. In e-commerce and social media settings, for example, a common problem is to automatically categorize user-provided pictures. Nowadays, a standard approach is to fine-tune pre-trained image models with application-specific data. Besides images, organizations however often also collect collaborative signals in the context of their application, in particular how users interacted with the provided online content, e.g., in forms of viewing, rating, or tagging. Such signals are commonly used for item recommendation, typically by deriving latent user and item representations from the data. In this work, we show that such collaborative information can be leveraged to improve the classification process of new images. Specifically, we propose a multitask learning framework, where the auxiliary task is to reconstruct collaborative latent item representations. A series of experiments on datasets from e-commerce and social media demonstrates that considering collaborative signals helps to significantly improve the performance of the main task of image classification by up to 9.1%. Koby Bibas, Oren Sar Shalom, Dietmar Jannach |
CIKM | 2 |
| 2022 | BRUCE: Bundle Recommendation Using Contextualized item EmbeddingsabstractA bundle is a pre-defined set of items that are collected together. In many domains, bundling is one of the most important marketing strategies for item promotion, commonly used in e-commerce. Bundle recommendation resembles the item recommendation task, where bundles are the recommended unit, but it poses additional challenges; while item recommendation requires only user and item understanding, bundle recommendation also requires modeling the connections between the various items in a bundle. Transformers have driven the state-of-the-art methods for set and sequence modeling in various natural language processing and computer vision tasks, emphasizing the understanding that the neighbors of an element are of crucial importance. Under some required adjustments, we believe the same applies for items in bundles, and better capturing the relations of an item with other items in the bundle may lead to improved recommendations. To address that, we introduce BRUCE - a novel model for bundle recommendation, in which we adapt Transformers to represent data on users, items, and bundles. This allows exploiting the self-attention mechanism to model the following: latent relations between the items in a bundle; and users’ preferences toward each of the items in the bundle and toward the whole bundle. Moreover, we examine various architectures to integrate the items’ and the users’ information and provide insights on architecture selection based on data characteristics. Experiments conducted on three benchmark datasets show that the proposed approach contributes to the accuracy of the recommendation and substantially outperforms state-of-the-art methods Tzoof Avny Brosh, Amit Livne, Oren Sar Shalom, Bracha Shapira, Mark Last |
RecSys | 3 |
| 2021 | A Black-Box Attack Model for Visually-Aware Recommender SystemsabstractDue to the advances in deep learning, visually-aware recommender systems (RS) have recently attracted increased research interest. Such systems combine collaborative signals with images, usually represented as feature vectors outputted by pre-trained image models. Since item catalogs can be huge, recommendation service providers often rely on images that are supplied by the item providers. In this work, we show that relying on such external sources can make an RS vulnerable to attacks, where the goal of the attacker is to unfairly promote certain pushed items. Specifically, we demonstrate how a new visual attack model can effectively influence the item scores and rankings in a black-box approach, i.e., without knowing the parameters of the model. The main underlying idea is to systematically create small human-imperceptible perturbations of the pushed item image and to devise appropriate gradient approximation methods to incrementally raise the pushed item's score. Experimental evaluations on two datasets show that the novel attack model is effective even when the contribution of the visual features to the overall performance of the recommender system is modest. Rami Cohen, Oren Sar Shalom, Dietmar Jannach, Amihood Amir |
WSDM | 2 |
| 2020 | Second Workshop on the Impact of Recommender Systems at ACM RecSys '20abstractRecommender systems research is largely focused on the value such systems can create for users, e.g., by helping them finding items of interest in situations of information overload. However, there are various other ways in which recommender systems can create value and have an impact on individuals and organizations. The goal of the workshop is to serve as a platform where researchers discuss recent insights on how recommender systems affect individuals, user communities, or organizations. The workshop also aims at raising awareness regarding the importance of impact-oriented research. Oren Sar Shalom, Dietmar Jannach, Joseph A. Konstan |
RecSys | 1 |
| 2019 | First workshop on the impact of recommender systems at ACM RecSys 2019abstractResearch in the area of recommender systems is largely focused on the value such a system creates for the users, by helping them finding items they are interested in. This is usually done by learning to rank the recommendable items based on their assumed relevance for each user. The implicit underlying goal often is that this personalization positively affects users in different positive ways, e.g., by making their search and decision processes easier or by helping them discover new things [3]. Oren Sar Shalom, Dietmar Jannach, Ido Guy |
RecSys | 1 |
| 2019 | A generative model for review-based recommendationsabstractUser generated reviews is a highly informative source of information, that has recently gained lots of attention in the recommender systems community. In this work we propose a generative latent variable model that explains both observed ratings and textual reviews. This latent variable model allows to combine any traditional collaborative filtering method, together with any deep learning architecture for text processing. Experimental results on four benchmark datasets demonstrate its superiority comparing to all baseline recommender systems. Furthermore, a running time analysis shows that this approach is in order of magnitude faster that relevant baselines. Moreover, underlying our solution there is a general framework that may be further explored. Oren Sar Shalom, Guy Uziel, Amir Kantor |
RecSys | 1 |
| 2018 | Rank and rate: multi-task learning for recommender systemsabstractThe two main tasks in the Recommender Systems domain are the ranking and rating prediction tasks. The rating prediction task aims at predicting to what extent a user would like any given item, which would enable to recommend the items with the highest predicted scores. The ranking task on the other hand directly aims at recommending the most valuable items for the user. Several previous approaches proposed learning user and item representations to optimize both tasks simultaneously in a multi-task framework. In this work we propose a novel multi-task framework that exploits the fact that a user does a two-phase decision process - first decides to interact with an item (ranking task) and only afterward to rate it (rating prediction task). Guy Hadash, Oren Sar Shalom, Rita Osadchy |
RecSys | 2 |
| 2018 | DLRS 2018: third workshop on deep learning for recommender systemsabstractDeep learning is now an integral part of recommender systems, but the research is still in its early phase. New research topics pop up frequently and established topics are extended in new, interesting directions. DLRS 2018 is a venue for pioneering work in the intersection of deep learning and recommender systems research. Balázs Hidasi, Alexandros Karatzoglou, Oren Sar Shalom, Bracha Shapira, Domonkos Tikk, Flavian Vasile, Sander Dieleman |
RecSys | 3 |
| 2017 | DLRS 2017: Second Workshop on Deep Learning for Recommender SystemsabstractDeep learning methods became widely popular in the recommender systems community in 2016, in part thanks to the previous event of the DLRS workshop series. Now, deep learning has been embedded in the main conference as well and initial research directions have started forming, so the role of DLRS 2017 is to encourage starting new research directions, incentivize the application of very recent techniques from deep learning, and provide a venue for specialized discussion of this topic. Balázs Hidasi, Alexandros Karatzoglou, Oren Sar Shalom, Sander Dieleman, Bracha Shapira, Domonkos Tikk |
RecSys | 3 |
| 2016 | RecSys'16 Workshop on Deep Learning for Recommender Systems (DLRS)abstractWe believe that Deep Learning is one of the next big things in Recommendation Systems technology. The past few years have seen the tremendous success of deep neural networks in a number of complex tasks such as computer vision, natural language processing and speech recognition. Despite this, only little work has been published on Deep Learning methods for Recommender Systems. Notable recent application areas are music recommendation, news recommendation, and session-based recommendation. The aim of the workshop is to encourage the application of Deep Learning techniques in Recommender Systems, to promote research in deep learning methods for Recommender Systems, and to bring together researchers from the Recommender Systems and Deep Learning communities. Alexandros Karatzoglou, Balázs Hidasi, Domonkos Tikk, Oren Sar Shalom, Haggai Roitman, Bracha Shapira, Lior Rokach |
RecSys | 4 |
| 2016 | Beyond Collaborative Filtering: The List Recommendation ProblemabstractMost Collaborative Filtering (CF) algorithms are optimized using a dataset of isolated user-item tuples. However, in commercial applications recommended items are usually served as an ordered list of several items and not as isolated items. In this setting, inter-item interactions have an effect on the list's Click-Through Rate (CTR) that is unaccounted for using traditional CF approaches. Most CF approaches also ignore additional important factors like click propensity variation, item fatigue, etc. In this work, we introduce the list recommendation problem. We present useful insights gleaned from user behavior and consumption patterns from a large scale real world recommender system. We then propose a novel two-layered framework that builds upon existing CF algorithms to optimize a list's click probability. Our approach accounts for inter-item interactions as well as additional information such as item fatigue, trendiness patterns, contextual information etc. Finally, we evaluate our approach using a novel adaptation of Inverse Propensity Scoring (IPS) which facilitates off-policy estimation of our method's CTR and showcases its effectiveness in real-world settings. Oren Sar Shalom, Noam Koenigstein, Ulrich Paquet, Hastagiri P. Vanchinathan |
WWW | 1 |
| 2015 | Data Quality Matters in Recommender SystemsabstractAlthough data quality has been recognized as an important factor in the broad information systems research, it has received little attention in recommender systems. Data quality matters are typically addressed in recommenders by ad-hoc cleansing methods, which prune noisy or unreliable records from the data. However, the setting of the cleansing parameters is often done arbitrarily, without thorough consideration of the data characteristics. In this work, we turn to two central data quality problems in recommender systems: sparsity and redundancy. We devise models for setting data-dependent thresholds and sampling levels, and evaluate these using a collection of public and proprietary datasets. We observe that the models accurately predict data cleansing parameters, while having minor effect on the accuracy of the generated recommendations. Oren Sar Shalom, Shlomo Berkovsky, Royi Ronen, Elad Ziklik, Amihood Amir |
RecSys | 1 |
| 2010 | A PTAS for the Square Tiling Problem
Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom |
SPIRE | 4 |