Alert button
Picture for Ido Guy

Ido Guy

Alert button

TCE: A Test-Based Approach to Measuring Calibration Error

Jun 25, 2023
Takuo Matsubara, Niek Tax, Richard Mudd, Ido Guy

Figure 1 for TCE: A Test-Based Approach to Measuring Calibration Error
Figure 2 for TCE: A Test-Based Approach to Measuring Calibration Error
Figure 3 for TCE: A Test-Based Approach to Measuring Calibration Error
Figure 4 for TCE: A Test-Based Approach to Measuring Calibration Error

This paper proposes a new metric to measure the calibration error of probabilistic binary classifiers, called test-based calibration error (TCE). TCE incorporates a novel loss function based on a statistical test to examine the extent to which model predictions differ from probabilities estimated from data. It offers (i) a clear interpretation, (ii) a consistent scale that is unaffected by class imbalance, and (iii) an enhanced visual representation with repect to the standard reliability diagram. In addition, we introduce an optimality criterion for the binning procedure of calibration error metrics based on a minimal estimation error of the empirical probabilities. We provide a novel computational algorithm for optimal bins under bin-size constraints. We demonstrate properties of TCE through a range of experiments, including multiple real-world imbalanced datasets and ImageNet 1000.

Viaarxiv icon

Explaining Predictive Uncertainty with Information Theoretic Shapley Values

Jun 09, 2023
David S. Watson, Joshua O'Hara, Niek Tax, Richard Mudd, Ido Guy

Figure 1 for Explaining Predictive Uncertainty with Information Theoretic Shapley Values
Figure 2 for Explaining Predictive Uncertainty with Information Theoretic Shapley Values
Figure 3 for Explaining Predictive Uncertainty with Information Theoretic Shapley Values
Figure 4 for Explaining Predictive Uncertainty with Information Theoretic Shapley Values

Researchers in explainable artificial intelligence have developed numerous methods for helping users understand the predictions of complex supervised learning models. By contrast, explaining the $\textit{uncertainty}$ of model outputs has received relatively little attention. We adapt the popular Shapley value framework to explain various types of predictive uncertainty, quantifying each feature's contribution to the conditional entropy of individual model outputs. We consider games with modified characteristic functions and find deep connections between the resulting Shapley values and fundamental quantities from information theory and conditional independence testing. We outline inference procedures for finite sample error rate control with provable guarantees, and implement an efficient algorithm that performs well in a range of experiments on real and simulated data. Our method has applications to covariate shift detection, active learning, feature selection, and active feature-value acquisition.

Viaarxiv icon

tBDFS: Temporal Graph Neural Network Leveraging DFS

Jun 12, 2022
Uriel Singer, Haggai Roitman, Ido Guy, Kira Radinsky

Figure 1 for tBDFS: Temporal Graph Neural Network Leveraging DFS
Figure 2 for tBDFS: Temporal Graph Neural Network Leveraging DFS
Figure 3 for tBDFS: Temporal Graph Neural Network Leveraging DFS
Figure 4 for tBDFS: Temporal Graph Neural Network Leveraging DFS

Temporal graph neural networks (temporal GNNs) have been widely researched, reaching state-of-the-art results on multiple prediction tasks. A common approach employed by most previous works is to apply a layer that aggregates information from the historical neighbors of a node. Taking a different research direction, in this work, we propose tBDFS -- a novel temporal GNN architecture. tBDFS applies a layer that efficiently aggregates information from temporal paths to a given (target) node in the graph. For each given node, the aggregation is applied in two stages: (1) A single representation is learned for each temporal path ending in that node, and (2) all path representations are aggregated into a final node representation. Overall, our goal is not to add new information to a node, but rather observe the same exact information in a new perspective. This allows our model to directly observe patterns that are path-oriented rather than neighborhood-oriented. This can be thought as a Depth-First Search (DFS) traversal over the temporal graph, compared to the popular Breath-First Search (BFS) traversal that is applied in previous works. We evaluate tBDFS over multiple link prediction tasks and show its favorable performance compared to state-of-the-art baselines. To the best of our knowledge, we are the first to apply a temporal-DFS neural network.

