scientific article; zbMATH DE number 6276155
From MaRDI portal
Publication:5405164
zbMath1303.62026MaRDI QIDQ5405164
Publication date: 1 April 2014
Full work available at URL: http://www.jmlr.org/papers/v13/rejchel12a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonparametric estimation (62G05) Learning and adaptive systems in artificial intelligence (68T05) Statistical ranking and selection procedures (62F07)
Related Items (26)
Online regularized learning with pairwise loss functions ⋮ Distributed spectral pairwise ranking algorithms ⋮ Convergence of online pairwise regression learning with quadratic loss ⋮ Error analysis of kernel regularized pairwise learning with a strongly convex loss ⋮ Optimality of regularized least squares ranking with imperfect kernels ⋮ Learning rates for regularized least squares ranking algorithm ⋮ On the variable bandwidth kernel estimation of conditional \(U\)-statistics at optimal rates in sup-norm ⋮ Uniform consistency and uniform in bandwidth consistency for nonparametric regression estimates and conditional U-statistics involving functional data ⋮ The performance of semi-supervised Laplacian regularized regression with the least square loss ⋮ Refined Rademacher Chaos Complexity Bounds with Applications to the Multikernel Learning Problem ⋮ Refined Generalization Bounds of Gradient Learning over Reproducing Kernel Hilbert Spaces ⋮ Online Pairwise Learning Algorithms ⋮ Stability and optimization error of stochastic gradient descent for pairwise learning ⋮ Query-dependent ranking and its asymptotic properties ⋮ Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity ⋮ U-Processes and Preference Learning ⋮ Learning rate of support vector machine for ranking ⋮ Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning ⋮ Unregularized online learning algorithms with general loss functions ⋮ On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization ⋮ Learning rate of magnitude-preserving regularization ranking with dependent samples ⋮ Online pairwise learning algorithms with convex loss functions ⋮ Online regularized pairwise learning with least squares loss ⋮ Regularized ranking with convex losses and \(\ell^1\)-penalty ⋮ Debiased magnitude-preserving ranking: learning rate and bias characterization ⋮ Extreme learning machine for ranking: generalization analysis and applications
This page was built for publication:
