Pages that link to "Item:Q1888821"
From MaRDI portal
The following pages link to Aggregated estimators and empirical complexity for least square regression (Q1888821):
Displaying 19 items.
- Model selection for weakly dependent time series forecasting (Q442082) (← links)
- Deviation optimal learning using greedy \(Q\)-aggregation (Q693750) (← links)
- Iterative feature selection in least square regression estimation (Q731450) (← links)
- PAC-Bayesian bounds for randomized empirical risk minimizers (Q734547) (← links)
- A universal procedure for aggregating estimators (Q1002171) (← links)
- PAC-Bayesian high dimensional bipartite ranking (Q1642737) (← links)
- On the optimality of the empirical risk minimization procedure for the convex aggregation problem (Q1943331) (← links)
- Classification via local multi-resolution projections (Q1950821) (← links)
- PAC-Bayesian estimation and prediction in sparse additive models (Q1951111) (← links)
- General oracle inequalities for model selection (Q1951973) (← links)
- PAC-Bayesian bounds for sparse regression estimation with exponential weights (Q1952177) (← links)
- Aggregating estimates by convex optimization (Q2102433) (← links)
- Aggregation of estimators and stochastic optimization (Q2197367) (← links)
- Aggregation using input-output trade-off (Q2317264) (← links)
- Fast learning rates in statistical inference through aggregation (Q2388975) (← links)
- Empirical risk minimization is optimal for the convex aggregation problem (Q2435238) (← links)
- Aggregation for Gaussian regression (Q2456016) (← links)
- Square root penalty: Adaption to the margin in classification and in edge estimation (Q2569239) (← links)
- Complexities of convex combinations and bounding the generalization error in classification (Q2583410) (← links)
