Computing the Integral R2 Indicator by Perspective Mapping and Box Decomposition
2026-06-29 • Computational Geometry
Computational GeometryNeural and Evolutionary Computing
AI summaryⓘ
The authors study a mathematical tool called the continuous integral R2 indicator, which helps evaluate solutions in multi-objective optimization. They show a new connection between computing this indicator and calculating volumes of certain box-shaped regions, allowing them to reuse existing algorithms from hypervolume computations. Their approach improves understanding of the problem's complexity and provides efficient methods for calculating the indicator for different numbers of objectives. The work also explains why exact computation becomes very hard as the number of objectives increases.
continuous integral R2 indicatormulti-objective optimizationPareto-compliancehypervolumeanchored axis-aligned boxesweighted Tchebycheff envelopebox decompositioncomplexity theoryPareto frontalgebraic decision-tree model
Authors
Michael T. M. Emmerich
Abstract
The continuous integral R2 indicator is a Pareto-compliant refinement of the classical finite-weight-vector R2 indicator, used in performance assessment, bounded archiving for a-posteriori multi-objective optimization, and skyline selection in databases. This work introduces a bidirectional perspective mapping between continuous integral R2 computation and integration over unions of anchored axis-aligned boxes. After translating the ideal point of a minimization problem to the origin, approximation points become strictly positive loss vectors, and the subgraph of the lower weighted Tchebycheff envelope over the weight simplex maps to the complement of an anchored-box union in reciprocal objective space. The Jacobian gives an absolute R2 formula as a weighted complement volume with density $(x_1+\cdots+x_N)^{-(N+1)}$, while differences of R2 values become finite weighted hypervolume differences. Hence, hypervolume algorithms that emit box decompositions can be reused by replacing ordinary box volumes with closed-form weighted box integrals. For $N$ objectives, this gives an output-sensitive overhead $O(2^N M)$ for an $M$-box decomposition, or $O(M)$ for fixed $N$. Using existing box-decomposition approaches, the integral R2 can be computed in $O(n \log n)$ for $N=2,3$, in $O(n^2)$ for $N=4$, and in $O\left(n^{\lfloor (N-1)/2\rfloor+1}\right)$ for $N\geq4$, with $n$ denoting the size of the approximation set. On the lower-bound side, exact value computation has an $Ω(n\log n)$ lower bound in the algebraic decision-tree model already in two objectives, this bound lifts to every fixed $N\geq2$, and exact computation is $\#P$-hard when $N$ is part of the input. Together, the proposed perspective mapping provides a powerful tool for transferring algorithmic and structural results between anchored-box union and hypervolume theory and integral R2 computation.