Hugging Face Blog

Pruning LLMs Like a Physicist: Block Removal as an Ising Optimization Problem

arXiv AI
Jun 18

LLM Compression by Block Removal with Constrained Binary Optimization

arXiv:2602. 00161v2 Announce Type: replace-cross Abstract: In this paper, we formulate the compression of large language models (LLMs) by optimally deleting transformer blocks (``block removal'') as a constrained binary optimization (CBO) problem that can be mapped to a physical system (Ising glass), whose energies are a strong proxy for downstream model performance.

By David Jansen, Roman Rausch, Ali Hashemi, David Montero, Rom\'an Or\'us
arXiv Machine Learning
Jun 24

A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm

arXiv:2601. 06351v2 Announce Type: replace Abstract: Anticlustering is an NP-hard combinatorial optimization problem that consists of partitioning a set of objects into equal-sized groups called anticlusters such that the objects in the same anticluster are as dissimilar as possible and thereby representative of the entire set of objects.

By Philipp Baumann, Olivier Goldschmidt, Dorit S. Hochbaum, Jason Yang
Towards Data Science
Jul 31

How Benders Decomposition Works Part I: Optimality Cuts

A friendly introduction to one of the most powerfull optimization techniques using the uncapacitated facility location problem The post How Benders Decomposition Works Part I: Optimality Cuts appeared first on Towards Data Science .

By Luis Fernando Pérez Armas