No More, No Less: Least-Privilege Language Models
Not on the map. Why?
Abstract (arXiv)
Least privilege is a core security principle: grant each request only the minimum access needed to achieve its goal. Deployed language models almost never follow it, instead being exposed through a single API endpoint that serves all users and requests. This gap exists not because least privilege would be unhelpful; deployments would benefit greatly from reducing unnecessary capability exposure. The real obstacle is definitional and mechanistic: what does "access" mean inside a language model, and how can we enforce it without retraining or deploying multiple models? We take inspiration from least privilege in computer systems and define a class of models called least-privilege language models, where privilege is reachable internal computation during the forward pass. In this view, lowering privilege literally shrinks the model's accessible function class, as opposed to denying access via learned policies. We formalize deployment-time control as a monitor-allocator-enforcer stack, separating (i) request-time signals, (ii) a decision rule that allocates privilege, and (iii) an inference-time mechanism that selects privilege. We then propose Nested Least-Privilege Networks, a shape-preserving, rank-indexed intervention that provides a smooth, reversible control knob. We show that this knob yields policy-usable privilege-utility frontiers and enables selective suppression of targeted capabilities with limited collateral degradation across various policies. Most importantly, we argue for a new deployment paradigm that challenges the premise that language models can only be controlled at the output level.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 54 of its 67 references that are in the map. First posted on arXiv 30 Jan 2026.
Builds on
54 of 67 references.
References · 54
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 8,065
- 2017Deep reinforcement learning from human preferencescited by 3,912
- 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedbackcited by 3,720
- 2023Universal and Transferable Adversarial Attacks on Aligned Language Modelscited by 3,104
- 2022Constitutional AI: Harmlessness from AI Feedbackcited by 3,050
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2020Learning to summarize from human feedbackcited by 2,588
- 2019Fine-Tuning Language Models from Human Preferencescited by 2,150
- 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
- 2023Fine-tuning Aligned Language Models Compromises Safety, Even When Users Do Not Intend To!cited by 1,154
38 more
- 2021A General Language Assistant as a Laboratory for Alignmentcited by 1,055
- 2023Steering Language Models With Activation Engineeringcited by 922
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
- 2022Quantifying Memorization Across Neural Language Modelscited by 763
- 2022Red Teaming Language Models to Reduce Harms: Methods, Scaling Behaviors, and Lessons Learnedcited by 729
- 2023Safe RLHF: Safe Reinforcement Learning from Human Feedbackcited by 656
- 2018Universal Transformerscited by 647
- 2024The WMDP Benchmark: Measuring and Reducing Malicious Use With Unlearningcited by 509
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
- 2018Slimmable Neural Networkscited by 305
- 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 273
- 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decodingcited by 269
- 2023LEACE: Perfect linear concept erasure in closed formcited by 267
- 2023A Survey of Reinforcement Learning from Human Feedbackcited by 264
- 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 258
- 2020FastBERT: a Self-distilling BERT with Adaptive Inference Timecited by 226
- 2019Universally Slimmable Networks and Improved Training Techniquescited by 221
- 2024Eight Methods to Evaluate Robust Unlearning in LLMscited by 163
- 2024Improving Instruction-Following in Language Models through Activation Steeringcited by 160
- 2023Can Sensitive Information Be Deleted From LLMs? Objectives for Defending Against Extraction Attackscited by 158
- 2024Safety Layers in Aligned Large Language Models: The Key to LLM Securitycited by 134
- 2024On Prompt-Driven Safeguarding for Large Language Modelscited by 116
- 2022Linear Adversarial Concept Erasurecited by 101
- 2023Fast and Robust Early-Exiting Framework for Autoregressive Language Models with Synchronized Parallel Decodingcited by 80
- 2024Adaptive Activation Steering: A Tuning-Free LLM Truthfulness Improvement Method for Diverse Hallucinations Categoriescited by 77
- 2023The MiniPile Challenge for Data-Efficient Language Modelscited by 75
- 2022Kernelized Concept Erasurecited by 48
- 2023From task structures to world models: What do LLMs know?cited by 46
- 2025Deep Ignorance: Filtering Pretraining Data Builds Tamper-Resistant Safeguards into Open-Weight LLMscited by 42
- 2024Routoo: Learning to Route to Large Language Models Effectivelycited by 34
- 2024Safety-Aware Fine-Tuning of Large Language Modelscited by 34
- 2025Activation Steering for Chain-of-Thought Compressioncited by 24
- 2025Layer-Aware Representation Filtering: Purifying Finetuning Data to Preserve LLM Safety Alignmentcited by 24
- 2023Editing Language Model-based Knowledge Graph Embeddingscited by 23
- 2025Cascaded Language Models for Cost-effective Human-AI Decision-Makingcited by 11
- 2024Context-Aware Testing: A New Paradigm for Model Testing with Large Language Modelscited by 8
- 2025Bridging the Safety Gap: A Guardrail Pipeline for Trustworthy LLM Inferencescited by 8
50 most cited of 54 All 54 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.