The following pages link to Pierre C. Bellec (Q502864):
Displaying 22 items.
- Optimal exponential bounds for aggregation of density estimators (Q502865) (← links)
- On the prediction loss of the Lasso in the partially labeled setting (Q1616320) (← links)
- A sharp oracle inequality for graph-slope (Q1684169) (← links)
- Bounds on the prediction error of penalized least squares estimators with convex penalty (Q1703904) (← links)
- Optimal bounds for aggregation of affine estimators (Q1747732) (← links)
- Sharp oracle inequalities for least squares estimators in shape restricted regression (Q1750286) (← links)
- Slope meets Lasso: improved oracle bounds and optimality (Q1990596) (← links)
- Adaptive confidence sets in shape restricted regression (Q2214235) (← links)
- Localized Gaussian width of \(M\)-convex hulls with applications to Lasso and convex aggregation (Q2325349) (← links)
- (Q3543436) (← links)
- Towards the study of least squares estimators with convex penalty (Q4557508) (← links)
- (Q5240869) (← links)
- Maximum Pseudolikelihood Estimation for Model-Based Clustering of Time Series Data (Q5380690) (← links)
- Sharp oracle bounds for monotone and convex regression through aggregation (Q5744824) (← links)
- Optimistic lower bounds for convex regularized least-squares (Q6283872) (← links)
- Out-of-sample error estimate for robust M-estimators with convex penalty (Q6347818) (← links)
- Existence of solutions to the nonlinear equations characterizing the precise error of M-estimators (Q6515197) (← links)
- Asymptotics of resampling without replacement in robust and logistic regression (Q6528924) (← links)
- Noise covariance estimation in multi-task high-dimensional linear models (Q6565298) (← links)
- Optimizing over iid distributions and the Beat the Average game (Q6759002) (← links)
- The Lasso error is bounded iff its active set size is bounded away from n in the proportional regime (Q6761047) (← links)
- Phase transition for unregularized M-estimation in single index model (Q6761178) (← links)
