ReLU Hull Approximation
Approximate ReLU hulls by reusing their linear pieces and constructing enclosing upper faces, rather than building the exact hull.
Diving deep into my PhD journey at The University of Queensland.
I study how formal methods and convex approximation can provide sound guarantees for neural networks.
Two results in convex approximation for neural network verification.
Approximate ReLU hulls by reusing their linear pieces and constructing enclosing upper faces, rather than building the exact hull.
Use double-linear-piece functions to simplify local activation geometry and construct convex over-approximations beyond ReLU.
The rest of the work covers model usage control and privacy in language models. See all publications.
NNV Guide · A series in progress
Understand what a verifier proves, how bounds and relaxations work, and where their guarantees end.
29 guides · 4 parts · Foundations to advanced topics
What a verifier is asked to prove, and what its answer means.
How bounds, relaxations and solver pipelines turn that question into constraints.
Specifications, benchmarks, and the testing that complements a proof.
Where verification gets expensive, and which architectures and defenses answer it.
Supporting tools for working with models and specifications.
A tool for converting ONNX models to PyTorch models (`.pth` for parameters, `.py` for structure).
A tool to convert VNN-LIB files (`.vnnlib`) to PyTorch tensors (`.pth` files) for efficient neural network verification.
For the activation-hull construction behind WraAct, there is the wraact Python library.
Acceptances, awards and releases.
Our paper Catch-Only-One: Non-Transferable Examples for Model-Specific Authorization is accepted by NeurIPS'26 as an oral presentation (112 of 30709 submissions, about 0.36%). Congrats, Zihan, Ethan and Zhongkui!
Our paper Non-Transferable Examples receives the Best Paper Award - Runner Up at the ECCV'26 LifeGenIP Workshop. Congrats, Zihan!
Our paper Re-Key-Free, Risky-Free: Adaptable Model Usage Control is accepted by Euro S&P'26. Congrats, Zihan!
Our paper Mitigating Gradient Inversion Risks in Language Models via Token Obfuscation is accepted by Asia CCS'2026. Congrats, Xinguo!
Our paper Convex Hull Approximation for Activation Functions is accepted by OOPSLA'25 within SPLASH'25. Happy!
Our paper AI Model Modulation with Logits Redistribution is accepted by WWW'25. Congrats, Zihan!
Our paper Uncovering Gradient Inversion Risks in Practical Language Model Training is accepted by CCS'24. Congrats, Xinguo!
Our paper CORELOCKER: Neuron-level Usage Control is accepted by S&P'24. Congrats, Zihan! [Live Video]
Our paper ReLU Hull Approximation is accepted by POPL'24.
Notes on the tools behind the work.
A dual-track shape inference tool that resolves ONNX's dynamic shapes to concrete static values for neural network verification workflows.
January 2026A pure Python toolkit for optimizing ONNX models specifically for verification workflows, validated on the VNN-COMP 2024 benchmark suites.
January 2026