An open-source library for building knowledge graphs from text corpus using open-source LLMs like Llama 3 and Mixtral.

Gemini 1.5 is so powerful that it can read all the Harry Potter books at once and generate a graph of the characters with perfect accuracy. All the books have… | 146 comments on LinkedIn

With the rise of LLMs, we can now store both structure and semantic meaning as vector embeddings in knowledge graphs.

Global Reasoning with Knowledge Graphs and Generative AI ⏺ Large language models (LLMs) open in a new era of natural language processing…

Introducing Microsoft Graph RAG: Enhancing AI's Ability to Summarize Large Text Corpora ... 👉A New Approach to Query-Focused Summarization based on Knowledge… | 21 comments on LinkedIn

DoorDash leverages Large Language Models to build a product knowledge graph that captures relationships between millions of consumer goods.

When to use graph data models, such as parent-child, question-based, and topic-summary, for RAG applications powered by knowledge graphs.

Language models have achieved impressive performances on dialogue generation tasks. However, when generating responses for a conversation that requires factual knowledge, they are far from perfect, due to an absence of mechanisms to retrieve, encode, and reflect the knowledge in the generated responses. Some knowledge-grounded dialogue generation methods tackle this problem by leveraging facts from Knowledge Graphs (KGs); however, they do not guarantee that the model utilizes a relevant piece of knowledge from the KG. To overcome this limitation, we propose SUbgraph Retrieval-augmented GEneration (SURGE), a framework for generating context-relevant and knowledge-grounded dialogues with the KG. Specifically, our SURGE framework first retrieves the relevant subgraph from the KG, and then enforces consistency across facts by perturbing their word embeddings conditioned by the retrieved subgraph. Then, we utilize contrastive learning to ensure that the generated texts have high similarity to the retrieved subgraphs. We validate our SURGE framework on OpendialKG and KOMODIS datasets, showing that it generates high-quality dialogues that faithfully reflect the knowledge from KG.

Have you tried Croissant? If not, you are missing out. Using LLMs to generate knowledge graphs is an exciting area of exploration. My colleague Jesús Barrasa…

Optimizing vector retrieval with advanced graph-based metadata techniques using LangChain and Neo4j Editor's Note: the following is a guest blog post from Tomaz Bratanic, who focuses on Graph ML and GenAI research at Neo4j. Neo4j is a graph database and analytics company which helps organizations find hidden relationships and patterns

AI has been a part of healthcare and life sciences for decades. You might remember hearing about the very first chatbot, ELIZA, created at MIT in 1964 by Joseph Weizenbaum to explore communication between machines and humans.

Learn how the 2023 Gartner Hype Cycle™ identifies exciting innovations in artificial intelligence that will be beneficial to business.

Our paper "𝐺𝑟𝑎𝑝ℎ𝐸𝑅: 𝐴 𝑆𝑡𝑟𝑢𝑐𝑡𝑢𝑟𝑒-𝑎𝑤𝑎𝑟𝑒 𝑇𝑒𝑥𝑡-𝑡𝑜-𝐺𝑟𝑎𝑝ℎ 𝑀𝑜𝑑𝑒𝑙 𝑓𝑜𝑟 𝐸𝑛𝑡𝑖𝑡𝑦 𝑎𝑛𝑑 𝑅𝑒𝑙𝑎𝑡𝑖𝑜𝑛… | 34 comments on LinkedIn

A survey of the current methods of integration

cognee: Train your knowledge graph generation and search with DSPy, Weaviate, and Neo4j to generate deterministic LLMs outputs! GitHub…

Transform plain text into a visually stunning Knowledge Graph with GPT-4 (latest preview)! It converts text into RDF tuples, and highlights the most frequent connections with a vibrant color-coding...

Recent work demonstrated great promise in the idea of orchestrating collaborations between LLMs, human input, and various tools to address the inherent limitations of LLMs. We propose a novel perspective called semantic decoding, which frames these collaborative processes as optimization procedures in semantic space. Specifically, we conceptualize LLMs as semantic processors that manipulate meaningful pieces of information that we call semantic tokens (known thoughts). LLMs are among a large pool of other semantic processors, including humans and tools, such as search engines or code executors. Collectively, semantic processors engage in dynamic exchanges of semantic tokens to progressively construct high-utility outputs. We refer to these orchestrated interactions among semantic processors, optimizing and searching in semantic space, as semantic decoding algorithms. This concept draws a direct parallel to the well-studied problem of syntactic decoding, which involves crafting algorithms to best exploit auto-regressive language models for extracting high-utility sequences of syntactic tokens. By focusing on the semantic level and disregarding syntactic details, we gain a fresh perspective on the engineering of AI systems, enabling us to imagine systems with much greater complexity and capabilities. In this position paper, we formalize the transition from syntactic to semantic tokens as well as the analogy between syntactic and semantic decoding. Subsequently, we explore the possibilities of optimizing within the space of semantic tokens via semantic decoding algorithms. We conclude with a list of research opportunities and questions arising from this fresh perspective. The semantic decoding perspective offers a powerful abstraction for search and optimization directly in the space of meaningful concepts, with semantic tokens as the fundamental units of a new type of computation.