* 9 pages, 2 figures, 2 tables 
Viaarxiv icon

Sequential Modeling with Multiple Attributes for Watchlist Recommendation in E-Commerce

Oct 24, 2021
Uriel Singer, Haggai Roitman, Yotam Eshel, Alexander Nus, Ido Guy, Or Levi, Idan Hasson, Eliyahu Kiperwasser

Figure 1 for Sequential Modeling with Multiple Attributes for Watchlist Recommendation in E-Commerce
Figure 2 for Sequential Modeling with Multiple Attributes for Watchlist Recommendation in E-Commerce
Figure 3 for Sequential Modeling with Multiple Attributes for Watchlist Recommendation in E-Commerce
Figure 4 for Sequential Modeling with Multiple Attributes for Watchlist Recommendation in E-Commerce

In e-commerce, the watchlist enables users to track items over time and has emerged as a primary feature, playing an important role in users' shopping journey. Watchlist items typically have multiple attributes whose values may change over time (e.g., price, quantity). Since many users accumulate dozens of items on their watchlist, and since shopping intents change over time, recommending the top watchlist items in a given context can be valuable. In this work, we study the watchlist functionality in e-commerce and introduce a novel watchlist recommendation task. Our goal is to prioritize which watchlist items the user should pay attention to next by predicting the next items the user will click. We cast this task as a specialized sequential recommendation task and discuss its characteristics. Our proposed recommendation model, Trans2D, is built on top of the Transformer architecture, where we further suggest a novel extended attention mechanism (Attention2D) that allows to learn complex item-item, attribute-attribute and item-attribute patterns from sequential-data with multiple item attributes. Using a large-scale watchlist dataset from eBay, we evaluate our proposed model, where we demonstrate its superiority compared to multiple state-of-the-art baselines, many of which are adapted for this task.

* International Conference on Web Search and Data Mining (WSDM), 2022  
Viaarxiv icon

Time Masking for Temporal Language Models

Oct 22, 2021
Guy D. Rosin, Ido Guy, Kira Radinsky

Figure 1 for Time Masking for Temporal Language Models
Figure 2 for Time Masking for Temporal Language Models
Figure 3 for Time Masking for Temporal Language Models
Figure 4 for Time Masking for Temporal Language Models

Our world is constantly evolving, and so is the content on the web. Consequently, our languages, often said to mirror the world, are dynamic in nature. However, most current contextual language models are static and cannot adapt to changes over time. In this work, we propose a temporal contextual language model called TempoBERT, which uses time as an additional context of texts. Our technique is based on modifying texts with temporal information and performing time masking - specific masking for the supplementary time information. We leverage our approach for the tasks of semantic change detection and sentence time prediction, experimenting on diverse datasets in terms of time, size, genre, and language. Our extensive evaluation shows that both tasks benefit from exploiting time masking.

* 9 pages, accepted to WSDM 2022 
Viaarxiv icon

E-Commerce Dispute Resolution Prediction

Oct 13, 2021
David Tsurel, Michael Doron, Alexander Nus, Arnon Dagan, Ido Guy, Dafna Shahaf

Figure 1 for E-Commerce Dispute Resolution Prediction
Figure 2 for E-Commerce Dispute Resolution Prediction
Figure 3 for E-Commerce Dispute Resolution Prediction
Figure 4 for E-Commerce Dispute Resolution Prediction

E-Commerce marketplaces support millions of daily transactions, and some disagreements between buyers and sellers are unavoidable. Resolving disputes in an accurate, fast, and fair manner is of great importance for maintaining a trustworthy platform. Simple cases can be automated, but intricate cases are not sufficiently addressed by hard-coded rules, and therefore most disputes are currently resolved by people. In this work we take a first step towards automatically assisting human agents in dispute resolution at scale. We construct a large dataset of disputes from the eBay online marketplace, and identify several interesting behavioral and linguistic patterns. We then train classifiers to predict dispute outcomes with high accuracy. We explore the model and the dataset, reporting interesting correlations, important features, and insights.

* CIKM'20: Proceedings of the 29th ACM International Conference on Information and Knowledge Management, Oct 2020, Pages 1465-1474  
Viaarxiv icon

