Open Problems

Domain Adaptation & Generalization

Cross-Architecture Robustness and Evaluation of Domain Adaptation in Object Detection

Scope to testPartly addressed
Possible candidate · 2/5 runs5 papers report this60% from 2025+

Generated automatically from the limitations stated in 5 papers (CVPR, NeurIPS, ICCV), listed under Evidence. It is not a paper, and it does not come from papers submitted to CSPaper.

The problem

Current domain adaptation and domain generalization methods for object detection are almost exclusively evaluated on two-stage anchor-based architectures, primarily Faster R-CNN with ResNet backbones. Because these adaptation mechanisms often couple directly to region proposal networks, RoI pooling representations, or batch normalization layers, it is completely unknown whether reported domain adaptation gains transfer to one-stage detectors (e.g., FCOS, YOLO) or query-based transformers (e.g., DETR variants). Consequently, practitioners deploying modern transformer or anchor-free architectures have no empirical guidance on whether established domain adaptation methods function outside Faster R-CNN.

Why it matters

Provides the first comprehensive empirical assessment of whether object detection domain adaptation techniques generalize across modern detector paradigms, establishing reliable baselines for one-stage and transformer-based architectures under domain shift.

Ways to approach it

Prior-work checks are free with an account. Results someone already ran are shown to everyone.

  1. 1

    Systematic multi-architecture benchmarking: Implement representative domain adaptation methods (e.g., adversarial feature alignment, self-training/pseudo-labeling, mean-teacher) across four detector paradigms—Faster R-CNN (two-stage), RetinaNet/YOLO (one-stage anchor-based), FCOS (anchor-free), and Deformable DETR (query-based)—measuring mAP shifts across standard cross-domain benchmarks (e.g., Cityscapes to Foggy Cityscapes, Sim10k to Cityscapes).

  2. 2

    Component-level transferability analysis: Disentangle adaptation components that operate at the backbone level versus detector-head-specific mechanisms (e.g., proposal alignment vs. query alignment), measuring the performance retention when swapping backbone and head types across architectures with and without batch normalization.

Have a different approach?

Describe how you would tackle this problem and we'll look for papers that already do it. Free; your text stays private.

Free · 3 checks per day

Why it might fail

The study could be diminished if modern detection transformers trained with simple data augmentations natively exhibit such high domain robustness that standard domain adaptation techniques yield negligible additive gains across all architectures.

Evidence

Each paper's own statement of the limitation, verbatim.

Nearest existing work

Related open problems

Domain Adaptation & Generalization

Barrier to removePartly addressed

Domain-Invariant Learning Without Domain Labels or Target-Domain Data at Training Time

Current methods across these settings all condition on information that disappears in deployment: explicit domain labels for training samples, knowledge of the domain count, or a pool of unlabeled target-domain data available during training. When source domain identity is unknown, only one source is available, or target data cannot be collected before the model is fixed, these methods are simply unusable — not merely degraded. This blocks the realistic scenario where a single labeled dataset is all one has, and the test distribution is only discovered at inference time.

Strong candidate · 4/5 runs10 papers report this57% from 2025+

Domain Adaptation & Generalization

Barrier to removePartly addressed

Systematic Evaluation of Data Augmentation Techniques Across Disparate Distribution Shift Types

Data augmentation methods developed for out-of-distribution robustness are overwhelmingly hand-engineered to simulate surface-level texture and appearance variations (e.g., color perturbations and synthetic corruptions). When these methods are deployed under other distribution shift types—such as subpopulation shifts, geometric transformations, or domain shifts in specialized fields like medical imaging—they frequently fail or degrade accuracy below standard Empirical Risk Minimization (ERM). Because augmentation techniques have not been systematically evaluated across these differing shift categories, practitioners have no reliable way to anticipate when a given augmentation strategy will harm downstream generalization.

Possible candidate · 2/5 runs4 papers report this0% from 2025+

Domain Adaptation & Generalization

Barrier to removeOpen

Cold-Start Streaming Domain Adaptation and Discovery Without Labeled Base Sessions or Offline Pre-Passes

Current continual domain adaptation and streaming open-world discovery methods structurally depend on an offline initialization phase—either requiring a fully labeled source base dataset or an offline full-dataset inference pass to compute initial prototypes and representations. In truly dynamic environments where data arrives purely as an online stream and domain shifts occur from the first observation, collecting labeled base data or executing multi-pass offline initialization is impossible. Consequently, existing frameworks cannot be deployed in pure cold-start streaming regimes.

Possible candidate · 2/5 runs3 papers report this100% from 2025+
Generated automatically, not curated by hand. Automated prior-work checks catch about a third of existing work, so treat this problem as a lead to investigate.