Interpretable Complex-Valued Neural Networks for Privacy Protection
Not on the map. Why?
Abstract (arXiv)
Previous studies have found that an adversary attacker can often infer unintended input information from intermediate-layer features. We study the possibility of preventing such adversarial inference, yet without too much accuracy degradation. We propose a generic method to revise the neural network to boost the challenge of inferring input attributes from features, while maintaining highly accurate outputs. In particular, the method transforms real-valued features into complex-valued ones, in which the input is hidden in a randomized phase of the transformed features. The knowledge of the phase acts like a key, with which any party can easily recover the output from the processing result, but without which the party can neither recover the output nor distinguish the original input. Preliminary experiments on various datasets and network structures have shown that our method significantly diminishes the adversary's ability in inferring about the input while largely preserves the resulting accuracy.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Jan 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 5; 2024: 0; 2025: 0; 2026: 1.
10 papers.
- 2022FR: Folded Rationalization with a Unified Encodercited by 18
- 2023Enhancing the Rationale-Input Alignment for Self-explaining Rationalizationcited by 15
- 2023Bounding the Invertibility of Privacy-preserving Instance Encoding using Fisher Informationcited by 11
- 2021AdaSplit: Adaptive Trade-offs for Resource-constrained Distributed Deep Learningcited by 8
- 2022Measuring and Controlling Split Layer Privacy Leakage Using Fisher Informationcited by 3
- 2023Adapting Pre-trained Language Models for Quantum Natural Language Processingcited by 2
- 2023Roulette: A Semantic Privacy-Preserving Device-Edge Collaborative Inference Framework for Deep Learning Classification Taskscited by 2
- 2023Approximating ReLU on a Reduced Ring for Efficient MPC-based Private Inferencecited by 2
- 2021Neural Networks with Complex-Valued Weights Have No Spurious Local Minimacited by 0
- 2026Spectrum-Aware Bounds on Invertibility for Privacy-Enhancing Instance Encodingcited by 0
- 2026Spectrum-Aware Bounds on Invertibility for Privacy-Enhancing Instance Encoding24 Aug 2026
- 2023Enhancing the Rationale-Input Alignment for Self-explaining Rationalization7 Dec 2023
- 2023Approximating ReLU on a Reduced Ring for Efficient MPC-based Private Inference9 Sep 2023
- 2023Roulette: A Semantic Privacy-Preserving Device-Edge Collaborative Inference Framework for Deep Learning Classification Tasks6 Sep 2023
- 2023Bounding the Invertibility of Privacy-preserving Instance Encoding using Fisher Information6 May 2023
- 2023Adapting Pre-trained Language Models for Quantum Natural Language Processing24 Feb 2023
- 2022Measuring and Controlling Split Layer Privacy Leakage Using Fisher Information21 Sep 2022
- 2022FR: Folded Rationalization with a Unified Encoder17 Sep 2022
- 2021AdaSplit: Adaptive Trade-offs for Resource-constrained Distributed Deep Learning2 Dec 2021
- 2021Neural Networks with Complex-Valued Weights Have No Spurious Local Minima31 Jan 2021