Pith. sign in

Sit Back and Relax: Learning to Drive Incrementally in All Weather Conditions

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

In autonomous driving scenarios, current object detection models show strong performance when tested in clear weather. However, their performance deteriorates significantly when tested in degrading weather conditions. In addition, even when adapted to perform robustly in a sequence of different weather conditions, they are often unable to perform well in all of them and suffer from catastrophic forgetting. To efficiently mitigate forgetting, we propose Domain-Incremental Learning through Activation Matching (DILAM), which employs unsupervised feature alignment to adapt only the affine parameters of a clear weather pre-trained network to different weather conditions. We propose to store these affine parameters as a memory bank for each weather condition and plug-in their weather-specific parameters during driving (i.e. test time) when the respective weather conditions are encountered. Our memory bank is extremely lightweight, since affine parameters account for less than 2% of a typical object detector. Furthermore, contrary to previous domain-incremental learning approaches, we do not require the weather label when testing and propose to automatically infer the weather condition by a majority voting linear classifier.

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Forget the Data and Fine-Tuning! Just Fold the Network to Compress

cs.LG · 2025-02-14 · conditional · novelty 6.0

Model folding compresses a network by k-means clustering similar neurons across adjacent layers and repairing activation statistics without data (Fold-AR, Fold-DIR), surpassing prior data-free methods at high sparsity.

citing papers explorer

Showing 1 of 1 citing paper.

  • Forget the Data and Fine-Tuning! Just Fold the Network to Compress cs.LG · 2025-02-14 · conditional · none · ref 49 · internal anchor

    Model folding compresses a network by k-means clustering similar neurons across adjacent layers and repairing activation statistics without data (Fold-AR, Fold-DIR), surpassing prior data-free methods at high sparsity.