Pages that link to "Item:Q1884608"

The following pages link to Optimal aggregation of classifiers in statistical learning. (Q1884608):

Displaying 50 items.

• Optimal upper and lower bounds for the true and empirical excess risks in heteroscedastic least-squares regression (Q1950830) (← links)
• Oracle inequalities for cross-validation type procedures (Q1950881) (← 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)
• General oracle inequalities for model selection (Q1951973) (← links)
• The false discovery rate for statistical pattern recognition (Q1951997) (← links)
• Penalized empirical risk minimization over Besov spaces (Q1952004) (← links)
• On the optimality of the aggregate with exponential weights for low temperatures (Q1952438) (← links)
• Adaptive kernel methods using the balancing principle (Q1959089) (← links)
• Surrogate losses in passive and active learning (Q2008623) (← links)
• Unregularized online algorithms with varying Gaussians (Q2035494) (← 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)
• Multiplier \(U\)-processes: sharp bounds and applications (Q2073203) (← links)
• Adaptive learning rates for support vector machines working on data with low intrinsic dimension (Q2073699) (← links)
• Optimal linear discriminators for the discrete choice model in growing dimensions (Q2073710) (← links)
• Adaptive transfer learning (Q2073726) (← links)
• Two-level monotonic multistage recommender systems (Q2074300) (← links)
• Generalization error bounds of dynamic treatment regimes in penalized regression-based learning (Q2091828) (← links)
• Tnn: a transfer learning classifier based on weighted nearest neighbors (Q2101480) (← links)
• A no-free-lunch theorem for multitask learning (Q2112800) (← links)
• Convergence rates of deep ReLU networks for multiclass classification (Q2137813) (← links)
• Reweighting samples under covariate shift using a Wasserstein distance criterion (Q2154951) (← links)
• Robust statistical learning with Lipschitz and convex loss functions (Q2174664) (← links)
• Quantitative convergence analysis of kernel based large-margin unified machines (Q2191836) (← links)
• Deviation inequalities for random polytopes in arbitrary convex bodies (Q2203612) (← links)
• ERM and RERM are optimal estimators for regression problems when malicious outliers corrupt the labels (Q2209821) (← links)
• Performance guarantees for policy learning (Q2227481) (← links)
• Optimal rates for nonparametric F-score binary classification via post-processing (Q2239315) (← links)
• Robustness of learning algorithms using hinge loss with outlier indicators (Q2292231) (← links)
• Conditional probability estimation based classification with class label missing at random (Q2293539) (← links)
• Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions (Q2313281) (← links)
• Minimax fast rates for discriminant analysis with errors in variables (Q2345118) (← links)
• Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder) (Q2373576) (← links)
• Model selection by bootstrap penalization for classification (Q2384135) (← links)
• Fast learning rates in statistical inference through aggregation (Q2388975) (← links)
• Asymptotic normality of plug-in level set estimates (Q2389605) (← links)
• Approximation on variable exponent spaces by linear integral operators (Q2406897) (← links)
• Statistical performance of support vector machines (Q2426613) (← links)
• High-dimensional generalized linear models and the lasso (Q2426617) (← links)
• Ranking and empirical minimization of \(U\)-statistics (Q2426626) (← links)
• Rates of convergence in active learning (Q2429933) (← links)
• Recursive aggregation of estimators by the mirror descent algorithm with averaging (Q2432961) (← links)
• Empirical risk minimization is optimal for the convex aggregation problem (Q2435238) (← links)
• Fast learning from \(\alpha\)-mixing observations (Q2443266) (← links)
• Optimal learning with \textit{Q}-aggregation (Q2448729) (← 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)
• Estimation of regression contour clusters -- an application of the excess mass approach to regression (Q2485989) (← links)
• Concentration inequalities and asymptotic results for ratio type empirical processes (Q2497173) (← links)