IP Library Granted Patent US 12,572,777
Granted Patent B2
US 12,572,777 · App. 18/811,610 · Granted Mar 10, 2026

Policy-based control of multimodal machine learning model via activation analysis

Inventors: Andrew Davis (Portland, OR); Amelia Kawasaki (Corvallis, OR)
Assignee: HiddenLayer, Inc.
G06N3/0442G06N3/0475
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,572,777
App. No.
18/811,610
Filed
Aug 21, 2024
Granted
Mar 10, 2026
Kind
B2
Examiner
KWON, JUN
Art Unit
2127
USPC
706/20
Abstract

An analysis engine receives data characterizing a multimodal prompt for ingestion by a generative artificial intelligence (GenAI) model. The multimodal prompt is processed and fed into a plurality of layers from which an intermediate result of the GenAI model or a proxy of the GenAI model is obtained. The analysis engine, using a classifier and the intermediate result, determines whether the prompt elicits undesired behavior by the GenAI model. Data characterizing the determination is provided to a consuming application or process. Related apparatus, systems, techniques and articles are also described.

Claims (45)

1 . A computer-implemented method comprising:

receiving, from a model computing environment, data characterizing a multimodal prompt for ingestion by a generative artificial intelligence (GenAI) model, the GenAI model comprising a pipeline including an encoder for processing the received data prior to ingestion by a plurality of layers including at least one intermediate layer, the GenAI model further comprising a transformer architecture with residual streams;

redirecting the multimodal prompt to a quantized proxy of the GenAI model that replicates a layer topology of the GenAI model and is more compact;

capturing an intermediate result derived from the at least one intermediate layer of the quantized proxy of the GenAI model responsive to the inputting of the received data after it is processed by the encoder, wherein the intermediate result comprises residual-stream activation vectors derived from the at least one intermediate layer of the quantized proxy of the GenAI model via forward-pass hooks applied to the transformer layers;

determining, based on the intermediate result and using a classifier, whether the prompt seeks to cause the GenAI model to behave in an undesired manner, the classifier being trained using a data set generated using a policy mapping intermediate results to undesired model behavior including a plurality of enumerated prohibited actions; and

providing data characterizing the determination to a consuming application or process, the consuming application or process:

preventing the multimodal prompt from being ingested by the GenAI model in response to determining that the prompt elicits undesired actions by the GenAI model; and

allowing the multimodal prompt to be ingested by the GenAI model in response to determining that the prompt does not elicit undesired actions by the GenAI model.

2 . The method of claim 1 , wherein the GenAI model comprises a mixture of experts (MoE) model and the intermediate result comprises outputs from at least a subset of experts in the MoE model.

3 . The method of claim 1 , wherein the consuming application or process flags the prompt based on the determination.

4 . The method of claim 1 , wherein the consuming application or process blocks an internet protocol (IP) address of a requester of the prompt based on the determination.

5 . The method of claim 1 , wherein the consuming application or process causes subsequent prompts from an internet protocol (IP) address of a requester of the prompt to be modified based on the determination and causes the modified prompt to be ingested by the GenAI model.

6 . The method of claim 1 , wherein the consuming application or process prevents the prompt from being input into the GenAI model based on the determination.

7 . The method of claim 1 , wherein the consuming application or process allows the prompt to be input into the GenAI model based on the determination.

8 . The method of claim 1 , wherein the consuming application or process modifies the prompt based on the determination and causes the modified prompt to be ingested by the GenAI model.

9 . The method of claim 1 further comprising: quantizing the GenAI model prior to capturing the intermediate result.

10 . The method of claim 1 , wherein a policy maps intermediate results to one or more prohibited actions.

11 . The method of claim 10 , wherein the one or more prohibited actions include seeking one or more of: a response in a non-approved spoken or written language, computer code, sensitive information, a response to an encrypted prompt, a prompt containing two or modalities, or a prompt in a first modality obfuscating information in a second modality.

