English
Related papers

Related papers: LLMs as Probabilistic Minimally Adequate Teachers …

200 papers

Active automata learning (AAL) under a Minimally Adequate Teacher (MAT) has been successfully used to infer a regular language through membership and equivalence queries. This language might not be fully characterized: we are then…

Formal Languages and Automata Theory · Computer Science 2026-04-09 Daniel Stan , Adrien Pommellet , Juliette Jacquot

Large language models (LLMs) have demonstrated strong performance on formal language tasks, yet whether this reflects genuine symbolic reasoning or pattern matching on familiar constructions remains unclear. We introduce a benchmark for…

Computation and Language · Computer Science 2026-01-21 Shlok Shelat , Jay Raval , Souvik Roy , Manas Gaur

Large Language Models (LLMs) can perform various natural language processing tasks with suitable instruction prompts. However, designing effective prompts manually is challenging and time-consuming. Existing methods for automatic prompt…

Computation and Language · Computer Science 2024-04-04 Viet-Tung Do , Van-Khanh Hoang , Duy-Hung Nguyen , Shahab Sabahi , Jeff Yang , Hajime Hotta , Minh-Tien Nguyen , Hung Le

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

Large Language Model (LLM) simulations, where LLMs act as students with varying approaches to learning tasks, can support teachers' noticing of student thinking. However, simulations using zero- or few-shot prompting often yield inauthentic…

Human-Computer Interaction · Computer Science 2026-04-07 Jie Cao , Ha Nguyen , Selim Yavuz , Boran Yu , Shuguang Wang , Pavneet Kaur Bharaj , Dionne Cross Francis

Large Language Models (LLMs), when used in educational settings without pedagogical fine-tuning, often provide immediate answers rather than guiding students through the problem-solving process. This approach falls short of pedagogically…

Computation and Language · Computer Science 2024-10-08 Shashank Sonkar , Kangqi Ni , Sapana Chaudhary , Richard G. Baraniuk

Large language models (LLMs) have become increasingly capable of following instructions and complex reasoning, making prompting a flexible interface for adapting models without parameter updates. Yet prompt design remains labor-intensive…

Computation and Language · Computer Science 2026-05-22 Farima Fatahi Bayat , Moin Aminnaseri , Pouya Pezeshkpour , Estevam Hruschka

Parameter-Efficient Fine-Tuning (PEFT) is widely used for adapting Large Language Models (LLMs) for various tasks. Recently, there has been an increasing demand for fine-tuning a single LLM for multiple tasks because it requires overall…

Computation and Language · Computer Science 2026-05-15 Anjir Ahmed Chowdhury , Syed Zawad , Xiaolong Ma , Xu Dong , Feng Yan

Generative artificial intelligence (AI) has the potential to scale up personalized tutoring through large language models (LLMs). Recent AI tutors are adapted for the tutoring task by training or prompting LLMs to follow effective…

Computation and Language · Computer Science 2025-07-30 Alexander Scarlatos , Naiming Liu , Jaewook Lee , Richard Baraniuk , Andrew Lan

The cold-start user issue further compromises the effectiveness of recommender systems in limiting access to the historical behavioral information. It is an effective pipeline to optimize instructional prompts on a few-shot large language…

Artificial Intelligence · Computer Science 2025-09-12 Haowei Yang , Yushang Zhao , Sitao Min , Bo Su , Chao Yao , Wei Xu

In this work, we introduce DeepDFA, a novel approach to identifying Deterministic Finite Automata (DFAs) from traces, harnessing a differentiable yet discrete model. Inspired by both the probabilistic relaxation of DFAs and Recurrent Neural…

Machine Learning · Computer Science 2024-08-19 Elena Umili , Roberto Capobianco

Existing approaches to mathematical reasoning with large language models (LLMs) rely on Chain-of-Thought (CoT) for generalizability or Tool-Integrated Reasoning (TIR) for precise computation. While efforts have been made to combine these…

Computation and Language · Computer Science 2026-02-13 Xin Xu , Yan Xu , Tianhao Chen , Yuchen Yan , Chengwu Liu , Zaoyu Chen , Yufei Wang , Yichun Yin , Yasheng Wang , Lifeng Shang , Qun Liu , Lu Yin

Automatically generating feedback via large language models (LLMs) in intelligent tutoring systems and online learning platforms has the potential to improve the learning outcomes of many students. However, both feedback generation and…

Computation and Language · Computer Science 2024-12-13 Alexander Scarlatos , Digory Smith , Simon Woodhead , Andrew Lan

Large Language Models (LLMs) have demonstrated remarkable efficiency in tackling various tasks based on human instructions, but studies reveal that they often struggle with tasks requiring reasoning, such as math or physics. This limitation…

Computation and Language · Computer Science 2024-10-08 Ruoyu Wang , Xiaoxuan Li , Lina Yao

Current literature demonstrates that Large Language Models (LLMs) are great few-shot learners, and prompting significantly increases their performance on a range of downstream tasks in a few-shot learning setting. An attempt to automate…

Computation and Language · Computer Science 2023-06-26 Yulin Zhou , Yiren Zhao , Ilia Shumailov , Robert Mullins , Yarin Gal

Large Language Models (LLMs) perform best with well-crafted prompts, yet prompt engineering remains manual, inconsistent, and inaccessible to non-experts. We introduce Promptomatix, an automatic prompt optimization framework that transforms…

Computation and Language · Computer Science 2025-07-28 Rithesh Murthy , Ming Zhu , Liangwei Yang , Jielin Qiu , Juntao Tan , Shelby Heinecke , Caiming Xiong , Silvio Savarese , Huan Wang

Large Language Models (LLMs) often struggle to deliver accurate and actionable answers when user-provided information is incomplete or ill-specified. We propose a new interaction paradigm, First Ask Then Answer (FATA), in which, through…

Artificial Intelligence · Computer Science 2025-08-13 Chuanruo Fu , Yuncheng Du

Recent works have shown promising results of prompt tuning in stimulating pre-trained language models (PLMs) for natural language processing (NLP) tasks. However, to the best of our knowledge, existing works focus on prompt-tuning…

Computation and Language · Computer Science 2022-05-24 Yuan Yao , Bowen Dong , Ao Zhang , Zhengyan Zhang , Ruobing Xie , Zhiyuan Liu , Leyu Lin , Maosong Sun , Jianyong Wang

Training large language models (LLMs) from scratch can yield models with unique functionalities and strengths, but it is costly and often leads to redundant capabilities. A more cost-effective alternative is to fuse existing pre-trained…

Computation and Language · Computer Science 2025-09-23 Runjia Zeng , James Chenhao Liang , Cheng Han , Zhiwen Cao , Jiahao Liu , Xiaojun Quan , Yingjie Victor Chen , Lifu Huang , Tong Geng , Qifan Wang , Dongfang Liu

LLM-based Automatic Prompt Optimization, which typically utilizes LLMs as Prompt Optimizers to self-reflect and refine prompts, has shown promising performance in recent studies. Despite the success, the underlying mechanism of this…

Computation and Language · Computer Science 2024-02-06 Ruotian Ma , Xiaolei Wang , Xin Zhou , Jian Li , Nan Du , Tao Gui , Qi Zhang , Xuanjing Huang
‹ Prev 1 2 3 10 Next ›