Skip to main content
Search

# Tabu Search

2 related articles

Subscribe to updates
  1. Swapping hill-climbing for tabu search in Bayesian network learning: PCTABU wins on sparse networks and ties on dense ones

    Hybrid Bayesian network learning separates skeleton construction from score-based search, and both the search strategy (hill-climbing or tabu) and the scoring function (BDe, LL or BIC) change the learned structure. PCTABU pairs the PC skeleton with tabu search; against PCHC on eight real benchmark networks it did better on the sparser Alarm, Child and Hailfinder, tied on the other five, and LL scored worst for both algorithms while BDe and BIC performed similarly.

  2. Hugging Face

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

    This work reformulates block removal in large language models as a constrained binary optimization equivalent to finding low-energy states of an Ising glass, using a once-computed approximate-Hessian energy as a cheap proxy for downstream quality so that vast numbers of candidate configurations can be ranked without benchmarking any of them; on Llama-3.3-70B-Instruct at 50% compression (40 of 80 blocks removed) without retraining, MMLU stays near 77 while the strongest baseline, block influence, falls to about 54, with transfer also shown on Llama-3.1-8B-Instruct, Qwen3-14B, and the hybrid NVIDIA-Nemotron-3-Nano-30B-A3B-FP8.

You’re all caught up