Papers › PolyMaX: General Dense Prediction with Mask Transformer

PolyMaX: General Dense Prediction with Mask Transformer

9 Nov 2023arXiv:2311.05770archive 2025-07-28

Xuan Yang, Liangzhe Yuan, Kimberly Wilber, Astuti Sharma, Xiuye Gu, Siyuan Qiao, Stephanie Debats, Huisheng Wang, Hartwig Adam, Mikhail Sirotenko, Liang-Chieh Chen

Dense prediction tasks, such as semantic segmentation, depth estimation, and surface normal prediction, can be easily formulated as per-pixel classification (discrete outputs) or regression (continuous outputs). This per-pixel prediction paradigm has remained popular due to the prevalence of fully convolutional networks. However, on the recent frontier of segmentation task, the community has been witnessing a shift of paradigm from per-pixel prediction to cluster-prediction with the emergence of transformer architectures, particularly the mask transformers, which directly predicts a label for a mask instead of a pixel. Despite this shift, methods based on the per-pixel prediction paradigm still dominate the benchmarks on the other dense prediction tasks that require continuous outputs, such as depth estimation and surface normal prediction. Motivated by the success of DORN and AdaBins in depth estimation, achieved by discretizing the continuous output space, we propose to generalize the cluster-prediction based method to general dense prediction tasks. This allows us to unify dense prediction tasks with the mask transformer framework. Remarkably, the resulting model PolyMaX demonstrates state-of-the-art performance on three benchmarks of NYUD-v2 dataset. We hope our simple yet effective design can inspire more research on exploiting mask transformers for more dense prediction tasks. Code and model will be made available.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2311.05770")

Code

Syntology Ran 3 of 3 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 3 ran with no contract checked.

By repository: official repository: 3 samples from 1 repository, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

google-research/deeplab2 officialmentioned in papertfApache-2.0 report

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

3 samples harvested; 3 ran; 0 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

3ran

Licence: 0 of the 3 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from google-research/deeplab2. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

resolve_batch_size google-research/deeplab2/model/utils.py official repository ran Apache-2.0 (permissive) · 5e915628f1149a2f · report
scale_int_list google-research/deeplab2/model/utils.py official repository ran Apache-2.0 (permissive) · e0df865e93d2e0db · report
scale_mutable_sequence google-research/deeplab2/model/utils.py official repository ran Apache-2.0 (permissive) · 315f2fdd4f533108 · report

Tasks

Depth EstimationMonocular Depth EstimationPredictionSemantic SegmentationSurface Normal EstimationSurface Normals Estimation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Monocular Depth Estimation NYU-Depth V2 PolyMaX(ConvNeXt-L) Delta < 1.25 0.969 #20 of 85 Archive leaderboard report
Monocular Depth Estimation NYU-Depth V2 PolyMaX(ConvNeXt-L) Delta < 1.25^2 0.9958 #20 of 85 Archive leaderboard report
Monocular Depth Estimation NYU-Depth V2 PolyMaX(ConvNeXt-L) Delta < 1.25^3 0.999 #20 of 85 Archive leaderboard report
Monocular Depth Estimation NYU-Depth V2 PolyMaX(ConvNeXt-L) RMSE 0.25 #20 of 85 Archive leaderboard report
Monocular Depth Estimation NYU-Depth V2 PolyMaX(ConvNeXt-L) absolute relative error 0.067 #20 of 85 Archive leaderboard report
Monocular Depth Estimation NYU-Depth V2 PolyMaX(ConvNeXt-L) log 10 0.029 #20 of 85 Archive leaderboard report
Semantic Segmentation NYU Depth v2 PolyMaX(ConvNeXt-L) Mean IoU 58.08% #12 of 121 Archive leaderboard report
Surface Normals Estimation NYU Depth v2 PolyMaX(ConvNeXt-L) % < 11.25 65.66 #2 of 6 Archive leaderboard report
Surface Normals Estimation NYU Depth v2 PolyMaX(ConvNeXt-L) % < 22.5 82.28 #2 of 6 Archive leaderboard report
Surface Normals Estimation NYU Depth v2 PolyMaX(ConvNeXt-L) % < 30 87.83 #2 of 6 Archive leaderboard report
Surface Normals Estimation NYU Depth v2 PolyMaX(ConvNeXt-L) Mean Angle Error 13.09 #2 of 6 Archive leaderboard report
Surface Normals Estimation NYU Depth v2 PolyMaX(ConvNeXt-L) RMSE 20.4 #2 of 6 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

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