Deterministic Mode Proposals: An Efficient Alternative to Generative Sampling for Ambiguous Segmentation

• URL: http://arxiv.org/abs/2603.20191v1
• Date: Fri, 20 Mar 2026 17:59:26 GMT
• Title: Deterministic Mode Proposals: An Efficient Alternative to Generative Sampling for Ambiguous Segmentation
• Abstract summary: We introduce a deterministic framework that efficiently produces a fixed-size set of proposal masks in a single forward pass.<n>Our approach significantly reduces inference time while achieving higher ground-truth coverage than existing generative models.<n>We demonstrate that our model can be trained without knowing the full distribution of outcomes, making it applicable to real-world datasets.
• Score: 3.5493798890908113
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many segmentation tasks, such as medical image segmentation or future state prediction, are inherently ambiguous, meaning that multiple predictions are equally correct. Current methods typically rely on generative models to capture this uncertainty. However, identifying the underlying modes of the distribution with these methods is computationally expensive, requiring large numbers of samples and post-hoc clustering. In this paper, we shift the focus from stochastic sampling to the direct generation of likely outcomes. We introduce mode proposal models, a deterministic framework that efficiently produces a fixed-size set of proposal masks in a single forward pass. To handle superfluous proposals, we adapt a confidence mechanism, traditionally used in object detection, to the high-dimensional space of segmentation masks. Our approach significantly reduces inference time while achieving higher ground-truth coverage than existing generative models. Furthermore, we demonstrate that our model can be trained without knowing the full distribution of outcomes, making it applicable to real-world datasets. Finally, we show that by decomposing the velocity field of a pre-trained flow model, we can efficiently estimate prior mode probabilities for our proposals.

Related papers

• TapSampling: Inference-Time Sampling with a Task-Progress-Understanding Verifier for Robotic Manipulation [61.35569005726248]
  Existing embodied control research demonstrates remarkable performance improvements by scaling training data and model size.<n>Non-deterministic generative models, such as diffusion and autoregressive models, have been widely adopted in the field of embodied control.<n>We propose textbfTapSampling, a plug-and-play framework for inference-time sampling.
  arXiv  Detail & Related papers  (2026-05-25T08:03:31Z)
• Enhanced Multi-model Online Conformal Prediction [25.495949162960624]
  Conformal prediction is a framework for uncertainty quantification that constructs prediction sets for previously unseen data.<n>The efficiency of these prediction sets, measured by their size, depends on the choice of the underlying learning model.<n>This work develops a novel multi-model online conformal prediction algorithm that reduces computational complexity and improves prediction efficiency.
  arXiv  Detail & Related papers  (2026-01-04T23:44:43Z)
• Aleatoric Uncertainty Medical Image Segmentation Estimation via Flow Matching [0.157286095422595]
  Quantifying aleatoric uncertainty in medical image segmentation is critical since it is a reflection of the natural variability observed among expert annotators.<n>Our proposed method leverages conditional flow matching, a simulation-free flow-based generative model that learns an exact density.
  arXiv  Detail & Related papers  (2025-07-30T06:45:32Z)
• Accelerated Diffusion Models via Speculative Sampling [89.43940130493233]
  Speculative sampling is a popular technique for accelerating inference in Large Language Models.<n>We extend speculative sampling to diffusion models, which generate samples via continuous, vector-valued Markov chains.<n>We propose various drafting strategies, including a simple and effective approach that does not require training a draft model.
  arXiv  Detail & Related papers  (2025-01-09T16:50:16Z)
• DistPred: A Distribution-Free Probabilistic Inference Method for Regression and Forecasting [14.390842560217743]
  We propose a novel approach called DistPred for regression and forecasting tasks.<n>We transform proper scoring rules that measure the discrepancy between the predicted distribution and the target distribution into a differentiable discrete form.<n>This allows the model to sample numerous samples in a single forward pass to estimate the potential distribution of the response variable.
  arXiv  Detail & Related papers  (2024-06-17T10:33:00Z)
• Rejection via Learning Density Ratios [50.91522897152437]
  Classification with rejection emerges as a learning paradigm which allows models to abstain from making predictions.<n>We propose a different distributional perspective, where we seek to find an idealized data distribution which maximizes a pretrained model's performance.<n>Our framework is tested empirically over clean and noisy datasets.
  arXiv  Detail & Related papers  (2024-05-29T01:32:17Z)
• Towards Better Certified Segmentation via Diffusion Models [62.21617614504225]
  segmentation models can be vulnerable to adversarial perturbations, which hinders their use in critical-decision systems like healthcare or autonomous driving. Recently, randomized smoothing has been proposed to certify segmentation predictions by adding Gaussian noise to the input to obtain theoretical guarantees. In this paper, we address the problem of certifying segmentation prediction using a combination of randomized smoothing and diffusion models.
  arXiv  Detail & Related papers  (2023-06-16T16:30:39Z)
• MaskDiff: Modeling Mask Distribution with Diffusion Probabilistic Model for Few-Shot Instance Segmentation [31.648523213206595]
  Few-shot instance segmentation extends the few-shot learning paradigm to the instance segmentation task. Conventional approaches have attempted to address the task via prototype learning, known as point estimation. We propose a novel approach, dubbed MaskDiff, which models the underlying conditional distribution of a binary mask.
  arXiv  Detail & Related papers  (2023-03-09T08:24:02Z)
• Sampling from Arbitrary Functions via PSD Models [55.41644538483948]
  We take a two-step approach by first modeling the probability distribution and then sampling from that model. We show that these models can approximate a large class of densities concisely using few evaluations, and present a simple algorithm to effectively sample from these models.
  arXiv  Detail & Related papers  (2021-10-20T12:25:22Z)
• Attentional Prototype Inference for Few-Shot Segmentation [128.45753577331422]
  We propose attentional prototype inference (API), a probabilistic latent variable framework for few-shot segmentation. We define a global latent variable to represent the prototype of each object category, which we model as a probabilistic distribution. We conduct extensive experiments on four benchmarks, where our proposal obtains at least competitive and often better performance than state-of-the-art prototype-based methods.
  arXiv  Detail & Related papers  (2021-05-14T06:58:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.