Recommendations
- STABILITY RESULTS IN LEARNING THEORY
- Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization
- scientific article; zbMATH DE number 6001978
- Generalization bounds of regularization algorithms derived simultaneously through hypothesis space complexity, algorithmic stability and data quality
- A survey on learning theory. I: Stability and generalization
Cited in
(only showing first 100 items - show all)- Predictive inference with the jackknife+
- A note on application of integral operator in learning theory
- Analysis of support vector machines regression
- Robustness of general dichotomies
- Distribution-free consistency of empirical risk minimization and support vector regression
- Robustness of reweighted least squares kernel based regression
- Perturbation to enhance support vector machines for classification.
- Kernel selection with spectral perturbation stability of kernel matrix
- Generalization properties of doubly stochastic learning algorithms
- Analysis of classifiers' robustness to adversarial perturbations
- Approximations and solution estimates in optimization
- Local Rademacher complexity: sharper risk bounds with and without unlabeled samples
- OCReP: an optimally conditioned regularization for pseudoinversion based neural training
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- Indefinite kernel network with l^q-norm regularization
- Concept drift detection and adaptation with hierarchical hypothesis testing
- Maximization of AUC and buffered AUC in binary classification
- A Bernstein-type inequality for functions of bounded interaction
- Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking
- Generalization bounds for averaged classifiers
- Good edit similarity learning by loss minimization
- Primal and dual model representations in kernel-based learning
- Oracle inequalities for cross-validation type procedures
- Transfer bounds for linear feature learning
- Composite kernel learning
- Robust pairwise learning with Huber loss
- A tight upper bound on the generalization error of feedforward neural networks
- Stability analysis of learning algorithms for ontology similarity computation
- Large margin vs. large volume in transductive learning
- A selective overview of deep learning
- Design-unbiased statistical learning in survey sampling
- Interpretable machine learning: fundamental principles and 10 grand challenges
- Wasserstein-based fairness interpretability framework for machine learning models
- From inexact optimization to learning via gradient concentration
- State-based confidence bounds for data-driven stochastic reachability using Hilbert space embeddings
- Understanding generalization error of SGD in nonconvex optimization
- Signal recovery by stochastic optimization
- Communication-efficient distributed multi-task learning with matrix sparsity regularization
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Discriminatively learned hierarchical rank pooling networks
- Uncertainty learning of rough set-based prediction under a holistic framework
- SIRUS: stable and interpretable RUle set for classification
- Least-square regularized regression with non-iid sampling
- Stochastic separation theorems
- Kernel learning at the first level of inference
- Gromov-Hausdorff stability of linkage-based hierarchical clustering methods
- Influence measures for CART classification trees
- Fast rates by transferring from auxiliary hypotheses
- Stability of unstable learning algorithms
- Learning with sample dependent hypothesis spaces
- The optimal solution of multi-kernel regularization learning
- Statistical performance of support vector machines
- Growing a list
- Classifier learning with a new locality regularization method
- The consistency of multicategory support vector machines
- Additive regularization trade-off: fusion of training and validation levels in kernel methods
- Approximation with polynomial kernels and SVM classifiers
- Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization
- Leave-one-out cross-validation is risk consistent for Lasso
- Approximating and learning by Lipschitz kernel on the sphere
- Learning rates of gradient descent algorithm for classification
- Discussion of big Bayes stories and BayesBag
- Generalization bounds for metric and similarity learning
- Differentially private SGD with non-smooth losses
- Free dynamics of feature learning processes
- Application of integral operator for vector-valued regression learning
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning
- Coefficient regularized regression with non-iid sampling
- Positivity, stability and accuracy
- scientific article; zbMATH DE number 6670747 (Why is no real title available?)
- Regression learning with non-identically and non-independently sampling
- 10.1162/153244303765208368
- Error analysis of multicategory support vector machine classifiers
- Generalization bounds of regularization algorithms derived simultaneously through hypothesis space complexity, algorithmic stability and data quality
- Stability of randomized learning algorithms
- Algorithmic stability and meta-learning
- A note on stability of error bounds in statistical learning theory
- scientific article; zbMATH DE number 1804116 (Why is no real title available?)
- Generalization Error in Deep Learning
- How effectively train large-scale machine learning models?
- Theory of Classification: a Survey of Some Recent Advances
- Measuring the Stability of Results From Supervised Statistical Learning
- Stability and generalization of learning algorithm: a new framework of stability
- Stable multi-label boosting for image annotation with structural feature selection
- Spectral Algorithms for Supervised Learning
- Generalization Bounds for Some Ordinal Regression Algorithms
- A survey on learning theory. I: Stability and generalization
- On the Generalization Ability of On-Line Learning Algorithms
- Regularization techniques and suboptimal solutions to optimization problems in learning from data
- On the consistency of the empirical risk minimization principle based on algorithmic stability
- Sharp learning rates of coefficient-based l^q-regularized regression with indefinite kernels
- Stability
- Domain adaptation and sample bias correction theory and algorithm for regression
- scientific article; zbMATH DE number 33716 (Why is no real title available?)
- Robustness and generalization
- scientific article; zbMATH DE number 1304253 (Why is no real title available?)
- Multi-output learning via spectral filtering
- Error bounds for \(l^p\)-norm multiple kernel learning with least square loss
- Support vector machines with applications
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
This page was built for publication: 10.1162/153244302760200704
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779564)
