English
Related papers

Related papers: Deconstructing analogy

200 papers

Large language models (LLMs) are increasingly deployed on complex reasoning tasks, yet little is known about their ability to internally evaluate problem difficulty, which is an essential capability for adaptive reasoning and efficient…

Computation and Language · Computer Science 2025-10-14 Sunbowen Lee , Qingyu Yin , Chak Tou Leong , Jialiang Zhang , Yicheng Gong , Shiwen Ni , Min Yang , Xiaoyu Shen

Human categorization is one of the most important and successful targets of cognitive modeling in psychology, yet decades of development and assessment of competing models have been contingent on small sets of simple, artificial…

Computer Vision and Pattern Recognition · Computer Science 2021-01-27 Ruairidh M. Battleday , Joshua C. Peterson , Thomas L. Griffiths

Learning and the ability to learn are important factors in development and evolutionary processes [1]. Depending on the level, the complexity of learning can strongly vary. While associative learning can explain simple learning behaviour…

Neurons and Cognition · Quantitative Biology 2007-05-23 Reimer Kuehn , Ion-Olimpiu Stamatescu

Language Models (LMs) have demonstrated impressive capabilities in solving complex reasoning tasks, particularly when prompted to generate intermediate explanations. However, it remains an open question whether these intermediate reasoning…

Computation and Language · Computer Science 2025-02-25 Moritz Miller , Kumar Shridhar

Language models learn and represent language differently than humans; they learn the form and not the meaning. Thus, to assess the success of language model explainability, we need to consider the impact of its divergence from a user's…

Computation and Language · Computer Science 2022-07-15 Rita Sevastjanova , Mennatallah El-Assady

Large language models demonstrate limited capability in proficiency-controlled sentence simplification, particularly when simplifying across large readability levels. We propose a framework that decomposes complex simplifications into…

Computation and Language · Computer Science 2026-02-10 Jingshen Zhang , Xin Ying Qiu , Lifang Lu , Zhuhua Huang , Yutao Hu , Yuechang Wu , JunYu Lu

Recent papers in explainable AI have made a compelling case for counterfactual modes of explanation. While counterfactual explanations appear to be extremely effective in some instances, they are formally equivalent to adversarial examples.…

Artificial Intelligence · Computer Science 2020-12-21 Kieran Browne , Ben Swift

Decomposition of text into atomic propositions is a flexible framework allowing for the closer inspection of input and output text. We use atomic decomposition of hypotheses in two natural language reasoning tasks, traditional NLI and…

Computation and Language · Computer Science 2025-03-10 Neha Srikanth , Rachel Rudinger

Convolutional neural networks have been successfully applied to various NLP tasks. However, it is not obvious whether they model different linguistic patterns such as negation, intensification, and clause compositionality to help the…

Computation and Language · Computer Science 2018-10-23 Mahnaz Koupaee , William Yang Wang

There is increasing interest in employing large language models (LLMs) as cognitive models. For such purposes, it is central to understand which properties of human cognition are well-modeled by LLMs, and which are not. In this work, we…

Researchers are increasingly subjecting artificial intelligence systems to psychological testing. But to rigorously compare their cognitive capacities with humans and other animals, we must avoid both over- and under-stating our…

Artificial Intelligence · Computer Science 2025-03-05 Konstantinos Voudouris , Lucy G. Cheke , Eric Schulz

The local and global interpretability of various ML models has been studied extensively in recent years. However, despite significant progress in the field, many known results remain informal or lack sufficient mathematical rigor. We…

Machine Learning · Computer Science 2024-06-10 Shahaf Bassan , Guy Amir , Guy Katz

In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze

When writing programs, people have the ability to tackle a new complex task by decomposing it into smaller and more familiar subtasks. While it is difficult to measure whether neural program synthesis methods have similar capabilities, what…

Machine Learning · Computer Science 2023-10-31 Kensen Shi , Joey Hong , Manzil Zaheer , Pengcheng Yin , Charles Sutton

Many language tasks can be modeled as classification problems where a large language model (LLM) is given a prompt and selects one among many possible answers. We show that the classification error in such problems scales as a power law in…

Machine Learning · Computer Science 2026-05-22 Amrut Nadgir , Vijay Balasubramanian , Pratik Chaudhari

Optimization problems are ubiquitous in our societies and are present in almost every segment of the economy. Most of these optimization problems are NP-hard and computationally demanding, often requiring approximate solutions for…

Optimization and Control · Mathematics 2021-06-23 James Kotary , Ferdinando Fioretto , Pascal Van Hentenryck

Biological and artificial information processing systems form representations of the world that they can use to categorize, reason, plan, navigate, and make decisions. How can we measure the similarity between the representations formed by…

Prototype learning, a popular machine learning method designed for inherently interpretable decisions, leverages similarities to learned prototypes for classifying new data. While it is mainly applied in computer vision, in this work, we…

Computation and Language · Computer Science 2023-12-14 Claudio Fanconi , Moritz Vandenhirtz , Severin Husmann , Julia E. Vogt

Reasoning is a distinctive human capacity, enabling us to address complex problems by breaking them down into a series of manageable cognitive steps. Yet, complex logical reasoning is still cumbersome for language models. Based on the dual…

Computation and Language · Computer Science 2023-11-14 Junbing Yan , Chengyu Wang , Taolin Zhang , Xiaofeng He , Jun Huang , Wei Zhang

The complexity class NP of decision problems that can be solved nondeterministically in polynomial time is of great theoretical and practical importance where the notion of polynomial-time reductions between NP-problems is a key concept for…

Computational Complexity · Computer Science 2022-12-23 Hans-Jörg Kreowski , Sabine Kuske , Aaron Lye , Aljoscha Windhorst
‹ Prev 1 8 9 10 Next ›