Applications of the Sufficiency Principle in Acceleration of Neural Networks Trainig

One of the problems in AI tasks solving by neurocomputing methods is a considerable training time. This problem especially appears when it is needed to reach high quality in forecast reliability or pattern recognition. Some formalised ways for increasing of networks’ training speed without loosing of precision are proposed here. The offered approaches are based on the Sufficiency Principle, which is formal representation of the aim of a concrete task and conditions (limitations) of their solving [1]. This is development of the concept that includes the formal aims’ description to the context of such AI tasks as classification, pattern recognition, estimation etc.

A Fractional Analog of the Duhamel Principle

Mathematics Subject Classification: 35CXX, 26A33, 35S10

Application of Subordination Principle to Log-Harmonic alpha-spirallike Mappings

MSC 2010: 30C45, 30C55

Applications of Subordination Principle to Log-Harmonic Mappings

MSC 2010: 30C45, 30C55

Hamilton’s Principle with Variable Order Fractional Derivatives

MSC 2010: 26A33, 70H25, 46F12, 34K37 Dedicated to 80-th birthday of Prof. Rudolf Gorenflo

Maximum Principle and Its Application for the Time-Fractional Diffusion Equations

MSC 2010: 26A33, 33E12, 35B45, 35B50, 35K99, 45K05 Dedicated to Professor Rudolf Gorenflo on the occasion of his 80th anniversary

On Principle Eigenvalue for Linear Second Order Elliptic Equations in Divergence Form

2002 Mathematics Subject Classification: 35J15, 35J25, 35B05, 35B50

Minimum Description Length Principle in Discriminating Marginal Distributions

2010 Mathematics Subject Classification: 94A17, 62B10, 62F03.