57 citations · 95 across the 10 of their papers we have counts for
10 papers
Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability
Prathyush Sambaturu, Aparna Gupta, Ian Davidson +3
Improving the explainability of the results from machine learning methods has become an important research goal. Here, we study the problem of making clusters more interpretable by…
A Graph-Based Approach for Active Learning in Regression
Hongjing Zhang, S. S. Ravi, Ian Davidson
Active learning aims to reduce labeling efforts by selectively asking humans to annotate the most important data points from an unlabeled pool and is an example of human-machine in…
Symmetry Properties of Nested Canalyzing Functions
Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi +1
Many researchers have studied symmetry properties of various Boolean functions. A class of Boolean functions, called nested canalyzing functions (NCFs), has been used to model cert…
Adversarial Scheduling in Evolutionary Game Dynamics
Gabriel Istrate, Madhav V. Marathe, S. S. Ravi
Consider a system in which players at nodes of an underlying graph G repeatedly play Prisoner's Dilemma against their neighbors. The players adapt their strategies based on the pas…
Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion
Gabriel Istrate, Madhav V. Marathe, S. S. Ravi
In (Istrate, Marathe, Ravi SODA 2001) we advocated the investigation of robustness of results in the theory of learning in games under adversarial scheduling models. We provide evi…
A mathematical formalism for agent-based modeling
Reinhard Laubenbacher, Abdul S. Jarrah, Henning Mortveit +1
Many complex systems can be modeled as multiagent systems in which the constituent entities (agents) interact with each other. The global dynamics of such a system is determined by…