Papers › On O(n) Algorithms for Projection onto the Top-k-sum Sublevel Set
On O(n) Algorithms for Projection onto the Top-k-sum Sublevel Set
Jake Roth, Ying Cui
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The \emph{top-k-sum} operator computes the sum of the largest k components of a given vector. The Euclidean projection onto the top-k-sum sublevel set serves as a crucial subroutine in iterative methods to solve composite superquantile optimization problems. In this paper, we introduce a solver that implements two finite-termination algorithms to compute this projection. Both algorithms have O(n) complexity of floating point operations when applied to a sorted n-dimensional input vector, where the absorbed constant is \emph{independent of k}. This stands in contrast to an existing grid-search-inspired method that has O(k(n-k)) complexity, a partition-based method with O(n+DlogD) complexity, where D≤n is the number of distinct elements in the input vector, and a semismooth Newon method with a finite termination property but unspecified floating point complexity. The improvement of our methods over the first method is significant when k is linearly dependent on n, which is frequently encountered in practical superquantile optimization applications. In instances where the input vector is unsorted, an additional cost is incurred to (partially) sort the vector, whereas a full sort of the input vector seems unavoidable for the other two methods. To reduce this cost, we further derive a rigorous procedure that leverages approximate sorting to compute the projection, which is particularly useful when solving a sequence of similar projection problems. Numerical results show that our methods solve problems of scale n=10⁷ and k=10⁴ within 0.05 seconds, whereas the most competitive alternative, the semismooth Newton-based method, takes about 1 second. The existing grid-search method and Gurobi's QP solver can take from minutes to hours.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections