WO2013182176A1 - Procédé pour entraîner un réseau de neurones artificiels etproduits-programmes informatiques - Google Patents

Procédé pour entraîner un réseau de neurones artificiels etproduits-programmes informatiques Download PDF

Info

Publication number
WO2013182176A1
WO2013182176A1 PCT/DE2013/000205 DE2013000205W WO2013182176A1 WO 2013182176 A1 WO2013182176 A1 WO 2013182176A1 DE 2013000205 W DE2013000205 W DE 2013000205W WO 2013182176 A1 WO2013182176 A1 WO 2013182176A1
Authority
WO
WIPO (PCT)
Prior art keywords
output
neurons
values
training
output neurons
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/DE2013/000205
Other languages
German (de)
English (en)
Inventor
Gerhard DÖDING
László GERMÁN
Klaus Kemper
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
KISTERS AG
Original Assignee
KISTERS AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by KISTERS AG filed Critical KISTERS AG
Publication of WO2013182176A1 publication Critical patent/WO2013182176A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/08Learning methods
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/04Architecture, e.g. interconnection topology
    • G06N3/0499Feedforward networks
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/08Learning methods
    • G06N3/09Supervised learning

Definitions

  • the invention relates to a method for training an artificial neural network and computer program products.
  • the method relates to training an artificial neural network having at least one hidden layer with tributary neurons and an output layer with output neurons.
  • the networks used are massively parallel structures for modeling arbitrary functional relationships. For this they are offered training data that represent the relationships to be modeled using examples. During training, the internal parameters of the neural networks, such as their synaptic weights, are adjusted by training processes to produce the desired response to the input data. This training is called supervised learning.
  • CONFIRMATION COPY For this purpose, the errors of the output neurons are propagated backwards into the network (backpropagation). Using various processes (gradient descent, heuristic methods such as particle swarm optimization or evolution method), the synaptic weights of all neurons in the network are then changed so that the neural network approximates the desired functionality as precisely as possible.
  • topology refers to the structure of the network. Neurons can be arranged in consecutive layers. For example, in a network with a single trainable neuron layer, one speaks of a single-layer network. The last layer of the network, whose neuron output is usually the only one visible outside the network, is called the output layer. Layers in front of it are accordingly called hidden layers.
  • the inventive method is suitable for neural feed forward networks of any topology having at least one layer with feeder neurons and an output layer with output neurons.
  • the described learning methods serve to cause a neural network to generate associated output patterns for particular input patterns. For this purpose, the network is trained or adapted.
  • the training of artificial neural networks, that is estimating the parameters contained in the model usually leads to high-dimensional nonlinear optimization problems.
  • the object of the invention is to further develop a method for training an artificial neural network in such a way that response values with minimal deviation from the desired output values are provided at predefined input values in the shortest possible time.
  • the upstream neurons generate multilevel nonlinear computations of the input values and the intermediate values of other neurons.
  • the task of the tributary neurons is to create a suitable internal representation of the functionality to be learned in a high-dimensional space.
  • the task of the output neurons is to examine the offer of the feeder neuron and to determine the most suitable selection of non-linear allocation results. [17] Therefore, these two classes of neurons can be adapted differently and it has surprisingly been found that the time required for training an artificial neural network can be significantly reduced if only the output neurons are adapted.
  • the method is based on a new interpretation of the mode of action of feed-forward networks and is essentially based on two process steps: a) Create suitable internal representations of the functionality to be trained. b) Choose an optimal selection from the offer of pre-calculated outputs of the feeder neurons.
  • a feed-forward network is interpreted as a series connection of two subnetworks.
  • the first part contains all the neurons except the output neurons. These neurons are initialized with random synaptic weights, random transfer functions, and random network topology, and are not altered at any stage of the adaptation. Therefore, they also generate only random nonlinear billing of the offered input information.
  • the second part contains only the output neurons. These are connected according to the predetermined network topology with the first part of the network synaptic weights.
  • weights are adapted to the task.
  • This is preferably done with a tichonov-regularized regression between the random allocations (the intermediate result offer of the first subnet) and the necessary activation of the output neurons.
  • the synaptic weights of the output neurons therefore select, according to the invention, from the random offer of the first subnetwork preferably in only one computation step, ie not iteratively and not with methods of gradient descent, the optimal synaptic weights of the output layer.
  • a network can learn by: developing new connections, deleting existing connections, changing the weighting, adjusting the thresholds of the neurons, adding or deleting neurons.
  • the learning behavior changes as the activation function of the neurons changes or the learning rate of the network changes.
  • the synaptic weights of the output neurons be determined to adapt the output neurons.
  • a commonly performed adaptation of the feeder neurons, preferably by adaptation of their synaptic weights, is not necessary according to the invention.
  • the synaptic weights of the output neurons will be determined based on the values of those tributary neurons that are directly connected to the output neurons and the default output values.
  • An advantageous method provides that the output neurons are adapted with fewer than five adaptation steps, preferably only one step.
  • the invention relates to a method for controlling a system in which the future behavior of observable quantities forms the basis for the control function and artificial neural network is trained as described above.
  • a compute rogramm with compute rogrammcodeschn to carry out the described method makes it possible to execute the process as a program on a computer.
  • Such a computer program product can also be stored on a computer-readable data memory.
  • FIG. 1 shows a highly abstracted scheme of an artificial neural network with several levels and feed-forward property
  • Figure 2 is a diagram of an artificial neuron.
  • the artificial neural network (1) shown in Figure 1 consists of 5 neurons (2, 3, 4, 5 and 6), of which the neurons (2, 3, 4) are arranged as a hidden layer and represent feeder neurons, while the neurons (5, 6) represent output neurons as the output layer.
  • the input values (7, 8, 9) are assigned to the feeder neurons (2, 3, 4) and the output neurons (5, 6) are assigned output values (10, 11).
  • the difference between the response (12) of the output neuron (5) and the output value (10), as well as the difference between the response (13) of the output neuron (6) and the output value (11), is referred to as an output error.
  • the artificial neuron scheme shown in Figure 2 shows how inputs (14, 15, 16, 17) result in a response (18).
  • the inputs (xj, x 2 , x 3, x n) are evaluated via weights (19) and a corresponding transfer function (20) leads to an activation (21).
  • An activation function (22) with a threshold value (23) leads to an initial value and thus to a response (18), [45] Since the weighting (19) has the strongest influence on the response (18) of the neurons (2 to 6), the training process will be described below exclusively with regard to an adaptation of the weights of the network (1).
  • the synaptic weights of all output neurons are determined by a ticho- nov regularized regression process between inverted predefined output values (10, 1 1) and those pre-calculation values of the tributary neurons (2, 3, 4) directly connected to the output neurons (5, 6) ) are connected. [49] If the desired approximation target is reached, ie if the output error is smaller than a set upper limit, the method ends here.
  • the method according to the invention allows training within a few seconds or minutes.
  • the method described thus makes it possible to greatly reduce the time required for a given artificial neural network.
  • the network can be chosen large enough to achieve the desired quality of the results.
  • the short training period opens up the use of artificial neural networks in less powerful computers, especially smartphones.
  • Smartphones can thus be continuously trained during their use, after a training phase to provide the user information itself, which he retrieves regularly. If, for example, the user can display special stock market data daily via an application, these stock market data can be automatically displayed to the user during any use of the smartphone without the user first activating the application and retrieving his data.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Molecular Biology (AREA)
  • Artificial Intelligence (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Health & Medical Sciences (AREA)
  • Feedback Control In General (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
PCT/DE2013/000205 2012-06-06 2013-04-18 Procédé pour entraîner un réseau de neurones artificiels etproduits-programmes informatiques Ceased WO2013182176A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US201261689457P 2012-06-06 2012-06-06
US61/689,457 2012-06-06
DE102012011194.0 2012-06-06
DE102012011194A DE102012011194A1 (de) 2012-06-06 2012-06-06 Verfahren zum Trainieren eines künstlichen neuronalen Netzes

Publications (1)

Publication Number Publication Date
WO2013182176A1 true WO2013182176A1 (fr) 2013-12-12

Family

ID=49625670

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE2013/000205 Ceased WO2013182176A1 (fr) 2012-06-06 2013-04-18 Procédé pour entraîner un réseau de neurones artificiels etproduits-programmes informatiques

Country Status (2)

Country Link
DE (1) DE102012011194A1 (fr)
WO (1) WO2013182176A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019096881A1 (fr) * 2017-11-15 2019-05-23 Gottfried Wilhelm Leibniz Universität Hannover Réseau neuronal artificiel et procédé associé

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101807046A (zh) * 2010-03-08 2010-08-18 清华大学 一种基于结构可调极限学习机的在线建模方法

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101807046A (zh) * 2010-03-08 2010-08-18 清华大学 一种基于结构可调极限学习机的在线建模方法

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
G.-B. HUANG ET AL: "Universal Approximation Using Incremental Constructive Feedforward Networks With Random Hidden Nodes", IEEE TRANSACTIONS ON NEURAL NETWORKS, vol. 17, no. 4, 1 July 2006 (2006-07-01), pages 879 - 892, XP055083863, ISSN: 1045-9227, DOI: 10.1109/TNN.2006.875977 *
GUANG-BIN HUANG ET AL: "Extreme learning machines: a survey", INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, vol. 2, no. 2, 25 May 2011 (2011-05-25), pages 107 - 122, XP055083871, ISSN: 1868-8071, DOI: 10.1007/s13042-011-0019-y *
HUANG G B ET AL: "Enhanced random search based incremental extreme learning machine", NEUROCOMPUTING, ELSEVIER SCIENCE PUBLISHERS, AMSTERDAM, NL, vol. 71, no. 16-18, 1 October 2008 (2008-10-01), pages 3460 - 3468, XP025680861, ISSN: 0925-2312, [retrieved on 20071121], DOI: 10.1016/J.NEUCOM.2007.10.008 *
QIN-YU ZHU ET AL: "A fast modular implementation for neural networks", CONTROL, AUTOMATION, ROBOTICS AND VISION CONFERENCE, 2004. ICARCV 2004 8TH KUNMING, CHINA 6-9 DEC. 2004, PISCATAWAY, NJ, USA,IEEE, US, vol. 3, 6 December 2004 (2004-12-06), pages 2270 - 2273, XP010818377, ISBN: 978-0-7803-8653-2, DOI: 10.1109/ICARCV.2004.1469785 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019096881A1 (fr) * 2017-11-15 2019-05-23 Gottfried Wilhelm Leibniz Universität Hannover Réseau neuronal artificiel et procédé associé

Also Published As

Publication number Publication date
DE102012011194A1 (de) 2013-12-12

Similar Documents

Publication Publication Date Title
WO2013170843A1 (fr) Procédé pour l'apprentissage d'un réseau de neurones artificiels
DE112016003245B4 (de) Resistive Verarbeitungseinheit
EP2135140B1 (fr) Procédé de commande et/ou de réglage assisté par ordinateur d'un système technique
EP2112568B1 (fr) Procédé de commande et/ou réglage assistées par ordinateur d'un système technique
DE202017007641U1 (de) Training von maschinellen Lernmodellen auf mehrere maschinelle Lernaufgaben
WO2014121863A1 (fr) Procédé et dispositif de commande d'une installation de production d'énergie exploitable avec une source d'énergie renouvelable
EP4000010A1 (fr) Dispositif et procédé mis en oeuvre par ordinateur pour le traitement de données de capteur numériques et procédé d'entraînement associé
DE112020002186T5 (de) Dnn-training mit asymmetrischen rpu-einheiten
EP3940596A1 (fr) Procédé de configuration d'un agent de commande pour un système technique ainsi que dispositif de commande
WO2020187591A1 (fr) Procédé et dispositif de commande d'un robot
DE60125536T2 (de) Anordnung zur generierung von elementensequenzen
EP4235317A1 (fr) Procédé de commande d'une machine par un agent de commande basé sur l'apprentissage, ainsi que dispositif de commande
WO2024110126A1 (fr) Procédé et dispositif de commande de machine pour commander une machine
WO2019206776A1 (fr) Procédé et dispositif de détermination de la configuration de réseau d'un réseau de neurones artificiels
DE112020005613T5 (de) Neuromorphe Einheit mit Kreuzschienen-Array-Struktur
DE202019103862U1 (de) Vorrichtung zum Erstellen einer Strategie für einen Roboter
DE202019103924U1 (de) Vorrichtung für die Verarbeitung digitaler Sensordaten
WO2023072528A1 (fr) Procédé et dispositif de commande pour commander un système technique
DE102021124252A1 (de) Neuronale Netzwerksysteme für abstraktes Denken
WO2013182176A1 (fr) Procédé pour entraîner un réseau de neurones artificiels etproduits-programmes informatiques
WO2020193481A1 (fr) Procédé et dispositif d'apprentissage et de réalisation d'un réseau neuronal artificiel
DE102019210372A1 (de) Verfahren, Vorrichtung und Computerprogramm zum Erstellen einer Strategie für einen Roboter
DE102022112606B3 (de) Computerimplementiertes Verfahren zur Kalibrierung eines technischen Systems
WO2014015844A1 (fr) Procédé de commande d'une installation, dans lequel les ordres p, q et r des différentes composantes d'un processus n-ar (p) ma (q) x (r) sont déterminés
DE102021115425A1 (de) Verfahren zum Übertragen eines Netzwerkverhaltens eines trainierten Startnetzwerkes auf ein Zielnetzwerk ohne Verwendung eines Originaldatensatzes

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13730460

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 1120130028298

Country of ref document: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13730460

Country of ref document: EP

Kind code of ref document: A1