11 citations · 23 across the 8 of their papers we have counts for
8 papers
Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning
Aditya Srinivas Timmaraju, Mehdi Mashayekhi, Mingliang Chen +9
Variances in ad impression outcomes across demographic groups are increasingly considered to be potentially indicative of algorithmic bias in personalized ads systems. While there…
CoRTX: Contrastive Framework for Real-time Explanation
Yu-Neng Chuang, Guanchu Wang, Fan Yang +4
Recent advancements in explainable machine learning provide effective and faithful solutions for interpreting model behaviors. However, many explanation methods encounter efficienc…
Accelerating Shapley Explanation via Contributive Cooperator Selection
Guanchu Wang, Yu-Neng Chuang, Mengnan Du +5
Even though Shapley value provides an effective explanation for a DNN model prediction, the computation relies on the enumeration of all possible input feature coalitions, which le…
A Web Scale Entity Extraction System
Xuanting Cai, Quanbin Ma, Pan Li +4
Understanding the semantic meaning of content on the web through the lens of entities and concepts has many practical advantages. However, when building large-scale entity extracti…
Matching with our Eyes Closed
Gagan Goel, Pushkar Tripathi
Motivated by an application in kidney exchange, we study the following query-commit problem: we are given the set of vertices of a non-bipartite graph G. The set of edges in this g…
Matching with Commitments
Kevin Costello, Prasad Tetali, Pushkar Tripathi
We consider the following stochastic optimization problem first introduced by Chen et al. in \cite{chen}. We are given a vertex set of a random graph where each possible edge is pr…
A Deterministic Algorithm for the Vertex Connectivity Survivable Network Design Problem
Pushkar Tripathi
In the vertex connectivity survivable network design problem we are given an undirected graph G = (V,E) and connectivity requirement r(u,v) for each pair of vertices u,v. We are al…
Optimal Approximation Algorithms for Multi-agent Combinatorial Problems with Discounted Price Functions
Gagan Goel, Pushkar Tripathi, Lei Wang
Submodular functions are an important class of functions in combinatorial optimization which satisfy the natural properties of decreasing marginal costs. The study of these functio…