2 papers
cs.LG2025
Is nasty noise actually harder than malicious noise?
Guy Blanc, Yizhi Huang, Tal Malkin +1
We consider the relative abilities and limitations of computationally efficient algorithms for learning in the presence of noise, under two well-studied and challenging adversarial…
cs.DS2023
Subset Sum in Time
Xi Chen, Yaonan Jin, Tim Randolph +1
A major goal in the area of exact exponential algorithms is to give an algorithm for the (worst-case) -input Subset Sum problem that runs in time for some const…