- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper introduces a solver for partial optimal transport on the circle when the ground cost is a convex function of the radial cost. The authors show that the problem can be solved with an adaptation of PAWC algorithm that provides local augmentation . They also show that the problem can be solved and return all optimal solutions for all cardinality in O(n log n+ k^2) where k is the largest cardinality of the support of the optimal plan. Numerical experiments illustrate the proposed algorithm on a toy example, partial alignment and foreground palette retrieval. The authors also propose extension of the method for slices partial OT on the sphere and linear version of the problem.
Critical strengths
- Extension of the PAWC, algorithm to solve partial OT on the circle for more general costs is interesting and makes nice connections between the recent work of Kolouri 2026 and of Angrick 2026.
Critical weaknesses
-
The paper is not very well written and the presentation is not always clear or even self content for instance many subtleties of PAWC are not explained. The numerical experiments are not detailed enough in the main paper and require to read the supplementary material to understand the results. This means that the main paper is not self contained and the reader has to read the supplementary material to understand the results, which is a way to cheat with the page limit.
-
The paper is an extension of PAWC (Kolouri 2026) that is itself a non published extension of the PAWL (Chapel 2025). It seems that it merges the proof tools from (Kolouri 2026) and the extension of OT on the line to more general costs of (Angrick 2026). In this sens it makes an interesting connexion but it is quite incremental and the novelty is limited.
-
The numerical experiments are not very convincing, they do not really show why more general costs are necessary and are done on simulated partial OT problems or on problems that are quite far from real applications. Most of them are also not detailed and provided only in the supplementary material.
-
Spherical Sliced COPT and Linear COPT are introduced, discussed and their numerical experiments are hinted at all in one paragraph in the main paper and are not detailed enough to be convincing. This makes the paper feel like a collection of ideas/flag planting rather than a coherent story.
Questions for authors
-
What was the motivation for studying more general costs? Are there any real applications where this is necessary? It is more and more important that research focus on understanding and intuition to guide applications and this is missing in the submission. This is also related to my comment above about experiments where no understanding or intuition is given about when this would be useful.
-
What is the novelty in the proof that goes beyond merging (Kolouri 2026) and (Angrick 2026)?
-
Minor comment. SInce the paper is strongly related to partial OT on the line (and circle) some references might be interesting to discuss. In particular [A] below that discuss squared distance on the line.
[A] Bonneel, N., & Coeurjolly, D. (2019). Spot: sliced partial optimal transport. ACM Transactions on Graphics (TOG), 38(4), 1-13.
5 comments
Response to JaJb (part 2)
What does the proof add beyond PAWC and Angrick et al.?
We appreciate your careful comparison with PAWL/PAWC [4,8] and Angrick et al. [7], whose ideas are important foundations of our method. Building on those works, we establish globally optimal profile growth and common-cut recovery for convex costs and ties. To apply Angrick et al.'s line argument, we would first need a cut valid for the nonlinear objective. PAWC's intermediate common-cut statement for arbitrary nested balanced sets cannot establish that cut for squared cost (Appendix C.1). Appendix C.2 constructs distinct balanced supports with a unique optimum for which every -optimal cut has full-cardinality quadratic line cost approaching times the circular optimum, where is the number of atoms per measure. Thus reusing a -optimal cut has no cardinality-independent constant-factor guarantee.
We therefore adapt the endpoint argument directly to circular arcs and prove locality before choosing the cut. If a minimum-net-cost augmentation from a refined optimum crossed a previously inactive path endpoint, we could remove a non-improving equal-cardinality exchange while shortening the refined arc. We use rank length to keep this shortening strict under coincident support and flat costs. One optimal augmentation must then stay in a cell, where Monge sorting attains its cost, and PAWC's free-gap induction can recover a common ordinary or virtual cut for the history. For tied inputs, virtual cuts recover optima missed by ordinary cuts; Angrick et al.'s interval tools accelerate integer powers.
The submitted Appendices A.3--A.4 already contain the locality and common-cut proofs. To check their consequences in the implementation, we compared every profile value, recovered plan and common-cut lift with an integer-cost oracle on 170,900 profiles, including cases requiring virtual cuts (Appendix B).
The spherical and linear extensions need fuller development and evaluation.
Thank you for asking us to explain more clearly why these sections belong in the paper. The circular solver is our main contribution, and the extensions develop two uses of its costs and plans. Great-circle methods compare spherical data through circular projections, while reference methods reuse transport plans across many comparisons, as in LCOT, LOPT and LSSOT [2,3,9]. We build on these established constructions to study how they handle incomplete observations. Presenting this development with the solver allows the paper to follow circular OPT from its computation to its use as a distance and a reusable representation.
Their brief treatment in the submitted main text obscured the work supporting them. These are not proposals whose proofs or evaluation are deferred to future papers. Partial transport raises a substantive question in each construction, because the mass omitted from a plan still affects the comparison or representation.
For spherical data, we prove that the rooted penalized integral for power costs is a metric on finite positive measures, with finite-slice estimates forming pseudometrics. The retrieval experiments evaluate this distance, while the fitting study examines the nonlinear circular plans during optimization. That study also answers the question about the broader cost class. At fixed transported mass, quadratic fitting reduces mean held-out error by 18.9% over 20--40% uniform contamination, and the four-arm comparison tests the contribution of the transport plan under either update rule (Table 1).
For reference representations, we must determine what to do with target observations omitted by the partial plan. Retaining their locations allows reconstruction of each unit-atom circular target and supports a reference metric that agrees with the OPT metric against the reference. Compressing them to their total mass reduces computation but loses metricity. We evaluate this choice on 320 ModelNet measures with 48 atoms and eight slices, including encoding and all pairwise comparisons after shared projection, using assignment for direct and residual transport costs.
| Representation | All-pairs time (s) | Speedup | Spearman |
|---|---|---|---|
| Pairwise COPT | 13.693 | 1.000 | |
| Full reference representation | 8.894 | 0.979 | |
| Compressed representation | 0.939 | 0.967 |
The retrieval study then tests the practical consequence of retaining those locations. With 24 slices, the full representation achieves 27.5% acc, compared with 28.4% for direct COPT and 19.4% after compression. The reference representation can be constructed on each circular projection, so the two extensions also combine in comparisons of spherical data.
Response to JaJb (part 3)
(continued from Part 2 - The spherical and linear extensions need fuller development and evaluation)
We therefore include them as developed consequences of the circular OPT formulation, with their own guarantees and measured benefits, while keeping the circular optimality and complexity results as the paper's main contribution. Sec 6 now presents enough of that development in the main text to assess both the connection and the results.
Please discuss reference [A] on squared-distance transport on the line.
Thank you for adding the reference. SPOT [10] develops a fast quadratic-cost solver on the line and uses it in sliced transport for color transfer and registration. It transports every point of the smaller set to a subset of the larger set, fixing the mass at the smaller cardinality. In the penalized OPT formulation [11], either measure may contain observations with no counterpart; COPT computes the corresponding circular optima at every cardinality. The additional ordering problem is why we establish circular locality and common-cut recovery. Related Work now describes SPOT's line solver and its use through slicing.
Once again we thank the reviewer for the insightful critique. We would be happy to discuss further to address any other concerns you may have, or clarify existing comments as well.
Best regards, authors
[1] Rabin, Delon and Gousseau, Transportation Distances on the Circle, JMIV 2011, Sections 3.1--3.3.
[2] Diaz Martin et al., LCOT, ICLR 2024, Definition 3.1 and Remark 3.3.
[3] Bai et al., Linear Optimal Partial Transport Embedding (LOPT), ICML 2023.
[4] Kolouri, PAWC, arXiv 2026, Section 6.3 and Appendix L.3.
[5] Coeurjolly and Le Bihan, Geodesic Normal Distribution on the Circle, Metrika 2012. The likelihood interpretation above is conditional, not an assumption about USGS.
[6] Evers et al., The LOCATA Challenge, IEEE/ACM TASLP 2020, Section VII.B.3 and Table V.
[7] Angrick et al., Computing All Optimal Partial p-Wasserstein Matchings on the Line, arXiv 2026.
[8] Chapel and Tavenard, PAWL, ICLR 2025.
[9] Liu et al., Linear Spherical Sliced Optimal Transport (LSSOT), ICLR 2025.
[10] Bonneel and Coeurjolly, SPOT, ACM TOG 2019.
[11] Bai et al., Sliced Optimal Partial Transport (SOPT), CVPR 2023.
Response to JaJb (part 1)
We appreciate your close reading and insightful questions about the method's motivation and practical use.
The main text should explain the method and experiments without relying on the appendix.
We agree that the submitted main text needed a fuller explanation of why the cell updates suffice and how the experiments were evaluated, and we now explain the update by asking what must change when one more pair is transported. In Section 4's worked example, keeping the first pair and appending the second increases the cost by 1/4, while allowing the partners within the cell to change costs only 7/100. This calculation motivates the search over cell updates; the locality lemma then proves that one of those updates reaches the next global optimum. We complete the explanation by deriving the common cut at which sorting recovers a plan for any recorded cardinality.
We also expanded Section 5 so that the reported scores can be read in terms of their tasks. For MPEG-7, we measure normalized symmetric RMS contour error after rotation recovery and class Recall@40 for retrieval. For Flowers, we retrieve an image's clean foreground palette from a query containing real background pixels. The main text now includes the sampling, corruption and class-disjoint validation procedures for these studies, while the fixed-mass fitting comparison below tests the cost choice beyond partial transport itself.
The motivation and practical need for costs beyond W1 are unclear.
We agree that a larger cost class needs an application-level motivation, and our aim is to preserve the chosen displacement loss when only part of each measure is transported. Rabin, Delon and Gousseau develop this motivation for circular OT by studying powers and Huber costs under position and weight perturbations [1]. The choice can change which circular plan is preferred even when transported mass is fixed, so retuning λ cannot reproduce it, since the penalty λ(N−2k) is constant across plans of cardinality k.
For instance, preserving the quadratic reference geometry of LCOT and LOPT [2,3] requires squared-distance optima in a partial circular counterpart. Squared cost can also be chosen from a residual model, since minimizing it maximizes conditional association likelihood under independent circular geodesic-normal errors of common concentration, uniform clutter and a prescribed cardinality [5]. Nonlinear angular costs are also used in applied evaluation, as in LOCATA's source-tracking scores at OSPA orders 1 and 5 [6]. These precedents motivate a solver that accepts the chosen cost without restricting the application to W1.
We tested the practical benefit on the USGS task from the submission, using real catalogue observations with generated contamination following PAWC's design [4]. With 500 particles and 32 shared slices, both costs retain 500 of 625 targets, so neither can improve merely by discarding more mass. Using each cost for both transport and updates, quadratic fitting lowers mean held-out chordal energy by 18.9% over 20--40% uniform contamination after 8,000 updates. Holding each update rule fixed in turn, quadratic-optimal plans lower mean error over these levels by 22.2% under W1 updates and 24.3% under quadratic updates, improving all sixteen seeds at each level. This supports the benefit of the transport plans themselves. Quadratic plans with W1 updates have the lowest five-level mean, while ordinary W1 fitting is better on clean data and at 10% contamination (Table 1 and Appendix K.10, including paired intervals).
Equal update counts allow the more expensive cost more computation, so we also tested both costs with 180 seconds of warmed USGS fitting through COPT. Quadratic fitting still lowers mean error over 20--40% uniform contamination by 18.5%, improving all eight new seeds at each level despite completing about 9% fewer updates. Appendix K.10 reports every level, including the clean and 10% conditions favoring W1.
Because the preferred cost varies with the setting, we evaluated choosing it on validation data in a further USGS study. One Huber configuration selected across all five uniform-contamination levels lowers mean test energy over those levels by 14.6% against W1 with its own validation-selected rate, holding the quota fixed across costs, in sixteen further seeds.