arXiv Machine Learning June 2, 2026 By Ibne Farabi Shihab, Sanjeda Akter, Anuj Sharma

Auditing Near-Optimal Policies Can Be Exponentially Hard: Conditional Query Lower Bounds via Occupancy Rashomon Capacity

Read the original on arXiv Machine Learning →

arXiv:2606. 00414v1 Announce Type: new Abstract: When many reinforcement-learning policies achieve near-optimal return, a post-hoc auditor may have to distinguish among many behaviorally distinct but return-equivalent policies.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Aug 31

Memorization Is Not Extraction: Tight Differential-Privacy Bounds and Audit Blind Spots

arXiv:2608.27782v1 Announce Type: cross Abstract: Memorization in large language models is measured through a zoo of definitions whose formal relations are unknown, and differential privacy (DP) is t...

By Xujun Che, Depeng Xu, Shuhan Yuan

llms safety

arXiv Machine Learning

Jul 7

How Much of the Routing Gap Is Real? Decomposing the Router-to-Oracle Gap into Reproducible Specialist Advantage and Single-Draw Label Noise

arXiv:2607. 03436v1 Announce Type: new Abstract: Routing among large language models (LLMs) promises better quality at lower cost, motivated by the reported gap between learned routers and a per-instance oracle.

By Teng-Ruei Chen

llms benchmarks

arXiv Machine Learning

3d ago

Counterfactual Probing for Parallel Unmasking with Hidden Forest Structure

arXiv:2609.37841v1 Announce Type: new Abstract: Masked generative models offer parallel token prediction, but accurate parallel sampling must account for dependencies among tokens. When dependencies...

By Ryotaro Kawata, Satoshi Hayakawa, Taiji Suzuki

arXiv Statistics ML

Sep 10

An Exponential Deterministic--Randomized Gap in ERM-Oracle Complexity for Thresholds on an Unknown Order

arXiv:2609.10196v1 Announce Type: cross Abstract: Attias, Hanneke and Ramaswami (NeurIPS 2025) asked whether randomization provably reduces the oracle calls needed for online learning when the class...

By Xuan Li

arXiv Machine Learning

Jun 25

Minimax PAC Bounds for Learning in Exogenous Contextual MDPs

arXiv:2606. 25170v1 Announce Type: cross Abstract: We study PAC learning in tabular discounted Markov decision processes with exogenous i.

By Corentin Pla, Hugo Richard, Marc Abeille, Vianney Perchet

agents reinforcement-learning

arXiv Machine Learning

Aug 10

Sub-Quadratic Bisimulation Metrics via Approximate Nearest Neighbors: Coverage-Augmented Guarantees and Computable Two-Sided Certificates

arXiv:2608. 06762v1 Announce Type: new Abstract: Bisimulation metrics quantify behavioral similarity in Markov decision processes, but their Wasserstein fixed-point operator updates every state pair and incurs quadratic pairwise work.

By Ibne Farabi Shihab, Joyanta Jyoti Mondal

rag reinforcement-learning benchmarks

One email a morning, machine-written

Related stories

Memorization Is Not Extraction: Tight Differential-Privacy Bounds and Audit Blind Spots

How Much of the Routing Gap Is Real? Decomposing the Router-to-Oracle Gap into Reproducible Specialist Advantage and Single-Draw Label Noise

Counterfactual Probing for Parallel Unmasking with Hidden Forest Structure

An Exponential Deterministic--Randomized Gap in ERM-Oracle Complexity for Thresholds on an Unknown Order

Minimax PAC Bounds for Learning in Exogenous Contextual MDPs

Sub-Quadratic Bisimulation Metrics via Approximate Nearest Neighbors: Coverage-Augmented Guarantees and Computable Two-Sided Certificates