Pages that link to "Item:Q5963450"
From MaRDI portal
The following pages link to On the convergence rate and some applications of regularized ranking algorithms (Q5963450):
Displaying 16 items.
- The convergence rate of a regularized ranking algorithm (Q692563) (← 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)
- A meta-learning approach to the regularized learning -- case study: blood glucose prediction (Q1941597) (← links)
- Convergence of online pairwise regression learning with quadratic loss (Q2191834) (← links)
- Bias corrected regularization kernel method in ranking (Q4615656) (← links)
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions (Q4968723) (← links)
- Comparison theorems on large-margin learning (Q5022946) (← links)
- Distributed spectral pairwise ranking algorithms (Q5060714) (← links)
- Ranking with a P-Norm Push (Q5307595) (← links)
- Learning rates for regularized least squares ranking algorithm (Q5356934) (← 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)
- Analysis of regularized least squares ranking with centered reproducing kernel (Q6591691) (← links)
