Pages that link to "Item:Q692563"

The following pages link to The convergence rate of a regularized ranking algorithm (Q692563):

Displaying 17 items.

• Learning rate of support vector machine for ranking (Q468458) (← links)
• Generalization performance of bipartite ranking algorithms with convex losses (Q488690) (← links)
• Debiased magnitude-preserving ranking: learning rate and bias characterization (Q777111) (← links)
• A linear functional strategy for regularized ranking (Q1669294) (← links)
• Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity (Q1722329) (← links)
• On the convergence rate of kernel-based sequential greedy regression (Q1938256) (← links)
• Robust pairwise learning with Huber loss (Q1979426) (← links)
• The \(\mathrm{r}\)-\(\mathrm{d}\) class predictions in linear mixed models (Q2048216) (← links)
• Kernel gradient descent algorithm for information theoretic learning (Q2223567) (← links)
• On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization (Q2256621) (← links)
• Regularized ranking with convex losses and \(\ell^1\)-penalty (Q2319268) (← links)
• Extreme learning machine for ranking: generalization analysis and applications (Q2339398) (← links)
• ℓ¹-Norm support vector machine for ranking with exponentially strongly mixing sequence (Q2930104) (← links)
• Distributed spectral pairwise ranking algorithms (Q5060714) (← links)
• Error analysis of kernel regularized pairwise learning with a strongly convex loss (Q6112862) (← links)
• Optimality of regularized least squares ranking with imperfect kernels (Q6125450) (← links)
• Pairwise learning problems with regularization networks and Nyström subsampling approach (Q6488738) (← links)