Of Notes

Maximum Entropy Inference

1 min read · revised 9 November 2026 · referred to by 1 note · ·

We root this in Shannon entropy where for outcomes in we define:

If we simply say that the sum of all probabilities should be one, maximizing entropy leads us to a uniform distribution. Then for some constraint function of some observations we will setup a maximum entropy with a Lagrangian multiplier:

Of which we then take the derivative

/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card