
TL;DR
This paper introduces sublinear query complexity tolerant testers for Unique Games and bipartiteness, improving upon prior methods by removing structural assumptions and exploiting problem-specific structures.
Contribution
It presents the first tolerant testers for Unique Games without structural assumptions and a specialized bipartiteness tester with better guarantees.
Findings
Achieves sublinear query complexity for tolerant testing of Unique Games.
Provides a specialized bipartiteness tester with improved tolerance and efficiency.
Demonstrates the effectiveness of exploiting problem structure in property testing.
Abstract
We give tolerant testers with sublinear query complexity in the adjacency-list model for Unique Games. Prior tolerant testers required structural assumptions such as expansion or clusterability. For Unique Games, the tester distinguishes instances whose optimum fraction of violated constraints is at most from those whose optimum is at least , for , assuming . On instances with vertices and constraints, it uses queries. We also give a specialized tester for bipartiteness, the transposition case of Unique Games. Exploiting its signed structure, the tester achieves substantially better tolerance and query-complexity guarantees than the generic Unique Games tester. Writing , the bipartiteness tester distinguishes…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