Neurosymbolic AI is an increasingly active area of research that combines symbolic reasoning methods with deep learning to leverage their complementary benefits. As knowledge graphs are becoming a popular way to represent heterogeneous and multi-relational data, methods for reasoning on graph structures have attempted to follow this neurosymbolic paradigm. Traditionally, such approaches have utilized either rule-based inference or generated representative numerical embeddings from which patterns could be extracted. However, several recent studies have attempted to bridge this dichotomy to generate models that facilitate interpretability, maintain competitive performance, and integrate expert knowledge. Therefore, we survey methods that perform neurosymbolic reasoning tasks on knowledge graphs and propose a novel taxonomy by which we can classify them. Specifically, we propose three major categories: (1) logically-informed embedding approaches, (2) embedding approaches with logical constraints, and (3) rule learning approaches. Alongside the taxonomy, we provide a tabular overview of the approaches and links to their source code, if available, for more direct comparison. Finally, we discuss the unique characteristics and limitations of these methods, then propose several prospective directions toward which this field of research could evolve.

The autonomous driving industry is expected to grow by over 20 times in the coming decade and, thus, motivate researchers to delve into it. The primary focus of their research is to ensure safety, comfort, and efficiency. An autonomous vehicle has several modules responsible for one or more of the aforementioned items. Among these modules, the trajectory planner plays a pivotal role in the safety of the vehicle and the comfort of its passengers. The module is also responsible for respecting kinematic constraints and any applicable road constraints. In this paper, a novel online spatial-temporal graph trajectory planner is introduced to generate safe and comfortable trajectories. First, a spatial-temporal graph is constructed using the autonomous vehicle, its surrounding vehicles, and virtual nodes along the road with respect to the vehicle itself. Next, the graph is forwarded into a sequential network to obtain the desired states. To support the planner, a simple behavioral layer is also presented that determines kinematic constraints for the planner. Furthermore, a novel potential function is also proposed to train the network. Finally, the proposed planner is tested on three different complex driving tasks, and the performance is compared with two frequently used methods. The results show that the proposed planner generates safe and feasible trajectories while achieving similar or longer distances in the forward direction and comparable comfort ride.

Accurate traffic forecasting is essential for effective urban planning and congestion management. Deep learning (DL) approaches have gained colossal success in traffic forecasting but still face challenges in capturing the intricacies of traffic dynamics. In this paper, we identify and address this challenges by emphasizing that spatial features are inherently dynamic and change over time. A novel in-depth feature representation, called Dynamic Spatio-Temporal (Dyn-ST) features, is introduced, which encapsulates spatial characteristics across varying times. Moreover, a Dynamic Spatio-Temporal Graph Transformer Network (DST-GTN) is proposed by capturing Dyn-ST features and other dynamic adjacency relations between intersections. The DST-GTN can model dynamic ST relationships between nodes accurately and refine the representation of global and local ST characteristics by adopting adaptive weights in low-pass and all-pass filters, enabling the extraction of Dyn-ST features from traffic time-series data. Through numerical experiments on public datasets, the DST-GTN achieves state-of-the-art performance for a range of traffic forecasting tasks and demonstrates enhanced stability.

Integrating large language models (LLMs) with knowledge graphs derived from domain-specific data represents an important advancement towards more powerful and factual reasoning. As these models grow more capable, it is crucial to enable them to perform multi-step inferences over real-world knowledge graphs while minimizing hallucination. While large language models excel at conversation and text generation, their ability to reason over domain-specialized graphs of interconnected entities remains limited. For example, can we query a LLM to identify the optimal contact in a professional network for a specific goal, based on relationships and attributes in a private database? The answer is no--such capabilities lie beyond current methods. However, this question underscores a critical technical gap that must be addressed. Many high-value applications in areas such as science, security, and e-commerce rely on proprietary knowledge graphs encoding unique structures, relationships, and logical constraints. We introduce a fine-tuning framework for developing Graph-aligned LAnguage Models (GLaM) that transforms a knowledge graph into an alternate text representation with labeled question-answer pairs. We demonstrate that grounding the models in specific graph-based knowledge expands the models' capacity for structure-based reasoning. Our methodology leverages the large-language model's generative capabilities to create the dataset and proposes an efficient alternate to retrieval-augmented generation styled methods.

Latest findings in multiple research directions for handling graph construction and network security issues

A comparison of FalkorDB with other Knowledge Graphs for developing AI applications with.

Motivation and context

Sorry to those immersed in DSPy, but this might be the least magical DSPy RAG (retrieval-augmented generation) pipeline you’ve ever seen. The DSPy… | 29 comments on LinkedIn

Copyright 2024 Kurt Cagle / The Cagle Report There is an interesting tug-of-war going on right now. On one side are the machine learning folks, those who have been harnessing neural networks for a few years.

The Iterative Dance of the RAG Framework for Knowledge-Grounded Language AI ⭕ To truly unlock the potential of LLMs for open-ended question answering and…

AI Answers Questions on Any Knowledge Graph - No Training Required ... Imagine being able to ask complex questions about any knowledge graph and get accurate…

A straightforward introduction to integrating language models (LLMs) with knowledge graphs (KGs) for enhanced intelligence.

In response to my last blog, LLMs and Knowledge — the study continues, I got a lot of questions LinkedIn, which I decided to answer in…