Pages that link to "Item:Q1884603"
From MaRDI portal
The following pages link to Statistical behavior and consistency of classification methods based on convex risk minimization. (Q1884603):
Displaying 50 items.
- Estimating treatment effect heterogeneity in randomized program evaluation (Q142565) (← links)
- Consistency and generalization bounds for maximum entropy density estimation (Q280753) (← links)
- V-shaped interval insensitive loss for ordinal classification (Q298286) (← links)
- Universally consistent vertex classification for latent positions graphs (Q366983) (← links)
- Linear classifiers are nearly optimal when hidden variables have diverse effects (Q420914) (← links)
- Oracle properties of SCAD-penalized support vector machine (Q433741) (← links)
- Learning sparse gradients for variable selection and dimension reduction (Q439003) (← links)
- Further results on the margin explanation of boosting: new algorithm and experiments (Q439827) (← links)
- Mirror averaging with sparsity priors (Q442083) (← links)
- Generalization ability of fractional polynomial models (Q461189) (← links)
- Does modeling lead to more accurate classification? A study of relative efficiency in linear classification (Q476236) (← links)
- Cox process functional learning (Q500875) (← links)
- Unregularized online learning algorithms with general loss functions (Q504379) (← links)
- Support vector machines based on convex risk functions and general norms (Q513637) (← links)
- Classification with polynomial kernels and \(l^1\)-coefficient regularization (Q514786) (← links)
- Learning rates for multi-kernel linear programming classifiers (Q537615) (← links)
- On qualitative robustness of support vector machines (Q538179) (← links)
- Learning from non-identical sampling for classification (Q541601) (← links)
- Remembering Leo Breiman (Q542912) (← links)
- Multicategory vertex discriminant analysis for high-dimensional data (Q542928) (← links)
- Classification with Gaussians and convex loss. II: Improving error bounds by noise conditions (Q547325) (← links)
- Learning errors of linear programming support vector regression (Q552420) (← links)
- Classification with non-i.i.d. sampling (Q652859) (← links)
- Learning the coordinate gradients (Q695644) (← links)
- PAC-Bayesian bounds for randomized empirical risk minimizers (Q734547) (← links)
- Generalization performance of Lagrangian support vector machine based on Markov sampling (Q830752) (← links)
- Multi-kernel regularized classifiers (Q870343) (← links)
- A review of boosting methods for imbalanced data classification (Q903116) (← links)
- Parzen windows for multi-class classification (Q958247) (← links)
- Learning rates for regularized classifiers using multivariate polynomial kernels (Q958248) (← links)
- Learning from dependent observations (Q958916) (← links)
- Statistical inference of minimum BD estimators and classifiers for varying-dimensional models (Q972890) (← links)
- Fast rates for support vector machines using Gaussian kernels (Q995417) (← links)
- New multicategory boosting algorithms based on multicategory Fisher-consistent losses (Q999662) (← links)
- Robust learning from bites for data mining (Q1020821) (← links)
- On surrogate loss functions and \(f\)-divergences (Q1020983) (← links)
- Convergence rates of generalization errors for margin-based classification (Q1021988) (← links)
- Risk-sensitive loss functions for sparse multi-category classification problems (Q1031681) (← links)
- On boosting kernel regression (Q1031760) (← links)
- The asymptotic optimization of pre-edited ANN classifier (Q1034786) (← links)
- Learning from binary labels with instance-dependent noise (Q1631810) (← links)
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation (Q1640399) (← links)
- Likelihood-free inference via classification (Q1702017) (← links)
- A note on margin-based loss functions in classification (Q1770065) (← links)
- Deformation of log-likelihood loss function for multiclass boosting (Q1784701) (← links)
- On the Bayes-risk consistency of regularized boosting methods. (Q1884602) (← links)
- A meta-cognitive learning algorithm for a fully complex-valued relaxation network (Q1929717) (← links)
- Fast structured prediction using large margin sigmoid belief networks (Q1931609) (← links)
- Calibrated asymmetric surrogate losses (Q1950846) (← links)
- Oracle inequalities for cross-validation type procedures (Q1950881) (← links)
