Artificial IntelligencearXiv — cs.LGMon, Jun 8, 2026, 4:00 AMNeutral

Inferring the Size of Large Language Models From Popular Text Memorization

A new study proposes a method to infer the size of large language models (LLMs) based on their text memorization capabilities, addressing the common issue of developers withholding parameter counts. This approach utilizes the accuracy of next-word predictions from widely circulated texts to estimate a model's memorization limits, which correlate with its total parameter count.

WPN Brief

  • What Happened

    A new study proposes a method to infer the size of large language models (LLMs) based on their text memorization capabilities, addressing the common issue of developers withholding parameter counts. This approach utilizes the accuracy of next-word predictions from widely circulated texts to estimate a model's memorization limits, which correlate with its total parameter count.

  • Why It Matters

    Understanding the size of LLMs is crucial for interpreting their capabilities and associated costs, especially as these models become integral to various applications in artificial intelligence. By providing a means to estimate model size, this research could enhance transparency and inform future developments in LLM technology.

  • The Bigger Picture

    The study highlights ongoing discussions in the AI community regarding model evaluation, personalization, and the balance between exploration and exploitation in decision-making tasks. As LLMs evolve, their ability to accurately predict and generate text remains a focal point, influencing their application across diverse fields, including education, communication, and data analysis.

Ask WPN AI

Related Reports

More coverage on this story

10 reports across the wire

arXiv — cs.CL
Jun 5

On the Persistent Effects of Lexicality in Large Language Models

A recent study published on arXiv investigates the persistent effects of lexicality in large language models (LLMs), revealing that lexical overlap significantly influences the structure of representations extracted from these models, often overshadowing semantic content. The research employs adversarial semantic stress tests to quantify this influence across various architectures and training regimes.

Artificial Intelligenceneutral
arXiv — cs.CL
Jun 8

Are Large Language Models Suitable for Graph Computation? Progress and Prospects

Recent research has explored the suitability of large language models (LLMs) for graph computation, focusing on their ability to reason over structured relationships and perform algorithmic operations. The study identifies two paradigms: LLMs as executors, which solve graph tasks directly, and LLMs as planners, which formulate problems and decompose reasoning steps. This comprehensive review aims to clarify the role of LLMs in graph-solving pipelines.

Artificial Intelligenceneutral
arXiv — cs.CL
Jun 8

Finding the Minimal Parameter Budget for Implicit Reasoning: A Data Complexity Driven Scaling Law for Language Models

A recent study published on arXiv investigates the minimal parameter budget necessary for language models (LMs) to perform implicit reasoning, which involves inferring new facts from existing knowledge without explicit supervision. The research identifies a scaling law that connects the optimal parameter budget to a measure of graph search entropy, demonstrating that appropriately sized LMs can effectively reason over specific information amounts.

Artificial Intelligenceneutral
arXiv — cs.CL
Jun 12

How reliable are LLMs when it comes to playing dice?

A recent study investigated the probabilistic reasoning capabilities of large language models (LLMs) through a controlled benchmarking study on discrete probability problems. The research evaluated eight state-of-the-art models, revealing an average accuracy of 0.96 on standard problems but only 0.59 on counterintuitive ones, indicating significant limitations in their reasoning abilities.

Artificial Intelligenceneutral
arXiv — cs.CL
Jun 9

Should You Use Your Large Language Model to Explore or Exploit?

A recent study evaluates the effectiveness of large language models (LLMs) in assisting decision-making agents with exploration-exploitation tradeoffs. The research highlights that while reasoning models show potential for exploitation tasks, they are often too costly or slow for practical use. Conversely, non-reasoning models can enhance performance on medium-difficulty tasks, although they still underperform compared to simple linear regression methods.

Artificial Intelligenceneutral
arXiv — cs.LG
Jun 8

Skip a Layer or Loop It? Learning Program-of-Layers in LLMs

Recent research has introduced a flexible program-of-layers (PoLar) approach for large language models (LLMs), allowing for dynamic execution of pretrained layers, which can be skipped or looped based on input requirements. This method aims to enhance inference efficiency and accuracy by customizing layer execution for various inputs.

Artificial Intelligencepositive
arXiv — cs.CL
Jun 8

Analysing Differences in Persuasive Language in LLM-Generated Text: Uncovering Stereotypical Gender Patterns

A recent study analyzed the differences in persuasive language generated by large language models (LLMs), focusing on how factors such as recipient gender, sender intent, and output language influence the effectiveness of persuasive communication. The research evaluated 13 LLMs across 16 languages, revealing significant gender differences in the generated persuasive language.

Artificial Intelligenceneutral
arXiv — cs.CL
Jul 7

