Unsupervised Domain Adaptation With Source Data for Estimating Occupancy and Recognizing Activities in Smart Buildings
Bibliographic record
Abstract
In this paper, we create and develop several unsupervised domain adaptation (UDA) methods that use source data to estimate the number of occupants and recognize activities in smart buildings. The created and developed methods have direct access to the source data, and their goal is to mitigate domain shift between source and target environments and to deal with the challenge of costly and time-consuming data labeling. We create our own novel UDA method called ATDOC-DDC that combines two powerful domain invariant methods Auxiliary Target Domain-Oriented Classifier (ATDOC) and Deep Domain Confusion (DDC) for better adaptation and performance. We introduce the Virtual Adversarial Domain Adaptation (VADA) model which is a combination of domain adversarial training and a penalty term. On the one hand, domain adversarial training trains a model on source and target data, and a discriminator to distinguish between data coming from different domains. The goal of the model is to fool the discriminator by creating features that generalize for different domains. On the other hand, the penalty term is added to punish the violation of the cluster assumption. Moreover, we introduce Sliced Wasserstein Discrepancy (SWD) for UDA which uses task-specific decision boundary and Wasserstein metric to perform domain alignment between source and target environments. The SWD distance is used to measure the difference between data distributions of the two domains so that the model can update its weights to minimize the considered distance (data alignment). Also, we consider three Adaptive Feature Norm (AFN) approaches that adapt the feature norms of the models to allow information transferability between domains. The adapted methods are Hard Adaptive Feature Norm (HAFN), Stepwise Adaptive Feature Norm (SAFN), and SAFN with entropy minimization. In addition, data poisoning has been employed to evaluate the robustness of the considered methods using mislabeled data. The obtained scores prove the efficiency and robustness of the proposed method on activity recognition and occupancy estimation datasets.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".