Approximate Minimization of the Regularized Expected Error over Kernel Models
From MaRDI portal
Publication:3168992
DOI10.1287/moor.1080.0317zbMath1216.68135MaRDI QIDQ3168992
Vera Kurková, Marcello Sanguineti
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1080.0317
rates of convergence; kernel methods; model complexity; convex functionals; suboptimal solutions; expected error
68Q32: Computational learning theory
90C48: Programming in abstract spaces
41A25: Rate of convergence, degree of approximation
58E50: Applications of variational problems in infinite-dimensional spaces to the sciences
Related Items
Suboptimal Policies for Stochastic $$N$$-Stage Optimization: Accuracy Analysis and a Case Study from Optimal Consumption, Learning with Boundary Conditions, Can dictionary-based computational models outperform the best linear ones?, Functional optimization by variable-basis approximation schemes, Suboptimal solutions to dynamic optimization problems via approximations of the policy functions, New insights into Witsenhausen's counterexample, Estimates of variation with respect to a set and applications to optimization problems, Estimates of the approximation error using Rademacher complexity: Learning vector-valued functions, On spectral windows in supervised learning from data, A meta-learning approach to the regularized learning -- case study: blood glucose prediction, Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
Uses Software
