Demo Data from EDBT 2026 / reviewers in the wild / expert
Taobo Liao
dblp:408/1979
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0002-8470-1017ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Security and privacy of machine learning · 50% Hardware security and side channels · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Security and privacy of machine learning › verifiable machine learning
model verification |
1.0 | 1 | 2026 | TAO: Tolerance-Aware Optimistic Verification for Floating-Point Neural Networks · EuroSys 2026 |
Hardware security and side channels
trusted execution environments |
1.0 | 1 | 2026 | TAO: Tolerance-Aware Optimistic Verification for Floating-Point Neural Networks · EuroSys 2026 |
Methods — techniques the papers use, named apart from their topics
merkle tree · 1.0interactive dispute game · 1.0empirical percentile profiling · 1.0IEEE-754 error bounds · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | TAO: Tolerance-Aware Optimistic Verification for Floating-Point Neural NetworksabstractNeural networks increasingly run on hardware outside the user's control (cloud GPUs, inference marketplaces, edge specialized accelerators) for both training and inference. Yet ML-as-a-Service reveals little about what actually ran or whether returned outputs faithfully reflect the intended inputs and models. Users lack recourse against service downgrades such as model swaps, quantization, graph rewrites, or discrepancies like altered advertisement embeddings. Verifying outputs is especially difficult because floating-point execution on heterogeneous accelerators is inherently non-deterministic. Existing approaches like zkML, deterministic replay, TEEs, and replication are either impractical for real floating-point neural networks or reintroduce the need to trust the vendor. We present TAO: a Tolerance-Aware Optimistic verification protocol for floating-point neural networks that accepts outputs within principled operator-level acceptance regions rather than requiring bitwise equality. TAO combines two complementary error models: (i) sound per-operator IEEE-754 worst-case bounds and (ii) tight empirical percentile profiles calibrated across hardware types. Discrepancies are resolved via a Merkle-anchored, threshold-guided interactive dispute game that recursively partitions the traced computation graph until one operator remains; at the leaf, adjudication reduces to either a lightweight theoretical-bound check or a small honest-majority vote against empirical thresholds. Unchallenged results finalize after a challenge window, without requiring trusted hardware or deterministic kernels. Jianzhu Yao, Hongxu Su, Taobo Liao, Zerui Cheng, Huan Zhang 0001, Xuechao Wang, Pramod Viswanath |
EuroSys | 3 |