Explore >> Select a destination
|
You are here 
|
howonlee.github.io | ||
| | | | |
blog.computationalcomplexity.org
|
|
| | | | | (Updated version of Computational Intractability: A Guide to Algorithmic Lower Bound by Demaine-Gasarch-Hajiaghayi is here ) Any question... | |
| | | | |
qsantos.fr
|
|
| | | | | ||
| | | | |
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. | |
| | | | |
sourcetms.com
|
|
| | | Two-time founder with a background in tech and finance. Built a VC-backed enterprise billing platform and Agentbase, an agent development and orchestration platform. | ||
