The authors reformulate block removal from large language models as a constrained binary optimization (CBO) problem, equivalent to finding low-energy states of an Ising glass, a disordered spin system with all-to-all interactions and a fixed number of "up" spins. This approach allows for efficient pruning of models by computing the energy of candidate configurations and using classical and quantum-inspired solvers to find good solutions. AI summary
Firehose
Filtered to tagged “Large Language Models” · clear filters
Browse: People · Companies · Papers · Podcasts · Hacker News · Deep dives
Browse by tag
This paper explores how large language models can become overly influenced by their own judgments, leading to a loss of diversity in scientific evaluations. Practitioners should care about this issue because it can impact the quality of reviews and recommendations in AI-assisted scientific evaluation.
TypeSafe's Jev, a "System One Model" trained with RLCD, claims to be 20-200x faster and 40-400x cheaper than small frontier LLMs, offering parallel sampling, "no hallucination", and calibration, and is suited for structured classifiers/judges/routing policies in production systems. AI summary
This paper investigates how the way large language models generate multiple candidate responses affects their performance and energy consumption. Practitioners might care because optimizing test-time scaling can lead to significant improvements in model accuracy and efficiency.
This paper proposes a new method for aligning large language models with human preferences, called Comparison-based Preference Optimization (ComPO), which is more efficient than existing methods and can mitigate a problem called likelihood displacement. Practitioners might care about this paper because it offers a new approach to aligning LLMs with human preferences, which is essential for developing more reliable and trustworthy AI models.