Explore >> Select a destination
|
You are here 
|
grigory.github.io | ||
| | | | |
theorydish.blog
|
|
| | | | | The 66th Annual Symposium on Foundations of Computer Science (FOCS 2025), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held in Sydney, Australia, December 14-17. Papers presenting new and original research on theory of computation are sought. Typical but not exclusive topics of interest include: algorithmic coding theory,... | |
| | | | |
ptreview.sublinear.info
|
|
| | | | | ||
| | | | |
jeremykun.com
|
|
| | | | | Hard to believe Sanjeev Arora and his coauthors consider it"a basic tool [that should be] taught to all algorithms students together with divide-and-conquer, dynamic programming, and random sampling."Christos Papadimitriou calls it"so hard to believe that it has been discovered five times and forgotten." It has formed the basis of algorithms inmachine learning, optimization, game theory, | |
| | | | |
blog.otoro.net
|
|
| | | [AI summary] This article describes a project that combines genetic algorithms, NEAT (NeuroEvolution of Augmenting Topologies), and backpropagation to evolve neural networks for classification tasks. The key components include: 1) Using NEAT to evolve neural networks with various activation functions, 2) Applying backpropagation to optimize the weights of these networks, and 3) Visualizing the results of the evolved networks on different datasets (e.g., XOR, two circles, spiral). The project also includes a web-based demo where users can interact with the system, adjust parameters, and observe the evolution process. The author explores how the genetic algorithm can discover useful features (like squaring inputs) without human intervention, and discusses the ... | ||
