Regularization schemes for minimum error entropy principle
From MaRDI portal
Recommendations
- Novel approaches to entropic regularization
- Regularization with approximated L^2 maximum entropy method
- An entropy regularization technique for minimizing a sum of Tchebycheff norms
- Entropy controlled Laplacian regularization for least square regression
- On optimal estimations with minimum error entropy criterion
- Minimum entropy of error principle in estimation
- On the smoothed minimum error entropy criterion
- scientific article; zbMATH DE number 879845
- Entropic Regularization of NonGradient Systems
- On the entropic regularization method for solving min-max problems with applications
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- Blind source separation using Renyi's -marginal entropies.
- Information theoretic learning. Renyi's entropy and kernel perspectives
- Learning rates of least-square regularized regression
- Multi-kernel regularized classifiers
- Online regression with varying Gaussians and non-identical distributions
- The MEE principle in data classification: a perceptron-based analysis
Cited in
(51)- Kernel-based sparse regression with the correntropy-induced loss
- Online pairwise learning algorithms with convex loss functions
- Online regularized learning with pairwise loss functions
- Robust learning of the modified Huber loss
- Learning theory of randomized sparse Kaczmarz method
- Optimal learning rates for kernel partial least squares
- Kernel gradient descent algorithm for information theoretic learning
- Convergence of online mirror descent
- Learning theory of distributed spectral algorithms
- On meshfree numerical differentiation
- Supersmooth density estimations over \(L^p\) risk by wavelets
- Consistency analysis of an empirical minimum error entropy algorithm
- Analysis of Online Composite Mirror Descent Algorithm
- Rates of approximation by ReLU shallow neural networks
- Online minimum error entropy algorithm with unbounded sampling
- Distributed learning with regularized least squares
- Semi-supervised learning with summary statistics
- Thresholded spectral algorithms for sparse approximations
- On reproducing kernel and density problems
- Distributed kernel-based gradient descent algorithms
- Error analysis on regularized regression based on the maximum correntropy criterion
- Distributed learning with multi-penalty regularization
- Necessary and sufficient optimality conditions for some robust variational problems
- On extension theorems and their connection to universal consistency in machine learning
- Convergence analysis of distributed multi-penalty regularized pairwise learning
- Distributed minimum error entropy algorithms
- Learning rates of regression with q-norm loss and threshold
- Learning theory approach to a system identification problem involving atomic norm
- On the robustness of regularized pairwise learning methods based on kernels
- Kernel-based conditional canonical correlation analysis via modified Tikhonov regularization
- Distributed kernel gradient descent algorithm for minimum error entropy principle
- Block coordinate type methods for optimization and learning
- On the K-functional in learning theory
- The MEE principle in data classification: a perceptron-based analysis
- Learning theory approach to minimum error entropy criterion
- Online regularized pairwise learning with least squares loss
- Fast rates of minimum error entropy with heavy-tailed noise
- Online Pairwise Learning Algorithms
- Error analysis of kernel regularized pairwise learning with a strongly convex loss
- The performance of semi-supervised Laplacian regularized regression with the least square loss
- Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems
- Constructive analysis for coefficient regularization regression algorithms
- Unregularized online learning algorithms with general loss functions
- Approximation on variable exponent spaces by linear integral operators
- Entropic Regularization of NonGradient Systems
- Novel approaches to entropic regularization
- Analysis of approximation by linear operators on variable \(L_\rho^{p(\cdot)}\) spaces and applications in learning theory
- A componentwise iterated relative entropy regularization method with updated prior and regularization parameter
- Learning theory of minimum error entropy under weak moment conditions
- Optimal learning with Gaussians and correntropy loss
- Error bounds for learning the kernel
This page was built for publication: Regularization schemes for minimum error entropy principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5253870)
