AI Breakdown

ArXiv Preprint - Talk like a Graph: Encoding Graphs for Large Language Models

In this episode we discuss Talk like a Graph: Encoding Graphs for Large Language Models
by Bahare Fatemi, Jonathan Halcrow, Bryan Perozzi. The paper discusses the encoding of graph-structured data for use in large language models (LLMs). It investigates different graph encoding methods, the nature of graph tasks, and the structure of the graph, and their impact on LLM performance in graph reasoning tasks. The study highlights the importance of choosing appropriate graph encoding methods and prompts to enhance LLM performance.

arxiv Preprint - AgentTuning: Enabling Generalized Agent Abilities for LLMs

In this episode we discuss AgentTuning: Enabling Generalized Agent Abilities for LLMs
by Aohan Zeng, Mingdao Liu, Rui Lu, Bowen Wang, Xiao Liu, Yuxiao Dong, Jie Tang. AgentTuning is a method that enhances the agent abilities of large language models (LLMs) while maintaining their general capabilities. It introduces AgentInstruct, a lightweight instruction-tuning dataset, and combines it with open-source instructions from general domains. The resulting model, AgentLM, demonstrates generalized agent capabilities comparable to commercial LLMs.

ArXiv Preprint - Jailbreaking Black Box Large Language Models in Twenty Queries

In this episode we discuss Jailbreaking Black Box Large Language Models in Twenty Queries
by Patrick Chao, Alexander Robey, Edgar Dobriban, Hamed Hassani, George J. Pappas, Eric Wong. The paper introduces an algorithm called Prompt Automatic Iterative Refinement (PAIR) that generates "jailbreaks" for large language models (LLMs) using only black-box access. PAIR leverages an attacker LLM to automatically create vulnerabilities for a targeted LLM without human intervention. The algorithm requires fewer than twenty queries to create a jailbreak and achieves competitive success rates on different LLMs, including GPT-3.5/4. The research aims to identify weaknesses in LLMs to enhance their safety and prevent potential misuse.

ArXiv Preprint - Matryoshka Diffusion Models

In this episode we discuss Matryoshka Diffusion Models
by Jiatao Gu, Shuangfei Zhai, Yizhe Zhang, Josh Susskind, Navdeep Jaitly. The paper introduces Matryoshka Diffusion Models (MDM) for high-resolution image and video synthesis. The authors propose a diffusion process that denoises inputs at multiple resolutions simultaneously. They also present a NestedUNet architecture that combines features and parameters for small-scale inputs with larger scales, allowing for improved optimization for high-resolution generation. The approach is demonstrated to be effective on various benchmarks, achieving strong zero-shot generalization using a dataset of only 12 million images.

arxiv Preprint - An Image is Worth Multiple Words: Learning Object Level Concepts using Multi-Concept Prompt Learning

In this episode we discuss An Image is Worth Multiple Words: Learning Object Level Concepts using Multi-Concept Prompt Learning
by Chen Jin, Ryutaro Tanno, Amrutha Saseendran, Tom Diethe, Philip Teare. The paper proposes a framework called Multi-Concept Prompt Learning (MCPL) to address the challenge of integrating multiple object-level concepts within one scene using prompt learning. The authors introduce three regularization techniques to enhance word-concept correlation. The MCPL framework is evaluated through image generation, editing, and attention visualization, and is compared to a previous approach that can only learn a single concept from each image.

arxiv Preprint - Retrieval meets Long Context Large Language Models

In this episode we discuss Retrieval meets Long Context Large Language Models
by Peng Xu, Wei Ping, Xianchao Wu, Lawrence McAfee, Chen Zhu, Zihan Liu, Sandeep Subramanian, Evelina Bakhturina, Mohammad Shoeybi, Bryan Catanzaro. This paper compares two methods for handling long context in large language models (LLMs): retrieval-augmentation and extending the context window. The study finds that LLMs with a 4K context window using retrieval-augmentation achieve similar performance to LLMs with a 16K context window through positional interpolation, while requiring less computation. Moreover, the authors demonstrate that retrieval significantly improves LLM performance regardless of the context window size.

arxiv Preprint - Contrastive Prefence Learning: Learning from Human Feedback without RL

In this episode we discuss Contrastive Prefence Learning: Learning from Human Feedback without RL
by Joey Hejna, Rafael Rafailov, Harshit Sikchi, Chelsea Finn, Scott Niekum, W. Bradley Knox, Dorsa Sadigh. Traditional approaches to Reinforcement Learning from Human Feedback (RLHF) assume that human preferences align with reward, but recent research suggests they align with regret under the user's optimal policy. This flawed assumption complicates the optimization of the learned reward function using RL. Contrastive Preference Learning (CPL) is proposed as a new approach that learns optimal policies directly from preferences without the need for RL, using maximum entropy and a contrastive objective. CPL is off-policy, applicable to various problems, and can handle high-dimensional and sequential RLHF tasks.

arxiv Preprint - BitNet: Scaling 1-bit Transformers for Large Language Models

In this episode we discuss BitNet: Scaling 1-bit Transformers for Large Language Models
by Hongyu Wang, Shuming Ma, Li Dong, Shaohan Huang, Huaijie Wang, Lingxiao Ma, Fan Yang, Ruiping Wang, Yi Wu, Furu Wei. The paper introduces BitNet, an architecture for large language models that addresses concerns about energy consumption and deployment challenges. BitNet utilizes 1-bit weights and introduces a BitLinear layer to replace the nn.Linear layer. Experimental results show that BitNet achieves competitive performance while reducing memory footprint and energy consumption. It also exhibits a scaling law similar to full-precision Transformers, suggesting its potential for scaling to larger language models efficiently. Detailed graphs and tables are provided to showcase the advantages of BitNet in terms of model size, energy cost reduction, and loss.

arxiv Preprint - Automatic Prompt Optimization with ”Gradient Descent” and Beam Search

In this episode we discuss Automatic Prompt Optimization with "Gradient Descent" and Beam Search
by Reid Pryzant, Dan Iter, Jerry Li, Yin Tat Lee, Chenguang Zhu, Michael Zeng. The paper introduces ProTeGi, a method for improving prompts used in large language models. It utilizes mini-batches of data to generate "natural language gradients" that provide feedback on the prompt. ProTeGi uses beam search and bandit selection to efficiently modify the prompt, resulting in improved performance on benchmark NLP tasks and a novel LLM jailbreak detection problem. This method reduces manual effort and enhances task performance by automatically optimizing prompts.

arxiv Preprint - Understanding Retrieval Augmentation for Long-Form Question Answering

In this episode we discuss Understanding Retrieval Augmentation for Long-Form Question Answering
by Hung-Ting Chen, Fangyuan Xu, Shane A. Arora, Eunsol Choi. This paper examines the impact of retrieval-augmented language models on long-form question answering. The authors compare the generated answers using the same evidence documents to analyze how retrieval augmentation affects different language models. They also investigate the quality of the retrieval document set and its effect on the generated answers.