Neural Fields with Hard Constraints of Arbitrary Differential Order

06/15/2023
by   Fangcheng Zhong, et al.
0

While deep learning techniques have become extremely popular for solving a broad range of optimization problems, methods to enforce hard constraints during optimization, particularly on deep neural networks, remain underdeveloped. Inspired by the rich literature on meshless interpolation and its extension to spectral collocation methods in scientific computing, we develop a series of approaches for enforcing hard constraints on neural fields, which we refer to as Constrained Neural Fields (CNF). The constraints can be specified as a linear operator applied to the neural field and its derivatives. We also design specific model representations and training strategies for problems where standard models may encounter difficulties, such as conditioning of the system, memory consumption, and capacity of the network when being constrained. Our approaches are demonstrated in a wide range of real-world applications. Additionally, we develop a framework that enables highly efficient model and constraint specification, which can be readily applied to any downstream task where hard constraints need to be explicitly satisfied during optimization.

READ FULL TEXT

page 7

page 14

page 18

page 19

page 20

page 21

page 22

page 23

research
04/25/2021

DC3: A learning method for optimization with hard constraints

Large optimization problems with hard constraints arise in many settings...
research
05/15/2019

Output-Constrained Bayesian Neural Networks

Bayesian neural network (BNN) priors are defined in parameter space, mak...
research
01/26/2020

A Lagrangian Dual Framework for Deep Neural Networks with Constraints

A variety of computationally challenging constrained optimization proble...
research
01/04/2021

Learning to Optimize Under Constraints with Unsupervised Deep Neural Networks

In this paper, we propose a machine learning (ML) method to learn how to...
research
12/02/2020

Improving Solution Quality of Bounded Max-Sum Algorithm to Solve DCOPs involving Hard and Soft Constraints

Bounded Max-Sum (BMS) is a message-passing algorithm that provides appro...
research
05/26/2020

Hard Shape-Constrained Kernel Machines

Shape constraints (such as non-negativity, monotonicity, convexity) play...
research
10/16/2012

Uniform Solution Sampling Using a Constraint Solver As an Oracle

We consider the problem of sampling from solutions defined by a set of h...

Please sign up or login with your details

Forgot password? Click here to reset