12 . The method of claim 1 , wherein the GenAI model is a state-based text analysis model.

13 . The method of claim 12 , wherein the state-based text analysis model comprises: a large language model.

14 . The method of claim 12 , wherein the state-based text analysis model comprises: a long short-term memory model (LSTM).

15 . A computer-implemented method comprising:

receiving data characterizing a multimodal prompt for ingestion by a generative artificial intelligence (GenAI) model, the GenAI model comprising a pipeline including an encoder for processing the received data prior to ingestion by a plurality of layers including at least one intermediate layer;

capturing, from a quantized proxy of the GenAI model and based on the received data after it is processed by the encoder, an intermediate result derived from the at least one intermediate layer, the quantized proxy of the GenAI model being separate from and more compact than the GenAI model, wherein the intermediate result comprises residual-stream activation vectors derived from the at least one intermediate layer of the quantized proxy of the GenAI model via forward-pass hooks applied to one or more transformer layers;

determining, using a classifier and based on the intermediate result, whether the prompt elicits undesired actions by the GenAI model, the classifier being trained using a data set generated according to a policy which maps acceptable and undesired actions to intermediate results;

providing data characterizing the determination to a consuming application or process, the consuming application or process:

preventing the multimodal prompt from being ingested by the GenAI model in response to determining that the prompt elicits undesired actions by the GenAI model; and

allowing the multimodal prompt to be ingested by the GenAI model in response to determining that the prompt does not elicit undesired actions by the GenAI model.

16 . A computer-implemented method for policy-based gating of multimodal prompts in a generative artificial intelligence (GenAI) system, the method comprising:

receiving, by a proxy computing system, data characterizing a multimodal prompt for ingestion by a production GenAI model, the GenAI model comprising a transformer architecture with a plurality of layers including at least one intermediate layer and residual streams;

redirecting the multimodal prompt to a quantized proxy model that shares a layer topology with the production GenAI model, the quantized proxy model configured to process the prompt without generating a final output;

capturing, by the proxy computing system and via forward-pass hooks applied to at least one transformer layer of the quantized proxy model, per-token activation vectors from residual streams at a predetermined intermediate layer, wherein the capturing occurs after encoding of the prompt and before any output is generated by the production GenAI model;

applying, by the proxy computing system, a classifier trained using a policy-labeled dataset that maps internal activation patterns to a plurality of enumerated prohibited actions, the prohibited actions comprising at least: (i) generation of computer code, (ii) response in a non-approved language, (iii) response to an encrypted prompt, or (iv) cross-modal obfuscation;

determining, by the proxy computing system and based on the per-token activation vectors, whether the prompt is likely to elicit a prohibited action by the production GenAI model; and

in response to the determination, gating the prompt by preventing the prompt from being ingested by the production GenAI model when the determination indicates a prohibited action, and allowing ingestion otherwise, such that the production GenAI model does not process prompts likely to elicit prohibited actions.

17 . A system comprising:

at least one data processor; and

memory storing instructions which, when executed by the at least one data processor, result in operations comprising:

receiving, from a model computing environment, data characterizing a multimodal prompt for ingestion by a generative artificial intelligence (GenAI) model, the GenAI model comprising a pipeline including an encoder for processing the received data prior to ingestion by a plurality of layers including at least one intermediate layer, the GenAI model further comprising a transformer architecture with residual streams;

redirecting the multimodal prompt to a quantized proxy of the GenAI model that replicates a layer topology of the GenAI model and is more compact;

capturing an intermediate result derived from the at least one intermediate layer of the quantized proxy of the GenAI model responsive to the inputting of the received data after it is processed by the encoder, wherein the intermediate result comprises residual-stream activation vectors derived from the at least one intermediate layer of the quantized proxy of the GenAI model via forward-pass hooks applied to the transformer layers;

