I am an Assistant Professor of Computer Science at Harvard University.
I am interested in understanding how to design algorithms with provable guarantees in environments with limited and noisy information. This largely spans optimization, approximation algorithms, machine learning theory, information networks, game theory, and mechanism design. For more information see my publications.
Before coming to Harvard, I was a postdoc at Google Research, and slightly before that I was a graduate student at UC Berkeley where I was fortunate to be advised by Christos Papadimitriou.
My work is generously supported by an NSF CAREER Award, Google Faculty Research Award, Facebook Faculty Award, NSF grant, DARPA, and a BSF grant. As a graduate student, I received the Microsoft Research fellowship and the Facebook fellowship.
I recently organized a workshop on algorithms and machine learning at Harvard, and a workshop on networks held in conjunction with ACM EC 2015.
This semester I'm teaching CS 134: Networks. In Spring 2016 I taught AM 221: Advanced Optimization. In Fall 2015 I co-developed and co-taught the networks course with Ben Golub. I previously taught (Social) Data Mining in Fall 2014, AM 221: Advanced Optimization in Spring 2014, and CS 284r: Incentives and Information in Networks in Fall 2013.
I serve(d) on the committees of FOCS 2017, ICML 2017, KDD 2017, EC 2017, NIPS 2016, ICML 2016, WSDM 2016, ITCS 2016, STOC 2015, KDD 2015, EC 2015, WSDM 2015, WINE 2014, EC 2014, WWW 2014, WSDM 2013, WINE 2013, EC 2013, HCOMP 2012.
I sit in Maxwell Dworkin 239, 33 Oxford St., Cambridge, MA 02138, and my email is yar_on@sea_s.harv_ard.ed_u (humans: ignore the underscores).