Pages that link to "Item:Q5754926"
From MaRDI portal
The following pages link to Convexity, Classification, and Risk Bounds (Q5754926):
Displaying 11 items.
- Universally consistent vertex classification for latent positions graphs (Q366983) (← links)
- Generalization ability of fractional polynomial models (Q461189) (← links)
- Multi-kernel regularized classifiers (Q870343) (← links)
- Learning from binary labels with instance-dependent noise (Q1631810) (← links)
- Projected estimators for robust semi-supervised classification (Q1697918) (← links)
- Deformation of log-likelihood loss function for multiclass boosting (Q1784701) (← links)
- Robustness of learning algorithms using hinge loss with outlier indicators (Q2292231) (← links)
- Surrogate regret bounds for generalized classification performance metrics (Q2398092) (← links)
- Power diagram detection with applications to information elicitation (Q2420775) (← links)
- Rademacher Chaos Complexities for Learning the Kernel Problem (Q3057230) (← links)
- Nonparametric Conditional Density Estimation Using Piecewise-Linear Solution Path of Kernel Quantile Regression (Q3612133) (← links)
