Structural risk minimization over data-dependent hierarchies
From MaRDI portal
Recommendations
- StructED: risk minimization in structured prediction
- A stochastic gradient descent algorithm for structural risk minimisation
- Empirical risk minimizing for dynamical data structures
- Rademacher penalties and structural risk minimization
- The structural risk minimization principle of rough-stochastic samples
- Learning Theory
- Set structured global empirical risk minimizers are rate optimal in general dimensions
- Minimax problems under hierarchical structures
- Regression with stagewise minimization on risk function
Cited in
(60)- A theory of learning with similarity functions
- Distribution-free consistency of empirical risk minimization and support vector regression
- On learning multicategory classification with sample queries.
- Large width nearest prototype classification on general distance spaces
- Why does deep and cheap learning work so well?
- Complexity regularization via localized random penalties
- Generalization bounds for averaged classifiers
- On data classification by iterative linear partitioning
- The true sample complexity of active learning
- On biased random walks, corrupted intervals, and learning under adversarial design
- A local Vapnik-Chervonenkis complexity
- Optimality of SVM: novel proofs and tighter bounds
- Structured large margin machines: sensitive to data distributions
- Classification based on prototypes with spheres of influence
- Learning bounds via sample width for classifiers on finite metric spaces
- A hybrid classifier based on boxes and nearest neighbors
- Aspects of discrete mathematics and probability in the theory of machine learning
- Approximation with polynomial kernels and SVM classifiers
- The theoretical analysis of FDA and applications
- Learning big (image) data via coresets for dictionaries
- PAC-Bayesian inequalities of some random variables sequences
- Soft computing on small data sets
- Making Vapnik-Chervonenkis bounds accurate
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning
- 10.1162/153244303765208368
- Data dependent priors in PAC-Bayes bounds
- Theory of Classification: a Survey of Some Recent Advances
- Empirical risk minimizing for dynamical data structures
- Regularization techniques and suboptimal solutions to optimization problems in learning from data
- Robust cutpoints in the logical analysis of numerical data
- Estimation of convergence rate for multi-regression learning algorithm
- A sharp concentration inequality with applications
- Active nearest-neighbor learning in metric spaces
- The maximum vector-angular margin classifier and its fast training on large datasets using a core vector machine
- An improved analysis of the Rademacher data-dependent bound using its self bounding property
- An easy-to-hard learning paradigm for multiple classes and multiple labels
- Recurrent Neural Networks with Small Weights Implement Definite Memory Machines
- Ten More Years of Error Rate Research
- A permutation approach to validation*
- scientific article; zbMATH DE number 7370646 (Why is no real title available?)
- scientific article; zbMATH DE number 7426461 (Why is no real title available?)
- Support Vector Machines for Dyadic Data
- Critical properties of the SAT/UNSAT transitions in the classification problem of structured data
- A stochastic gradient descent algorithm for structural risk minimisation
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- Adaptive metric dimensionality reduction
- Comment
- Tests and classification methods in adaptive designs with applications
- Hybrid evolutionary algorithms in a SVR traffic flow forecasting model
- PAC-Chernoff bounds: understanding generalization in the interpolation regime
- Wide stochastic networks: Gaussian limit and PAC-Bayesian training
- Stable sample compression schemes: new applications and an optimal SVM margin bound
- Mixed moving average field guided learning for spatio-temporal data
- Multi-category classifiers and sample width
- Kernels as features: on kernels, margins, and low-dimensional mappings
- Complexity of hyperconcepts
- Multi-kernel regularized classifiers
- On the generalization error of fixed combinations of classifiers
- Derivative reproducing properties for kernel methods in learning theory
This page was built for publication: Structural risk minimization over data-dependent hierarchies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701167)
