Robust learning of minimum error entropy under heavy-tailed noise
From MaRDI portal
Cites work
- A statistical learning assessment of Huber regression
- Blind source separation using Renyi's -marginal entropies.
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Consistency analysis of an empirical minimum error entropy algorithm
- Convergence of Gradient Descent for Minimum Error Entropy Principle in Linear Regression
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Fast rates of exponential cost function
- Fast rates of minimum error entropy with heavy-tailed noise
- Fixed-Point Minimum Error Entropy With Fiducial Points
- scientific article; zbMATH DE number 3173999 (Why is no real title available?)
- I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error
- Information theoretic learning. Renyi's entropy and kernel perspectives
- Kernel-based sparse regression with the correntropy-induced loss
- Learning rates of least-square regularized regression
- Learning Theory
- Learning theory approach to minimum error entropy criterion
- Learning theory of minimum error entropy under weak moment conditions
- Learning under \((1 + \epsilon)\)-moment conditions
- Minimum Total Error Entropy Method for Parameter Estimation
- Probability Inequalities for Sums of Bounded Random Variables
- Regularization schemes for minimum error entropy principle
- Robust learning of the modified Huber loss
- The covering number in learning theory
- Theory of Reproducing Kernels
- Tikhonov regularization for Gaussian empirical gain maximization in RKHS is consistent
This page was built for publication: Robust learning of minimum error entropy under heavy-tailed noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7297222)
