arXiv Machine Learning July 17, 2026 By Haifeng Li, Mo Hai

CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees

Read the original on arXiv Machine Learning →

arXiv:2607. 14545v1 Announce Type: new Abstract: Machine-learned predictions can speed up offline NP-hard optimization, but asking a predictor what to do amounts to asking it to solve the problem, and committing an unchecked prediction forfeits every worst-case guarantee.

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.

efficiency

arXiv Machine Learning

Aug 4

When May a Model Replace the Experiment? Audits, Licenses, and the Price of Trust in Surrogate-Driven Design

arXiv:2608. 01378v1 Announce Type: new Abstract: Design campaigns in chemistry, materials science, and machine learning share a bottleneck: determining how good a candidate truly is requires an expensive evaluation - an experiment, a first-principles simulation, or a full training run.

By Shuangxiu (Max), Ma (Zachary), Wenhe (Zachary), Zhao

safety

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

Hugging Face Trending Papers

Sep 21

Adversarially Robust PAC Learning with Optimal VC Rates

We study the problem of \emph{adversarially robust} PAC learning. In this framework, the learner observes independent samples from an unknown distribution over $\mathcal{X} \times \{0,1\}$, as in clas...

safety

arXiv Machine Learning

Jun 17

On Randomized Algorithms in Online Strategic Classification

arXiv:2602. 06257v2 Announce Type: replace Abstract: Online strategic classification studies settings in which agents strategically modify their features to obtain favorable predictions.

By Chase Hutton, Adam Melrod, Han Shao

agents robotics

Hugging Face Trending Papers

Sep 9

A Sharp Barrier for Consistent Submodular Maximization: Any Improvement over $2-\sqrt{2}$ Entails Exponential Queries or Linear Recourse

Consistent submodular maximization studies the tradeoff between solution quality and stability when elements arrive over time. For a monotone submodular objective, which models diminishing returns, an...

arXiv AI

Jun 17

Beyond the Sampled Token: Preserving Candidate Support in RLVR

arXiv:2510. 14807v3 Announce Type: replace Abstract: We revisit exploration collapse in reinforcement learning with verifiable rewards (RLVR), from the perspective of the \emph{candidate distribution} for next-token prediction.

By Ruotian Peng, Yi Ren, Zhouliang Yu, Weiyang Liu, Yandong Wen

reinforcement-learning benchmarks