Large Language Model
Who is attending Sunak's AI safety summit – and what will they discuss?
Global leaders, tech executives and experts – including Elon Musk – are gathering on Wednesday and Thursday at Bletchley Park, the home of second world war codebreakers, for a landmark summit on safety in artificial intelligence. In a speech last week Rishi Sunak said AI – the term for computer systems that can perform tasks typically associated with intelligent beings – brought opportunities but also significant risks, such as making it easier for rogue actors to make chemical or biological weapons. Here we answer your questions about the summit. The AI safety summit will look at frontier AI systems, which the government describes as "highly capable" models that can perform a wide variety of tasks matching or exceeding the performances of the most advanced AI available today. An example of frontier AI, according to a government document released last week, is the "large language model" technology that underpins AI tools such as the ChatGPT chatbot and its Google-made rival, Bard.
Mark Zuckerberg's Real Cage Fight
This article is from Big Technology, a newsletter by Alex Kantrowitz. Sam Altman sat comfortably between Satya Nadella and Sundar Pichai at a White House gathering of top A.I. CEOs in May--with one noticeable gap in the guest list. With Alphabet, Microsoft, and OpenAI in attendance, it was impossible to miss Mark Zuckerberg's absence. And that appeared to be no accident. The meeting, one administration official said, "was focused on companies currently leading in the space."
Biden rolls out 'most sweeping actions ever taken' to control artificial intelligence that mandates safety tests so tech isn't used to make nuclear or biological weapons... (and AI czar Kamala Harris will oversee it)
President Joe Biden has unveiled the most sweeping actions ever taken to control artificial intelligence to ensure the tech cannot be transformed into a weapon. The order, unveiled Monday, will require developers like Microsoft, OpenAI and Google to conduct safety tests and submit results before launching models for the public. These results will be analyzed by federal agencies, including Homeland Security, to address threats to critical infrastructure and chemical, biological, radiological, nuclear and cybersecurity risks. Biden believes the government was late to address the dangers of social media, and now US youth are grappling with related mental health issues. Monday's executive order is an'urgent' move to rein in the technology before it warps basic notions of truth with false images, deepens racial and social inequalities, provides a tool to scammers and criminals and is used for warfare.
Joe Biden's Sweeping New Executive Order Aims to Drag the US Government into the Age of ChatGPT
Joe Biden wants the US government to make wider use of artificial intelligence--and to keep commercial AI on a tighter leash. Those are two prominent themes of a sprawling executive order Biden will sign today, which issues dozens of directives for federal agencies to complete within the next year, on topics ranging from national security and immigration to housing and health care. Biden will use the Defense Production Act, a law that can compel businesses to take actions in the interest of national security, to require the makers of large AI models to report key information to the government, including when they are training a new model and what cybersecurity protections they have. That will include disclosing results of so-called red teaming exercises, intended to reveal vulnerabilities in AI models, such as those that can be used to evade controls that prevent malicious use cases such as generating malware. The goal is to monitor the potential threats AI technology can pose to national security, public health, and the economy.
Optimistic Active Exploration of Dynamical Systems
Sukhija, Bhavya, Treven, Lenart, Sancaktar, Cansu, Blaes, Sebastian, Coros, Stelian, Krause, Andreas
Reinforcement learning algorithms commonly seek to optimize policies for solving one particular task. How should we explore an unknown dynamical system such that the estimated model globally approximates the dynamics and allows us to solve multiple downstream tasks in a zero-shot manner? In this paper, we address this challenge, by developing an algorithm -- OPAX -- for active exploration. OPAX uses well-calibrated probabilistic models to quantify the epistemic uncertainty about the unknown dynamics. It optimistically -- w.r.t. to plausible dynamics -- maximizes the information gain between the unknown dynamics and state observations. We show how the resulting optimization problem can be reduced to an optimal control problem that can be solved at each episode using standard approaches. We analyze our algorithm for general models, and, in the case of Gaussian process dynamics, we give a first-of-its-kind sample complexity bound and show that the epistemic uncertainty converges to zero. In our experiments, we compare OPAX with other heuristic active exploration approaches on several environments. Our experiments show that OPAX is not only theoretically sound but also performs well for zero-shot planning on novel downstream tasks.
Generative retrieval-augmented ontologic graph and multi-agent strategies for interpretive large language model-based materials design
Transformer neural networks show promising capabilities, in particular for uses in materials analysis, design and manufacturing, including their capacity to work effectively with both human language, symbols, code, and numerical data. Here we explore the use of large language models (LLMs) as a tool that can support engineering analysis of materials, applied to retrieving key information about subject areas, developing research hypotheses, discovery of mechanistic relationships across disparate areas of knowledge, and writing and executing simulation codes for active knowledge generation based on physical ground truths. When used as sets of AI agents with specific features, capabilities, and instructions, LLMs can provide powerful problem solution strategies for applications in analysis and design problems. Our experiments focus on using a fine-tuned model, MechGPT, developed based on training data in the mechanics of materials domain. We first affirm how finetuning endows LLMs with reasonable understanding of domain knowledge. However, when queried outside the context of learned matter, LLMs can have difficulty to recall correct information. We show how this can be addressed using retrieval-augmented Ontological Knowledge Graph strategies that discern how the model understands what concepts are important and how they are related. Illustrated for a use case of relating distinct areas of knowledge - here, music and proteins - such strategies can also provide an interpretable graph structure with rich information at the node, edge and subgraph level. We discuss nonlinear sampling strategies and agent-based modeling applied to complex question answering, code generation and execution in the context of automated force field development from actively learned Density Functional Theory (DFT) modeling, and data analysis.
The Impact of Depth and Width on Transformer Language Model Generalization
Petty, Jackson, van Steenkiste, Sjoerd, Dasgupta, Ishita, Sha, Fei, Garrette, Dan, Linzen, Tal
To process novel sentences, language models (LMs) must generalize compositionally -- combine familiar elements in new ways. What aspects of a model's structure promote compositional generalization? Focusing on transformers, we test the hypothesis, motivated by recent theoretical and empirical work, that transformers generalize more compositionally when they are deeper (have more layers). Because simply adding layers increases the total number of parameters, confounding depth and size, we construct three classes of models which trade off depth for width such that the total number of parameters is kept constant (41M, 134M and 374M parameters). We pretrain all models as LMs and fine-tune them on tasks that test for compositional generalization. We report three main conclusions: (1) after fine-tuning, deeper models generalize better out-of-distribution than shallower models do, but the relative benefit of additional layers diminishes rapidly; (2) within each family, deeper models show better language modeling performance, but returns are similarly diminishing; (3) the benefits of depth for compositional generalization cannot be attributed solely to better performance on language modeling or on in-distribution data.
Rethinking Memory and Communication Cost for Efficient Large Language Model Training
Wu, Chan, Zhang, Hanxiao, Ju, Lin, Huang, Jinjing, Xiao, Youshao, Huan, Zhaoxin, Li, Siyuan, Meng, Fanzhuang, Liang, Lei, Zhang, Xiaolu, Zhou, Jun
Recently, various distributed strategies for large language model training have been proposed. However, these methods provided limited solutions for the trade-off between memory consumption and communication cost. In this paper, we rethink the impact of memory consumption and communication costs on the training speed of large language models, and propose a memory-communication balanced strategy set Partial Redundancy Optimizer (PaRO). PaRO provides comprehensive options which reduces the amount and frequency of inter-group communication with minor memory redundancy by fine-grained sharding strategy, thereby improving the training efficiency in various training scenarios. Additionally, we propose a Hierarchical Overlapping Ring (HO-Ring) communication topology to enhance communication efficiency between nodes or across switches in large language model training. Our experiments demonstrate that PaRO significantly improves training throughput by 1.19x-2.50x compared to the SOTA method and achieves a near-linear scalability. The HO-Ring algorithm improves communication efficiency by 36.5% compared to the traditional Ring algorithm.
InterCode: Standardizing and Benchmarking Interactive Coding with Execution Feedback
Yang, John, Prabhakar, Akshara, Narasimhan, Karthik, Yao, Shunyu
Humans write code in a fundamentally interactive manner and rely on constant execution feedback to correct errors, resolve ambiguities, and decompose tasks. While LLMs have recently exhibited promising coding capabilities, current coding benchmarks mostly consider a static instruction-to-code sequence transduction process, which has the potential for error propagation and a disconnect between the generated code and its final execution environment. To address this gap, we introduce InterCode, a lightweight, flexible, and easy-to-use framework of interactive coding as a standard reinforcement learning (RL) environment, with code as actions and execution feedback as observations. Our framework is language and platform agnostic, uses self-contained Docker environments to provide safe and reproducible execution, and is compatible out-of-the-box with traditional seq2seq coding methods, while enabling the development of new methods for interactive code generation. We use InterCode to create three interactive code environments with Bash, SQL, and Python as action spaces, leveraging data from the static NL2Bash [32], Spider [55], and MBPP [4] datasets. We demonstrate InterCode's viability as a testbed by evaluating multiple state-of-the-art LLMs configured with different prompting strategies such as ReAct [51] and Plan & Solve [43]. Our results showcase the benefits of interactive code generation and demonstrate that InterCode can serve as a challenging benchmark for advancing code understanding and generation capabilities. InterCode is designed to be easily extensible and can even be used to create new tasks such as Capture the Flag, a popular coding puzzle that is inherently multi-step and involves multiple programming languages.
Remember what you did so you know what to do next
Ciosici, Manuel R., Hedges, Alex, Kankanampati, Yash, Martin, Justin, Freedman, Marjorie, Weischedel, Ralph
We explore using a moderately sized large language model (GPT-J 6B parameters) to create a plan for a simulated robot to achieve 30 classes of goals in ScienceWorld, a text game simulator for elementary science experiments. Previously published empirical work claimed that large language models (LLMs) are a poor fit (Wang et al., 2022) compared to reinforcement learning. Using the Markov assumption (a single previous step), the LLM outperforms the reinforcement learning-based approach by a factor of 1.4. When we fill the LLM's input buffer with as many prior steps as possible, improvement rises to 3.5x. Even when training on only 6.5% of the training data, we observe a 2.2x improvement over the reinforcement-learning-based approach. Our experiments show that performance varies widely across the 30 classes of actions, indicating that averaging over tasks can hide significant performance issues. In work contemporaneous with ours, Lin et al. (2023) demonstrated a two-part approach (SwiftSage) that uses a small LLM (T5-large) complemented by OpenAI's massive LLMs to achieve outstanding results in ScienceWorld. Our 6-B parameter, single-stage GPT-J matches the performance of SwiftSage's two-stage architecture when it incorporates GPT-3.5 turbo which has 29-times more parameters than GPT-J.