/explore
|
You are here 
|
memetracker.org | ||
| | | | |
distill.pub
|
|
| | | | | What components are needed for building learning algorithms that leverage the structure and properties of graphs? | |
| | | | |
www.nature.com
|
|
| | | | | Despite the growing interest in characterizing the local geometry leading to the global topology of networks, our understanding of the local structure of complex networks, especially real-world networks, is still incomplete. Here, we analyze a simple, elegant yet underexplored measure, degree difference (DD) between vertices of an edge, to understand the local network geometry. We describe the connection between DD and global assortativity of the network from both formal and conceptual perspective, and s... | |
| | | | |
cprimozic.net
|
|
| | | | | A summary of my research and experiments on growing sparse computational graphs by training small RNNs. This post describes the architecture, training process, and pruning method used to create the graphs and then examines some of the learned solutions to a variety of objectives. | |
| | | | |
dennybritz.com
|
|
| | | All the code is also available as an Jupyter notebook on Github. | ||
