REVIEW 2 cited by
Perplexed: Understanding When Large Language Models are Confused
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Large Language Models (LLMs) have become dominant in the Natural Language Processing (NLP) field causing a huge surge in progress in a short amount of time. However, their limitations are still a mystery and have primarily been explored through tailored datasets to analyze a specific human-level skill such as negation, name resolution, etc. In this paper, we introduce perplexed, a library for exploring where a particular language model is perplexed. To show the flexibility and types of insights that can be gained by perplexed, we conducted a case study focused on LLMs for code generation using an additional tool we built to help with the analysis of code models called codetokenizer. Specifically, we explore success and failure cases at the token level of code LLMs under different scenarios pertaining to the type of coding structure the model is predicting, e.g., a variable name or operator, and how predicting of internal verses external method invocations impact performance. From this analysis, we found that our studied code LLMs had their worst performance on coding structures where the code was not syntactically correct. Additionally, we found the models to generally perform worse at predicting internal method invocations than external ones. We have open sourced both of these tools to allow the research community to better understand LLMs in general and LLMs for code generation.
Forward citations
Cited by 2 Pith papers
-
Rethinking Code Complexity Through the Lens of Large Language Models
LM-CC, a code complexity metric built from an LLM's token entropy and a semantic compositional hierarchy, correlates with LLM task performance (r ≈ −0.92…−0.97 after length control) where classical metrics mostly fail.
-
DPO-Shift: Shifting the Distribution of Direct Preference Optimization
DPO-Shift multiplies the rejected-response term in the DPO loss by a factor f(λ) below 1, shifting chosen-response probabilities upward at the expense of some reward margin.
Discussion (0). Continue with ORCID to comment.