Matt Jordan, Alexandros Dimakis
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We present a scalable technique for upper bounding the Lipschitz constant of generative models. We relate this quantity to the maximal norm over the set of attainable vector-Jacobian products of a given generative model. We approximate this set by layerwise convex approximations using zonotopes. Our approach generalizes and improves upon prior work using zonotope transformers and we extend to Lipschitz estimation of neural networks with large output dimension. This provides efficient and tight bounds on small networks and can scale to generative models on VAE and DC-GAN architectures.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2107.02732")
get_code_for_paper("2107.02732")
have("2107.02732")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2107.02732.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2107.02732)
Connect an agent — have() is free.