atlas

Research map / Large language models / Instruction and fine-tuning

Encryption-Friendly LLM Architecture

ICLR 2025 · Large language models › Instruction and fine-tuning · approach: Fine-tuning generalization and delta compression · 3 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes an HE-friendly BERT-style transformer that combines LoRA fine-tuning (to avoid large ciphertext-ciphertext matrix multiplications) with Gaussian kernel attention (replacing softmax), enabling encrypted fine-tuning and inference under CKKS with near-plaintext GLUE accuracy.

Problem

Applying homomorphic encryption to LLM fine-tuning and inference is computationally prohibitive, mainly due to large ciphertext-ciphertext matrix multiplications from full fine-tuning and the difficulty of evaluating softmax under HE.

Approach

Use LoRA so that weight updates are small (turning large CCMMs into cheap PCMMs plus small CCMMs), and replace softmax attention with a division-free, max-free Gaussian kernel approximated by a polynomial for x<=0; also a modified AdamW (AdamW-HE) that moves epsilon outside the square root to avoid inverse-sqrt difficulties.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace full fine-tuning with LoRA fine-tuning (ablation)BERT-style model under HE with Softmax · Fine-tuning, 2 layerstime (s): 423.55 -> 76.97Helped
Replace Softmax with Gaussian kernel attention (ablation)BERT-style model under HE with LoRA · Fine-tuning, 2 layerstime (s): 76.97 -> 61.03Helped
Replace Softmax with Gaussian kernel attention (ablation)BERT-style model under HE with LoRA · Inference, 2 layerstime (s): 42.44 -> 26.5Helped
Use LoRA+GK instead of full fine-tuning with SoftmaxBERT-style model under HE · Inference, 2 layerstime (s): 61.84 -> 26.5Helped
Replace ciphertext-ciphertext matrix multiplication with plaintext-ciphertext matrix multiplicationHomomorphic matrix multiplication · 128×768 by 768×768time (s): 1.259 -> 0.275Helped
Replace Softmax with Gaussian kernel attentionHomomorphic attention computation · 128×128 matricestime (s): 8.99 -> 1.44Helped
Use LoRA+GK instead of full fine-tuning with SoftmaxBERT-style model · GLUE CoLAMatthews correlation: 0.2688 -> 0.1575Hurt
Use LoRA+GK instead of full fine-tuning with SoftmaxBERT-style model · GLUE MRPCF1: 0.8304 -> 0.8147Hurt
Use LoRA+GK instead of full fine-tuning with SoftmaxBERT-style model · GLUE RTEaccuracy: 0.5884 -> 0.5993Helped
Use LoRA+GK instead of full fine-tuning with SoftmaxBERT-style model · GLUE STS-BPearson: 0.8164 -> 0.7997Hurt
Use LoRA+GK instead of full fine-tuning with SoftmaxBERT-style model · GLUE SST-2accuracy: 0.8991 -> 0.8188Hurt
Use LoRA+GK instead of full fine-tuning with SoftmaxBERT-style model · GLUE QNLIaccuracy: 0.8375 -> 0.7827Hurt

Surprising findings

Limitations

Experimental setup

Datasets: GLUE CoLA MRPC RTE STS-B SST-2 QNLI

Benchmarks: GLUE

Metrics: Matthews correlation F1 accuracy Pearson correlation execution time speedup factor

Baselines: Full+SM LoRA+SM HETAL NEXUS Powerformer

Builds on: LoRA CKKS JKLS HETAL AdamW

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy