Rademacher processes and bounding the risk of function learning.
From MaRDI portal
Recommendations
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Local Rademacher complexities
- Rademacher penalties and structural risk minimization
- Bounds on margin distributions in learning problems
- Optimal estimators in learning theory
Cited in
(52)- Generalization bounds for learning weighted automata
- Relative deviation learning bounds and generalization with unbounded loss functions
- Bayesian fractional posteriors
- Moment inequalities for functions of independent random variables
- Bounding the generalization error of convex combinations of classifiers: Balancing the dimensionality and the margins.
- Complexity regularization via localized random penalties
- Estimation from nonlinear observations via convex programming with application to bilinear regression
- A statistician teaches deep learning
- Convergence rates of least squares regression estimators with heavy-tailed errors
- Generalization bounds for non-stationary mixing processes
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Model selection by bootstrap penalization for classification
- Simultaneous adaptation to the margin and to complexity in classification
- Local entropy in learning theory
- Empirical minimization
- Concentration inequalities and asymptotic results for ratio type empirical processes
- Complexities of convex combinations and bounding the generalization error in classification
- Local Rademacher complexities
- Learning bounds for quantum circuits in the agnostic setting
- On the Rademacher complexity of weighted automata
- Permutational Rademacher Complexity
- On the optimality of sample-based estimates of the expectation of the empirical minimizer
- Rademacher and Gaussian complexities: Risk bounds and structural results
- A chain rule for the expected suprema of Gaussian processes
- Theory of Classification: a Survey of Some Recent Advances
- General nonexact oracle inequalities for classes with a subexponential envelope
- Rademacher penalties and structural risk minimization
- Rademacher averages and phase transitions in Glivenko-Cantelli classes
- Local Rademacher complexity-based learning guarantees for multi-task learning
- 10.1162/153244303321897690
- A permutation approach to validation*
- Risk bounds for unsupervised cross-domain mapping with IPMs
- The contrast features selection with empirical data
- An unrestricted learning procedure
- Double-fold localized multiple matrixized learning machine
- Concentration inequalities for samples without replacement
- U-Processes and Preference Learning
- Risk bounds of learning processes for Lévy processes
- Deep learning: a statistical viewpoint
- Minimax rates for conditional density estimation via empirical entropy
- Orthogonal statistical learning
- On the information complexity for integration in subspaces of the Wiener algebra
- Asset pricing with neural networks: significance tests
- A moment-matching approach to testable learning and a new characterization of Rademacher complexity
- Locally simultaneous inference
- Solving PDEs on spheres with physics-informed convolutional neural networks
- On generalized sub-Gaussian canonical processes and their applications
- Learning the coordinate gradients
- Information-theoretic generalization bounds for transductive learning and its applications
- Generalization bounds: perspectives from information theory and PAC-Bayes
- A tight excess risk bound via a unified PAC-Bayesian-Rademacher-Shtarkov-MDL complexity
- Non-asymptotic quality assessment of generalised FIR models with periodic inputs
This page was built for publication: Rademacher processes and bounding the risk of function learning.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4524759)
