Fixed-Set Robustness in Programming by Example: Example Corruption and Semantic Partition Recovery

Summary

arXiv:2607.01280v1 Announce Type: new Abstract: Programming-by-example systems infer programs from a small set of input-output examples. Robust PBE work usually models wrong examples as samples from a stochastic noise process and then minimizes an expected or empirical loss. This paper studies a different failure mode: an adversary who sees the synthesizer and chooses the examples whose corruption most damages the returned program. We formalize fixed-set worst-case corruption for finite PBE vers

SpinGraph analysis pending — check back after processing.

• How to Allocate Your Tokens? Scaling Laws with Training Steps and Batch Size
• Class-Grouped Normalized Momentum and Faster Hyperparameter Exploration to Tackle Class Imbalance in Federated Learning
• Token Geometry
• Geometry-Aware R-Structured Kolmogorov-Arnold Networks
• On the Utility and Factual Reliability of Pruned Mixture-of-Experts Models in the Biomedical Domain
• Conditional Inference Trees and Forests for Feature Selection