mlsanityData to 14 Oct 2026

Proteus: Preserving Model Confidentiality during Graph Optimizations

arXiv 2404.12512 ↗First posted 18 Apr 2024cs.CR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Deep learning (DL) models have revolutionized numerous domains, yet optimizing them for computational efficiency remains a challenging endeavor. Development of new DL models typically involves two parties: the model developers and performance optimizers. The collaboration between the parties often necessitates the model developers exposing the model architecture and computational graph to the optimizers. However, this exposure is undesirable since the model architecture is an important intellectual property, and its innovations require significant investments and expertise. During the exchange, the model is also vulnerable to adversarial attacks via model stealing. This paper presents Proteus, a novel mechanism that enables model optimization by an independent party while preserving the confidentiality of the model architecture. Proteus obfuscates the protected model by partitioning its computational graph into subgraphs and concealing each subgraph within a large pool of generated realistic subgraphs that cannot be easily distinguished from the original. We evaluate Proteus on a range of DNNs, demonstrating its efficacy in preserving confidentiality without compromising performance optimization opportunities. Proteus effectively hides the model as one alternative among up to 1032 possible model architectures, and is resilient against attacks with a learning-based adversary. We also demonstrate that heuristic based and manual approaches are ineffective in identifying the protected model. To our knowledge, Proteus is the first work that tackles the challenge of model confidentiality during performance optimization. Proteus will be open-sourced for direct use and experimentation, with easy integration with compilers such as ONNXRuntime.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 17 of its 45 references that are in the map. First posted on arXiv 18 Apr 2024.

Builds on

17 of 45 references.

References · 17

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  2. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
  3. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  4. 2017Inductive Representation Learning on Large Graphscited by 6,320
  5. 2017Squeeze-and-Excitation Networkscited by 4,789
  6. 2017Learning Transferable Architectures for Scalable Image Recognitioncited by 1,101
  7. 2016Practical Black-Box Attacks against Machine Learningcited by 903
  8. 2016Stealing Machine Learning Models via Prediction APIscited by 619
  9. 2018GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Modelscited by 413
  10. 2020Ansor: Generating High-Performance Tensor Programs for Deep Learningcited by 201
  11. 2018Stealing Hyperparameters in Machine Learningcited by 118
  12. 2020NATS-Bench: Benchmarking NAS Algorithms for Architecture Topology and Sizecited by 98
5 more
  1. 2018Glow: Graph Lowering Compiler Techniques for Neural Networkscited by 75
  2. 2017CryptoDL: Deep Neural Networks over Encrypted Datacited by 56
  3. 2022SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learningcited by 47
  4. 2022Hidet: Task-Mapping Programming Paradigm for Deep Learning Tensor Programscited by 28
  5. 2018Intel nGraph: An Intermediate Representation, Compiler, and Executor for Deep Learningcited by 23

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.