Pith. sign in

REVIEW 2 cited by

Neural Fields with Hard Constraints of Arbitrary Differential Order

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.08943 v2 pith:KWT2T3OR submitted 2023-06-15 cs.LG cs.NAmath.NA

classification cs.LGcs.NAmath.NA
keywords constraintsneuralhardfieldsoptimizationappliedapproachesconstrained
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. mPOLICE: Provable Enforcement of Multi-Region Affine Constraints in Deep Neural Networks

    cs.LG 2025-02 conditional novelty 6.0 of 10

    mPOLICE generalizes POLICE to enforce exact affine output constraints inside multiple disjoint convex regions of a ReLU network's input by giving each region its own activation pattern.

  2. HoP: Homeomorphic Polar Learning for Hard Constrained Optimization

    cs.LG 2025-02 conditional novelty 6.0 of 10

    A polar-coordinate homeomorphic mapping lets a neural network output only feasible points for star-convex constraints, with tests showing lower objective values and zero violations than baseline L2O solvers.

Pith tools