You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Start with an initially randomly connected network containing (m_0) neural units.
At every time step, introduce a new unit and connect it to (m) already-existing neural units, with (m \le m_0).
When the number of units reaches the total (N), the growth process stops.
Step 2: Preferential attachment
The probability (\Pi_i) that a new neural unit will be attached to unit (i) (one of the (m) already-existing units) depends on the degree (k_i) of unit (i), as follows:
Hi, I’m interested in working on this if it’s still available. I’ve reviewed the current initializer conventions and the paper linked in the issue. For a first contribution, would you prefer an undirected Barabási–Albert topology with sampled weights and the standard radius/sparse-output support, or should a directed/weighted variant be included from the beginning?
Activity
aviralgarg05 commentedon Nov 13, 2026
Hi, I’m interested in working on this if it’s still available. I’ve reviewed the current initializer conventions and the paper linked in the issue. For a first contribution, would you prefer an undirected Barabási–Albert topology with sampled weights and the standard radius/sparse-output support, or should a directed/weighted variant be included from the beginning?
MartinuzziFrancesco commentedon Nov 19, 2026
if you want you can start with the first and add the second with a different pr