Learnability, stability and uniform convergence
From MaRDI portal
Recommendations
- On learnability, complexity and stability
- Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization
- STABILITY RESULTS IN LEARNING THEORY
- A survey on learning theory. I: Stability and generalization
- Scale-sensitive dimensions, uniform convergence, and learnability
Cited in
(65)- Kernel selection with spectral perturbation stability of kernel matrix
- Robust regression using biased objectives
- Stability behavior for unsupervised learning
- A selective overview of deep learning
- Relative utility bounds for empirically optimal portfolios
- Compressive sensing and neural networks from a statistical learning perspective
- Understanding generalization error of SGD in nonconvex optimization
- Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization
- Sample average approximations of strongly convex stochastic programs in Hilbert spaces
- scientific article; zbMATH DE number 6001978 (Why is no real title available?)
- Consistency of learning algorithms using Attouch-Wets convergence
- On the consistency of the empirical risk minimization principle based on algorithmic stability
- Stability
- Fluctuations, effective learnability and metastability in analysis
- Stability and Convergence of Principal Component Learning Algorithms
- Average stability is invariant to data preconditioning. Implications to exp-concave empirical risk minimization
- A theoretical framework for deep transfer learning
- Parsimonious online learning with kernels via sparse projections in function space
- scientific article; zbMATH DE number 6860836 (Why is no real title available?)
- Test Data Reuse for the Evaluation of Continuously Evolving Classification Algorithms Using the Area under the Receiver Operating Characteristic Curve
- Graph-dependent implicit regularisation for distributed stochastic subgradient descent
- Algorithmic stability for adaptive data analysis
- Generalization performance of multi-pass stochastic gradient descent with convex loss functions
- Perturbation of convex risk minimization and its application in differential private learning algorithms
- scientific article; zbMATH DE number 7626777 (Why is no real title available?)
- scientific article; zbMATH DE number 7625184 (Why is no real title available?)
- Efficient and reliable overlay networks for decentralized federated learning
- Sample complexity of sample average approximation for conditional stochastic optimization
- Learning whenever learning is possible: universal learning under general stochastic processes
- Optimal transport: fast probabilistic approximation with exact solvers
- On learnability, complexity and stability
- Toward nonlinear local reinforcement learning rules through neuroevolution
- scientific article; zbMATH DE number 5241994 (Why is no real title available?)
- For interpolating kernel machines, minimizing the norm of the ERM solution maximizes stability
- Closure properties of uniform convergence of empirical means and PAC learnability under a family of probability measures.
- Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems
- High-probability generalization bounds for pointwise uniformly stable algorithms
- Diametrical risk minimization: theory and computations
- Quantitative stability of barycenters in the Wasserstein space
- Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization
- A Statistical Learning Theory Approach for the Analysis of the Trade-off Between Sample Size and Precision in Truncated Ordinary Least Squares
- Stability is stable: connections between replicability, privacy, and adaptive generalization
- A moment-matching approach to testable learning and a new characterization of Rademacher complexity
- Realizable learning is all you need
- Statistical computational learning
- Complementary composite minimization, small gradients in general norms, and applications
- Minibatch and local SGD: algorithmic stability and linear speedup in generalization
- Bootstrap SGD: algorithmic stability and robustness
- Gentle local robustness implies generalization
- Accelerated stochastic extragradient: mixing Hessian and gradient similarity to reduce communication in distributed and federated learning
- Nonconvex stochastic Bregman proximal gradient method with application to deep learning
- Optimization and learning with randomly compressed gradient updates
- Information-theoretic generalization bounds for transductive learning and its applications
- Limitations of information-theoretic generalization bounds for gradient descent methods in stochastic convex optimization
- Generalization bounds: perspectives from information theory and PAC-Bayes
- An exponential Efron-Stein inequality for L_q stable learning rules
- Agnostic learning with unknown utilities
- Applying statistical learning theory to deep learning
- On the security and privacy of CKKS-based homomorphic evaluation protocols
- The limits of assumption-free tests for algorithm performance
- Learning-to-optimize with PAC-Bayesian guarantees: theoretical considerations and practical implementation
- Generalized universal inference on risk minimizers
- Adversarial laws of large numbers and optimal regret in online classification
- Stability via resampling: statistical problems beyond the real line
- Learnability with respect to fixed distributions
This page was built for publication: Learnability, stability and uniform convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896159)
