Large Language Model
Making Pre-trained Language Models Better Continual Few-Shot Relation Extractors
Ma, Shengkun, Han, Jiale, Liang, Yi, Cheng, Bo
Continual Few-shot Relation Extraction (CFRE) is a practical problem that requires the model to continuously learn novel relations while avoiding forgetting old ones with few labeled training data. The primary challenges are catastrophic forgetting and overfitting. This paper harnesses prompt learning to explore the implicit capabilities of pre-trained language models to address the above two challenges, thereby making language models better continual few-shot relation extractors. Specifically, we propose a Contrastive Prompt Learning framework, which designs prompt representation to acquire more generalized knowledge that can be easily adapted to old and new categories, and margin-based contrastive learning to focus more on hard samples, therefore alleviating catastrophic forgetting and overfitting issues. To further remedy overfitting in low-resource scenarios, we introduce an effective memory augmentation strategy that employs well-crafted prompts to guide ChatGPT in generating diverse samples. Extensive experiments demonstrate that our method outperforms state-of-the-art methods by a large margin and significantly mitigates catastrophic forgetting and overfitting in low-resource scenarios.
The Impact of LoRA on the Emergence of Clusters in Transformers
Koubbi, Hugo, Boussard, Matthieu, Hernandez, Louis
In this paper, we employ the mathematical framework on Transformers developed by \citet{sander2022sinkformers,geshkovski2023emergence,geshkovski2023mathematical} to explore how variations in attention parameters and initial token values impact the structural dynamics of token clusters. Our analysis demonstrates that while the clusters within a modified attention matrix dynamics can exhibit significant divergence from the original over extended periods, they maintain close similarities over shorter intervals, depending on the parameter differences. This work contributes to the fine-tuning field through practical applications to the LoRA algorithm \cite{hu2021lora,peft}, enhancing our understanding of the behavior of LoRA-enhanced Transformer models.
Can Machines Be in Language?
In late 2022, large language models (LLMs) erupted into the public spotlight. Pundits were quick to claim LLMs are the next step in the path to artificial general intelligence (AGI) and even the Singularity. LLMs are artificial neural networks (ANN) created by a complex process. First, the core ANN is trained on billions of words of text from the Internet to respond to a prompt with a list of most probable next words after the prompt. Second, the core ANN is then "fine-tuned" by a complex process called "tweaking" to make the core ANN outputs more satisfactory to humans.
GPT-4 developer tool can hack websites without human help
OpenAI's artificial intelligence model GPT-4 has the capability to hack websites and steal information from online databases without human help, researchers have found. That suggests individuals or organisations without hacking expertise could unleash AI agents to carry out cyber attacks. "You literally don't need to understand anything โ you can just let the agent go hack the website by itself," says Daniel Kang at the University of Illinois Urbana-Champaign. "We think this really reduces the expertise needed toโฆ
17 Tips to Take Your ChatGPT Prompts to the Next Level
ChatGPT, Google Gemini, and other tools like them are making artificial intelligence available to the masses. We can now get all sorts of responses back on almost any topic imaginable. These chatbots can compose sonnets, write code, get philosophical, and automate tasks. However, while you can just type anything you like into ChatGPT and get it to understand you. There are ways of getting more interesting and useful results out of the bot.
Chipmaker Nvidia posts record growth, showing AI boom continues
Nvidia invested years ago in software and computer chips focused on AI. When the current excitement around the technology took off in late 2022 after OpenAI's release of ChatGPT, the company was well-positioned to benefit. Its tech is best-suited to run the extremely large computations needed to train AI algorithms, and now Big Tech companies are spending billions to buy its chips to keep up in the AI arms race.
Gotcha! Don't trick me with unanswerable questions! Self-aligning Large Language Models for Responding to Unknown Questions
Deng, Yang, Zhao, Yong, Li, Moxin, Ng, See-Kiong, Chua, Tat-Seng
Despite the remarkable abilities of Large Language Models (LLMs) to answer questions, they often display a considerable level of overconfidence even when the question does not have a definitive answer. To avoid providing hallucinated answers to these unknown questions, existing studies typically investigate approaches to refusing to answer these questions. In this work, we propose a novel and scalable self-alignment method to utilize the LLM itself to enhance its response-ability to different types of unknown questions, being capable of not only refusing to answer but also providing explanation to the unanswerability of unknown questions. Specifically, the Self-Align method first employ a two-stage class-aware self-augmentation approach to generate a large amount of unknown question-response data. Then we conduct disparity-driven self-curation to select qualified data for fine-tuning the LLM itself for aligning the responses to unknown questions as desired. Experimental results on two datasets across four types of unknown questions validate the superiority of the Self-Align method over existing baselines in terms of three types of task formulation.
Efficient and Effective Vocabulary Expansion Towards Multilingual Large Language Models
Kim, Seungduk, Choi, Seungtaek, Jeong, Myeongho
This report introduces \texttt{EEVE-Korean-v1.0}, a Korean adaptation of large language models that exhibit remarkable capabilities across English and Korean text understanding. Building on recent highly capable but English-centric LLMs, such as SOLAR-10.7B and Phi-2, where non-English texts are inefficiently processed with English-centric tokenizers, we present an efficient and effective vocabulary expansion (EEVE) method, which encompasses parameter freezing and subword initialization. In contrast to previous efforts that believe new embeddings require trillions of training tokens, we show that our method can significantly boost non-English proficiency within just 2 billion tokens. Surpassing most instruction-tuned LLMs on the Open Ko-LLM Leaderboard, as of January 2024, our model \texttt{EEVE-Korean-10.8B-v1.0} ranks as the leading Korean pre-trained model in the open-source community, according to Hugging Face's leaderboard. We open-source our models on Huggingface to empower the open research community in various languages.
VISREAS: Complex Visual Reasoning with Unanswerable Questions
Akter, Syeda Nahida, Lee, Sangwu, Chang, Yingshan, Bisk, Yonatan, Nyberg, Eric
Verifying a question's validity before answering is crucial in real-world applications, where users may provide imperfect instructions. In this scenario, an ideal model should address the discrepancies in the query and convey them to the users rather than generating the best possible answer. Addressing this requirement, we introduce a new compositional visual question-answering dataset, VISREAS, that consists of answerable and unanswerable visual queries formulated by traversing and perturbing commonalities and differences among objects, attributes, and relations. VISREAS contains 2.07M semantically diverse queries generated automatically using Visual Genome scene graphs. The unique feature of this task, validating question answerability with respect to an image before answering, and the poor performance of state-of-the-art models inspired the design of a new modular baseline, LOGIC2VISION that reasons by producing and executing pseudocode without any external modules to generate the answer. LOGIC2VISION outperforms generative models in VISREAS (+4.82% over LLaVA-1.5; +12.23% over InstructBLIP) and achieves a significant gain in performance against the classification models.