Explore >> Select a destination
|
You are here 
|
emilygorcenski.com | ||
| | | | |
chalkdustmagazine.com
|
|
| | | | | Write down a quadratic. What is the probability that it factorises? Paging Prof. Dirichet... | |
| | | | |
www.blueraja.com
|
|
| | | | | Not a Substitute for Human Interaction | |
| | | | |
lispy.wordpress.com
|
|
| | | | | I didn't immediately recognize the equation that Steve Knight used in his answer to problem 6 of the Euler Project, but it was in fact just the formula for an arithmetic series. This one's actually pretty easy to come to from an intuitive standpoint. The story goes that Gauss had one of the meanest school... | |
| | | | |
francisbach.com
|
|
| | | [AI summary] This text discusses the scaling laws of optimization in machine learning, focusing on asymptotic expansions for both strongly convex and non-strongly convex cases. It covers the derivation of performance bounds using techniques like Laplace's method and the behavior of random minimizers. The text also explains the 'weird' behavior observed in certain plots, where non-strongly convex bounds become tight under specific conditions. The analysis connects theoretical results to practical considerations in optimization algorithms. | ||
