Explore >> Select a destination
|
You are here 
|
gilkalai.wordpress.com | ||
| | | | |
polymathprojects.org
|
|
| | | | | This post is meant to propose and discuss a polymath project and a sort of polymath project. I. A polymath proposal: Convex hulls of real algebraic varieties. One of the interesting questions regarding the polymath endeavor was: Can polymath be used to develop a theory/new area? My idea is to have a project devoted to... | |
| | | | |
rjlipton.com
|
|
| | | | | Isomorphism at the SODA 2014 conference Ronald Read and Derek Corneil are Canadian mathematicians and computer scientists. Read earned a PhD in Mathematics from the University of London in 1959, while Corneil was one of the inaugural PhD's in the University of Toronto's Department of Computer Science. Read is also an accomplished musician and composer---indeed... | |
| | | | |
quomodocumque.wordpress.com
|
|
| | | | | OK, they are not really the same thing. But I got you reading, right? Here's the sense in which they're all the same thing. Let G be a group and H < G a subgroup. Let m > 1 be an integer. Write Orb_m for the set of orbits of G by simultaneous left multiplication... | |
| | | | |
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. | ||
