Pith. sign in

REVIEW 1 cited by

NCVX: A General-Purpose Optimization Solver for Constrained Machine and Deep Learning

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 2210.00973 v2 pith:IPC57PUD submitted 2022-10-03 cs.LG cs.CVcs.MSeess.SPmath.OC

classification cs.LGcs.CVcs.MSeess.SPmath.OC
keywords deeplearningncvxoptimizationconstraintsconstrainedgeneral-purposemachine
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Imposing explicit constraints is relatively new but increasingly pressing in deep learning, stimulated by, e.g., trustworthy AI that performs robust optimization over complicated perturbation sets and scientific applications that need to respect physical laws and constraints. However, it can be hard to reliably solve constrained deep learning problems without optimization expertise. The existing deep learning frameworks do not admit constraints. General-purpose optimization packages can handle constraints but do not perform auto-differentiation and have trouble dealing with nonsmoothness. In this paper, we introduce a new software package called NCVX, whose initial release contains the solver PyGRANSO, a PyTorch-enabled general-purpose optimization package for constrained machine/deep learning problems, the first of its kind. NCVX inherits auto-differentiation, GPU acceleration, and tensor variables from PyTorch, and is built on freely available and widely used open-source frameworks. NCVX is available at https://ncvx.org, with detailed documentation and numerous examples from machine/deep learning and other fields.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 2 citations worldwide. Full citation record

  1. Exact Reformulation and Optimization for Direct Metric Optimization in Binary Imbalanced Classification

    cs.LG 2025-07 conditional novelty 8.0 of 10

    A continuous exact reformulation lets precision, recall, and F-beta metrics be optimized with gradient methods, avoiding smooth surrogate losses.

Pith tools