(Upper Confidence Bound) is a simple policy for the multi-armed bandit: for each arm, compute an index = estimated mean + confidence bound (e.g. proportional to โ(log n /...
The core idea
(Upper Confidence Bound) is a simple policy for the multi-armed bandit: for each arm, compute an index = estimated mean + confidence bound (e.g. proportional to โ(log n /...
Connected
Abstraction
complexity behind simpler interfaces to reason at higher levels.
Explore-exploit Tradeoff
gathering new information against leveraging what you already know.
Metcalfe's Law
value grows proportionally to the square of connected users.
Moore's Law
counts double every two years, driving exponential computing gains.
Mythical Man Month
people to a late project makes it later.
Technical Debt
decisions create compounding costs that must be repaid.