Pith. sign in

REVIEW 1 cited by

WANCO: Weak Adversarial Networks for Constrained Optimization problems

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 2407.03647 v1 pith:N32YXHDH submitted 2024-07-04 math.OC cs.AI

classification math.OCcs.AI
keywords problemsconstraintsoptimizationnetworksadversarialconstrainedaugmenteddeep
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper focuses on integrating the networks and adversarial training into constrained optimization problems to develop a framework algorithm for constrained optimization problems. For such problems, we first transform them into minimax problems using the augmented Lagrangian method and then use two (or several) deep neural networks(DNNs) to represent the primal and dual variables respectively. The parameters in the neural networks are then trained by an adversarial process. The proposed architecture is relatively insensitive to the scale of values of different constraints when compared to penalty based deep learning methods. Through this type of training, the constraints are imposed better based on the augmented Lagrangian multipliers. Extensive examples for optimization problems with scalar constraints, nonlinear constraints, partial differential equation constraints, and inequality constraints are considered to show the capability and robustness of the proposed method, with applications ranging from Ginzburg--Landau energy minimization problems, partition problems, fluid-solid topology optimization, to obstacle problems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Layer Separation Deep Learning Model with Auxiliary Variables for Partial Differential Equations

    cs.LG 2025-07 conditional novelty 5.0 of 10

    LySep separates the layers and derivatives of a PINN into auxiliary variables, yielding a shallow, easier-to-optimize loss that remains provably consistent with the original PINN loss.

Pith tools