scientific article; zbMATH DE number 1552503

zbMath1106.68385arXivmath/0405338MaRDI QIDQ4524759

Dmitriy Panchenko, Vladimir I. Koltchinskii

Publication date: 19 March 2001

Full work available at URL: https://arxiv.org/abs/math/0405338

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computational learning theory (68Q32) Nonparametric estimation (62G05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (41)

Bounding the generalization error of convex combinations of classifiers: Balancing the dimensionality and the margins. ⋮ Generalization bounds for non-stationary mixing processes ⋮ Deep learning: a statistical viewpoint ⋮ Complexity regularization via localized random penalties ⋮ Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder) ⋮ Model selection by bootstrap penalization for classification ⋮ A chain rule for the expected suprema of Gaussian processes ⋮ Minimax rates for conditional density estimation via empirical entropy ⋮ Unnamed Item ⋮ Orthogonal statistical learning ⋮ Learning bounds for quantum circuits in the agnostic setting ⋮ On the information complexity for integration in subspaces of the Wiener algebra ⋮ Asset pricing with neural networks: significance tests ⋮ Generalization bounds for learning weighted automata ⋮ Concentration Inequalities for Samples without Replacement ⋮ General nonexact oracle inequalities for classes with a subexponential envelope ⋮ Relative deviation learning bounds and generalization with unbounded loss functions ⋮ U-Processes and Preference Learning ⋮ Bayesian fractional posteriors ⋮ Simultaneous adaptation to the margin and to complexity in classification ⋮ A statistician teaches deep learning ⋮ The contrast features selection with empirical data ⋮ Double-fold localized multiple matrixized learning machine ⋮ Estimation from nonlinear observations via convex programming with application to bilinear regression ⋮ Learning the coordinate gradients ⋮ Non-asymptotic quality assessment of generalised FIR models with periodic inputs ⋮ Empirical minimization ⋮ Moment inequalities for functions of independent random variables ⋮ Concentration inequalities and asymptotic results for ratio type empirical processes ⋮ Unnamed Item ⋮ A moment-matching approach to testable learning and a new characterization of Rademacher complexity ⋮ Locally simultaneous inference ⋮ Theory of Classification: a Survey of Some Recent Advances ⋮ Solving PDEs on spheres with physics-informed convolutional neural networks ⋮ A permutation approach to validation* ⋮ On the Optimality of Sample-Based Estimates of the Expectation of the Empirical Minimizer ⋮ Convergence rates of least squares regression estimators with heavy-tailed errors ⋮ On the Rademacher Complexity of Weighted Automata ⋮ Permutational Rademacher Complexity ⋮ Complexities of convex combinations and bounding the generalization error in classification ⋮ Local Rademacher complexities

This page was built for publication: