Daniel Lowd is an Associate Professor in the Department of Computer and Information Science at the University of Oregon. His research interests include machine learning and artificial intelligence, focusing on adversarial methods and statistical relational models. He received his Ph.D. in 2010 from the University of Washington. He has received a Google Faculty Award, an ARO Young Investigator Award, and a best paper award from DEXA.
BS, 2003, Harvey Mudd College
MS, 2005, Washington
PhD, 2010, Washington
Daniel Lowd's research is in statistical machine learning, with a focus on statistical relational learning and adversarial machine learning. These areas relax the traditional machine learning assumption that training examples are independent and identically distributed, and that future data will be drawn from the same distribution.
Statistical relational learning focuses on the relationships among the examples, such as links among Web pages, friendship in a social network, or protein interactions in bioinformatics. This is done by by combining a relational representation, such as first-order logic, with a statistical representation, such as Markov or Bayesian networks.
Adversarial machine learning deals with domains where an adversary is actively trying to evade detection. For example, spammers often try to disguise their emails by changing or adding words. By modeling the machine learning problem as a game, we hope to automatically build classifiers that are not so easily tricked.