arXiv AI

OpenAI Privacy Filter: A Cross-Lingual, Cross-Domain PII Evaluation Across 32 Benchmarks

arXiv:2608. 02616v2 Announce Type: replace-cross Abstract: We present what is, to our knowledge, the first systematic evaluation of OpenAI's Privacy Filter (OPF), a 1.

arXiv AI
Aug 18

AWED-PIPER: Agents, Web Applications & Expert Detectors for Personally Identifiable Information Protection & Fine-grained Named Entity Recognition across 36 languages for 6.6 Billion Speakers

arXiv:2601. 10161v3 Announce Type: replace-cross Abstract: Named Entity Recognition (NER) and Personally Identifiable Information (PII) anonymization are critical tasks in Natural Language Processing (NLP) for information extraction and privacy preservation.

By Prachuryya Kaushik, Ashish Anand
arXiv Machine Learning
Aug 20

Model Card for OpenAI Privacy Filter

The OpenAI Privacy Filter is a 1.5‑billion‑parameter, bidirectional token‑classification model that detects and redacts personally identifiable information and secrets in unstructured text. It is built from an autoregressive checkpoint, converted into a banded‑attention classifier, and uses a constrained Viterbi decoder to produce coherent spans across eight privacy categories in a single forward pass. The model supports configurable precision‑recall tradeoffs, a 128,000‑token context window, and is designed for efficient local deployment and domain‑specific fine‑tuning as a data‑minimization component within layered privacy workflows.

By Charles de Bourcy, Sahra Ghalebikesabi, Avi Schwarzschild, Alex Gorbachev, Mihai Maruseac, Annie Chu, Vol Kyrylov, Tong Mu, Ally Bennett, Andy Nguyen, Casey Meehan, Jessica Gan Lee, Shane Bauer, Harold Nguyen, Rodolpho Eckhardt, Yuqi Liu, Charlie Oxborough, Marco Rougeth, Omar Chedid, Caio Costa, Yash Parikh, Yao Li, Congzheng Song, Om Thakkar, Vinnie Monaco
arXiv Machine Learning
Aug 27

OpenSanctions Pairs: Large-Scale Entity Matching with LLMs

OpenSanctions Pairs is the first large‑scale public benchmark for entity matching on sanctions and OSINT data, comprising 755,540 expert‑labeled pairs drawn from over 1 million entities across 293 source datasets and 45 jurisdictions. The dataset spans multiple languages and writing systems, inconsistent structures, and time‑varying provenance, making it far more heterogeneous than prior benchmarks. Baseline experiments show a rule‑based matcher achieving 91.3 % F1, GPT‑4o reaching 99.0 % F1, and a locally deployable open‑source model scoring 98.2 % F1, with complementary failure modes that highlight the need to focus on downstream pipeline components.

By Chandler Smith, Magnus Sesodia, Friedrich Lindenberg, Christian Schroeder de Witt
arXiv Computation and Language
Sep 2

PersianAnonymizer: Evaluating LLM-Labeled Training for Efficient NER-based Anonymization in Persian

The paper presents PersianAnonymizer, a method for anonymizing Persian customer chats by training a compact NER model using supervision from large language models (LLMs). Three instruction‑tuned LLMs—DeepSeek‑V3‑0324, GPT‑OSS‑120B, and Qwen3‑235B‑A22B‑Instruct‑2507—were used to generate span annotations, producing four corpora. A MatinaRoberta token‑classifier trained on each corpus achieved high macro‑F1 and Label Coverage Recall, with the OSS_ZeroShot‑derived NER labeling a 40K‑message test set in about two minutes on a single RTX 3090, demonstrating a practical, low‑cost approach to Persian data anonymization.

By Mohammad Hossein Shalchian, Mostafa Amiri, Amir Mahdi Sadeghzadeh
Hugging Face Trending Papers
Jun 21

Sub-Billion, Super-Frontier: Small Language Models Rival Zero-Shot Frontier LLMs on General and Literary Relation Extraction

Large language models (LLMs) achieve strong relation extraction (RE), but their computational demands and reliance on proprietary APIs limit deployment in resource-constrained or privacy-sensitive settings. We investigate how far small language models (SLMs) can close this gap across general-domain and literary text.

arXiv Machine Learning
Jun 5

Domain-Adapted Small Language Models with Hybrid Post-Processing: Achieving Cost-Efficient, Low-Latency Multi-Label Structured Prediction via LoRA Fine-Tuning on Scarce Data

arXiv:2606. 05781v1 Announce Type: new Abstract: Deploying frontier large language models (LLMs) for domain-specific structured evaluation tasks often incurs substantial latency, cost, and data privacy overhead.

By Srinivasan Manoharan, Dilipkumar Nallusamy, Sachin Kumar, Haifeng Wu