~/talk

Automating Privacy Reviews with LLMs: Challenges & Opportunities

links:none on file
links:none on file
links:none on file
name:Ugur Koc
links:none on file
slides:none on file

Experiments show LLMs classifying privacy reviews with false negatives comparable to a junior reviewer and summarizing documents to cut reviewer words by about 85%, but they produce many false positives and hallucinate when documentation or diagrams are missing. Combining static code‑scanning graphs with LLMs raises data‑flow accuracy to roughly 95% after AI filtering. Practical limits include multimodal diagram parsing, on‑prem deployment needs for IP protection, and target costs like running models on a single GPU (~$10k/year).

AI-written summary · about

  1. 0:00Automating privacy with LLMs
  2. 3:56LLMs for review summarization
  3. 7:29LLMs as classifiers
  4. 10:59LLMs in code scanning
  5. 15:59LLM adoption considerations
  6. 22:46Future of automated reviews
  7. 27:29Closing on AI and privacy
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.