paper-with-me

홈 › Papers

Verifiable evaluations of machine learning models using zkSNARKs

2024-02-05 · Tobin South, Alexander Camuto, Shrey Jain, Shayla Nguyen, Robert Mahari, Christian Paquin, Jason Morton, Alex 'Sandy' Pentland

In a world of increasing closed-source commercial machine learning models, model evaluations from developers must be taken at face value. These benchmark results-whether over task accuracy, bias evaluations, or safety checks-are traditionally impossible to verify by a model end-user without the costly or impossible process of re-performing the benchmark on black-box model outputs. This work presents a method of verifiable model evaluation using model inference through zkSNARKs. The resulting zero-knowledge computational proofs of model outputs over datasets can be packaged into verifiable evaluation attestations showing that models with fixed private weights achieve stated performance or fairness metrics over public inputs. We present a flexible proving system that enables verifiable attestations to be performed on any standard neural network model with varying compute requirements. For the first time, we demonstrate this across a sample of real-world models and highlight key challenges and design solutions. This presents a new transparency paradigm in the verifiable evaluation of private models.

📄 PDF Abstract BibTeX arXiv:2402.02675

Code (1)

tobinsouth/verifiableevals 공식 구현 pytorch

Tasks

Fairness

Similar Papers 제목 키워드 기반

Tiered Reasoning for Intuitive Physics: Toward Verifiable Commonsense Language Understanding

2021-09-10 · Findings (EMNLP) 2021 11 · Shane Storks, Qiaozi Gao, Yichi Zhang, Joyce Chai

Large-scale, pre-trained language models (LMs) have achieved human-level performance on a breadth of language understanding tasks. However, evaluations only based on end task performance shed little light on machines' tr…

valid

Bridging Offline and Online Reinforcement Learning for LLMs

2025-06-26 · Jack Lanchantin, Angelica Chen, Janice Lan, Xian Li 외

We investigate the effectiveness of reinforcement learning methods for finetuning large language models when transitioning from offline to semi-online to fully online regimes for both verifiable and non-verifiable tasks.…

Instruction FollowingMathreinforcement-learningReinforcement Learning

TrustErase: Auditable Instant Machine Unlearning with Passport-Embedded Representations

2026-06-15 · Rutger Hendrix, Leonardo G. Russo, Concetto Spampinato, Matteo Pennisi 외 arxiv

The demand for privacy-compliant AI has amplified the need for machine unlearning; yet, existing retraining or distillation-based methods remain unverifiable and computationally costly. We introduce TrustErase, a verifia…

zkUnlearner: A Zero-Knowledge Framework for Verifiable Unlearning with Multi-Granularity and Forgery-Resistance

2025-09-08 · Nan Wang, Nan Wu, Xiangyu Hui, Jiafan Wang 외 arxiv

As the demand for exercising the "right to be forgotten" grows, the need for verifiable machine unlearning has become increasingly evident to ensure both transparency and accountability. We present {\em zkUnlearner}, the…

TinyJudge: Unverifiable Constraint Alignment via Lightweight Specialist Ensembles

2026-04-19 · Yirong Zeng, Yufei Liu, Xiao Ding, Yutai Hou 외 arxiv

Instruction Following (IF) is a core capability of LLMs, requiring strict adherence to diverse constraints, ranging from verifiable ones (e.g., output length) to unverifiable ones (e.g., tone). Reinforcement learning wit…

Reinforcement LearningInstruction Following