-
```
Hi Marc
First of all, thanks very much for putting effort into protobuf-net. It's a
great engine!
I have a problem with a very large object graph I'm trying to serialize.
Sometimes, a collecti…
-
```
Hi Marc
First of all, thanks very much for putting effort into protobuf-net. It's a
great engine!
I have a problem with a very large object graph I'm trying to serialize.
Sometimes, a collecti…
-
```
Hi Marc
First of all, thanks very much for putting effort into protobuf-net. It's a
great engine!
I have a problem with a very large object graph I'm trying to serialize.
Sometimes, a collecti…
-
```
Hi Marc
First of all, thanks very much for putting effort into protobuf-net. It's a
great engine!
I have a problem with a very large object graph I'm trying to serialize.
Sometimes, a collecti…
-
### Description:
We should implement model sharding in neural-lam to allow for training with larger batch sizes without exhausting GPU vRAM. This feature will enable users to scale to larger models a…
-
Example of the problem is Tree Search. Or BAMT graphs (see discussion).
The problem is that Tree search is caught in local minima for graphs with N>20. Small graphs are found without problem in 50-…
-
This is the original vanilla code, not even refine till end pass.
Disconnected communities: `5.0E-4`, Modularity: `0.4450`
![image](https://github.com/user-attachments/assets/923cc05f-c24c-4d09-…
-
https://arxiv.org/abs/1706.02216
> Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying prot…
-
See this twitter thread for reference: https://twitter.com/neuecc/status/1589902671540256771?s=20&t=AcVRk8mwSdMyQJT2c5jyDg
Note: we could also consider avoiding reference tracking for types by defa…
-
With the [webbase-2001](https://sparse.tamu.edu/LAW/webbase-2001) graph, a graph with 118M vertices and and 1.02B directed edges, leidenalg is currently returning 30 disconnected communities (with see…