Related Experiment Videos
Regularization techniques and suboptimal solutions to optimization problems in learning from data
Giorgio Gnecco1, Marcello Sanguineti
1Departments of Communications, Computer, and System Sciences and of Computer and Information Science, University of Genova, Genova, Italy. giorgio.gnecco@dist.unige.it
Abstract:
Various regularization techniques are investigated in supervised learning from data. Theoretical features of the associated optimization problems are studied, and sparse suboptimal solutions are searched for. Rates of approximate optimization are estimated for sequences of suboptimal solutions formed by linear combinations of n-tuples of computational units, and statistical learning bounds are derived. As hypothesis sets, reproducing kernel Hilbert spaces and their subsets are considered.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Application of Linearization and Approximation
Lagrange Multipliers: Two Constraints
Methods of Medium Optimization
Optimization Problems
Linearization and Approximation