English
Related papers

Related papers: FLamE: Few-shot Learning from Natural Language Exp…

200 papers

While large language models (LLMs), such as GPT-3, appear to be robust and general, their reasoning ability is not at a level to compete with the best models trained for specific natural language reasoning problems. In this study, we…

Computation and Language · Computer Science 2023-07-18 Zhun Yang , Adam Ishay , Joohyung Lee

Human learning benefits from multi-modal inputs that often appear as rich semantics (e.g., description of an object's attributes while learning about it). This enables us to learn generalizable concepts from very limited visual examples.…

Computer Vision and Pattern Recognition · Computer Science 2021-11-15 Mohamed Afham , Salman Khan , Muhammad Haris Khan , Muzammal Naseer , Fahad Shahbaz Khan

Most reinforcement learning (RL) methods for training large language models (LLMs) require ground-truth labels or task-specific verifiers, limiting scalability when correctness is ambiguous or expensive to obtain. We introduce Reinforcement…

Neural and Evolutionary Computing · Computer Science 2026-01-30 Micah Rentschler , Jesse Roberts

Natural Language Explanation (NLE) aims to elucidate the decision-making process by providing detailed, human-friendly explanations in natural language. It helps demystify the decision-making processes of large vision-language models…

Computation and Language · Computer Science 2024-12-10 Patrick Amadeus Irawan , Genta Indra Winata , Samuel Cahyawijaya , Ayu Purwarianti

Although language models (LMs) have boosted the performance of Question Answering, they still need plenty of data. Data annotation, in contrast, is a time-consuming process. This especially applies to Question Answering, where possibly…

Computation and Language · Computer Science 2024-05-16 Maximilian Schmidt , Andrea Bartezzaghi , Ngoc Thang Vu

We propose FAME (Formal Abstract Minimal Explanations), a new class of abductive explanations grounded in abstract interpretation. FAME is the first method to scale to large neural networks while reducing explanation size. Our main…

Artificial Intelligence · Computer Science 2026-03-12 Ryma Boumazouza , Raya Elsaleh , Melanie Ducoffe , Shahaf Bassan , Guy Katz

Prompting language models (LMs) with training examples and task descriptions has been seen as critical to recent successes in few-shot learning. In this work, we show that finetuning LMs in the few-shot setting can considerably reduce the…

Computation and Language · Computer Science 2021-07-02 Robert L. Logan , Ivana Balažević , Eric Wallace , Fabio Petroni , Sameer Singh , Sebastian Riedel

Over the last couple of years few-shot learning (FSL) has attracted great attention towards minimizing the dependency on labeled training examples. An inherent difficulty in FSL is the handling of ambiguities resulting from having too few…

Computer Vision and Pattern Recognition · Computer Science 2023-02-06 Orhun Buğra Baran , Ramazan Gökberk Cinbiş

Understanding covert narratives and implicit messaging is essential for analyzing bias and sentiment. Traditional NLP methods struggle with detecting subtle phrasing and hidden agendas. This study tackles two key challenges: (1) multi-label…

Computation and Language · Computer Science 2025-09-05 Rishit Tyagi , Rahul Bouri , Mohit Gupta

Supervised learning has traditionally focused on inductive learning by observing labeled examples of a task. In contrast, humans have the ability to learn new concepts from language. Here, we explore training zero-shot classifiers for…

Computation and Language · Computer Science 2022-04-15 Rakesh R Menon , Sayan Ghosh , Shashank Srivastava

Large Language Models (LLMs), with their remarkable ability to tackle challenging and unseen reasoning problems, hold immense potential for tabular learning, that is vital for many real-world applications. In this paper, we propose a novel…

Machine Learning · Computer Science 2024-05-07 Sungwon Han , Jinsung Yoon , Sercan O Arik , Tomas Pfister

Large language models (LLM) trained using the next-token-prediction objective, such as GPT3 and PaLM, have revolutionized natural language processing in recent years by showing impressive zero-shot and few-shot capabilities across a wide…

Computation and Language · Computer Science 2023-02-01 Hao Liu , Xinyang Geng , Lisa Lee , Igor Mordatch , Sergey Levine , Sharan Narang , Pieter Abbeel

Self-Refinement refers to a model's ability to revise its own responses to produce improved outputs. This capability can also serve as a fundamental mechanism for Self-Improvement, for example, by reconstructing datasets with refined…

Computation and Language · Computer Science 2025-10-28 Yongcheng Zeng , Xinyu Cui , Xuanfa Jin , Qirui Mi , Guoqing Liu , Zexu Sun , Mengyue Yang , Dong Li , Weiyu Ma , Ning Yang , Jian Zhao , Jianye Hao , Haifeng Zhang , Jun Wang

It has been shown for English that discrete and soft prompting perform strongly in few-shot learning with pretrained language models (PLMs). In this paper, we show that discrete and soft prompting perform better than finetuning in…

Computation and Language · Computer Science 2021-09-09 Mengjie Zhao , Hinrich Schütze

A prominent achievement of natural language processing (NLP) is its ability to understand and generate meaningful human language. This capability relies on complex feedforward transformer block architectures pre-trained on large language…

Computation and Language · Computer Science 2025-11-11 Ronit D. Gross , Yarden Tzach , Tal Halevi , Ella Koresh , Ido Kanter

Explainability algorithms such as LIME have enabled machine learning systems to adopt transparency and fairness, which are important qualities in commercial use cases. However, recent work has shown that LIME's naive sampling strategy can…

Machine Learning · Computer Science 2021-03-23 Sean Saito , Eugene Chua , Nicholas Capel , Rocco Hu

Code generation, symbolic math reasoning, and other tasks require LLMs to produce outputs that are both syntactically and semantically correct. Constrained LLM generation is a promising direction to enforce adherence to formal grammar, but…

Programming Languages · Computer Science 2025-09-08 Debangshu Banerjee , Tarun Suresh , Shubham Ugare , Sasa Misailovic , Gagandeep Singh

Few-shot spoken word classification has largely been developed for applications where a small number of classes is considered, and so the potential of larger-scale few-shot spoken word classification remains untapped. This paper…

Computation and Language · Computer Science 2026-05-15 Louise Beyers , Batsirayi Mupamhi Ziki , Ruan van der Merwe

We introduce LAMPO, a novel paradigm that leverages Large Language Models (LLMs) for solving few-shot multi-class ordinal classification tasks. Unlike conventional methods, which concatenate all demonstration examples with the test instance…

Machine Learning · Computer Science 2024-08-08 Zhen Qin , Junru Wu , Jiaming Shen , Tianqi Liu , Xuanhui Wang

Expert demonstrations have proven an easy way to indirectly specify complex tasks. Recent algorithms even support extracting unambiguous formal specifications, e.g. deterministic finite automata (DFA), from demonstrations. Unfortunately,…

Machine Learning · Computer Science 2025-06-24 Marcell Vazquez-Chanlatte , Karim Elmaaroufi , Stefan J. Witwicki , Matei Zaharia , Sanjit A. Seshia