Distributed minimum error entropy algorithms
From MaRDI portal
(Redirected from Publication:4969211)
Recommendations
- Distributed kernel gradient descent algorithm for minimum error entropy principle
- Online minimum error entropy algorithm with unbounded sampling
- Learning theory of minimum error entropy under weak moment conditions
- Distributed semi-supervised regression learning with coefficient regularization
- Regularization schemes for minimum error entropy principle
Cites work
- scientific article; zbMATH DE number 979014 (Why is no real title available?)
- Consistency analysis of an empirical minimum error entropy algorithm
- Convergence of Gradient Descent for Minimum Error Entropy Principle in Linear Regression
- Convergence rates of kernel conjugate gradient for random design regression
- Cross-validation based adaptation for regularization operators in learning theory
- Distributed kernel gradient descent algorithm for minimum error entropy principle
- Distributed kernel-based gradient descent algorithms
- Distributed learning with regularized least squares
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
- Information theoretic learning. Renyi's entropy and kernel perspectives
- Learning Theory
- Learning theory approach to minimum error entropy criterion
- Learning theory estimates via integral operators and their approximations
- Learning theory of distributed regression with bias corrected regularization kernel network
- Learning theory of distributed spectral algorithms
- Minimum Total Error Entropy Method for Parameter Estimation
- On Estimation of a Probability Density Function and Mode
- On regularization algorithms in learning theory
- On the robustness of regularized pairwise learning methods based on kernels
- Online Pairwise Learning Algorithms
- Online minimum error entropy algorithm with unbounded sampling
- Optimal rates for regularization of statistical inverse learning problems
- Optimal rates for the regularized least-squares algorithm
- Parallelizing spectrally regularized kernel algorithms
- Regularization in kernel learning
- Regularization schemes for minimum error entropy principle
- Remarks on Inequalities for Large Deviation Probabilities
- Semi-supervised learning on Riemannian manifolds
- Semi-supervised learning using greedy Max-Cut
- Spectral Algorithms for Supervised Learning
- The MEE principle in data classification: a perceptron-based analysis
- The covering number in learning theory
- Unregularized online learning algorithms with general loss functions
- Weak convergence and empirical processes. With applications to statistics
Cited in
(12)- On the convergence of gradient descent for robust functional linear regression
- Distributed robust regression with correntropy losses and regularization kernel networks
- Online minimum error entropy algorithm with unbounded sampling
- Multilevel aggregation of central server models: a minimum relative entropy approach
- Semi-supervised learning with summary statistics
- Large margin unified machines with non-i.i.d. process
- Distributed kernel gradient descent algorithm for minimum error entropy principle
- Convex analysis method for distributed learning algorithm
- Averaging versus voting: a comparative study of strategies for distributed classification
- Pairwise learning problems with regularization networks and Nyström subsampling approach
- A Framework of Learning Through Empirical Gain Maximization
- Learning theory of minimum error entropy under weak moment conditions
This page was built for publication: Distributed minimum error entropy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969211)
