Pages that link to "Item:Q549116"

The following pages link to Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008. (Q549116):

Displaying 50 items.

• Two-level monotonic multistage recommender systems (Q2074300) (← links)
• Convergence rates of support vector machines regression for functional data (Q2074933) (← links)
• Sparse high-dimensional semi-nonparametric quantile regression in a reproducing kernel Hilbert space (Q2076148) (← links)
• An elementary analysis of ridge regression with random design (Q2080945) (← links)
• Robust group synchronization via cycle-edge message passing (Q2098232) (← links)
• Functional linear regression with Huber loss (Q2099272) (← links)
• Suboptimality of constrained least squares and improvements via non-linear predictors (Q2108490) (← links)
• On least squares estimation under heteroscedastic and heavy-tailed errors (Q2119229) (← links)
• Binary classification with corrupted labels (Q2136645) (← links)
• Learning with tree tensor networks: complexity estimates and model selection (Q2137001) (← links)
• Empirical variance minimization with applications in variance reduction and optimal control (Q2137023) (← links)
• Neural network training using \(\ell_1\)-regularization and bi-fidelity data (Q2138992) (← links)
• Optimal robust mean and location estimation via convex programs with respect to any pseudo-norms (Q2159256) (← links)
• Estimation of partially conditional average treatment effect by double kernel-covariate balancing (Q2168086) (← links)
• Robust statistical learning with Lipschitz and convex loss functions (Q2174664) (← links)
• Convergence rates for empirical barycenters in metric spaces: curvature, convexity and extendable geodesics (Q2182123) (← links)
• Handling concept drift via model reuse (Q2183593) (← links)
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
• Robust machine learning by median-of-means: theory and practice (Q2196199) (← links)
• Robust classification via MOM minimization (Q2203337) (← links)
• ERM and RERM are optimal estimators for regression problems when malicious outliers corrupt the labels (Q2209821) (← links)
• Performance guarantees for policy learning (Q2227481) (← links)
• Bounding the expectation of the supremum of empirical processes indexed by Hölder classes (Q2239314) (← links)
• Outlier detection in networks with missing links (Q2242182) (← links)
• Learning sets with separating kernels (Q2252512) (← links)
• Low-rank model with covariates for count data with missing values (Q2274954) (← links)
• Sharp oracle inequalities for low-complexity priors (Q2304249) (← links)
• Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions (Q2313281) (← links)
• An exponential inequality for suprema of empirical processes with heavy tails on the left (Q2317491) (← links)
• Localized Gaussian width of \(M\)-convex hulls with applications to Lasso and convex aggregation (Q2325349) (← links)
• On Lasso refitting strategies (Q2325356) (← links)
• Rademacher complexity for Markov chains: applications to kernel smoothing and Metropolis-Hastings (Q2325397) (← links)
• On the asymptotic variance of the debiased Lasso (Q2326043) (← links)
• Nonparametric estimation of low rank matrix valued function (Q2326073) (← links)
• Mean estimation and regression under heavy-tailed distributions: A survey (Q2329044) (← links)
• Conditional quantile processes based on series or many regressors (Q2330744) (← links)
• High-dimensional Ising model selection with Bayesian information criteria (Q2340871) (← links)
• Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction (Q2364497) (← links)
• A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
• Noisy low-rank matrix completion with general sampling distribution (Q2444669) (← links)
• Optimal learning with \textit{Q}-aggregation (Q2448729) (← links)
• Matrix concentration inequalities via the method of exchangeable pairs (Q2450243) (← links)
• Phase retrieval: stability and recovery guarantees (Q2450942) (← links)
• Complex sampling designs: uniform limit theorems and applications (Q2656604) (← links)
• Nonasymptotic analysis of robust regression with modified Huber's loss (Q2693696) (← links)
• Communication-efficient sparse composite quantile regression for distributed data (Q2696327) (← links)
• Learning without concentration (Q2796408) (← links)
• Sparse Learning for Large-Scale and High-Dimensional Data: A Randomized Convex-Concave Optimization Approach (Q2830269) (← links)
• Permutational Rademacher Complexity (Q2835630) (← links)
• Low Rank Estimation of Similarities on Graphs (Q2840345) (← links)