Pages that link to "Item:Q4544631"
From MaRDI portal
The following pages link to Rademacher penalties and structural risk minimization (Q4544631):
Displaying 50 items.
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning (Q285946) (← links)
- The two-sample problem for Poisson processes: adaptive tests with a nonasymptotic wild bootstrap approach (Q366986) (← links)
- Robustness and generalization (Q420915) (← links)
- An improved analysis of the Rademacher data-dependent bound using its self bounding property (Q459446) (← links)
- Double-fold localized multiple matrixized learning machine (Q527144) (← links)
- Structural multiple empirical kernel learning (Q528736) (← links)
- Approximation of frame based missing data recovery (Q550489) (← links)
- Adaptive estimation of a distribution function and its density in sup-norm loss by wavelet and spline projections (Q627291) (← links)
- The geometry of hypothesis testing over convex cones: generalized likelihood ratio tests and minimax radii (Q666588) (← links)
- Non-asymptotic quality assessment of generalised FIR models with periodic inputs (Q705182) (← links)
- Some nonasymptotic results on resampling in high dimension. I: Confidence regions (Q847628) (← links)
- Bootstrap model selection for possibly dependent and heterogeneous data (Q904102) (← links)
- Kernel methods in machine learning (Q930651) (← links)
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- Model selection with the loss rank principle (Q962384) (← links)
- A survey of cross-validation procedures for model selection (Q975579) (← links)
- Rademacher complexity in Neyman-Pearson classification (Q1034311) (← links)
- Vote counting measures for ensemble classifiers. (Q1425964) (← links)
- On learning multicategory classification with sample queries. (Q1427857) (← links)
- Matrixized learning machine with modified pairwise constraints (Q1669624) (← links)
- On some distributions arising from a generalized trivariate reduction scheme (Q1731364) (← links)
- Moment inequalities for functions of independent random variables (Q1775439) (← links)
- Bounding the generalization error of convex combinations of classifiers: Balancing the dimensionality and the margins. (Q1872344) (← links)
- Complexity regularization via localized random penalties (Q1879970) (← links)
- Optimal aggregation of classifiers in statistical learning. (Q1884608) (← links)
- Optimal model selection in heteroscedastic regression using piecewise polynomial functions (Q1951154) (← links)
- Model selection by resampling penalization (Q1951992) (← links)
- Penalized empirical risk minimization over Besov spaces (Q1952004) (← links)
- Estimation from nonlinear observations via convex programming with application to bilinear regression (Q2002578) (← links)
- Surrogate losses in passive and active learning (Q2008623) (← links)
- Model selection in utility-maximizing binary prediction (Q2024476) (← links)
- Convolutional spectral kernel learning with generalization guarantees (Q2093403) (← links)
- Compressive sensing and neural networks from a statistical learning perspective (Q2106482) (← links)
- From Gauss to Kolmogorov: localized measures of complexity for ellipses (Q2199701) (← links)
- Statistical learning based on Markovian data maximal deviation inequalities and learning rates (Q2202513) (← links)
- A statistician teaches deep learning (Q2241468) (← links)
- A novel multi-view learning developed from single-view patterns (Q2275990) (← links)
- A local Vapnik-Chervonenkis complexity (Q2281678) (← links)
- MREKLM: a fast multiple empirical kernel learning machine (Q2289596) (← links)
- Inference on covariance operators via concentration inequalities: \(k\)-sample tests, classification, and clustering via Rademacher complexities (Q2317001) (← links)
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder) (Q2373576) (← links)
- Model selection by bootstrap penalization for classification (Q2384135) (← links)
- Global uniform risk bounds for wavelet deconvolution estimators (Q2429928) (← links)
- Simultaneous adaptation to the margin and to complexity in classification (Q2456017) (← links)
- Empirical minimization (Q2494402) (← links)
- Boosted ARTMAP: modifications to fuzzy ARTMAP motivated by boosting theory (Q2507302) (← links)
- Square root penalty: Adaption to the margin in classification and in edge estimation (Q2569239) (← links)
- Local Rademacher complexities (Q2583411) (← links)
- Classifiers of support vector machine type with \(\ell_1\) complexity regularization (Q2642804) (← links)
- Learning bounds for quantum circuits in the agnostic setting (Q2685576) (← links)
