Pages that link to "Item:Q2426626"
From MaRDI portal
The following pages link to Ranking and empirical minimization of \(U\)-statistics (Q2426626):
Displaying 50 items.
- Generalization bounds for metric and similarity learning (Q255367) (← links)
- One-pass AUC optimization (Q286076) (← links)
- On the robustness of regularized pairwise learning methods based on kernels (Q325147) (← links)
- Robust estimation of \(U\)-statistics (Q335650) (← links)
- Ranking data with ordinal labels: optimality and pairwise aggregation (Q374178) (← links)
- A statistical view of clustering performance through the theory of \(U\)-processes (Q392047) (← links)
- Adaptive partitioning schemes for bipartite ranking (Q413849) (← links)
- Rank correlation estimators and their limiting distributions (Q451344) (← links)
- Learning rate of support vector machine for ranking (Q468458) (← links)
- Generalization performance of bipartite ranking algorithms with convex losses (Q488690) (← links)
- Unregularized online learning algorithms with general loss functions (Q504379) (← links)
- Overlaying classifiers: A practical approach to optimal scoring (Q607486) (← links)
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning (Q669277) (← links)
- The risk of trivial solutions in bipartite top ranking (Q669314) (← links)
- The convergence rate of a regularized ranking algorithm (Q692563) (← links)
- Debiased magnitude-preserving ranking: learning rate and bias characterization (Q777111) (← links)
- Learning rates of multi-kernel regularized regression (Q974504) (← links)
- Learning from binary labels with instance-dependent noise (Q1631810) (← links)
- PAC-Bayesian high dimensional bipartite ranking (Q1642737) (← links)
- Variance reduction in Monte Carlo estimators via empirical variance minimization (Q1709870) (← links)
- Query-dependent ranking and its asymptotic properties (Q1722064) (← links)
- Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity (Q1722329) (← links)
- Approximation analysis of gradient descent algorithm for bipartite ranking (Q1760585) (← links)
- Analysis of convergence performance of neural networks ranking algorithm (Q1942699) (← links)
- Upper bounds and aggregation in bipartite ranking (Q1951156) (← links)
- The false discovery rate for statistical pattern recognition (Q1951997) (← links)
- Learning to rank on graphs (Q1959630) (← links)
- Generalization ability of online pairwise support vector machine (Q1996328) (← links)
- Product-form estimators: exploiting independence to scale up Monte Carlo (Q2066757) (← links)
- Multiplier \(U\)-processes: sharp bounds and applications (Q2073203) (← links)
- Asymptotic linear expansion of regularized M-estimators (Q2075454) (← links)
- A review on instance ranking problems in statistical learning (Q2127240) (← links)
- Empirical variance minimization with applications in variance reduction and optimal control (Q2137023) (← links)
- Solving optimal stopping problems under model uncertainty via empirical dual optimisation (Q2153522) (← links)
- Stochastic AUC optimization with general loss (Q2191849) (← links)
- Concentration inequalities for two-sample rank processes with application to bipartite ranking (Q2233587) (← links)
- Sequential event prediction (Q2251444) (← links)
- On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization (Q2256621) (← links)
- Approximating high-dimensional infinite-order \(U\)-statistics: statistical and computational guarantees (Q2283566) (← links)
- Online pairwise learning algorithms with convex loss functions (Q2293252) (← links)
- Regularized ranking with convex losses and \(\ell^1\)-penalty (Q2319268) (← links)
- Extreme learning machine for ranking: generalization analysis and applications (Q2339398) (← links)
- Online regularized learning with pairwise loss functions (Q2361154) (← links)
- The asymptotics of ranking algorithms (Q2438754) (← links)
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods (Q2444590) (← links)
- Co-clustering separately exchangeable network data (Q2448722) (← links)
- Concordance and value information criteria for optimal treatment decision (Q2656587) (← links)
- Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness (Q2687436) (← links)
- Lasso with convex loss: Model selection consistency and estimation (Q2811411) (← links)
- ℓ<sup>1</sup>-Norm support vector machine for ranking with exponentially strongly mixing sequence (Q2930104) (← links)
