BRACE: Differential Privacy for Dense Associative Memory with LSR Energy
In this paper, we develop a differential privacy framework for log-sum-ReLU (LSR) dense associative memory, whose finite-support retrieval dynamics pose distinctive challenges for privacy-preserving computation.
Key points
- Dense associative memory (DAM) provides an energy-based framework for memory retrieval with close connections to attention mechanisms in modern artificial intelligence.
- Despite growing interest in differential privacy for AI, the privacy of DAM retrieval dynamics remains relatively unexplored.
- We propose the Boundary-Responsive Adaptive Correction Evolution (BRACE) algorithm, a differentially private retrieval mechanism for LSR-DAM that adaptively corrects boundary-sensitive perturbations to control their cumulative effect over the retrieval trajectory.
- We further establish central limit theorems that enable uncertainty quantification for private retrieval by characterizing its asymptotic distribution and the additional variability introduced by privacy.
Sources (1)
- [1]BRACE: Differential Privacy for Dense Associative Memory with LSR EnergyarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 8, 04:13 AM
In this paper, we develop a differential privacy framework for log-sum-ReLU (LSR) dense associative memory, whose finite-support retrieval dynamics pose distinctive challenges for privacy-preserving computation.
Dense associative memory (DAM) provides an energy-based framework for memory retrieval with close connections to attention mechanisms in modern artificial intelligence.
Extractive summary: sentences quoted from the sources.