determining, based on the intermediate result and using a classifier, whether the prompt seeks to cause the GenAI model to behave in an undesired manner, the classifier being trained using a data set generated using a policy mapping intermediate results to undesired model behavior including a plurality of enumerated prohibited actions; and

providing data characterizing the determination to a consuming application or process, the consuming application or process:

preventing the multimodal prompt from being ingested by the GenAI model in response to determining that the prompt elicits undesired actions by the GenAI model; and

allowing the multimodal prompt to be ingested by the GenAI model in response to determining that the prompt does not elicit undesired actions by the GenAI model.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 22, 2024
From: DAVIS, ANDREW; KAWASAKI, AMELIA
To: HIDDENLAYER, INC.
Reel/Frame 068375/0458 →
Continuity (2)
Continuation In Part 18669366 · May 20, 2024
Related Publication 20250356165A1 · Nov 20, 2025
References Cited (204)
US 7802298B1 · Hong et al. · 2010 [cited by applicant]
US 9350748B1 · McClintock et al. · 2016 [cited by applicant]
US 9356941B1 · Kislyuk et al. · 2016 [cited by applicant]
US 9516053B1 · Muddu et al. · 2016 [cited by applicant]
US 10121104B1 · Hu et al. · 2018 [cited by applicant]
US 10193902B1 · Caspi et al. · 2019 [cited by applicant]
US 10205735B2 · Apostolopoulos · 2019 [cited by applicant]
US 10210036B2 · Iyer et al. · 2019 [cited by applicant]
US 10462168B2 · Shibahara et al. · 2019 [cited by applicant]
US 10637884B2 · Apple et al. · 2020 [cited by applicant]
US 10673880B1 · Pratt et al. · 2020 [cited by applicant]
US 10764313B1 · Mushtaq · 2020 [cited by applicant]
US 10803188B1 · Rajput et al. · 2020 [cited by applicant]
US 10824721B2 · Kesarwani et al. · 2020 [cited by applicant]
US 11310270B1 · Weber et al. · 2022 [cited by applicant]
US 11483327B2 · Hen et al. · 2022 [cited by applicant]
US 11501101B1 · Ganesan et al. · 2022 [cited by applicant]
US 11551137B1 · Echauz et al. · 2023 [cited by applicant]
US 11601468B2 · Angel et al. · 2023 [cited by applicant]
US 11710045B2 · Lee et al. · 2023 [cited by applicant]
US 11710067B2 · Harris et al. · 2023 [cited by applicant]
US 11762998B2 · Kuta et al. · 2023 [cited by applicant]
US 11777957B2 · Chen et al. · 2023 [cited by applicant]
US 11875130B1 · Bosnjakovic et al. · 2024 [cited by applicant]
US 11893111B2 · Sai et al. · 2024 [cited by applicant]
US 11893358B1 · Lakshmikanthan et al. · 2024 [cited by applicant]
US 11930030B1 · Burns et al. · 2024 [cited by applicant]
US 11930039B1 · Geethakumar et al. · 2024 [cited by applicant]
US 11954199B1 · Burns et al. · 2024 [cited by applicant]
US 11960514B1 · Taylert et al. · 2024 [cited by applicant]
US 11962546B1 · Hattangady et al. · 2024 [cited by applicant]
US 11971914B1 · Watson et al. · 2024 [cited by applicant]
US 11972333B1 · Horesh et al. · 2024 [cited by applicant]
US 11995180B1 · Cappel et al. · 2024 [cited by applicant]
US 11997059B1 · Su et al. · 2024 [cited by applicant]
US 12026255B1 · Burns et al. · 2024 [cited by applicant]
US 12105844B1 · Burns et al. · 2024 [cited by applicant]
US 12107885B1 · Kawasaki et al. · 2024 [cited by applicant]
US 12111926B1 · Beveridge et al. · 2024 [cited by applicant]
US 12124592B1 · O'Hern et al. · 2024 [cited by applicant]
US 12130917B1 · Yeung et al. · 2024 [cited by applicant]
US 12130943B1 · Burns et al. · 2024 [cited by applicant]
US 12137118B1 · Kawasaki et al. · 2024 [cited by applicant]
US 12174954B1 · Yeung et al. · 2024 [cited by applicant]
US 12182264B2 · Sinha et al. · 2024 [cited by applicant]
US 12197859B1 · Malviya et al. · 2025 [cited by applicant]
US 12204323B1 · Malviya et al. · 2025 [cited by applicant]
US 12229265B1 · Yeung et al. · 2025 [cited by applicant]
US 12248883B1 · Rideout et al. · 2025 [cited by applicant]
US 12293277B1 · Yeung et al. · 2025 [cited by applicant]
US 20100082811A1 · Van Der Merwe · 2010 [cited by applicant]
US 20140033307A1 · Schmidtler · 2014 [cited by applicant]
US 20140157415A1 · Abercrombie et al. · 2014 [cited by applicant]
US 20150074392A1 · Boivie et al. · 2015 [cited by applicant]
US 20160344770A1 · Verma et al. · 2016 [cited by applicant]
US 20170154021A1 · Vidhani et al. · 2017 [cited by applicant]
US 20170251006A1 · LaRosa et al. · 2017 [cited by applicant]
US 20170331841A1 · Hu et al. · 2017 [cited by applicant]
US 20180018590A1 · Szeto et al. · 2018 [cited by applicant]
US 20180063190A1 · Wright et al. · 2018 [cited by applicant]
US 20180205734A1 · Wing et al. · 2018 [cited by applicant]
US 20180219888A1 · Apostolopoulos · 2018 [cited by applicant]
US 20180324193A1 · Ronen et al. · 2018 [cited by applicant]
US 20190050564A1 · Pogorelik et al. · 2019 [cited by applicant]
US 20190238568A1 · Goswami · 2019 [cited by examiner]
US 20190238572A1 · Manadhata et al. · 2019 [cited by applicant]
US 20190260784A1 · Stockdale et al. · 2019 [cited by applicant]
US 20190311118A1 · Grafi et al. · 2019 [cited by applicant]
US 20190392176A1 · Taron et al. · 2019 [cited by applicant]
US 20200019721A1 · Shanmugam et al. · 2020 [cited by applicant]
US 20200076771A1 · Maier et al. · 2020 [cited by applicant]
US 20200092299A1 · Srinivasan et al. · 2020 [cited by applicant]
US 20200167471A1 · Darvish et al. · 2020 [cited by applicant]
US 20200175094A1 · Palmer et al. · 2020 [cited by applicant]
US 20200219009A1 · Dao et al. · 2020 [cited by applicant]
US 20200233979A1 · Maraghoosh et al. · 2020 [cited by applicant]
US 20200279192A1 · Godfrey et al. · 2020 [cited by applicant]
US 20200285737A1 · Kraus et al. · 2020 [cited by applicant]
US 20200313849A1 · Kar et al. · 2020 [cited by applicant]
US 20200364333A1 · Derks et al. · 2020 [cited by applicant]
US 20200403826A1 · Dawani et al. · 2020 [cited by applicant]
US 20200409323A1 · Spalt et al. · 2020 [cited by applicant]
US 20210110062A1 · Oliner et al. · 2021 [cited by applicant]
US 20210141897A1 · Seifert et al. · 2021 [cited by applicant]
US 20210209464A1 · Bala et al. · 2021 [cited by applicant]
US 20210218673A1 · Ma et al. · 2021 [cited by applicant]
US 20210224425A1 · Nasr-Azadani et al. · 2021 [cited by applicant]
US 20210303695A1 · Grosse et al. · 2021 [cited by applicant]
US 20210319098A1 · Pogorelik et al. · 2021 [cited by applicant]
US 20210319784A1 · Le Roux et al. · 2021 [cited by applicant]
US 20210357508A1 · Elovici et al. · 2021 [cited by applicant]
US 20210374247A1 · Sultana et al. · 2021 [cited by applicant]
US 20210407051A1 · Pardeshi · 2021 [cited by examiner]
US 20220030009A1 · Hasan · 2022 [cited by applicant]
US 20220058444A1 · Olabiyi et al. · 2022 [cited by applicant]
US 20220070195A1 · Sern et al. · 2022 [cited by applicant]
US 20220083658A1 · Shah et al. · 2022 [cited by applicant]
US 20220114399A1 · Castiglione et al. · 2022 [cited by applicant]
US 20220147597A1 · Bhide et al. · 2022 [cited by applicant]
US 20220164444A1 · Prudkovskij et al. · 2022 [cited by applicant]
US 20220166795A1 · Simioni et al. · 2022 [cited by applicant]
US 20220182410A1 · Tupsamudre et al. · 2022 [cited by applicant]
US 20220253464A1 · Sloane et al. · 2022 [cited by applicant]
US 20220269796A1 · Chase et al. · 2022 [cited by applicant]
US 20220284283A1 · Yin et al. · 2022 [cited by applicant]
US 20220309179A1 · Payne et al. · 2022 [cited by applicant]
US 20230008037A1 · Venugopal et al. · 2023 [cited by applicant]
US 20230027149A1 · Kuan · 2023 [cited by examiner]
US 20230049479A1 · Mozo Velasco · 2023 [cited by examiner]
US 20230109426A1 · Hashimoto et al. · 2023 [cited by applicant]
US 20230111744A1 · Chandrasekaran et al. · 2023 [cited by applicant]
US 20230128947A1 · Bhaskar et al. · 2023 [cited by applicant]
US 20230148116A1 · Stokes et al. · 2023 [cited by applicant]
US 20230169397A1 · Smith et al. · 2023 [cited by applicant]
US 20230185912A1 · Sinn et al. · 2023 [cited by applicant]
US 20230185915A1 · Rao et al. · 2023 [cited by applicant]
US 20230208869A1 · Bisht et al. · 2023 [cited by applicant]
US 20230229960A1 · Zhu et al. · 2023 [cited by applicant]
US 20230252178A1 · Ruelke et al. · 2023 [cited by applicant]
US 20230259787A1 · David et al. · 2023 [cited by applicant]
US 20230269263A1 · Yarabolu · 2023 [cited by applicant]
US 20230274003A1 · Liu et al. · 2023 [cited by applicant]
US 20230289604A1 · Chan et al. · 2023 [cited by applicant]
US 20230351143A1 · Kutt et al. · 2023 [cited by applicant]
US 20230359903A1 · Cefalu · 2023 [cited by examiner]
US 20230359924A1 · Maman et al. · 2023 [cited by applicant]
US 20230385085A1 · Singh · 2023 [cited by applicant]
US 20230388324A1 · Thompson · 2023 [cited by applicant]
US 20240005690A1 · Brodie · 2024 [cited by examiner]
US 20240007469A1 · Wang et al. · 2024 [cited by applicant]
US 20240022585A1 · Burns et al. · 2024 [cited by applicant]
US 20240031026A1 · Fujisawa et al. · 2024 [cited by applicant]
US 20240039948A1 · Koc et al. · 2024 [cited by applicant]
US 20240045959A1 · Marson et al. · 2024 [cited by applicant]
US 20240054233A1 · Ohayon et al. · 2024 [cited by applicant]
US 20240078337A1 · Kamyshenko et al. · 2024 [cited by applicant]
US 20240080333A1 · Burns et al. · 2024 [cited by applicant]
US 20240126611A1 · Phanishayee et al. · 2024 [cited by applicant]
US 20240127065A1 · Ren et al. · 2024 [cited by applicant]
US 20240160902A1 · Padgett et al. · 2024 [cited by applicant]
US 20240185086A1 · Hou · 2024 [cited by examiner]
US 20240289628A1 · Parmar et al. · 2024 [cited by applicant]
US 20240289863A1 · Smith Lewis et al. · 2024 [cited by applicant]
US 20240296315A1 · Singh et al. · 2024 [cited by applicant]
US 20240386103A1 · Clement · 2024 [cited by examiner]
US 20240414177A1 · Lal et al. · 2024 [cited by applicant]
US 20240427986A1 · Shakarian et al. · 2024 [cited by applicant]
US 20250086455A1 · Yang et al. · 2025 [cited by applicant]
CN 117786750A · 2024 [cited by applicant]
Morozov & Babenko, 2019, “Unsupervised Neural Quantization for Compressed-Domain Similarity Search” (Year: 2019). [cited by examiner]
Elthakeb et al. “Divide and Conquer: Leveraging Intermediate Feature Representations for Quantized Training of Neural Networks”, 2020 (Year: 2020). [cited by examiner]
Shi et al., “PL-Transformer: a POS-aware and layer ensemble transformer for text classification”, 2022 (Year: 2022). [cited by examiner]
Wang et al., 2023, “Self-Deception: Reverse Penetrating the Semantic Firewall of Large Language Models,” arXiv:2308.11521v1 [cs.CL] Aug. 16, 2023 (15 pages). [cited by applicant]
Shayegani et al., 2023, “Survey of Vulnerabilities in Large Language Models Revealed by Adversarial Attacks,” arXiv:2310.10844v1 [cs.CL] Oct. 16, 2023 (54 pages). [cited by applicant]
Bezymiannyi et al., 2023, “Filter for confidential information,” Electronics and Control Systems 4(78):21-25 (5 pages). [cited by applicant]
Wang et al., 2023, “Self-Guard: Empower the LLM to Safeguard Itself,” ACL Anthology, NAACL (21 pages). [cited by applicant]
Kim et al., 2023, “Robust Safety Classifier for Large Language Models: Adversarial Prompt Shield,” Available online at: https://arxiv.org/abs/2311.00172 (11 pages). [cited by applicant]
Kim et al., 2023, “Memory-Efficient Fine-Tuning of Compressed Large Language Models via sub-4-bit Integer,” Available online at https://arxiv.org/abs/2305.14152 (21 pages). [cited by applicant]
Zhou et al., 2024, “A Survey on Efficient Inference for Large Language Models,” Available online at https://arxiv.org/abs/2404.14294 (36 pages). [cited by applicant]
International Search Report and Written Opinion mailed Jun. 25, 2025 for PCT/US2025/026109 filed Apr. 24, 2025 (11 pages). [cited by applicant]
Automorphic.ai, 2024, “Github—automorphic-ai/aegis: Self-hardening firewall for large language models,” XP093278213, Available online at https://web.archive.org/web/20240222171700/https://github.com/automorphic-ai/aegis… [cited by applicant]
Sun et al., “Conscendi: A Contrastive and Scenario-Guided Distillation Approach to Guardrail Models for Virtual Assistants,” arXiv:2304.14364v1 [cs.CL] Apr. 27, 2023 (20 pages). [cited by applicant]
Hu et al., “Gradient Cuff: Detecting Jailbreak Attacks on Large Language Models by Exploring Refusal Loss Landscapes,” arXiv:2403.00867v1 [cs.CR] Mar. 1, 2024 (19 pages). [cited by applicant]
Robey et al., “SmoothLLM: Defending Large Language Models Against Jailbreaking Attacks,” arXiv:2310.03684v3 [cs.LG] Nov. 29, 2023 (42 pages). [cited by applicant]
Mohtashami et al., “Social Learning: Towards Collaborative Learning with Large Language Models,” arXiv:2312.11441v2 [cs.LG] Feb. 8, 2024 (19 pages). [cited by applicant]
Chao et al., 2023, “Jailbreaking black box large language models in twenty queries,” University of Pennsylvania, Available online at: https://arxiv.org/abs/2211.09527 (21 pages). [cited by applicant]
Goodfellow et al., 2015, “Explaining and harnessing adversarial examples,” 3rd International Conference on Learning Representations, ICLR 2015, Available online at: http://arxiv.org/abs/1412.6572 (11 pages). [cited by applicant]
Hu et al., 2022, “LoRA: Low-rank adaptation of large language models,” International Conference on Learning Representations, Available online at: https://openreview.net/forum?id=nZe VKeeFYf9 (13 pages). [cited by applicant]
Imoxto, 2024, “prompt injection cleaned dataset-v2,” Hugging Face, available online at: https://huggingface.co/datasets/imoxto/prompt_injection_cleaned_datasetv2 (3 pages). [cited by applicant]
Jiang et al., 2023, “Mistral 7b,” Available online at: https://mistral.ai/news/announcing-mistral-7b (9 pages). [cited by applicant]
Ke et al., 2017, “Lightgbm: a highly efficient gradient boosting decision tree,” Proceedings of the 31st International Conference on Neural Information Processing Systems (9 pages). [cited by applicant]
Lee et al., 2023, “Wizardvicunalm,” Available online at: https://github.com/melodysdreamj/WizardVicunaLM (6 pages). [cited by applicant]
Lee, 2023, “ChatGPT DAN,” ChatGPT DAN, Jailbreaks prompt, Available online at: https://github.com/0xk1h0/ChatGPT_DAN (3 pages). [cited by applicant]
Lian et al., 2023. “Openorca: An open dataset of gpt augmented flan reasoning traces,” Hugging Face, Available online at: https://huggingface.co/Open-Orca/OpenOrca (8 pages). [cited by applicant]
Luo et al., 2024, “Jailbreakv-28k: A benchmark for assessing the robustness of multimodal large language models against jailbreak attacks,” Available online at: https://arxiv.org/abs/2404.03027 (20 pages). [cited by applicant]
MacDiarmid et al., 2024, “Simple probes can catch sleeper agents,” Available online at: https://www.anthropic.com/news/probescatch-sleeper-agents (18 pages). [cited by applicant]
Perez et al., 2022, “Ignore previous prompt: Attack techniques for language models,” NeurIPS ML Safety Workshop, 36th Conference on Neural Information Processing System (NeurIPS2022), Available online at: https://openre… [cited by applicant]
Raman et al., 2023, “Model-tuning via prompts makes NLP models adversarially robust,” The 2023 Conference on Empirical Methods in Natural Language Processing, Available online at: https://openreview.net/forum?id=R4yb4m7… [cited by applicant]
Schulhoff et al., 2023, “Ignore this title and hackAPrompt: Exposing systemic vulnerabilities of LLMs through a global prompt hacking competition,” The 2023 Conference on Empirical Methods in Natural Language Processing… [cited by applicant]
Sujet-Ai, 2024, “Sujet finance dataset,” Huging Face, https://huggingface.co/datasets/sujetai/Sujet-Finance-Instruct-177k (6 pages). [cited by applicant]
Templeton et al., 2024, “Scaling monosemanticity: Extracting interpretable features from claude 3 sonnet,” Transformer Circuits Thread, Available online at: https://transformer-circuits.pub/2024/scalingmonosemanticity/i… [cited by applicant]
Touvron et al., 2023, “Llama 2: Open foundation and fine-tuned chat models,” Available online at: https://arxiv.org/abs/2307.09288 (77 pages). [cited by applicant]
Zhang et al., 2024, “Tinyllama: An open-source small language model,” Available online at: https://arxiv.org/abs/2401.02385 (10 pages). [cited by applicant]
Zheng et al., 2023, “Judging LLM-as-a-judge with MT-bench and chatbot arena,” Thirty-seventh Conference on Neural Information Processing Systems Datasets and Benchmarks Track, Available online at: https://openreview.net… [cited by applicant]
Zou et al., 2023, “Representation engineering: A top-down approach to ai transparency,” Available online at: https://arxiv.org/abs/2310.01405 (55 pages). [cited by applicant]
Zou et al., 2023, “Universal and transferable adversarial attacks on aligned language models,” Available online at: https://arxiv.org/abs/2307.15043 (31 pages). [cited by applicant]
Morozov et al., 2019, “Unsupervised Neural Quantization for Compressed-Domain Similarity Search,” International Conference on Computer Vision (ICCV) 2019 (11 pages). [cited by applicant]
Rijthoven et al., 2021, “HookNet: Multi-resolution convulational neural networks for semantic segmentation in histopathology whole-slide images,” Medical Imange Analysis 68:1-10. [cited by applicant]
Dinan et al., 2021, “Anticipating safety issues in e2e conversational ai: Framework and tooling,” arXiv preprint arXiv:2107.03451v3 (43 pages). [cited by applicant]
Abadi et al., 2016, “Deep Learning with Differential Privacy,” arXiv:1607.00133v2 [stat.ML] Oct. 24, 2016 (14 pages). [cited by applicant]
Carlini et al., 2021, “Extracting Training Data from Large Language Models,” arXiv:2012.07805v2 [cs.CR] Jun. 15, 2021 (19 pages). [cited by applicant]
Choquette-Choo et al., 2021, “Label-Only Membership Inference Attacks,” arXiv:2007.14321v3 [cs.CR] Dec. 5, 2021 (17 pages). [cited by applicant]
Heusel et al., 2018, “GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium,” arXiv:1706.08500v6 [cs.LG] Jan. 12, 2018 (38 pages). [cited by applicant]
Hu et al., 2021, “LoRA: Low-rank adaptation of large language models,” arXiv:2106.09685v2 [cs.CL] Oct. 16, 2021 (26 pages). [cited by applicant]
Kahla et al., 2022, “Label-Only Model Inversion Attacks via Boundary Repulsion,” arXiv:2203.01925v1 [cs.LG] Mar. 3, 2022 (13 pages). [cited by applicant]
Ko et al., 2023, “PrivMon: A Stream-Based System for Real-Time Privacy Attack Detection for Machine Learning Models,” Raid 2023 https://doi.org/10.1145/3607199.3607232 (18 pages). [cited by applicant]
Li et al., 2021, “Membership Leakage in Label-Only Exposures,” arXiv:2007.15528v3 [cs.LG] Sep. 17, 2021 (17 pages). [cited by applicant]
Li et al., 2022, “Blacklight: Scalable Defense for Neural Networks against Query-Based Black-Box Attacks,” Proceedings of the 31st Usenix Security Symposium (19 pages). [cited by applicant]
Liu et al., 2015, “Deep Learning Face Attributes in the Wild,” arXiv:1411.7766v3 [cs.CV] Sep. 24, 2015 (11 pages). [cited by applicant]
Madry et al., 2019, “Towards Deep Learning Models Resistant to Adversarial Attacks,” arXiv:1706.06083v4 [stat.ML] Sep. 4, 2019 (28 pages). [cited by applicant]
Mattern et al., 2023, “Membership Inference Attacks against Language Models via Neighborhood Comparison,” arXiv:2305.18462v2 [cs.CL] Aug. 7, 2023 (12 pages). [cited by applicant]
Mireshghallah et al., 2022, “Quantifying Privacy Risks of Masked Language Models Using Membership Inference Attacks,” arXiv:2203.03929v2 [cs.LG] Nov. 4, 2022 (16 pages). [cited by applicant]
Salimans et al., 2016, “Improved Techniques for Training GANs,” arXiv:1606.03498v1 [cs.LG] Jun. 10, 2016 (10 pages). [cited by applicant]
Zhang et al., 2020, “The Secret Revealer: Generative Model-Inversion Attacks Against Deep Neural Networks,” https://arxiv.org/abs/1911.07135 (9 pages). [cited by applicant]