Optimal clipping for a Laplace-distributed tensor
ProofAdvanced⏱ 1 hourQuantizationclippingmseoptimisationlaplace
Problem
Let have the Laplace density , quantized with bits over .
- Compute the clipping term in closed form.
- Write the total MSE, treating , and derive the stationarity condition for the optimal .
- Solve numerically for and with , and comment on how the optimal loading factor moves with .
Write a complete argument. Every inequality you use should be one you could state precisely.
Hints
Hints — 0 of 2 revealed
Solution
Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.
Related problems
All problems| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| The round-trip error bound | Quantization | Proof | 15 min | ||
| The true bit width of a group-quantized format | Quantization | Numerical | 15 min | ||
| Six decibels per bit, and what outliers cost | Quantization | Numerical | 30 min | ||
| The Δ²/12 noise variance | Quantization | Proof | 15 min | ||
| Optimal checkpointing frequency | Fine-Tuning | Proof | 30 min |