Event-Driven Query Expansion

Dec 22, 2020
Guy D. Rosin, Ido Guy, Kira Radinsky

Figure 1 for Event-Driven Query Expansion
Figure 2 for Event-Driven Query Expansion
Figure 3 for Event-Driven Query Expansion
Figure 4 for Event-Driven Query Expansion

A significant number of event-related queries are issued in Web search. In this paper, we seek to improve retrieval performance by leveraging events and specifically target the classic task of query expansion. We propose a method to expand an event-related query by first detecting the events related to it. Then, we derive the candidates for expansion as terms semantically related to both the query and the events. To identify the candidates, we utilize a novel mechanism to simultaneously embed words and events in the same vector space. We show that our proposed method of leveraging events improves query expansion performance significantly compared with state-of-the-art methods on various newswire TREC datasets.

* 9 pages, WSDM 2021 
Viaarxiv icon

Reciprocal Recommender Systems: Analysis of State-of-Art Literature, Challenges and Opportunities on Social Recommendation

Jul 17, 2020
Ivan Palomares, Carlos Porcel, Luiz Pizzato, Ido Guy, Enrique Herrera-Viedma

Figure 1 for Reciprocal Recommender Systems: Analysis of State-of-Art Literature, Challenges and Opportunities on Social Recommendation
Figure 2 for Reciprocal Recommender Systems: Analysis of State-of-Art Literature, Challenges and Opportunities on Social Recommendation
Figure 3 for Reciprocal Recommender Systems: Analysis of State-of-Art Literature, Challenges and Opportunities on Social Recommendation
Figure 4 for Reciprocal Recommender Systems: Analysis of State-of-Art Literature, Challenges and Opportunities on Social Recommendation

Many social services including online dating, social media, recruitment and online learning, largely rely on \matching people with the right people". The success of these services and the user experience with them often depends on their ability to match users. Reciprocal Recommender Systems (RRS) arose to facilitate this process by identifying users who are a potential match for each other, based on information provided by them. These systems are inherently more complex than user-item recommendation approaches and unidirectional user recommendation services, since they need to take into account both users' preferences towards each other in the recommendation process. This entails not only predicting accurate preference estimates as classical recommenders do, but also defining adequate fusion processes for aggregating user-to-user preferential information. The latter is a crucial and distinctive, yet barely investigated aspect in RRS research. This paper presents a snapshot analysis of the extant literature to summarize the state-of-the-art RRS research to date, focusing on the fundamental features that differentiate RRSs from other classes of recommender systems. Following this, we discuss the challenges and opportunities for future research on RRSs, with special focus on (i) fusion strategies to account for reciprocity and (ii) emerging application domains related to social recommendation.

* 53 pages, 6 figures, 8 tables, 176 references 
Viaarxiv icon

Beyond Personalization: Research Directions in Multistakeholder Recommendation

May 01, 2019
Himan Abdollahpouri, Gediminas Adomavicius, Robin Burke, Ido Guy, Dietmar Jannach, Toshihiro Kamishima, Jan Krasnodebski, Luiz Pizzato

Figure 1 for Beyond Personalization: Research Directions in Multistakeholder Recommendation
Figure 2 for Beyond Personalization: Research Directions in Multistakeholder Recommendation
Figure 3 for Beyond Personalization: Research Directions in Multistakeholder Recommendation
Figure 4 for Beyond Personalization: Research Directions in Multistakeholder Recommendation

Recommender systems are personalized information access applications; they are ubiquitous in today's online environment, and effective at finding items that meet user needs and tastes. As the reach of recommender systems has extended, it has become apparent that the single-minded focus on the user common to academic research has obscured other important aspects of recommendation outcomes. Properties such as fairness, balance, profitability, and reciprocity are not captured by typical metrics for recommender system evaluation. The concept of multistakeholder recommendation has emerged as a unifying framework for describing and understanding recommendation settings where the end user is not the sole focus. This article describes the origins of multistakeholder recommendation, and the landscape of system designs. It provides illustrative examples of current research, as well as outlining open questions and research directions for the field.

* 66 pages 
Viaarxiv icon