Multiple-Function Approximated Coded Computing: Constructions and Error Bounds
cs.IT, math.IT
Submitted: 2026-10-12
Updated: 2026-10-20
Related papers
- Task-Sufficient Contraction: Source Selection for Machine Information Interfaces
- Language Modeling is Monotone Compression
- Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
- Discrepancy for Random Linear Codes
- A New Approach to Code Smoothing Bounds
- Contextual Memory-Enhanced Source Coding for Low-SNR Communications