Jeff M. Phillips

Jeff M. Phillips

Auto-generated profile, based on publicly available information

Jeff M. Phillips

University of Utah

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 September 2019 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
JPJeff M. Phillips
Jeff M. Phillips
WTWai Ming Tai
Wai Ming Tai

9 January 2024 in ACM Transactions on Interactive Intelligent Systems
Verified
Journal Article
Open access
ARArchit Rathore
Archit Rathore
SDSunipa Dev
Sunipa Dev
JPJeff M. Phillips
Jeff M. Phillips
VSVivek Srikumar
Vivek Srikumar
YZYan Zheng
Yan Zheng
BWBei Wang
Bei Wang
Word vector embeddings have been shown to contain and amplify biases in the data they are extracted from. Consequently, many techniques have been proposed to identify, mitigate, and attenuate these biases in word representations. In this article, we utilize interactive visualization to increase the interpretability and accessibility of a collection of state-of-the-art debiasing techniques. To aid this, we present the Visualization of Embedding Representations for deBiasing (VERB) system, an open-source web-based visualization tool that helps users gain a technical understanding and visual intuition of the inner workings of debiasing techniques, with a focus on their geometric properties. In particular, VERB offers easy-to-follow examples that explore the effects of these debiasing techniques on the geometry of high-dimensional word vectors. To help understand how various debiasing techniques change the underlying geometry, VERB decomposes each technique into interpretable sequences of primitive transformations and highlights their effect on the word vectors using dimensionality reduction and interactive visual exploration. VERB is designed to target natural language processing (NLP) practitioners who are designing decision-making systems on top of word embeddings and researchers working with the fairness and ethics of machine learning systems in NLP. It can also serve as a visual medium for education, which helps an NLP novice understand and mitigate biases in word embeddings.

6 January 2013
Verified
Conference Paper
Closed access
JPJeff M. Phillips
Jeff M. Phillips

21 March 2011
Verified
Conference Paper
Open access
PDF file
PAPeyman Afshani
Peyman Afshani
PAPankaj K. Agarwal
Pankaj K. Agarwal
LALars Arge
Lars Arge
KLKasper Green Larsen
Kasper Green Larsen
JPJeff M. Phillips
Jeff M. Phillips
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not dominated by any other input point. If each point's uncertainty is described as a probability distribution over a discrete set of locations, we improve the best known exact solution. We also suggest why we believe our solution might be optimal. Next, we describe simple, near-linear time approximation algorithms for computing the probability of each point lying on the skyline. In addition, some of our methods can be adapted to construct data structures that can efficiently determine the probability of a query point lying on the skyline.

13 May 2024
Verified
Conference Paper
Open access
TYTao Yang
Tao Yang
CHCuize Han
Cuize Han
CLChen Luo
Chen Luo
PGParth Gupta
Parth Gupta
JPJeff M. Phillips
Jeff M. Phillips
QAQingyao Ai
Qingyao Ai
Ranking is at the core of many artificial intelligence (AI) applications, including search engines, recommender systems, etc. Modern ranking systems are often constructed with learning-to-rank (LTR) models built from user behavior signals. While previous studies have demonstrated the effectiveness of using user behavior signals (e.g., clicks) as both features and labels of LTR algorithms, we argue that existing LTR algorithms that indiscriminately treat behavior and non-behavior signals in input features could lead to suboptimal performance in practice. Because user behavior signals often have strong correlations with the ranking objective and can only be collected on items that have already been shown to users, directly using behavior signals in LTR could create an exploitation bias that hurts the system performance in the long run. To address the exploitation bias, we propose an uncertainty-aware empirical Bayes based ranking algorithm, referred to as EBRank. Specifically, EBRank uses a sole non-behavior feature-based prior model to get a prior estimation of relevance. In the dynamic training and serving of ranking systems, EBRank uses the observed user behaviors to update posterior relevance estimation instead of concatenating behaviors as features in ranking models. Besides, EBRank additionally applies an uncertainty-aware exploration strategy to explore actively and collect user behaviors for empirical Bayesian modeling. Experiments on three public datasets show that EBRank is effective, practical and significantly outperforms state-of-the-art ranking algorithms.

9 January 2021 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
SDSunipa Dev
Sunipa Dev
SHSafia Hassan
Safia Hassan
JPJeff M. Phillips
Jeff M. Phillips