Papers by Ilia Shumailov
Measuring memorization in language models via probabilistic extraction (2025.naacl-long)
Copied to clipboard
Jamie Hayes, Marika Swanberg, Harsh Chaudhari, Itay Yona, Ilia Shumailov, Milad Nasr, Christopher A. Choquette-Choo, Katherine Lee, A. Feder Cooper
| Challenge: | Large language models (LLMs) are susceptible to memorizing training data, raising concerns about the potential extraction of sensitive information at generation time. |
| Approach: | They propose a method that splits training example into prefix and suffix, prompts LLM with suffix and deems it extractable if it generates the suffix using greedy sampling. |
| Outcome: | The proposed method is unreliable because it does not account for non-determinism in more realistic sampling schemes. |
Revisiting Automated Prompting: Are We Actually Doing Better? (2023.acl-short)
Copied to clipboard
| Challenge: | Recent work demonstrates that Large Language Models are great few-shot learners, and prompting significantly increases their performance on a range of downstream tasks. |
| Approach: | They revisit techniques for automated prompting on six different downstream tasks and a larger range of K-shot learning settings. |
| Outcome: | The proposed approach outperforms manual prompting on six different downstream tasks and a larger range of K-shot learning settings. |
Revisiting Block-based Quantisation: What is Important for Sub-8-bit LLM Inference? (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing quantisation methods mainly focus on 8-bit LLMs . a lack of scaling offsets in the quantisation process limits the use of LLM inference. |
| Approach: | They propose to use block quantisations to reduce scaling offsets in Large language models . they find that the block quantizations reduce scaling only from an arithmetic perspective . |
| Outcome: | The proposed methods reduce scaling offsets solely from an arithmetic perspective without additional treatments in the computational path. |