scientific article; zbMATH DE number 5957406

zbMATH Open1222.62078MaRDI QIDQ3174048FDOQ3174048

Qiang Wu, Sayan Mukherjee

Publication date: 12 October 2011

Full work available at URL: http://www.jmlr.org/papers/v7/mukherjee06b.html

Title of this publication is not available (Why is that?)

zbMATH Keywords

variable selectionclassificationreproducing kernel Hilbert spacegeneralization boundsTikhnonov regularization

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Applications of functional analysis in probability theory and statistics (46N30)

Cited In (30)

• Online pairwise learning algorithms with convex loss functions
• Online regularized learning with pairwise loss functions
• Normal estimation on manifolds by gradient learning.
• Performance analysis of the LapRSSLG algorithm in learning theory
• Generalization ability of online pairwise support vector machine
• Learning gradients by a gradient descent algorithm
• Estimating variable structure and dependence in multitask learning via gradients
• Hermite learning with gradient data
• Refined Generalization Bounds of Gradient Learning over Reproducing Kernel Hilbert Spaces
• Derivative reproducing properties for kernel methods in learning theory
• Classification and Regression Using an Outer Approximation Projection-Gradient Method
• Reproducing kernel Hilbert spaces associated with analytic translation-invariant Mercer kernels
• Learning sparse gradients for variable selection and dimension reduction
• Covariance structure approximation via gLasso in high-dimensional supervised classification
• Approximation analysis of gradient descent algorithm for bipartite ranking
• Learning gradients via an early stopping gradient descent method
• Online regularized pairwise learning with least squares loss
• Convergence rate of kernel canonical correlation analysis
• Online Pairwise Learning Algorithms
• Generalization performance of bipartite ranking algorithms with convex losses
• Modeling interactive components by coordinate kernel polynomial models
• Gradient learning in a classification setting by gradient descent
• Online regularized pairwise learning with non-i.i.d. observations
• Unregularized online learning algorithms with general loss functions
• Parzen windows for multi-class classification
• ERM scheme for quantile regression
• Learning the coordinate gradients
• Learning from non-identical sampling for classification
• Learning gradients on manifolds
• Online Classification with Varying Gaussians

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174048)