Peter L. Bartlett

From MaRDI portal
Person:162843

Available identifiers

zbMath Open bartlett.peter-lDBLP68/4020WikidataQ79811656 ScholiaQ79811656MaRDI QIDQ162843

List of research outcomes





PublicationDate of PublicationType
A diffusion process perspective on posterior contraction rates for parameters2024-08-06Paper
Bayesian Robustness: A Nonasymptotic Viewpoint2024-07-05Paper
Corrigendum to: ``Prediction, learning, uniform convergence, and scale-sensitive dimensions2024-01-04Paper
https://portal.mardi4nfdi.de/entity/Q50531922022-12-06Paper
https://portal.mardi4nfdi.de/entity/Q58672802022-09-13Paper
https://portal.mardi4nfdi.de/entity/Q50917182022-07-27Paper
Oracle lower bounds for stochastic gradient sampling algorithms2022-05-16Paper
Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity2022-05-16Paper
Benign overfitting in linear regression2022-05-05Paper
Optimal and instance-dependent guarantees for Markovian linear stochastic approximation2021-12-23Paper
https://portal.mardi4nfdi.de/entity/Q51594342021-10-27Paper
Gradient Descent with Identity Initialization Efficiently Learns Positive-Definite Linear Transformations by Deep Residual Networks2021-10-01Paper
Is there an analog of Nesterov acceleration for gradient-based MCMC?2021-07-09Paper
https://portal.mardi4nfdi.de/entity/Q49989322021-07-09Paper
When does gradient descent with logistic loss find interpolating two-layer networks?2020-12-04Paper
Failures of model-dependent generalization bounds for least-norm interpolation2020-10-16Paper
Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems2020-10-05Paper
Sampling for Bayesian Mixture Models: MCMC with Polynomial-Time Mixing2019-12-11Paper
A Diffusion Process Perspective on Posterior Contraction Rates for Parameters2019-09-03Paper
High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm2019-08-28Paper
https://portal.mardi4nfdi.de/entity/Q53811172019-06-07Paper
https://portal.mardi4nfdi.de/entity/Q46176012019-02-06Paper
Exchangeability Characterizes Optimality of Sequential Normalized Maximum Likelihood and Bayesian Prediction2018-06-27Paper
Sharp convergence rates for Langevin dynamics in the nonconvex setting2018-05-04Paper
Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization2017-07-12Paper
Hit-and-Run for Sampling and Planning in Non-Convex Spaces2016-10-19Paper
Bounding Embeddings of VC Classes into Maximum Classes2016-05-13Paper
\(\ell _{1}\)-regularized linear regression: persistence and oracle inequalities2013-01-14Paper
Margin-adaptive model selection in statistical learning2012-09-19Paper
Randomized smoothing for stochastic optimization2012-09-12Paper
Comment2012-09-01Paper
Classification with a reject option using a hinge loss2011-11-08Paper
Exponentiated gradient algorithms for conditional random fields and max-margin Markov networks2011-11-08Paper
Sparseness vs estimating conditional probabilities: some asymptotic results2011-10-12Paper
On the consistency of multiclass classification methods2011-10-12Paper
Variance reduction techniques for gradient estimates in reinforcement learning2011-10-12Paper
AdaBoost is consistent2011-10-12Paper
On the optimality of sample-based estimates of the expectation of the empirical minimizer2011-03-31Paper
A regularization approach to metrical task systems2010-10-01Paper
Corrigendum to ``Shifting: One-inclusion mistake bounds and sample compression2010-05-25Paper
https://portal.mardi4nfdi.de/entity/Q33947642009-09-08Paper
FAST RATES FOR ESTIMATION ERROR AND ORACLE INEQUALITIES FOR MODEL SELECTION2009-06-11Paper
Correction to "The Importance of Convexity in Learning With Squared Loss" [Sep 98 1974-1980]2009-02-24Paper
Shifting: one-inclusion mistake bounds and sample compression2009-01-09Paper
Bounded Parameter Markov Decision Processes with Average Reward Criterion2008-01-03Paper
Multitask Learning with Expert Advice2008-01-03Paper
Convexity, Classification, and Risk Bounds2007-08-20Paper
Empirical minimization2006-06-26Paper
Learning Theory2006-06-22Paper
Local Rademacher complexities2006-01-16Paper
Learning Theory2005-06-13Paper
Learning Theory2005-06-13Paper
Discussion on boosting papers.2004-11-05Paper
10.1162/1532443033218976902004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q30466942004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44132652003-07-17Paper
Generalization error of combined classifiers.2003-05-14Paper
Exploiting random walks for learning2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q45333622002-10-13Paper
https://portal.mardi4nfdi.de/entity/Q45333632002-10-10Paper
https://portal.mardi4nfdi.de/entity/Q31488082002-09-22Paper
Covering numbers for support vector machines2002-08-04Paper
Hardness results for neural network approximation problems2002-07-15Paper
Estimation and approximation bounds for gradient-based reinforcement learning2002-07-04Paper
Model selection and error estimation2002-04-11Paper
Direct iterative tuning via spectral analysis2002-01-08Paper
An inequality for uniform deviations of sample averages from their means2001-12-12Paper
Improved generalization through explicit optimization of margins2001-02-05Paper
Learning changing concepts by exploiting the structure of change2001-01-16Paper
Prediction, learning, uniform convergence, and scale-sensitive dimensions2000-09-27Paper
Function Learning from Interpolation2000-09-04Paper
Neural Network Learning2000-05-09Paper
Structural risk minimization over data-dependent hierarchies1999-11-21Paper
The importance of convexity in learning with squared loss1999-11-21Paper
The minimax distortion redundancy in empirical quantizer design1999-11-21Paper
Boosting the margin: a new explanation for the effectiveness of voting methods1999-11-09Paper
The complexity of model classes, and smoothing noisy data1999-01-12Paper
Optimal controller properties from closed-loop experiments1998-10-27Paper
The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network1998-08-02Paper
Covering numbers for real-valued function classes1998-03-22Paper
Valid Generalisation from Approximate Interpolation1997-07-07Paper
Efficient agnostic learning of neural networks with bounded fan-in1997-06-12Paper
Fat-shattering and the learnability of real-valued functions1996-11-26Paper

Research outcomes over time

This page was built for person: Peter L. Bartlett