{"total":28,"rows":[{"id":"2402.09963","title":"Why are Sensitive Functions Hard for Transformers?","created":"2024-02-15","cited_by_count":74,"area":null},{"id":"2209.07661","title":"On the Relation between Sensitivity and Accuracy in In-context Learning","created":"2022-09-16","cited_by_count":72,"area":null},{"id":"2211.12316","title":"Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions","created":"2022-11-22","cited_by_count":70,"area":null},{"id":"2501.17047","title":"How Linguistics Learned to Stop Worrying and Love the Language Models","created":"2025-01-28","cited_by_count":51,"area":null},{"id":"2403.02241","title":"Neural Redshift: Random Networks are not Random Functions","created":"2024-03-04","cited_by_count":43,"area":null},{"id":"2311.07230","title":"How are Prompts Different in Terms of Sensitivity?","created":"2023-11-13","cited_by_count":35,"area":null},{"id":"2112.09054","title":"Pushing the Limits of Rule Reasoning in Transformers through Natural Language Satisfiability","created":"2021-12-16","cited_by_count":18,"area":null},{"id":"2503.10065","title":"Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wild","created":"2025-03-13","cited_by_count":13,"area":null},{"id":"2410.13779","title":"The Mystery of the Pathological Path-star Task for Language Models","created":"2024-10-17","cited_by_count":8,"area":null},{"id":"2304.07687","title":"MLRegTest: A Benchmark for the Machine Learning of Regular Languages","created":"2023-04-16","cited_by_count":7,"area":null},{"id":"2211.09113","title":"On Measuring the Intrinsic Few-Shot Hardness of Datasets","created":"2022-11-16","cited_by_count":4,"area":null},{"id":"2410.12774","title":"Identifying Task Groupings for Multi-Task Learning Using Pointwise V-Usable Information","created":"2024-10-16","cited_by_count":4,"area":null},{"id":"2307.10442","title":"Thrust: Adaptively Propels Large Language Models with External Knowledge","created":"2023-07-19","cited_by_count":3,"area":null},{"id":"2503.10542","title":"Language Models, Graph Searching, and Supervision Adulteration: When More Supervision is Less and How to Make More More","created":"2025-03-13","cited_by_count":3,"area":null},{"id":"2607.17624","title":"Can Transformers Really Do It All? On the Compatibility of Inductive Biases Across Tasks","created":"2026-07-20","cited_by_count":2,"area":null},{"id":"2305.09178","title":"Empirical Analysis of the Inductive Bias of Recurrent Neural Networks by Discrete Fourier Transform of Output Sequences","created":"2023-05-16","cited_by_count":0,"area":null},{"id":"2310.12300","title":"Measuring Pointwise $\\mathcal{V}$-Usable Information In-Context-ly","created":"2023-10-18","cited_by_count":0,"area":null},{"id":"2404.10200","title":"TEL'M: Test and Evaluation of Language Models","created":"2024-04-16","cited_by_count":0,"area":null},{"id":"2407.12512","title":"$\\textit{GeoHard}$: Towards Measuring Class-wise Hardness through Modelling Class Semantics","created":"2024-07-17","cited_by_count":0,"area":null},{"id":"2502.07101","title":"SMAB: MAB based word Sensitivity Estimation Framework and its Applications in Adversarial Text Generation","created":"2025-02-10","cited_by_count":0,"area":null},{"id":"2512.09394","title":"Language models as tools for investigating the distinction between possible and impossible natural languages","created":"2025-12-10","cited_by_count":0,"area":null},{"id":"2512.12447","title":"Large language models have learned to use language","created":"2025-12-13","cited_by_count":0,"area":null},{"id":"2512.13441","title":"Large language models are not about natural language","created":"2025-12-15","cited_by_count":0,"area":null},{"id":"2512.14506","title":"Linguists should learn to love speech-based deep learning models","created":"2025-12-16","cited_by_count":0,"area":null},{"id":"2601.10421","title":"Are Language Models Models?","created":"2026-01-15","cited_by_count":0,"area":null},{"id":"2604.09466","title":"Across the Levels of Analysis: Explaining Predictive Processing in Humans Requires More Than Machine-Estimated Probabilities","created":"2026-04-10","cited_by_count":0,"area":null},{"id":"2604.09501","title":"You Can't Fight in Here! This is BBS!","created":"2026-04-10","cited_by_count":0,"area":null},{"id":"2605.10061","title":"Not-So-Strange Love: Language Models and Generative Linguistic Theories are More Compatible than They Appear","created":"2026-05-11","cited_by_count":0,"area":null}],"next_cursor":null}