Pages that link to "Item:Q869973"
From MaRDI portal
The following pages link to Risk bounds for statistical learning (Q869973):
Displaying 50 items.
- Fast rates for empirical vector quantization (Q351685) (← links)
- Inverse statistical learning (Q364201) (← links)
- A statistical view of clustering performance through the theory of \(U\)-processes (Q392047) (← links)
- Risk bounds for CART classifiers under a margin condition (Q437488) (← links)
- General nonexact oracle inequalities for classes with a subexponential envelope (Q447832) (← links)
- Margin-adaptive model selection in statistical learning (Q453298) (← links)
- Classification algorithms using adaptive partitioning (Q482871) (← links)
- Optimal exponential bounds on the accuracy of classification (Q485316) (← links)
- A new method for estimation and model selection: \(\rho\)-estimation (Q510164) (← links)
- Sharper lower bounds on the performance of the empirical risk minimization algorithm (Q637070) (← links)
- Optimal model selection for density estimation of stationary data under various mixing condi\-tions (Q651014) (← links)
- A high-dimensional Wilks phenomenon (Q718891) (← links)
- Fast learning rates for plug-in classifiers (Q995418) (← links)
- Learning from binary labels with instance-dependent noise (Q1631810) (← links)
- Localization of VC classes: beyond local Rademacher complexities (Q1663641) (← links)
- Best subset binary prediction (Q1668571) (← links)
- Discussion of ``On concentration for (regularized) empirical risk minimization'' by Sara van de Geer and Martin Wainwright (Q1688424) (← links)
- Relative deviation learning bounds and generalization with unbounded loss functions (Q1714946) (← links)
- Improved classification rates under refined margin conditions (Q1746541) (← links)
- Optimal upper and lower bounds for the true and empirical excess risks in heteroscedastic least-squares regression (Q1950830) (← links)
- Upper bounds and aggregation in bipartite ranking (Q1951156) (← links)
- Classification with minimax fast rates for classes of Bayes rules with sparse representation (Q1951772) (← links)
- Penalized empirical risk minimization over Besov spaces (Q1952004) (← links)
- A local maximal inequality under uniform entropy (Q1952182) (← links)
- Minimax semi-supervised set-valued approach to multi-class classification (Q1983613) (← links)
- Model selection in utility-maximizing binary prediction (Q2024476) (← links)
- A MOM-based ensemble method for robustness, subsampling and hyperparameter tuning (Q2044333) (← links)
- Set structured global empirical risk minimizers are rate optimal in general dimensions (Q2054522) (← links)
- Optimal linear discriminators for the discrete choice model in growing dimensions (Q2073710) (← links)
- A no-free-lunch theorem for multitask learning (Q2112800) (← links)
- On least squares estimation under heteroscedastic and heavy-tailed errors (Q2119229) (← links)
- On robust learning in the canonical change point problem under heavy tailed errors in finite and growing dimensions (Q2136638) (← links)
- Optimal functional supervised classification with separation condition (Q2174981) (← links)
- Robust machine learning by median-of-means: theory and practice (Q2196199) (← links)
- On biased random walks, corrupted intervals, and learning under adversarial design (Q2202524) (← links)
- Learning the distribution of latent variables in paired comparison models with round-robin scheduling (Q2203618) (← links)
- Convergence rates of least squares regression estimators with heavy-tailed errors (Q2313287) (← links)
- Nonasymptotic bounds for vector quantization in Hilbert spaces (Q2343956) (← links)
- Minimax fast rates for discriminant analysis with errors in variables (Q2345118) (← links)
- Model selection by bootstrap penalization for classification (Q2384135) (← links)
- Statistical performance of support vector machines (Q2426613) (← links)
- Ranking and empirical minimization of \(U\)-statistics (Q2426626) (← links)
- Rates of convergence in active learning (Q2429933) (← links)
- Empirical risk minimization is optimal for the convex aggregation problem (Q2435238) (← links)
- Simultaneous adaptation to the margin and to complexity in classification (Q2456017) (← links)
- Optimal rates of aggregation in classification under low noise assumption (Q2469663) (← links)
- Concentration inequalities and asymptotic results for ratio type empirical processes (Q2497173) (← links)
- Bandwidth selection in kernel empirical risk minimization via the gradient (Q2515491) (← links)
- Gibbs posterior concentration rates under sub-exponential type losses (Q2692523) (← links)
- Fast rate of convergence in high-dimensional linear discriminant analysis (Q3021183) (← links)