UnpredictaBench: A Benchmark for Evaluating Distributional Randomness in LLMs

UnpredictaBench has been introduced as a benchmark aimed at evaluating the distributional randomness capabilities of large language models (LLMs). This evaluation is crucial as LLMs are increasingly utilized in simulations that require capturing the unpredictability of real-world systems, rather than converging on a single plausible answer. The benchmark includes 448 problems that assess the models' ability to sample from various target distributions.

Artificial Intelligenceneutral
arXiv — cs.LG
Jun 10

Data-Constrained Language Model Pretraining: Improved Regularization and Scaling Laws

A recent study published on arXiv explores data-constrained language model pretraining, focusing on improved regularization and scaling laws. The research highlights the challenges faced as training compute outpaces the availability of natural language data, leading to a regime where models are trained over finite datasets for multiple epochs. The study introduces masked-input regularization (MIR) to enhance autoregressive pretraining without altering the model architecture.

Artificial Intelligenceneutral
arXiv — cs.CL
Jun 8

Re-Centering Humans in LLM Personalization

A recent study published on arXiv investigates the personalization capabilities of large language models (LLMs) using human data, revealing significant limitations compared to synthetic data. The research involved analyzing 550 human conversations and 5,949 judgments on user attributes, highlighting challenges in extracting relevant information and generating personalized responses.

Artificial Intelligenceneutral

Apps

Useful picks

Explore all apps

Articles

Continue Reading

Ahead of AIArtificial Intelligence2 days ago

Controlling Reasoning Effort in LLMs

Recent advancements in large language models (LLMs) have focused on controlling reasoning effort, exploring how these models can learn to operate in low-, medium-, and high-effort reasoning modes. This development is crucial for enhancing the efficiency and effectiveness of LLMs in various applications.

arXiv — cs.LGArtificial Intelligence2 days ago

Gibbs randomness-compression proposition

A new proposition has been introduced that connects randomness and compression through Gibbs entropy, focusing on measurement vectors linked to compression processes. This approach utilizes the performance of learning tasks as a metric for assessing compression across multiple cycles, suggesting that lossy compression can be viewed as directed randomness that retains information within specific Gibbs entropy limits.

arXiv — cs.LGArtificial Intelligence2 days ago

Similarity as Reward Alignment: Robust and Versatile Preference-based Reinforcement Learning

A new framework called Similarity as Reward Alignment (SARA) has been introduced in preference-based reinforcement learning (PbRL), addressing the challenges of labeler errors and adapting to various feedback formats. SARA computes rewards based on the similarity of learned latent representations of preferred samples, demonstrating improved stability and performance in offline reinforcement learning benchmarks.

arXiv — cs.LGArtificial Intelligence2 days ago

Contrastive Conformal Sets

A recent study introduces Contrastive Conformal Sets, enhancing contrastive learning by constructing geometric sets in the semantic feature space, ensuring user-specified coverage of positive samples while maximizing the exclusion of negative samples. This method extends conformal prediction principles to improve the reliability of machine learning models.

arXiv — cs.LGArtificial Intelligence2 days ago

Data Driven Block Replacement Scheduling

A new study has introduced data-driven algorithms for managing independent identical machines under a block replacement policy, focusing on determining the optimal replacement interval based on operational data. The research formulates this challenge as a stochastic multi-armed bandit problem, proposing algorithms that achieve regret matching the Lai–Robbins lower bound.

arXiv — cs.LGArtificial Intelligence2 days ago

Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces

A recent study has introduced a framework for distributionally robust optimization (DRO) in continuous probability spaces, addressing the computational challenges associated with infinite-dimensional optimization problems. The research leverages Brenier's theorem to define the least favorable distribution as a pushforward of a transport map, leading to a minimax problem in Wasserstein space and proposing an iterative algorithmic framework with global convergence guarantees.

arXiv — cs.LGArtificial Intelligence2 days ago

To Grok Grokking: Provable Grokking in Ridge Regression

A recent study published on arXiv explores the phenomenon of grokking within the context of ridge regression, demonstrating that models can overfit training data initially, yet later achieve significant generalization. The research provides rigorous quantitative bounds on the delay of generalization, termed 'grokking time', and emphasizes the role of hyperparameter tuning in influencing this process.

arXiv — cs.LGArtificial Intelligence2 days ago

Generalized Neural Distributional Regression

The Generalized Neural Distributional Regression (GNDR) framework has been introduced, integrating deep neural networks with classical probability distributions to enhance statistical modeling. This framework employs a semi-parametric estimation procedure to address the non-identifiability of deep architectures, allowing for the extraction of analytical Fisher Information matrices and facilitating rigorous uncertainty quantification.