Pages that link to "Item:Q2175022"
From MaRDI portal
The following pages link to Distributed kernel gradient descent algorithm for minimum error entropy principle (Q2175022):
Displaying 16 items.
- Distributed regularized least squares with flexible Gaussian kernels (Q2036424) (← links)
- Fast rates of minimum error entropy with heavy-tailed noise (Q2168008) (← links)
- Kernel-based maximum correntropy criterion with gradient descent method (Q2191846) (← links)
- Kernel gradient descent algorithm for information theoretic learning (Q2223567) (← links)
- Averaging versus voting: a comparative study of strategies for distributed classification (Q2668577) (← links)
- (Q4969157) (← links)
- (Q4969211) (← links)
- A Framework of Learning Through Empirical Gain Maximization (Q5004380) (← links)
- Learning theory of minimum error entropy under weak moment conditions (Q5037873) (← links)
- Distributed spectral pairwise ranking algorithms (Q5060714) (← links)
- Robust kernel-based distribution regression (Q5157866) (← links)
- (Q5159455) (← links)
- Convergence analysis of distributed multi-penalty regularized pairwise learning (Q5220068) (← links)
- Block coordinate type methods for optimization and learning (Q5889894) (← links)
- Infinite-dimensional stochastic transforms and reproducing kernel Hilbert space (Q6049820) (← links)
- Pairwise learning problems with regularization networks and Nyström subsampling approach (Q6488738) (← links)
