Correcting the overestimate of forest biomass carbon on the national scale
Bibliographic record
Abstract
Summary For decades, researchers have thought it was difficult to remove the uncertainty from the estimates of forest carbon storage and its changes on national sales. This is not only because of stochasticity in the data but also the bias to overcome in the computations. Most studies of the estimation, however, ignore quantitative analyses for the latter uncertainty. This bias primarily results from the widely used volume‐biomass method via scaling up forest biomass from limited sample plots to large areas. This paper addresses (i) the mechanism of scaling‐up error occurrence, and (ii) the quantitative effects of the statistical factors on the error. The error compensators were derived, and expressed by ternary functions with three variables: expectation, variance and the power in the volume‐biomass equation. This is based on analysing the effect of power‐law function convexity on scaling‐up error by solving the difference of both sides of the weighted Jensen inequality. The simulated data and the national forest inventory of China were used for algorithm testing and application, respectively. Scaling‐up error occurrence stems primarily from an effect of the distribution heterogeneity of volume density on the total biomass amount, and secondarily from the extent of function nonlinearities. In our experiments, on average 94·2% of scaling‐up error can be reduced for the statistical populations of forest stands in a region. China's forest biomass carbon was estimated as approximately 6·0 PgC or less at the beginning of the 2010s after on average 1·1% error compensation. The results of both the simulated data experiment and national‐scale estimation suggest that the biomass is overestimated for young forests more than others. It implies a necessity to compensate scaling‐up error, especially for the areas going through extensive afforestation and reforestation in past decades. This study highlights the importance of understanding how both the function nonlinearity and the statistics of the variables quantitatively affect the scaling‐up error. Generally, the presented methods will help to translate fine‐scale ecological relationships to estimate coarser scale ecosystem properties by correcting aggregation errors.
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.003 | 0.008 |
| 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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".