The following pages link to Peter L. Bartlett (Q162843):
Displaying 50 items.
- (Q239341) (redirect page) (← links)
- Margin-adaptive model selection in statistical learning (Q453298) (← links)
- Corrigendum to ``Shifting: One-inclusion mistake bounds and sample compression'' (Q972387) (← links)
- Optimal controller properties from closed-loop experiments (Q1129661) (← links)
- Prediction, learning, uniform convergence, and scale-sensitive dimensions (Q1271550) (← links)
- The complexity of model classes, and smoothing noisy data (Q1274410) (← links)
- Improved generalization through explicit optimization of margins (Q1568529) (← links)
- Learning changing concepts by exploiting the structure of change (Q1592380) (← links)
- Hardness results for neural network approximation problems (Q1603592) (← links)
- Estimation and approximation bounds for gradient-based reinforcement learning (Q1604222) (← links)
- (Q1807155) (redirect page) (← links)
- Boosting the margin: a new explanation for the effectiveness of voting methods (Q1807156) (← links)
- Exploiting random walks for learning (Q1854545) (← links)
- Generalization error of combined classifiers. (Q1872713) (← links)
- Discussion on boosting papers. (Q1884605) (← links)
- Fat-shattering and the learnability of real-valued functions (Q1924381) (← links)
- \(\ell _{1}\)-regularized linear regression: persistence and oracle inequalities (Q1930861) (← links)
- An inequality for uniform deviations of sample averages from their means (Q1962162) (← links)
- Is there an analog of Nesterov acceleration for gradient-based MCMC? (Q2040101) (← links)
- Oracle lower bounds for stochastic gradient sampling algorithms (Q2137007) (← links)
- Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity (Q2137032) (← links)
- Empirical minimization (Q2494402) (← links)
- Shifting: one-inclusion mistake bounds and sample compression (Q2517823) (← links)
- Local Rademacher complexities (Q2583411) (← links)
- Bounding Embeddings of VC Classes into Maximum Classes (Q2805735) (← links)
- Randomized smoothing for stochastic optimization (Q2910890) (← links)
- (Q3046694) (← links)
- On the Optimality of Sample-Based Estimates of the Expectation of the Empirical Minimizer (Q3085585) (← links)
- (Q3093234) (← links)
- (Q3096171) (← links)
- (Q3096172) (← links)
- (Q3148808) (← links)
- (Q3174098) (← links)
- (Q3174109) (← links)
- (Q3174158) (← links)
- (Q3394764) (← links)
- Correction to "The Importance of Convexity in Learning With Squared Loss" [Sep 98 1974-1980] (Q3604803) (← links)
- FAST RATES FOR ESTIMATION ERROR AND ORACLE INEQUALITIES FOR MODEL SELECTION (Q3632389) (← links)
- Efficient agnostic learning of neural networks with bounded fan-in (Q4336393) (← links)
- Covering numbers for real-valued function classes (Q4371881) (← links)
- The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network (Q4400270) (← links)
- (Q4413265) (← links)
- Function Learning from Interpolation (Q4500420) (← links)
- (Q4533362) (← links)
- (Q4533363) (← links)
- Covering numbers for support vector machines (Q4544779) (← links)
- Exchangeability Characterizes Optimality of Sequential Normalized Maximum Likelihood and Bayesian Prediction (Q4566526) (← links)
- (Q4617601) (← links)
- Learning Theory (Q4680882) (← links)
- Learning Theory (Q4680906) (← links)
