9 citations · 16 across the 8 of their papers we have counts for
8 papers
Training set cleansing of backdoor poisoning by self-supervised representation learning
H. Wang, S. Karami, O. Dia +6
A backdoor or Trojan attack is an important type of data poisoning attack against deep neural network (DNN) classifiers, wherein the training dataset is poisoned with a small numbe…
Active Learning for Non-Parametric Choice Models
Fransisca Susan, Negin Golrezaei, Ehsan Emamjomeh-Zadeh +1
We study the problem of actively learning a non-parametric choice model based on consumers' decisions. We present a negative result showing that such choice models may not be ident…
Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds
Ehsan Emamjomeh-Zadeh, Chen-Yu Wei, Haipeng Luo +1
We revisit the problem of online learning with sleeping experts/bandits: in each time step, only a subset of the actions are available for the algorithm to choose from (and learn a…
The Complexity of Interactively Learning a Stable Matching by Trial and Error
Ehsan Emamjomeh-Zadeh, Yannai A. Gonczarowski, David Kempe
In a stable matching setting, we consider a query model that allows for an interactive learning algorithm to make precisely one type of query: proposing a matching, the response to…
A General Framework for Robust Interactive Learning
Ehsan Emamjomeh-Zadeh, David Kempe
We propose a general framework for interactively learning models, such as (binary or non-binary) classifiers, orderings/rankings of items, or clusterings of data points. Our framew…
Adaptive Hierarchical Clustering Using Ordinal Queries
Ehsan Emamjomeh-Zadeh, David Kempe
In many applications of clustering (for example, ontologies or clusterings of animal or plant species), hierarchical clusterings are more descriptive than a flat clustering. A hier…
Mixture Selection, Mechanism Design, and Signaling
Yu Cheng, Ho Yee Cheung, Shaddin Dughmi +3
We pose and study a fundamental algorithmic problem which we term mixture selection, arising as a building block in a number of game-theoretic applications: Given a function fr…
Deterministic and Probabilistic Binary Search in Graphs
Ehsan Emamjomeh-Zadeh, David Kempe, Vikrant Singhal
We consider the following natural generalization of Binary Search: in a given undirected, positively weighted graph, one vertex is a target. The algorithm's task is to identify the…