Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs

Hardness of approximation aims to establish lower bounds on the approximability of optimization problems in NP and beyond. We continue the study of hardness of approximation for problems beyond NP, specifically for stochastic constraint satisfaction problems (SCSPs). An SCSP with ? alternations is a list of constraints over variables grouped into 2? blocks, where each constraint has constant arity. An assignment to the SCSP is defined by two players who alternate in setting values to a designated block of variables, with one player choosing their assignments uniformly at random and the other player trying to maximize the number of satisfied constraints. In this paper, we establish hardness of approximation for SCSPs based on interactive proofs. For ? ? O(log n), we prove that it is AM[?]-hard to approximate, to within a constant, the value of SCSPs with ? alternations and constant arity. Before, this was known only for ? = O(1). Furthermore, we introduce a natural class of ?-round interactive proofs, denoted IR[?] (for interactive reducibility), and show that several protocols (e.g., the sumcheck protocol) are in IR[?]. Using this notion, we extend our inapproximability to all values of ?: we show that for every ?, approximating an SCSP instance with O(?) alternations and constant arity is IR[?]-hard. While hardness of approximation for CSPs is achieved by constructing suitable PCPs, our results for SCSPs are achieved by constructing suitable IOPs (interactive oracle proofs). We show that every language in AM[? ? O(log n)] or in IR[?] has an O(?)-round IOP whose verifier has constant query complexity (regardless of the number of rounds ?). In particular, we derive a "sumcheck protocol" whose verifier reads O(1) bits from the entire interaction transcript