Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean
From MaRDI portal
Publication:3604584
DOI10.1109/TIT.2008.917657zbMATH Open1329.62359MaRDI QIDQ3604584FDOQ3604584
Authors: Florentina Bunea, Andrew B. Nobel
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- A sequential procedure for simultaneous estimation of several means
- A note on sequential estimation of the mean
- Sequential estimation of a linear combination of means
- scientific article; zbMATH DE number 679522
- Sequential estimation of parameters by the method of proxy distributions
- Sequential estimation of means of linear processes
Cited In (27)
- Adaptive and optimal online linear regression on \(\ell^1\)-balls
- A universal procedure for aggregating estimators
- A two–stage sequential allocation scheme for estimating the product of several means
- Aggregation of estimators and stochastic optimization
- Fast learning rates in statistical inference through aggregation
- Estimation and variable selection with exponential weights
- Tractability of batch to sequential conversion
- Mirror averaging with sparsity priors
- Aggregation for Gaussian regression
- Aggregating regression procedures to improve performance
- Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
- Generalized mirror averaging and \(D\)-convex aggregation
- An upper bound for aggregating algorithm for regression with changing dependencies
- Inferring the residual waiting time for binary stationary time series
- Optimal learning for sequential sampling with non-parametric beliefs
- On universal algorithms for classifying and predicting stationary processes
- Countable alphabet stationary processes with at least one memory word and intermittent estimation with universal rates
- Title not available (Why is that?)
- Aggregated estimators and empirical complexity for least square regression
- Mixing partially linear regression models
- Empirical risk minimization is optimal for the convex aggregation problem
- Nonparametric sequential prediction of time series
- Simultaneous adaptation to the margin and to complexity in classification
- On the optimality of the empirical risk minimization procedure for the convex aggregation problem
- Aggregation via empirical risk minimization
- Learning by mirror averaging
- User-friendly Introduction to PAC-Bayes Bounds
This page was built for publication: Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604584)