scientific article
From MaRDI portal
Publication:2880888
zbMath1235.68123MaRDI QIDQ2880888
Shivani Agarwal, Partha Niyogi
Publication date: 17 April 2012
Full work available at URL: http://www.jmlr.org/papers/v10/agarwal09a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Online regularized learning with pairwise loss functions, One-pass AUC optimization, Distributed spectral pairwise ranking algorithms, Online regularized pairwise learning with non-i.i.d. observations, On the robustness of regularized pairwise learning methods based on kernels, A linear functional strategy for regularized ranking, 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, Analysis of convergence performance of neural networks ranking algorithm, Bias corrected regularization kernel method in ranking, Supervised multidimensional scaling for visualization, classification, and bipartite ranking, The performance of semi-supervised Laplacian regularized regression with the least square loss, Learning to rank on graphs, Online Pairwise Learning Algorithms, Stability and optimization error of stochastic gradient descent for pairwise learning, Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity, Generalization performance of bipartite ranking algorithms with convex losses, Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning, Robust pairwise learning with Huber loss, Unregularized online learning algorithms with general loss functions, Generalization ability of online pairwise support vector machine, The convergence rate of a regularized ranking algorithm, Approximation analysis of gradient descent algorithm for bipartite ranking, On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization, Stability analysis of learning algorithms for ontology similarity computation, Randomized smoothing variance reduction method for large-scale non-smooth convex optimization, On the convergence rate and some applications of regularized ranking algorithms, Learning rate of magnitude-preserving regularization ranking with dependent samples, Online pairwise learning algorithms with convex loss functions, The \(\mathrm{r}\)-\(\mathrm{d}\) class predictions in linear mixed models, Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions, Online regularized pairwise learning with least squares loss, Convergence analysis of distributed multi-penalty regularized pairwise learning, On extension theorems and their connection to universal consistency in machine learning, Debiased magnitude-preserving ranking: learning rate and bias characterization, Extreme learning machine for ranking: generalization analysis and applications, Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion
