Online minimum error entropy algorithm with unbounded sampling
From MaRDI portal
reproducing kernel Hilbert spacesonline learningpairwise learningminimum error entropyinformation-theoretic learning
General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Recommendations
Cites work
- 10.1162/15324430260185619
- A Statistical Learning Approach to Modal Regression
- Blind source separation using Renyi's -marginal entropies.
- Consistency analysis of an empirical minimum error entropy algorithm
- Convergence of Gradient Descent for Minimum Error Entropy Principle in Linear Regression
- Information theoretic learning. Renyi's entropy and kernel perspectives
- Integral operator approach to learning theory with unbounded sampling
- Learning theory approach to minimum error entropy criterion
- Learning theory estimates via integral operators and their approximations
- Minimum Total Error Entropy Method for Parameter Estimation
- On Estimation of a Probability Density Function and Mode
- On the Generalization Ability of On-Line Learning Algorithms
- Online Pairwise Learning Algorithms
- Online gradient descent learning algorithms
- Optimal learning rates for least squares regularized regression with unbounded sampling
- Optimal rates for the regularized least-squares algorithm
- Optimum bounds for the distributions of martingales in Banach spaces
- Probability Inequalities for the Sum of Independent Random Variables
- Regularization schemes for minimum error entropy principle
- Stochastic gradient algorithm under (h, )-entropy criterion
- The Fast Gauss Transform
- The MEE principle in data classification: a perceptron-based analysis
- Theory of Reproducing Kernels
- Unregularized online learning algorithms with general loss functions
Cited in
(19)- Consistency analysis of an empirical minimum error entropy algorithm
- Robust kernel-based distribution regression
- Online outcome weighted learning with general loss functions
- Semi-supervised learning with summary statistics
- On the smoothed minimum error entropy criterion
- Distributed minimum error entropy algorithms
- Information theoretic learning with adaptive kernels
- On the K-functional in learning theory
- A minimum-error entropy criterion with self-adjusting step-size (MEE-SAS)
- Stability and optimization error of stochastic gradient descent for pairwise learning
- Online regularized pairwise learning with least squares loss
- Mixture quantized error entropy for recursive least squares adaptive filtering
- Kernel-based online gradient descent using distributed approach
- Renewable estimation for partly interval-censored data streams
- Error analysis of kernel regularized pairwise learning with a strongly convex loss
- A new robust fixed-point algorithm and its convergence analysis
- Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
- Quantitative convergence analysis of kernel based large-margin unified machines
- Learning theory of minimum error entropy under weak moment conditions
This page was built for publication: Online minimum error entropy algorithm with unbounded sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5382494)
