Kernel gradient descent algorithm for information theoretic learning
From MaRDI portal
Recommendations
Cites work
- Adaptive kernel methods using the balancing principle
- Best choices for regularization parameters in learning theory: on the bias-variance problem.
- Blind source separation using Renyi's -marginal entropies.
- Capacity of reproducing kernel spaces in learning theory
- Consistency analysis of an empirical minimum error entropy algorithm
- Convergence of Gradient Descent for Minimum Error Entropy Principle in Linear Regression
- Cross-validation based adaptation for regularization operators in learning theory
- Distributed kernel gradient descent algorithm for minimum error entropy principle
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Early stopping and non-parametric regression: an optimal data-dependent stopping rule
- Information theoretic learning. Renyi's entropy and kernel perspectives
- Iterative regularization for learning with convex loss functions
- Learning rates for regularized least squares ranking algorithm
- Learning rates of least-square regularized regression
- Learning theory approach to minimum error entropy criterion
- Leave-One-Out Bounds for Kernel Methods
- Minimum Total Error Entropy Method for Parameter Estimation
- On early stopping in gradient descent learning
- On regularization algorithms in learning theory
- Online Pairwise Learning Algorithms
- Online Regularized Classification Algorithms
- Online gradient descent learning algorithms
- Optimal rates for spectral algorithms with least-squares regression over Hilbert spaces
- Optimal rates for the regularized least-squares algorithm
- Probability Inequalities for Sums of Bounded Random Variables
- Regularization schemes for minimum error entropy principle
- Stochastic gradient algorithm under (h, )-entropy criterion
- Support Vector Machines
- Support vector machine soft margin classifiers: error analysis
- The MEE principle in data classification: a perceptron-based analysis
- The convergence rate of a regularized ranking algorithm
- The covering number in learning theory
- Unregularized online learning algorithms with general loss functions
Cited in
(14)- Identification of the ARX model with random impulse noise based on forgetting factor multi-error information entropy
- On the Choice of the Kernel Function in Kernel Discriminant Analysis Using Information Complexity
- Virtual sensors for semiconductor manufacturing: A nonparametric approach -- exploiting information theoretic learning and kernel machines
- Learning from examples with information theoretic criteria
- On the Combination of Information-Theoretic Kernels with Generative Embeddings
- Information theoretic learning. Renyi's entropy and kernel perspectives
- Independent Component Analysis and Blind Signal Separation
- A Reproducing Kernel Hilbert Space Framework for Information-Theoretic Learning
- Information theoretic learning with adaptive kernels
- Error analysis of kernel regularized pairwise learning with a strongly convex loss
- scientific article; zbMATH DE number 1694978 (Why is no real title available?)
- A new robust fixed-point algorithm and its convergence analysis
- Information Theoretic Learning and Kernel Methods
- Learning theory of minimum error entropy under weak moment conditions
This page was built for publication: Kernel gradient descent algorithm for information theoretic learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223567)
