3 papers
cs.LG2025
Mechanistic Interpretability for Neural TSP Solvers
Reuben Narad, Leonard Boussioux, Michael Wagner
Neural networks have advanced combinatorial optimization, with Transformer-based solvers achieving near-optimal solutions on the Traveling Salesman Problem (TSP) in milliseconds. H…
cs.CL2025
Which LLMs Get the Joke? Probing Non-STEM Reasoning Abilities with HumorBench
Reuben Narad, Siddharth Suresh, Jiayi Chen +5
We present HumorBench, a benchmark designed to evaluate large language models' (LLMs) ability to reason about and explain sophisticated humor in cartoon captions. As reasoning mode…
cs.CL2025
Bridging the Creativity Understanding Gap: Small-Scale Human Alignment Enables Expert-Level Humor Ranking in LLMs
Kuan Lok Zhou, Jiayi Chen, Siddharth Suresh +6
Large Language Models (LLMs) have shown significant limitations in understanding creative content, as demonstrated by Hessel et al. (2023)'s influential work on the New Yorker Cart…