PowerBin Algorithm: Allocation & Spatial Binning

• PowerBin algorithm is a dual-framework addressing both load allocation with the 'power of d choices' and adaptive spatial binning using optimal transport methods.
• In the allocation paradigm, it analyzes load distribution, memory trade-offs, and performance bounds with applications in systematic load imbalance strategies.
• For spatial binning, it employs centroidal power diagrams to create convex, compact bins, enhancing scalability in astronomical and high-dimensional data processing.

The term PowerBin algorithm refers to two unrelated but independently influential schemes: (1) an allocation strategy for sequentially assigning balls to bins using the "power of two" (or more generally, $d$) random choices to optimize load balance or intentionally create unbalanced allocations (Redlich, 2013), and (2) an adaptive spatial binning algorithm for large, high-dimensional data sets, leveraging optimal transport and centroidal power diagrams to produce compact, convex, and capacity-constrained bins with scalable complexity (Cappellari, 8 Sep 2025). The following article addresses both the allocation and spatial binning paradigms under the PowerBin umbrella, clarifying algorithmic structures, theoretical results, and computational methodologies.

1. PowerBin Algorithm: Balls-and-Bins Allocation Paradigm

The PowerBin algorithm in the context of balls-and-bins allocation generalizes the "power of two choices" framework. Consider $n$ bins and $m$ balls, with $d \ge 2$ choices per allocation. At each step, $d$ bins are sampled i.i.d. uniformly from $\{1,\dots,n\}$. The ball is allocated to the maximally loaded bin among the sampled set (often referred to as GREEDY in the literature, in contrast to FAIR, which chooses the minimally loaded) (Redlich, 2013).

Pseudocode for Allocation

$d\geq 2$9

A variant places the ball in the least-loaded bin (FAIR), yielding dramatically different load distributions.

2. Analytical Properties and Load Distribution

For the PowerBin (GREEDY) allocation with $d\geq 2$, a key analytic tool is a system of deterministic ODEs tracking the expected fraction $Z_\ell(t)$ of bins at load $\ell$. The process is governed by a polynomial drift reflecting that heavy bins are increasingly likely to absorb more mass as $d$ increases.

Key Results

• Load Profile: For $n$0, $n$1, $n$2 constant, $n$3 with $n$4 solving

$n$5

with $n$6, $n$7 ($n$8).

• Maximum Load Bound: For $n$9, any $m$0,

$m$1

With high probability (w.h.p.), $m$2.

• Subset Load Bounds: The expected total load in the smallest $m$3 bins is bounded:

$m$4

For $m$5, nearly all bins remain empty or lightly loaded, with load mass concentrating into a shrinking minority of bins.

• Gap and Equality Properties: Bins, once separated by a large gap, virtually never exchange relative position; pairs of bins with exactly equal load become exponentially rare outside a vanishing small set.

3. Balanced Allocation, Memory Constraints, and the Two-Choice Scheme

The "balanced allocation" version of PowerBin assigns balls to the least loaded bin among two random choices and is optimal for maximal load under sufficient memory.

Memory-Tradeoff Results (0901.1155)

• With no memory ($m$6 or $m$7): Maximum load is

$m$8

• With $m$9 bits per bin ($d \ge 2$0 total memory):

$d \ge 2$1

• With advice string of $d \ge 2$2 bits:

$d \ge 2$3

matching lower and upper bounds in the communication complexity model.

Principal Theorems

Theorem	Statement
Lower Bound (1.1)	$d \ge 2$4 w.h.p. for $d \ge 2$5 bits
Upper Bound (1.2)	Existence of algorithm with $d \ge 2$6 bits, achieving $d \ge 2$7

This suggests that the memory–performance curve exhibits a sharp drop between $d \ge 2$8 and $d \ge 2$9, with further increases in memory yielding no asymptotic benefit beyond $d$0.

4. PowerBin Algorithm for Adaptive Data Binning

A separate PowerBin algorithm, introduced for astronomical data analysis, addresses the partitioning of spatial pixel data into bins to guarantee near-uniform aggregate properties (e.g., S/N) while providing convex, compact regions (Cappellari, 8 Sep 2025).

Optimal Transport and Centroidal Power Diagrams

Given pixels $d$1 with measure $d$2, the goal is to partition into $d$3 bins $d$4 each with capacity $d$5, minimizing total quadratic transport cost:

$d$6

subject to $d$7.

• The optimal solution is a power diagram determined by generators $d$8 and weights $d$9:

$\{1,\dots,n\}$0

A Centroidal Power Diagram (CPD) is attained when each generator coincides with the centroid of its cell and mass matches $\{1,\dots,n\}$1.

Algorithmic Stages

1. Bin Accretion (Initialization, $\{1,\dots,n\}$2):
   • Compute Delaunay triangulation for adjacency.
   • Greedily grow bins from high-density seeds, maintaining compactness and roundness.
2. Regularization (CPD Optimization, $\{1,\dots,n\}$3):
   • Update bin weights via a "soap bubble" multiplicative heuristic:

   $\{1,\dots,n\}$4

   where $\{1,\dots,n\}$5 is area, $\{1,\dots,n\}$6 the measured capacity. - Shift generators toward centroids. - Iteratively recompute power diagram until convergence.

3. Diagram Evaluation leverages the classical lifting method and $\{1,\dots,n\}$7-d tree for efficient nearest-neighbor search (Cappellari, 8 Sep 2025).

Pseudocode Summary

$Z_\ell(t)$0

5. Performance, Complexity, and Applications

• Complexity: Both the bin-accretion and regularization phases scale as $\{1,\dots,n\}$8. Voronoi-based methods scale as $\{1,\dots,n\}$9, creating computational bottlenecks for large datasets; PowerBin offers roughly $d\geq 2$0 speed-up for million-pixel inputs (Cappellari, 8 Sep 2025).
• Bin Quality: Yields convex, compact bins with target aggregate properties, even under non-additive, correlated-noise settings.
• Applications: Astronomical integral-field spectroscopy, optimal painter stippling, deterministic sampling, and other domains requiring adaptive partitioning with measure constraints.

Performance metrics in practical data (e.g., mock Sérsic profiles, galaxy groups, real IFU mosaics) exhibit rms S/N scatter $d\geq 2$15–7%, robustness to noise correlations, and superior scalability compared to prior art.

6. Connections, Variants, and Regimes

The PowerBin moniker thus encapsulates two paradigms:

Paradigm	Key Feature	Scaling	Maximum Load / Bin Quality	Relevant Papers
Allocative	Balls to (un)balanced bins	$d\geq 2$2	$d\geq 2$3	(Redlich, 2013, 0901.1155)
Spatial Binning	Convex partitions, CPD	$d\geq 2$4	$d\geq 2$5 uniform S/N, compactness	(Cappellari, 8 Sep 2025)

In allocation, the key regime transition is dictated by available memory: from $d\geq 2$6, through subpolylogarithmic, to $d\geq 2$7, which sharply reduces $d\geq 2$8. In optimal-transport spatial binning, PowerBin achieves CPD solutions algorithmically and robustly with physical heuristics that succeed where formal solvers may fail, especially with non-additive measures.

A plausible implication is that for both paradigms, the PowerBin philosophy enables distinctively efficient and theoretically tractable solutions for problems characterized by random, budgeted choices—either aiming for deliberate imbalance (allocation) or adaptive homogeneity under convexity (binning).