Fixed-Set Robustness in Programming by Example: Example Corruption and Semantic Partition Recovery
Researchers formalize a worst-case corruption model for Programming-by-Example systems to defend against adversarial example manipulation.
Standard robust PBE models typically address stochastic noise. This paper introduces a framework for fixed-set worst-case corruption, where an adversary selects specific examples to maximize program failure. The authors implement both exact and heuristic search methods for a string-transformation DSL to evaluate system resilience.