We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
Many image denoising methods can be characterized as minimizing "loss + penalty," where the "loss" measures the fidelity of the denoised image to the data, and ...
Traditional classification methods assume that the training and the test data arise from the same underlying distribution. However, in several adversarial settings, the test set is...
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
Choon Hui Teo, S. V. N. Vishwanathan, Alex J. Smol...