I have a prototype to optimize a caching policy using a hill climber. It favors recency or frequency by adapting the partition between the two regions. It works really well in early experiments.

https://docs.google.com/presentation/d/1NlDxyXsUG1qlVHMl4vsU...