AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (416.2 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

New regularization methods for convolutional kernel tensors

School of Science, China University of Geosciences, Beijing 100083, China
Show Author Information

Abstract

Convolution is a very basic and important operation for convolutional neural networks. For neural network training, how to bound the convolutional layers is a currently popular research topic. Each convolutional layer is represented by a tensor, which corresponds to a structured transformation matrix. The objective is to ensure that the singular values of each transformation matrix are bounded around 1 by changing the entries of the tensor. We propose three new regularization terms for a convolutional kernel tensor and derive the gradient descent algorithm for each penalty function. Numerical examples are presented to demonstrate the effectiveness of the algorithms.

CLC number: 15B05, 65F15

References

【1】
【1】
 
 
AIMS Mathematics
Pages 26188-26198

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Guo P-C. New regularization methods for convolutional kernel tensors. AIMS Mathematics, 2023, 8(11): 26188-26198. https://doi.org/10.3934/math.20231335

3

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 28 June 2023
Revised: 21 August 2023
Accepted: 31 August 2023
Published: 15 November 2023
©2023 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)