Locally Imposing Function for Generalized Constraint Neural Networks - A Study on Equality Constraints

04/18/2016
by   Linlin Cao, et al.
0

This work is a further study on the Generalized Constraint Neural Network (GCNN) model [1], [2]. Two challenges are encountered in the study, that is, to embed any type of prior information and to select its imposing schemes. The work focuses on the second challenge and studies a new constraint imposing scheme for equality constraints. A new method called locally imposing function (LIF) is proposed to provide a local correction to the GCNN prediction function, which therefore falls within Locally Imposing Scheme (LIS). In comparison, the conventional Lagrange multiplier method is considered as Globally Imposing Scheme (GIS) because its added constraint term exhibits a global impact to its objective function. Two advantages are gained from LIS over GIS. First, LIS enables constraints to fire locally and explicitly in the domain only where they need on the prediction function. Second, constraints can be implemented within a network setting directly. We attempt to interpret several constraint methods graphically from a viewpoint of the locality principle. Numerical examples confirm the advantages of the proposed method. In solving boundary value problems with Dirichlet and Neumann constraints, the GCNN model with LIF is possible to achieve an exact satisfaction of the constraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2020

Learning Manifolds for Sequential Motion Planning

Motion planning with constraints is an important part of many real-world...
research
01/26/2012

Constraint Propagation as Information Maximization

This paper draws on diverse areas of computer science to develop a unifi...
research
02/19/2021

Efficient Riccati recursion for optimal control problems with pure-state equality constraints

A novel approach to efficiently treat pure-state equality constraints in...
research
09/24/2012

A New Continuous-Time Equality-Constrained Optimization Method to Avoid Singularity

In equality-constrained optimization, a standard regularity assumption i...
research
07/10/2013

Tractable Combinations of Global Constraints

We study the complexity of constraint satisfaction problems involving gl...
research
03/02/2023

DeepSaDe: Learning Neural Networks that Guarantee Domain Constraint Satisfaction

As machine learning models, specifically neural networks, are becoming i...
research
09/08/2022

Incremental Correction in Dynamic Systems Modelled with Neural Networks for Constraint Satisfaction

This study presents incremental correction methods for refining neural n...

Please sign up or login with your details

Forgot password? Click here to reset