Hard Instances on Demand

cs.DS, cs.AI, math.OC

Submitted: 2026-10-15

Updated: 2026-10-15

Comments: Full version of a paper accepted to ALENEX 2027

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Computational and Statistical Hardness of Calibration Distance
• Edge-Private Matching Kernels Through Local Decoding
• Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing