Online minimum error entropy algorithm with unbounded sampling
DOI10.1142/S0219530518500148zbMath1410.68327MaRDI QIDQ5382494
Publication date: 17 June 2019
Published in: Analysis and Applications (Search for Journal in Brave)
reproducing kernel Hilbert spacesonline learningpairwise learningminimum error entropyinformation-theoretic learning
General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05) 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) Online algorithms; streaming algorithms (68W27)
Related Items (10)
Cites Work
- Unnamed Item
- Consistency analysis of an empirical minimum error entropy algorithm
- Integral operator approach to learning theory with unbounded sampling
- Unregularized online learning algorithms with general loss functions
- Optimal learning rates for least squares regularized regression with unbounded sampling
- Stochastic gradient algorithm under \((h, \phi)\)-entropy criterion
- Online gradient descent learning algorithms
- Blind source separation using Renyi's \(\alpha\)-marginal entropies.
- Optimum bounds for the distributions of martingales in Banach spaces
- Optimal rates for the regularized least-squares algorithm
- Learning theory estimates via integral operators and their approximations
- The MEE Principle in Data Classification: A Perceptron-Based Analysis
- 10.1162/15324430260185619
- Probability Inequalities for the Sum of Independent Random Variables
- On the Generalization Ability of On-Line Learning Algorithms
- Minimum Total Error Entropy Method for Parameter Estimation
- Convergence of Gradient Descent for Minimum Error Entropy Principle in Linear Regression
- A Statistical Learning Approach to Modal Regression
- Information Theoretic Learning
- Regularization schemes for minimum error entropy principle
- Online Pairwise Learning Algorithms
- On Estimation of a Probability Density Function and Mode
- The Fast Gauss Transform
- Theory of Reproducing Kernels
This page was built for publication: Online minimum error entropy algorithm with unbounded sampling