arXiv:2606. 30333v1 Announce Type: cross Abstract: The generalized Ising problem captures a broad spectrum of hard combinatorial problems, including MAX-CUT, Number Partitioning (NPP), and Maximum Independent Set.
By Debraj Banerjee, Santanu Mahapatra, Kunal N. Chaudhury
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: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
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
arXiv:2608.30564v1 Announce Type: cross
Abstract: Mixed-precision quantization (MPQ) assigns a different bitwidth to each linear layer of a large language model (LLM) to minimize the quantization-ind...
By Deokjae Lee, Sihun Chu, Hyun Oh Song