zlacker

[parent] [thread] 5 comments
1. zopf+(OP)[view] [source] 2024-04-17 23:15:00
I wonder to what degree an LLM could now produce frames/slots/values in the knowledge graph. With so much structure already existing in the Cyc knowledge graph, could those frames act as the crystal seed upon which an LLM could crystallize its latent knowledge about the world from the trillions of tokens it was trained upon?
replies(1): >>tkgall+K
2. tkgall+K[view] [source] 2024-04-17 23:20:19
>>zopf+(OP)
I had the same thought. Does anybody know if there have been attempts either to incorporate Cyc-like graphs into LLM training data or to extend such graphs with LLMs?
replies(3): >>radomi+45 >>thesz+69 >>mike_h+cO
◧◩
3. radomi+45[view] [source] [discussion] 2024-04-17 23:55:04
>>tkgall+K
From time to time, I read articles on the boundary between neural nets and knowledge graphs like a recent [1]. Sadly, no mention of Cyc.

I'd bet, judging mostly from my failed attempts at playing with OpenCyc around 2009, is that the Cyc has always been too closed and to complex to tinker with. That doesn't play nicely with academic work. When people finish their PhDs and start working for OpenAI, they simply don't have Cyc in their toolbox.

[1] https://www.sciencedirect.com/science/article/pii/S089360802...

replies(1): >>viksit+w5
◧◩◪
4. viksit+w5[view] [source] [discussion] 2024-04-17 23:58:38
>>radomi+45
oh i just commented elsewhere in the thread about our work in integrating frames and slots into LSTMs a few years ago! second this.
◧◩
5. thesz+69[view] [source] [discussion] 2024-04-18 00:28:32
>>tkgall+K
There are lattice-based RNNs applied as language models.

In fact, if you have a graph and a path-weighting model (RNN, TDCNN or Transformer), you can use beam search to evaluate paths through graphs.

◧◩
6. mike_h+cO[view] [source] [discussion] 2024-04-18 08:51:18
>>tkgall+K
The problem is not one of KB size. The Cyc KB is huge. The problem is that the underlying inferencing algorithms don't scale whereas the transformer algorithm does.
[go to top]