The following pages link to (Q4524759):
Displaying 38 items.
- A chain rule for the expected suprema of Gaussian processes (Q329618) (← links)
- General nonexact oracle inequalities for classes with a subexponential envelope (Q447832) (← links)
- The contrast features selection with empirical data (Q517347) (← links)
- Double-fold localized multiple matrixized learning machine (Q527144) (← links)
- Learning the coordinate gradients (Q695644) (← links)
- Non-asymptotic quality assessment of generalised FIR models with periodic inputs (Q705182) (← links)
- Generalization bounds for learning weighted automata (Q1704563) (← links)
- Relative deviation learning bounds and generalization with unbounded loss functions (Q1714946) (← links)
- Bayesian fractional posteriors (Q1731743) (← 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)
- Estimation from nonlinear observations via convex programming with application to bilinear regression (Q2002578) (← links)
- A statistician teaches deep learning (Q2241468) (← links)
- Convergence rates of least squares regression estimators with heavy-tailed errors (Q2313287) (← links)
- Generalization bounds for non-stationary mixing processes (Q2360972) (← 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)
- Simultaneous adaptation to the margin and to complexity in classification (Q2456017) (← links)
- Empirical minimization (Q2494402) (← links)
- Concentration inequalities and asymptotic results for ratio type empirical processes (Q2497173) (← links)
- Complexities of convex combinations and bounding the generalization error in classification (Q2583410) (← links)
- Local Rademacher complexities (Q2583411) (← links)
- Learning bounds for quantum circuits in the agnostic setting (Q2685576) (← links)
- On the Rademacher Complexity of Weighted Automata (Q2835626) (← links)
- Permutational Rademacher Complexity (Q2835630) (← links)
- On the Optimality of Sample-Based Estimates of the Expectation of the Empirical Minimizer (Q3085585) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- (Q4558184) (← links)
- A permutation approach to validation* (Q4969738) (← links)
- (Q4999018) (← links)
- Concentration Inequalities for Samples without Replacement (Q5369328) (← links)
- <i>U</i>-Processes and Preference Learning (Q5383812) (← links)
- Deep learning: a statistical viewpoint (Q5887827) (← links)
- Minimax rates for conditional density estimation via empirical entropy (Q6117050) (← links)
- Orthogonal statistical learning (Q6136574) (← links)
- On the information complexity for integration in subspaces of the Wiener algebra (Q6154552) (← links)
- Asset pricing with neural networks: significance tests (Q6193024) (← links)
