scientific article; zbMATH DE number 1950575
From MaRDI portal
Publication:4413261
Recommendations
Cited in
(38)- Learning bounds of ERM principle for sequences of time-dependent samples
- Approximating the covariance ellipsoid
- Integer cells in convex sets
- scientific article; zbMATH DE number 2152981 (Why is no real title available?)
- Some notes on perceptron learning
- The shattering dimension of sets of linear functionals.
- Empirical minimization
- Dimension reduction by random hyperplane tessellations
- Consistency of spectral clustering
- Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization
- Sequential complexities and uniform martingale laws of large numbers
- On the mathematical foundations of learning
- Convergence of the weighted nonlocal Laplacian on random point cloud
- Imaging conductivity from current density magnitude using neural networks
- Complexity regularization via localized random penalties
- Obtaining fast error rates in nonconvex situations
- On the geometry of polytopes generated by heavy-tailed random vectors
- Monte Carlo algorithms for optimal stopping and statistical learning
- Sampling discretization error of integral norms for function classes
- Foundations of support constraint machines
- Oracle inequalities for support vector machines that are based on random entropy numbers
- An axiomatic approach to intrinsic dimension of a dataset
- A refined Hoeffding's upper tail probability bound for sum of independent random variables
- Sampling discretization and related problems
- Robust support vector machines for classification with nonconvex and smooth losses
- Solving PDEs on spheres with physics-informed convolutional neural networks
- A recursive procedure for density estimation on the binary hypercube
- Regularized learning schemes in feature Banach spaces
- Generalization error of minimum weighted norm and kernel interpolation
- Unregularized online learning algorithms with general loss functions
- Refined Rademacher chaos complexity bounds with applications to the multikernel learning problem
- scientific article; zbMATH DE number 3874345 (Why is no real title available?)
- Kernel methods in machine learning
- Estimation in high dimensions: a geometric perspective
- On the optimality of sample-based estimates of the expectation of the empirical minimizer
- Asymptotic properties of neural network sieve estimators
- Aspects of discrete mathematics and probability in the theory of machine learning
- Theory of Classification: a Survey of Some Recent Advances
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4413261)