Distributed Approximate Computing with Constant Locality: Achievable Rate Region and Optimal Coding Scheme

The authors establish an achievable rate region for distributed approximate computing with constant decoding locality by designing a layered coding scheme. They show that the rate region is optimal under mild regularity conditions, indicating the need for more rate to achieve lower coding complexity.