55 citations · 100 across the 7 of their papers we have counts for
8 papers
Optimal Binary Classification Beyond Accuracy
Shashank Singh, Justin Khim
The vast majority of statistical theory on binary classification characterizes performance in terms of accuracy. However, accuracy is known in many cases to poorly reflect the prac…
Class-Weighted Classification: Trade-offs and Robust Approaches
Ziyu Xu, Chen Dan, Justin Khim +1
We address imbalanced classification, the problem in which a label may have low marginal probability relative to other labels, by weighting losses according to the correct class. F…
Multiclass Classification via Class-Weighted Nearest Neighbors
Justin Khim, Ziyu Xu, Shashank Singh
We study statistical properties of the k-nearest neighbors algorithm for multiclass classification, with a focus on settings where the number of classes may be large and/or classes…
Adversarial Risk Bounds via Function Transformation
Justin Khim, Po-Ling Loh
We derive bounds for a notion of adversarial risk, designed to characterize the robustness of linear and neural network classifiers to adversarial perturbations. Specifically, we i…
A theory of maximum likelihood for weighted infection graphs
Justin Khim, Po-Ling Loh
We study the problem of parameter estimation based on infection data from an epidemic outbreak on a graph. We assume that successive infections occur via contagion; i.e., transmiss…
Permutation Tests for Infection Graphs
Justin Khim, Po-Ling Loh
We formulate and analyze a novel hypothesis testing problem for inferring the edge structure of an infection graph. In our model, a disease spreads over a network via contagion or…
Adversarial Influence Maximization
Justin Khim, Varun Jog, Po-Ling Loh
We consider the problem of influence maximization in fixed networks for contagion models in an adversarial setting. The goal is to select an optimal set of nodes to seed the influe…
Confidence Sets for the Source of a Diffusion in Regular Trees
Justin Khim, Po-Ling Loh
We study the problem of identifying the source of a diffusion spreading over a regular tree. When the degree of each node is at least three, we show that it is possible to construc…