Pages that link to "Item:Q3373749"
From MaRDI portal
The following pages link to Theory of Classification: a Survey of Some Recent Advances (Q3373749):
Displaying 45 items.
- Optimal functional supervised classification with separation condition (Q2174981) (← links)
- Local nearest neighbour classification with applications to semi-supervised learning (Q2196247) (← links)
- Robust classification via MOM minimization (Q2203337) (← links)
- Concentration inequalities for two-sample rank processes with application to bipartite ranking (Q2233587) (← links)
- Learning sets with separating kernels (Q2252512) (← links)
- Maxisets for model selection (Q2267395) (← links)
- When are epsilon-nets small? (Q2304628) (← links)
- Minimax fast rates for discriminant analysis with errors in variables (Q2345118) (← links)
- Statistical active learning algorithms for noise tolerance and differential privacy (Q2345952) (← links)
- Model selection by bootstrap penalization for classification (Q2384135) (← links)
- Guest editorial: Learning theory (Q2384140) (← links)
- Fast learning rates in statistical inference through aggregation (Q2388975) (← links)
- Ranking and empirical minimization of \(U\)-statistics (Q2426626) (← links)
- Properties of convergence of a fuzzy set estimator of the density function (Q2427785) (← links)
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods (Q2444590) (← 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)
- Bandwidth selection in kernel empirical risk minimization via the gradient (Q2515491) (← links)
- Agnostic active learning (Q2517826) (← links)
- Mathematical methods of randomized machine learning (Q2662930) (← links)
- Learning bounds for quantum circuits in the agnostic setting (Q2685576) (← links)
- Supervised Learning by Support Vector Machines (Q2789826) (← links)
- Measuring the Capacity of Sets of Functions in the Analysis of ERM (Q2805728) (← links)
- Permutational Rademacher Complexity (Q2835630) (← links)
- Consistency of learning algorithms using Attouch–Wets convergence (Q3225085) (← links)
- Sample Complexity of Classifiers Taking Values in ℝ<sup><i>Q</i></sup>, Application to Multi-Class SVMs (Q3562430) (← links)
- Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm (Q3648754) (← links)
- Strong Lp convergence of wavelet deconvolution density estimators (Q4602844) (← links)
- (Q4633035) (← links)
- Optimal survey schemes for stochastic gradient descent with applications to <i>M</i>-estimation (Q4967801) (← links)
- (Q4998891) (← links)
- (Q4999003) (← links)
- (Q5053288) (← links)
- Combinatorial bounds of overfitting for threshold classifiers (Q5137158) (← links)
- Structure from Randomness in Halfspace Learning with the Zero-One Loss (Q5139592) (← links)
- Sampling and empirical risk minimization (Q5276167) (← links)
- Classification with reject option (Q5295962) (← links)
- Concentration Inequalities for Samples without Replacement (Q5369328) (← links)
- Variance-based regularization with convex objectives (Q5381122) (← links)
- (Q5381137) (← links)
- Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming (Q5869814) (← links)
- For interpolating kernel machines, minimizing the norm of the ERM solution maximizes stability (Q5873932) (← links)
- Neural network approximation (Q5887830) (← links)
- Some properties of Gaussian reproducing kernel Hilbert spaces and their implications for function approximation and learning theory (Q5962345) (← links)
- SVRG meets AdaGrad: painless variance reduction (Q6097116) (← links)
