arXiv Machine Learning July 24, 2026 By Martin Anthony, Kaveh Salehzadeh Nobari

Finite-Sample Coverage Audits for High-Recall Candidate Generation: Certification and Learning-Theoretic Design

Read the original on arXiv Machine Learning →

arXiv:2607. 21480v1 Announce Type: new Abstract: An initial high-recall stage in an empirical pipeline decides which items pass to later review, labelling, or modelling, and relevant items it misses are lost to every subsequent stage.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 30

When Can Conformal Risk Control Certify LLM Outputs? Bounds, Impossibility, and Adaptation for Structured Generation

arXiv:2606. 29054v1 Announce Type: new Abstract: Large language models (LLMs) deployed for structured generation (NER, JSON extraction, QA, and classification) lack formal reliability guarantees, and standard heuristic abstention policies miss user-specified risk targets by 7.

By Varun Kotte

llms

arXiv Machine Learning

Jul 15

Extractable Memorization From First Principles

arXiv:2607. 12649v1 Announce Type: new Abstract: Recent work on extractable memorization in LLMs suffers from two contrasting validity problems.

By A. Feder Cooper, Marika Swanberg, Jamie Hayes, Lea Duesterwald, Christopher De Sa, Daniel E. Ho, Mark A. Lemley, Percy Liang

llms

arXiv AI

1d ago

What Do Compliance Detectors Read? An Audit of Activation Probes and Guard Models

arXiv:2608. 16852v1 Announce Type: new Abstract: Regulatory compliance monitoring in deployed language models is increasingly implemented as a legal and audit control, checking model outputs against written rules spanning data protection, healthcare, financial regulation, and platform policy.

By Saisab Sadhu, Aadit Sengupta, Vinay Kumar Sankarapu, Pratinav Seth

llms benchmarks

arXiv AI

Jul 23

Unlearning as Distribution Restoration: A Controlled Counterfactual Study, a Validated Selective Screen, and the Limits of Oracle-Free Certification

arXiv:2607. 19442v1 Announce Type: cross Abstract: Machine unlearning is commonly evaluated by matching a retrained oracle on trained probes.

By Sen Yang, Yuen-Hei Yeung

benchmarks

arXiv AI

1d ago

Admission Without Answers: Label-Free Certification and Experience Learning for LLM-Based Optimization Modeling

arXiv:2608. 15565v1 Announce Type: new Abstract: Experience-learning agents for optimization modeling improve by storing verified skills, but existing learners admit knowledge by checking against known answers, which real ticket streams do not provide.

By Junbo Jacob Lian, Huiling Chen, Hanzhang Qin, Chung-Piaw Teo

llms agents benchmarks

arXiv Machine Learning

Jul 24

Best-of-Evidence: Best-of-N Selection under Partial Verification

arXiv:2607. 20950v1 Announce Type: new Abstract: BoN improves model outputs by sampling several candidates and selecting one with a proxy score, but it assumes that complete candidates can be evaluated reliably.

By Cenwei Zhang, Teng Fang, Yuxia Wang, Derek Li, Bryan Dai, Lei You

multimodal

Related stories

When Can Conformal Risk Control Certify LLM Outputs? Bounds, Impossibility, and Adaptation for Structured Generation

Extractable Memorization From First Principles

What Do Compliance Detectors Read? An Audit of Activation Probes and Guard Models

Unlearning as Distribution Restoration: A Controlled Counterfactual Study, a Validated Selective Screen, and the Limits of Oracle-Free Certification

Admission Without Answers: Label-Free Certification and Experience Learning for LLM-Based Optimization Modeling

Best-of-Evidence: Best-of-N Selection under Partial Verification