אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

Vapnik’s fundamental theorem of statistical learning establishes a computational equivalence between optimization (Empirical Risk Minimization) and statistical learning. Is the same true for learning in games? We give a precise answer to this question and describe consequences to the computational complexity of solving zero-sum games with best-response oracles.

Joint work with Elad Hazan.