Home | Resources | Meetups | Conference 2025 | Join the community
Efficient Pruning for Machine Learning under Homomorphic Encryption
by Subhankar Pal - 2024.01.04
Presentation recording (Youtube) | Speaker interview (Youtube) | Paper (Github) | Slides (Github) | Join the discussion (Discord)
Abstract
Homomorphic encryption (HE) based privacy-preserving machine learning (PPML) solutions are gaining widespread popularity. However, model sizes in PPML are limited by computational speed and memory requirements for inference. Pruning the model parameters improves latency and memory in plaintext ML, but has little impact if directly applied to HE-based PPML. This presentation introduces a framework called HE-PEx that carefully applies parameter pruning and permutation methods, on top of a packing technique called tile tensors, for reducing the latency and memory of PPML inference.
About the speaker
Dr. Subhankar Pal is a research scientist at IBM T.J. Watson Research Center in Yorktown Heights, USA. He currently works on hardware and software co-designed approaches for accelerating homomorphic encryption, and SoC-level design methodologies. In the past, he has worked on reconfigurable computer architectures, machine learning hardware and compiler techniques, resource scheduling, among others.
Never miss an update
The newsletter where we post community announcements: https://fheorg.substack.com/
The discord server where you can discuss FHE related topics with the community: https://discord.fhe.org
Make sure to join either (or both) of these to stay informed about future events!