scientific article

Massimiliano Pontil, Charles A. Micchelli

Publication date: 12 October 2011

Full work available at URL: http://www.jmlr.org/papers/v6/micchelli05a.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (68)

Optimal sampling points in reproducing kernel Hilbert spaces ⋮ Kernels for Linear Time Invariant System Identification ⋮ Multi-penalty regularization in learning theory ⋮ Feature space perspectives for learning the kernel ⋮ Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions ⋮ Learning with sample dependent hypothesis spaces ⋮ Error bounds of multi-graph regularized semi-supervised classification ⋮ A Bayesian approach to sparse dynamic network identification ⋮ The optimal solution of multi-kernel regularization learning ⋮ Kernel-Based Discretization for Solving Matrix-Valued PDEs ⋮ Fast learning rate of non-sparse multiple kernel learning and optimal regularization strategies ⋮ Distributed parametric and nonparametric regression with on-line performance bounds computation ⋮ Multi-kernel regularized classifiers ⋮ Multiple Kernel Learningの学習理論 ⋮ Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness ⋮ The two-sample problem for Poisson processes: adaptive tests with a nonasymptotic wild bootstrap approach ⋮ A linear functional strategy for regularized ranking ⋮ Manifold regularization based on Nyström type subsampling ⋮ Multi-task learning via linear functional strategy ⋮ Convex optimization in sums of Banach spaces ⋮ Learning the kernel matrix by maximizing a KFD-based class separability criterion ⋮ The learning rate of \(l_2\)-coefficient regularized classification with strong loss ⋮ Regularizing multiple kernel learning using response surface methodology ⋮ Least square regression with indefinite kernels and coefficient regularization ⋮ Learning with optimal interpolation norms ⋮ Sparsity in multiple kernel learning ⋮ Learning rates for the kernel regularized regression with a differentiable strongly convex loss ⋮ When is there a representer theorem? Nondifferentiable regularisers and Banach spaces ⋮ SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels ⋮ A meta-learning approach to the regularized learning -- case study: blood glucose prediction ⋮ Bayesian pathway selection ⋮ High-speed train localization algorithm via cooperative multi-classifier network using distributed heterogeneous signals ⋮ Group online adaptive learning ⋮ Error bounds for \(l^p\)-norm multiple kernel learning with least square loss ⋮ Adaptive kernel methods using the balancing principle ⋮ Fast learning of relational kernels ⋮ Refined Rademacher Chaos Complexity Bounds with Applications to the Multikernel Learning Problem ⋮ Proximal methods for the latent group lasso penalty ⋮ A multiscale support vector regression method on spheres with data compression ⋮ Multilevel augmentation algorithms based on fast collocation methods for solving ill-posed integral equations ⋮ Behavior of a functional in learning theory ⋮ Multiscale support vector approach for solving ill-posed problems ⋮ Orthogonality from disjoint support in reproducing kernel Hilbert spaces ⋮ Online primal-dual learning for a data-dependent multi-kernel combination model with multiclass visual categorization applications ⋮ Discriminatively regularized least-squares classification ⋮ Classifier learning with a new locality regularization method ⋮ Learning the coordinate gradients ⋮ Multi-parameter regularization and its numerical realization ⋮ Evolution strategies based adaptive \(L_{p}\) LS-SVM ⋮ Learning rates of multi-kernel regularized regression ⋮ Approximation of kernel matrices by circulant matrices and its application in kernel selection methods ⋮ Sampling and Stability ⋮ Balancing principle in supervised learning for a general regularization scheme ⋮ Approximation of high-dimensional kernel matrices by multilevel circulant matrices ⋮ Learning with Kernels and Logical Representations ⋮ When is there a representer theorem? Reflexive Banach spaces ⋮ Another look at linear programming for feature selection via methods of regularization ⋮ Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions ⋮ Sparse RKHS estimation via globally convex optimization and its application in LPV-IO identification ⋮ Modeling interactive components by coordinate kernel polynomial models ⋮ On extension theorems and their connection to universal consistency in machine learning ⋮ Error bounds for learning the kernel ⋮ Multikernel Regression with Sparsity Constraint ⋮ Improvement of multiple kernel learning using adaptively weighted regularization ⋮ Parameter Choice Strategies for Least-squares Approximation of Noisy Smooth Functions on the Sphere ⋮ Learning rates for partially linear support vector machine in high dimensions ⋮ Unnamed Item ⋮ Error analysis of the kernel regularized regression based on refined convex losses and RKBSs

This page was built for publication: