The following pages link to Local Rademacher complexities (Q2583411):
Displaying 37 items.
- Direct importance estimation for covariate shift adaptation (Q144623) (← links)
- On the optimal estimation of probability measures in weak and strong topologies (Q282569) (← links)
- Consistency analysis of an empirical minimum error entropy algorithm (Q285539) (← links)
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning (Q285946) (← links)
- Smooth sparse coding via marginal regression for learning sparse representations (Q309913) (← links)
- Inverse statistical learning (Q364201) (← links)
- Model selection in reinforcement learning (Q415618) (← links)
- Robustness and generalization (Q420915) (← links)
- Margin-adaptive model selection in statistical learning (Q453298) (← links)
- An improved analysis of the Rademacher data-dependent bound using its self bounding property (Q459446) (← links)
- Optimal convergence rate of the universal estimation error (Q516004) (← links)
- Optimal learning rates of \(l^p\)-type multiple kernel learning under general conditions (Q526680) (← links)
- Monte Carlo algorithms for optimal stopping and statistical learning (Q558680) (← links)
- Estimating conditional quantiles with the help of the pinball loss (Q637098) (← links)
- The geometry of hypothesis testing over convex cones: generalized likelihood ratio tests and minimax radii (Q666588) (← links)
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning (Q669277) (← links)
- Metamodel construction for sensitivity analysis (Q4606427) (← links)
- Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach (Q4958550) (← links)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
- Smooth Contextual Bandits: Bridging the Parametric and Nondifferentiable Regret Regimes (Q5060501) (← links)
- Graphical Convergence of Subgradients in Nonconvex Optimization and Learning (Q5076697) (← links)
- Learning with Convex Loss and Indefinite Kernels (Q5378314) (← links)
- Refined Generalization Bounds of Gradient Learning over Reproducing Kernel Hilbert Spaces (Q5380250) (← links)
- Kernelized Elastic Net Regularization: Generalization Bounds, and Sparse Recovery (Q5380402) (← links)
- <i>U</i>-Processes and Preference Learning (Q5383812) (← links)
- Comments on: Support vector machines maximizing geometric margins for multi-class classification (Q5965492) (← links)
- Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints (Q6038637) (← links)
- Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso (Q6038638) (← links)
- Distributed learning for sketched kernel regression (Q6079133) (← links)
- Multi-kernel learning for multi-label classification with local Rademacher complexity (Q6095622) (← links)
- PAC-learning with approximate predictors (Q6103580) (← links)
- Overall error analysis for the training of deep neural networks via stochastic gradient descent with random initialisation (Q6107984) (← links)
- Minimax rates for conditional density estimation via empirical entropy (Q6117050) (← links)
- Orthogonal statistical learning (Q6136574) (← links)
- Robust supervised learning with coordinate gradient descent (Q6172182) (← links)
- Data-adaptive discriminative feature localization with statistically guaranteed interpretation (Q6179110) (← links)
- Asset pricing with neural networks: significance tests (Q6193024) (← links)
