ST-LoRA: Single Trajectory LoRA Ensemble for Uncertainty Aware Agricultural Segmentation

• URL: http://arxiv.org/abs/2608.01530v1
• Date: Sun, 02 Aug 2026 22:49:28 GMT
• Title: ST-LoRA: Single Trajectory LoRA Ensemble for Uncertainty Aware Agricultural Segmentation
• Abstract summary: Decision-support in digital agriculture requires accurate predictions and well-calibrated uncertainty estimates.<n>We propose ST-LoRA, a parameter-efficient ensemble framework that builds diverse ensemble members from a single training trajectory.<n> ST-LoRA matches or exceeds full-rank ensembles in segmentation accuracy and calibration across both datasets and architectures.
• Score: 4.391214332238358
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Reliable decision-support in digital agriculture requires accurate predictions and well-calibrated uncertainty estimates, particularly for dense prediction tasks such as semantic segmentation. Ensemble methods provide strong uncertainty quantification, but their computational and memory demands limit practical use, while single-model approximations often trade off uncertainty quality for efficiency. We propose ST-LoRA, a parameter-efficient ensemble framework that builds diverse ensemble members from a single training trajectory by combining Low-Rank Adaptation (LoRA) with snapshot ensembling. Each member shares a frozen pretrained backbone and differs only in lightweight low-rank adapters, reducing trainable parameters to under 10% of the full model while preserving ensemble diversity. We evaluate across two agricultural datasets - GrowliFlower-L (cauliflower, open field) and BUP20 (sweet pepper, glasshouse) - using SegFormer and Mask2Former, covering in-distribution performance, calibration under distribution shift, and out-of-distribution detection. Ablations show feed-forward layers, not attention layers, are the critical LoRA target for dense prediction, contrary to the attention-only convention from language models. ST-LoRA matches or exceeds full-rank ensembles in segmentation accuracy and calibration across both datasets and architectures, while substantially reducing training time, inference latency, memory footprint, and storage requirements. Against efficient baselines - Snapshot Ensemble, MC Dropout, and Deep Deterministic Uncertainty - ST-LoRA consistently matches or outperforms them in image/pixel-level OoD detection, calibration stability under shift, and cross-seed variance, with far fewer parameters and lower compute. These results show LoRA-efficient ensemble adaptation is a highly effective, practical approach for uncertainty-aware agricultural vision systems.

Related papers

• Bayesian Sparse Low-Rank Adaptation for Large Language Model Uncertainty Estimation [14.828620034157316]
  Large language models (LLMs) exhibit remarkable reasoning capabilities, but their task-specific fine-tuning is notoriously plagued by overconfidence.<n>We propose Data-Adaptive Lower-Rank Adaptation (DALorRA), a simple and effective variational Bayesian sparse framework that shifts the paradigm of uncertainty from the dense parameter space to the lightweight rank level of low-rank adaptation (LoRA)<n>With the insight that LoRA aggregates multiple rank-one components that may provide superfluous model capacity, DALorRA imposes masking on rank dimensions, enabling regularization of model capacity during training and ensemble-like calibration during inference.
  arXiv  Detail & Related papers  (2026-07-02T13:52:12Z)
• On the Construction and Implications of Low-Loss Valleys in LoRA-based Bayesian Inference [12.367241512406656]
  We introduce LoRA-Curve, a segmented Bézier curve parameterization in the LoRA space with two variants.<n>We prove pathwise continuity and Lipschitz regularity of the loss along the curve and empirically show, across reasoning and classification benchmarks with Qwen2.5 7B, that linear perturbations encounter loss barriers.<n>Combined with flat-minima perturbations and a Jensen-Shannon divergence regularizer, LoRA-Curve yields measurably higher mutual information of the predictive distribution without sacrificing performance.
  arXiv  Detail & Related papers  (2026-05-28T08:24:45Z)
• Stabilized Fine-Tuning with LoRA in Federated Learning: Mitigating the Side Effect of Client Size and Rank via the Scaling Factor [8.51407618718798]
  In distributed scenarios where privacy constraints necessitate Federated Learning (FL), the integration of Low-Rank Adaptation (LoRA) is often unstable.<n>This paper introduces Stabilized Federated LoRA (SFed-LoRA), a framework that theoretically characterizes the interaction between adapter rank and federated aggregation.<n>We demonstrate that SFed-LoRA prevents high-rank collapse, and achieves significantly improved stability and faster convergence.
  arXiv  Detail & Related papers  (2026-03-09T07:49:56Z)
• Decomposing and Composing: Towards Efficient Vision-Language Continual Learning via Rank-1 Expert Pool in a Single LoRA [50.97792275353563]
  We introduce a novel framework that restructures a single Low-Rank Adaptation (LoRA) module as a decomposable Rank-1 Expert Pool.<n>Our method learns to dynamically compose a sparse, task-specific update by selecting from this expert pool, guided by the semantics of the [Guided] token.
  arXiv  Detail & Related papers  (2026-01-30T10:54:51Z)
• Modest-Align: Data-Efficient Alignment for Vision-Language Models [67.48633659305592]
  Cross-modal alignment models often suffer from overconfidence and degraded performance when operating in resource-constrained settings.<n>We propose Modest-Align, a lightweight alignment framework designed for robustness and efficiency.<n>Our method offers a practical and scalable solution for cross-modal alignment in real-world, low-resource scenarios.
  arXiv  Detail & Related papers  (2025-10-24T16:11:10Z)
• SD-LoRA: Scalable Decoupled Low-Rank Adaptation for Class Incremental Learning [73.93639228235622]
  Continual Learning with foundation models has emerged as a promising paradigm to exploit abundant knowledge acquired during pre-training for tackling sequential tasks.<n>Existing prompt-based and Low-Rank Adaptation-based (LoRA-based) methods often require expanding a prompt/LoRA pool or retaining samples of previous tasks.<n>We propose Scalable Decoupled LoRA (SD-LoRA) for class incremental learning, which continually separates the learning of the magnitude and direction of LoRA components without rehearsal.
  arXiv  Detail & Related papers  (2025-01-22T20:00:41Z)
• Replay-Free Continual Low-Rank Adaptation with Dynamic Memory [62.85596937435928]
  We revisit continual learning, which enables pre-trained vision transformers (ViTs) to sequentially fine-tune on new downstream tasks over time.<n>Recent studies highlight a crossover between CL techniques and parameter-efficient fine-tuning.<n>We propose a novel PEFT-CL method called Dual Low-Rank Adaptation (DualLoRA)
  arXiv  Detail & Related papers  (2024-11-01T14:28:39Z)
• Randomized Asymmetric Chain of LoRA: The First Meaningful Theoretical Framework for Low-Rank Adaptation [58.288682735160585]
  Low-Rank Adaptation (LoRA) is a popular technique for finetuning models. LoRA often under performs when compared to full- parameter fine-tuning. We present a framework that rigorously analyzes the adaptation rates of LoRA methods.
  arXiv  Detail & Related papers  (2024-10-10T18:51:53Z)
• LoRA-Ensemble: Efficient Uncertainty Modelling for Self-Attention Networks [52.46420522934253]
  We introduce LoRA-Ensemble, a parameter-efficient ensembling method for self-attention networks.<n>The method not only outperforms state-of-the-art implicit techniques like BatchEnsemble, but even matches or exceeds the accuracy of an Explicit Ensemble.
  arXiv  Detail & Related papers  (2024-05-23T11:10:32Z)

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.