Skip to main navigation
Skip to search
Skip to main content
PolyU Scholars Hub Home
Help & FAQ
Link opens in a new tab
Search content at PolyU Scholars Hub
Home
Researchers
Units
Research output
Prizes
Activities
Press/Media
Student theses
Distributed minimum error entropy algorithms
Xin Guo
, Ting Hu
, Qiang Wu
Department of Applied Mathematics
The Hong Kong Polytechnic University
Research output
:
Journal article publication
›
Journal article
›
Academic research
›
peer-review
20
Link opens in a new tab
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Distributed minimum error entropy algorithms'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Unlabeled Data
100%
Minimum Error Entropy
100%
Entropy Algorithm
100%
Learning Rate
60%
Computing Node
40%
Fully-supervised
40%
Supervised Data
40%
Computational Memory
20%
Computational Complexity
20%
Decomposition Method
20%
Memory Requirements
20%
Communication Overhead
20%
Regularity Assumption
20%
Divide-and-conquer
20%
Distributed Algorithms
20%
Robustness to Noise
20%
Learning Problems
20%
Kernel Methods
20%
Kernel Regression
20%
U-statistics
20%
Semi-supervised Learning
20%
Labeled Data
20%
Integral Operator
20%
Regularized Least Squares
20%
Privacy Protection
20%
Reproducing Kernel
20%
Pairwise Learning
20%
Learning Loss
20%
Saturation Phenomenon
20%
Ination
20%
Entropy Principle
20%
Inter-node Communication
20%
Decentralized Data
20%
Non-convex Cost Function
20%
Semi-supervised Data
20%
Error Decomposition
20%
Optimal Learning Rate
20%
Information Theoretic Learning
20%
Weak Regularity
20%
Entropy Learning
20%
Learning Scenarios
20%
Minimax Optimal
20%
Computer Science
Unlabeled Data
100%
Entropy
100%
Learning Rate
80%
Privacy Protection
20%
Data Source
20%
Communication Overhead
20%
Least Squares Methods
20%
Distributed Algorithm
20%
Learning Problem
20%
Computational Complexity
20%
Semisupervised Learning
20%
Memory Requirement
20%
Reproducing Kernel
20%