跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2506.18150 · v5

HE-LRM: Encrypted Deep Learning Recommendation Models using Fully Homomorphic Encryption

首次提交 2025-06-23 03:40
版本更新 2026-11-17 09:51
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

FHE inference systems primarily target models with dense inputs, while Deep Learning Recommendation Models (DLRMs) contain sparse categorical features that require lookups into embedding tables. Encrypted lookups are challenging because indexing is not natively supported and must be expressed using SIMD arithmetic. A direct one-hot formulation does not scale. Prior work addresses parts of this problem through embedding compression or compact encrypted queries. However, it does not address complete DLRM inference, leaving open how private lookup interacts with downstream computation and memory constraints. We present HE-LRM, the first end-to-end FHE system for private DLRM inference. We use deterministic compositional embedding compression with client-side digit decomposition, avoiding expensive homomorphic selector construction while consuming only one multiplicative level. We further develop a block-diagonal packing strategy that performs lookups across multiple embedding tables using optimized BSGS linear transformations and produces encrypted embeddings directly compatible with downstream inference. We extend Orion with a high-performance GPU backend and achieve 9 ms for single-inference embedding lookup. We also show that GPU memory capacity limits batching and therefore the latency-bound throughput in such systems. On Criteo, HE-LRM achieves complete encrypted inference with server-side latencies of 154-247 ms on a single GPU. We open-source HE-LRM at https://github.com/baahl-nyu/orion

作者备注:16 pages, 12 figures, 2 tables. Akshath Mahajan and Karthik Garimella contributed equally

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v5,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v5 · 2026-11-17 09:51 · 最新观测版本

HE-LRM: Encrypted Deep Learning Recommendation Models using Fully Homomorphic Encryption

FHE inference systems primarily target models with dense inputs, while Deep Learning Recommendation Models (DLRMs) contain sparse categorical features that require lookups into embedding tables. Encrypted lookups are challenging because indexing is not natively supported and must be expressed using SIMD arithmetic. A direct one-hot formulation does not scale. Prior work addresses parts of this problem through embedding compression or compact encrypted queries. However, it does not address complete DLRM inference, leaving open how private lookup interacts with downstream computation and memory constraints. We present HE-LRM, the first end-to-end FHE system for private DLRM inference. We use deterministic compositional embedding compression with client-side digit decomposition, avoiding expensive homomorphic selector construction while consuming only one multiplicative level. We further develop a block-diagonal packing strategy that performs lookups across multiple embedding tables using optimized BSGS linear transformations and produces encrypted embeddings directly compatible with downstream inference. We extend Orion with a high-performance GPU backend and achieve 9 ms for single-inference embedding lookup. We also show that GPU memory capacity limits batching and therefore the latency-bound throughput in such systems. On Criteo, HE-LRM achieves complete encrypted inference with server-side latencies of 154-247 ms on a single GPU. We open-source HE-LRM at https://github.com/baahl-nyu/orion

查看此版本解读 →查看此版本原文 ↗