augmentation terms and pull them out of the first part of the cost function and show that they basically form a this Hessian penalty this Hessian complexity regularization penalty okay so what that's saying is that data augmentation implicitly implements a hessian complexity regularization on the optimization okay so that's like the theorem here too or just a simple experiment with the CFR 100 data that so this is training epochs in the x-axis this complexity measure in the vertical axis and all we're doing here