Substantial effort has recently focused on developing methods capable of solving large linear systems that arise from discretizing partial differential equations, especially on unstructured grids. Algebraic multigrid (AMG) is of particular interest because of its promise of optimal performance without the need for explicit knowledge of the problem's origin. We introduce an adaptive AMG algorithm and show, with theory and numerical experiments, good convergence on a broader class of problems than the original AMG algorithm.