Pages that link to "Item:Q3604584"

The following pages link to Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean (Q3604584):

Displaying 23 items.

• Adaptive and optimal online linear regression on \(\ell^1\)-balls (Q391734) (← links)
• Mirror averaging with sparsity priors (Q442083) (← links)
• Generalized mirror averaging and \(D\)-convex aggregation (Q734528) (← links)
• Optimal learning for sequential sampling with non-parametric beliefs (Q742143) (← links)
• Aggregation via empirical risk minimization (Q842390) (← links)
• Learning by mirror averaging (Q955138) (← links)
• Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity (Q1009266) (← links)
• Aggregating regression procedures to improve performance (Q1431542) (← links)
• Aggregated estimators and empirical complexity for least square regression (Q1888821) (← links)
• On the optimality of the empirical risk minimization procedure for the convex aggregation problem (Q1943331) (← links)
• On universal algorithms for classifying and predicting stationary processes (Q2039763) (← links)
• Fast learning rates in statistical inference through aggregation (Q2388975) (← links)
• Mixing partially linear regression models (Q2392079) (← links)
• Empirical risk minimization is optimal for the convex aggregation problem (Q2435238) (← links)
• Estimation and variable selection with exponential weights (Q2447091) (← links)
• Aggregation for Gaussian regression (Q2456016) (← links)
• Simultaneous adaptation to the margin and to complexity in classification (Q2456017) (← links)
• Tractability of batch to sequential conversion (Q2636409) (← links)
• Nonparametric sequential prediction of time series (Q3569202) (← links)
• (Q4317942) (← links)
• A two–stage sequential allocation scheme for estimating the product of several means (Q4949465) (← links)
• (Q5179066) (← links)
• Countable alphabet stationary processes with at least one memory word and intermittent estimation with universal rates (Q6634799) (← links)