Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Learning deep kernels in the space of dot product polynomials
Donini M., Aiolli F. Machine Learning106 (9-10):1245-1269,2017.Type:Article
Date Reviewed: May 16 2018

A very detailed and thorough description of a novel approach, this paper presents a well-motivated technical account.

The purpose of the proposed research is to define a general methodology for determining “a hierarchy of base kernels” and combining them via multiple kernel learning “to generate overall deeper kernels,” as recent advances in the area of neural networks discover the merits of deep representations. The approach consists of defining a “qualitative measure of expressiveness of a kernel” based on “trace ... and Frobenius norms of the kernel matrix,” showing “connections with the rank of the matrix,” radius of the minimum enclosing ball (MEB), and the empirical Rademacher complexity (ERC) of linear functions within the feature space. Further, the multi-kernel learning method is designed to learn the coefficients of general dot product polynomials.

The paper presents a very detailed explanation of the approach, including all formulas, theorems, and proofs, and adds very broad empirical evidence for its benefits by showing experimentation results in different contexts, comparing them with well-established baselines such as radial basis function (RBF) and homogeneous and nonhomogeneous polynomials, and demonstrating that exploiting the feature structure of the network when building the base kernels brings significant improvements in performance.

A very thorough and well-argued description, with a wealth of examples, explanations, and empirical results, and a solid basis on references and related work, this paper is an excellent read for scholars, engineers, and practitioners interested in machine learning and neural networks for research and application purposes.

Reviewer:  Mariana Damova Review #: CR146034 (1807-0398)
Bookmark and Share
  Featured Reviewer  
 
Learning (I.2.6 )
 
Would you recommend this review?
yes
no
Other reviews under "Learning": Date
Learning in parallel networks: simulating learning in a probabilistic system
Hinton G. (ed) BYTE 10(4): 265-273, 1985. Type: Article
Nov 1 1985
Macro-operators: a weak method for learning
Korf R. Artificial Intelligence 26(1): 35-77, 1985. Type: Article
Feb 1 1986
Inferring (mal) rules from pupils’ protocols
Sleeman D.  Progress in artificial intelligence (, Orsay, France,391985. Type: Proceedings
Dec 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy