The following pages link to 10.1162/153244303321897690 (Q4825353):
Displaying 50 items.
- Generalization bounds for metric and similarity learning (Q255367) (← links)
- Consistency analysis of an empirical minimum error entropy algorithm (Q285539) (← links)
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning (Q285946) (← links)
- Minimum distance Lasso for robust high-dimensional regression (Q286223) (← links)
- Matrix completion via max-norm constrained optimization (Q302432) (← links)
- A chain rule for the expected suprema of Gaussian processes (Q329618) (← links)
- The learning rate of \(l_2\)-coefficient regularized classification with strong loss (Q383667) (← links)
- Robustness and generalization (Q420915) (← links)
- Generalization error bounds for the logical analysis of data (Q427877) (← links)
- An improved analysis of the Rademacher data-dependent bound using its self bounding property (Q459446) (← links)
- Generalization performance of bipartite ranking algorithms with convex losses (Q488690) (← links)
- Unregularized online learning algorithms with general loss functions (Q504379) (← links)
- Optimal convergence rate of the universal estimation error (Q516004) (← links)
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning (Q669277) (← links)
- Extreme value correction: a method for correcting optimistic estimations in rule learning (Q669278) (← links)
- Learning the coordinate gradients (Q695644) (← links)
- Relaxing support vectors for classification (Q744716) (← links)
- Generalization bounds for learning with linear, polygonal, quadratic and conic side knowledge (Q747246) (← links)
- Data-driven estimation in equilibrium using inverse optimization (Q747777) (← links)
- Scalable Gaussian kernel support vector machines with sublinear training time complexity (Q780936) (← links)
- Machine learning from a continuous viewpoint. I (Q829085) (← links)
- A reproducing kernel Hilbert space approach to high dimensional partially varying coefficient model (Q830540) (← links)
- Regularized least square regression with dependent samples (Q849335) (← links)
- The value of agreement a new boosting algorithm (Q927875) (← links)
- Kernel methods in machine learning (Q930651) (← links)
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- Learning rates of multi-kernel regularized regression (Q974504) (← links)
- Fast rates for support vector machines using Gaussian kernels (Q995417) (← links)
- A theory of learning with similarity functions (Q1009272) (← links)
- Convergence analysis of kernel canonical correlation analysis: theory and practice (Q1009310) (← links)
- Kernel ellipsoidal trimming (Q1020817) (← links)
- Rademacher complexity in Neyman-Pearson classification (Q1034311) (← links)
- Kernel selection with spectral perturbation stability of kernel matrix (Q1616171) (← links)
- D-learning to estimate optimal individual treatment rules (Q1616327) (← links)
- Measuring distributional asymmetry with Wasserstein distance and Rademacher symmetrization (Q1657945) (← links)
- Local Rademacher complexity: sharper risk bounds with and without unlabeled samples (Q1669081) (← links)
- IRAHC: instance reduction algorithm using hyperrectangle clustering (Q1677859) (← links)
- Homotopy continuation approaches for robust SV classification and regression (Q1697922) (← links)
- Bayesian fractional posteriors (Q1731743) (← links)
- High-dimensional asymptotics of prediction: ridge regression and classification (Q1747738) (← links)
- Learning similarity with cosine similarity ensemble (Q1749099) (← links)
- Robust multicategory support vector machines using difference convex algorithm (Q1749454) (← links)
- Oracle inequalities for sparse additive quantile regression in reproducing kernel Hilbert space (Q1750287) (← links)
- Large-width bounds for learning half-spaces on distance spaces (Q1752445) (← links)
- Moment inequalities for functions of independent random variables (Q1775439) (← links)
- Fast structured prediction using large margin sigmoid belief networks (Q1931609) (← links)
- A computational learning theory of active object recognition under uncertainty (Q1943411) (← links)
- On the empirical estimation of integral probability metrics (Q1950872) (← links)
- Penalized empirical risk minimization over Besov spaces (Q1952004) (← links)
- Incentive compatible regression learning (Q1959425) (← links)
