Weakly Supervised Domain Adversarial Neural Network for Deforestation Detection in Tropical Forests
Bibliographic record
Abstract
Domain adaptation has proven to be suitable for alleviating domain discrepancies, which hinder the generalization capacity of classifiers. Among a few alternatives, domain adaptation techniques that align features in a domain-agnostic space through adversarial learning have been widely investigated. Nevertheless, such an approach often implies the deterioration of feature discriminability as a side effect of the adversarial alignment, which does not take into consideration class labels of the target domain samples. We advocate that weakly-supervised learning can help mitigate that problem, as noisy labels for the target domain samples may serve to sustain class discriminability during the feature alignment procedure. Therefore, in this work we propose a weakly-supervised, adversarial domain adaptation method for a change detection task based on the Domain Adversarial Neural Network (DANN) strategy. We assessed the performance of the proposed method on a deforestation detection application, conducting experiments in sites of the Amazon and Cerrado (Brazilian Savannah) biomes using Landsat-8 images, each site corresponding to a different domain. The results showed that the inclusion of weak supervision in the domain adaptation procedure provided higher accuracies as compared to the original DANN strategy, which did not prescribe any supervision for the selection of target domain samples in the training procedure. On average, the Average Precision and F1-score metrics values increased by 10.1 use of the proposed method. Additionally, our method achieved performances that are compatible with the ones obtained with previously proposed, state-of-the-art domain adaptation methods. To the best of our knowledge, the proposed method is the first weakly-supervised domain adaptation strategy conceived for deforestation detection and, in general, for change detection.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".