Md. Asif Uddin
    I.13.X04

    A point code has unbounded rate

    limit▲▲△

    Keep the encoder’s mean at 0.8660250.866025, the posterior mean of the point (1,2)(1,2), and shrink its standard deviation ss. Compute the price of the code, KL⁡(N(0.866025,s2) ∥ N(0,1))\KL(\mathcal N(0.866025,s^2)\,\|\,\mathcal N(0,1)), at s=0.1s=0.1, 0.010.01 and 0.0010.001. How fast does it grow, and what does the limit say about the autoencoder of Chapter I.12?

    Hint

    Only the −log⁡s2-\log s^2 term of (I.13.5) grows as s→0s\to0.

    Solution

    With μ2=0.75\mu^2=0.75, (I.13.5) gives 12(s2−0.25−log⁡s2)\tfrac12(s^2-0.25-\log s^2):

    ssprice of the code
    0.10.12.1825852.182585
    0.010.014.4802204.480220
    0.0010.0016.7827566.782756

    Each tenfold narrowing adds log⁡10=2.302585\log10=2.302585 nats, apart from the vanishing s2s^2 term: the price grows like −log⁡s-\log s without limit.

    A deterministic encoder is the limit s→0s\to0, so its rate is infinite. The autoencoder of I.12 is a VAE whose code costs nothing because its price is never charged. Proposition 4 reaches the same corner from the other side: in the linear model the encoder’s variance is βσ2/λ1\beta\sigma^2/\lambda_1, which goes to zero only as β→0\beta\to0, and the rate 12log⁡(λ1/βσ2)\tfrac12\log(\lambda_1/\beta\sigma^2) diverges with it.

    The noise in the code is what makes the space between codes trained. A point code puts the decoder back where it was in I.12.

    Draws on