Oracle-efficient algorithms for online learning with smoothed and hint-adversaries.
problem Online learning with beyond worst-case adversaries.
method Oracle-efficient algorithms for two settings: smoothed analysis and -hint transductive learning.
result Oracle-efficient regret bounds for learning real-valued and binary-valued functions.