30 citations · 31 across the 4 of their papers we have counts for
6 papers
On the Efficient Implementation of High Accuracy Optimality of Profile Maximum Likelihood
Moses Charikar, Zhihao Jiang, Kirankumar Shiragur +1
We provide an efficient unified plug-in approach for estimating symmetric properties of distributions given independent samples. Our estimator is based on profile-maximum-likel…
Fair for All: Best-effort Fairness Guarantees for Classification
Anilesh K. Krishnaswamy, Zhihao Jiang, Kangning Wang +2
Standard approaches to group-based notions of fairness, such as \emph{parity} and \emph{equalized odds}, try to equalize absolute measures of performance across known groups (based…
Online Algorithms for Weighted Paging with Predictions
Zhihao Jiang, Debmalya Panigrahi, Kevin Sun
In this paper, we initiate the study of the weighted paging problem with predictions. This continues the recent line of work in online algorithms with predictions, particularly tha…
Approximately Stable Committee Selection
Zhihao Jiang, Kamesh Munagala, Kangning Wang
In the committee selection problem, we are given candidates, and voters. Candidates can have different weights. A committee is a subset of candidates, and its weight is the…
Group Fairness in Committee Selection
Yu Cheng, Zhihao Jiang, Kamesh Munagala +1
In this paper, we study fairness in committee selection problems. We consider a general notion of fairness via stability: A committee is stable if no coalition of voters can deviat…
An FPTAS for Stochastic Unbounded Min-Knapsack Problem
Zhihao Jiang, Haoyu Zhao
In this paper, we study the stochastic unbounded min-knapsack problem (). The ordinary unbounded min-knapsack problem states that: There are types of items,…