Pith. sign in

REVIEW 1 cited by

Robustness Certification of Generative Models

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 2004.14756 v1 pith:BF7NSBGJ submitted 2020-04-30 cs.LG cs.CRcs.PLstat.ML

classification cs.LGcs.CRcs.PLstat.ML
keywords approxlinegenerativecertificationimagesmodelsnetworksneuralnon-convex
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Generative neural networks can be used to specify continuous transformations between images via latent-space interpolation. However, certifying that all images captured by the resulting path in the image manifold satisfy a given property can be very challenging. This is because this set is highly non-convex, thwarting existing scalable robustness analysis methods, which are often based on convex relaxations. We present ApproxLine, a scalable certification method that successfully verifies non-trivial specifications involving generative models and classifiers. ApproxLine can provide both sound deterministic and probabilistic guarantees, by capturing either infinite non-convex sets of neural network activation vectors or distributions over such sets. We show that ApproxLine is practically useful and can verify interesting interpolations in the networks latent space.

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. Specification Generation for Neural Networks in Systems

    cs.AI 2024-12 conditional novelty 6.0 of 10

    SpecTRA generates specifications for neural networks in adaptive bitrate and congestion control by clustering observations from trusted reference algorithms.

Pith tools