SourceTalk like a Graph: Encoding Graphs for Large Language Models
The paper introduces a task where the LLM is given a graph description and asked to identify nodes NOT directly connected to a given node. This requires reasoning about information that is implicit (not explicitly stated in the encoding). PaLM 62B achieves 0.5% accuracy with zero-shot prompting, and zero-CoT, few-shot, CoT, and CoT-bag methods all achieve close to 0.0% accuracy. The authors attribute this to the graph encoding functions primarily encoding connected nodes, leaving the model without explicit information about absent connections.