Searcharxiv⌕ Search

arXiv subjects

Yun Am Seo

Publications and source records attributed to Yun Am Seo.

5 recordsLinked to original sources

A plug-in energy-balance freezing module for transformer frost nowcasting without leaf-sensor inputs

Frost protection requires local warnings where leaf-sensor inputs are unavailable. In the frost literature we surveyed, physics entered machine-learning models through inputs, numerical-model coupling, or losses, rather than model structure. We develop a transformer-compatible module that embeds leaf energy-balance physics in freezing-probability forecasts: an energy-balance temperature reference and a learned residual predict leaf temperature, which drives a multiplicative gate imposing a temperature-dependent probability cap. We mathematically prove conditional monotonicity and an alarm boundary, and test whether placing the same information in the output pathway or in attention yields different benefits. We evaluated 12 hourly leads at 19 Korean stations over five frost seasons, with and without leaf-sensor inputs. In the 2025-2026 hold-out season without these inputs, our time-token transformer (PET-E) achieved a lead-mean critical success index (CSI) of 0.516 versus 0.478 for fixed-configuration, joint-lead LightGBM, with significant gains at all 12 leads, and the fraction of alarms at observed leaf temperatures of at least 2 degrees C fell from 0.087 to 0.051 relative to the unmodified backbone. Across the hold-out and a retrospective 2024-2025 evaluation, the module reduced Brier scores and warm-surface alarm fractions in both the time-token transformer and iTransformer, with no significant CSI decrease at any lead. At held-out stations without static or leaf-sensor inputs, both module-equipped backbones exceeded LightGBM at all 12 leads (CSI 0.468 and 0.467 versus 0.437). In the time-token backbone, the temperature pathway reduced this alarm fraction in all four settings, whereas the attention prior increased CSI in three. These findings link an explicit temperature-dependent probability cap to improved forecasts and distinguish output-side from attention-based embedding.

stat.AP↗

Learning joint probabilistic weather forecasts from station observations alone

Assessing compound weather risks requires forecasts representing dependence between variables. CLARA (Calibrated Advection-Routing Attention) learns joint Gaussian predictive distributions of five surface variables from station observations alone, without numerical weather prediction or reanalysis; the approximately 28,000-parameter model supports CPU training and prediction. Across six multi-year folds on 96 stations, its lead-mean energy score is 4.9% lower than that of a learned comparator with matched temporal inputs (4.7% with a similar parameter count) and 11-65% lower than those of statistical baselines. Holding marginal variances fixed, removing learned correlations worsens joint negative log-likelihood by 1.0-2.8 nats per station. A covariance-scale estimator, proved consistent under stated assumptions, improves short-lead calibration but over-corrects at long leads. Synthetic interventions show an attention-bias coefficient alone does not measure forecast influence. Retrained in ten regions on six continents, CLARA outperforms persistence in all 60 multi-year region-lead comparisons and a similarly sized learned model in 57 of 60.

stat.AP↗

DOMIC: Provably Calibrated Detection of Dependence-Structure Change Points via Density-Operator Mutual Information

Dependence can change between variable blocks without changing correlation; serial dependence complicates calibration. We propose DOMIC, a rank-based detector using density-operator mutual information (DOMI). Unit-norm random features make sample-level partial traces exact, so prefix sums compute segment statistics at per-split cost independent of segment length; a Gram form uses the exact kernel. Permutation tests are finite-sample exact under pair or block exchangeability for windows and schemes fixed in advance; validity after data-driven scheme selection is unproved. For i.i.d. pairs with feature dimension, frequency draw and bandwidth fixed, we prove a weighted chi-square limit at independence for the rank-based random-feature statistic. An additive entropy cost with Holevo gains drives segmentation. DOMI attains higher localised power than rank, copula, kernel and distance baselines in most non-Gaussian and correlation-free settings; the Gram form leads or ties in all 16 non-Gaussian settings where any statistic exceeds 0.10. On a three-break benchmark, Holevo partitioning returns exactly three breaks in 47.5% of replicates, against at most 19% for calibrated baselines. Block-calibrated primary scans reject in all three pre-specified pairs of a US financial panel, with strongest stage-two evidence for stocks and Treasury yields. One of 27 weather candidates passes the multiplicity-corrected re-test; candidate selection is unadjusted.

stat.ME↗

Early warning of road icing from antecedent meteorological conditions without consistent critical slowing down

Critical slowing down (CSD), the slowing of recovery from perturbations as a system approaches a critical transition, is widely used for early warning, but whether such signals appear in environmental transitions subject to rapidly changing external forcing has rarely been tested with observations. Here we show, using 2,427 icing-onset events in 1-min observations from 121 South Korean road weather stations, that such signals do not consistently precede road icing. Icing began from different prior surface states, but conditions at onset varied continuously with weak separation among pathways. Cold dose, deposition dose and freeze-thaw accumulation at onset exceeded those at non-icing control times, with cold-dose discrimination highest at decay timescales of 30 min or less. However, the increases in variance and lag-1 autocorrelation expected under CSD did not distinguish icing from control times; the same procedure recovered these increases in synthetic series with a declining recovery rate, and the null result was replicated for 3,091 events at 127 independent stations. Predictive information was nevertheless present: adding recent changes and cumulative antecedent conditions to current conditions improved discrimination, and surrounding meteorological fields increased the area under the ROC curve by 0.030-0.032 for forecast windows of 1 to 12 h and reduced false alarms by 62-67% at 3 and 6 h. These results suggest that road icing is more consistent with recent meteorological forcing moving the road surface into icing-favourable conditions than with a progressive decline in internal stability, and they indicate where early warning should look when a transition is externally forced.

stat.AP↗

Iterative Method for Tuning Complex Simulation Code

Tuning a complex simulation code refers to the process of improving the agreement of a code calculation with respect to a set of experimental data by adjusting parameters implemented in the code. This process belongs to the class of inverse problems or model calibration. For this problem, the approximated nonlinear least squares (ANLS) method based on a Gaussian process (GP) metamodel has been employed by some researchers. A potential drawback of the ANLS method is that the metamodel is built only once and not updated thereafter. To address this difficulty, we propose an iterative algorithm in this study. In the proposed algorithm, the parameters of the simulation code and GP metamodel are alternatively re-estimated and updated by maximum likelihood estimation and the ANLS method. This algorithm uses both computer and experimental data repeatedly until convergence. A study using toy-models including inexact computer code with bias terms reveals that the proposed algorithm performs better than the ANLS method and the conditional-likelihood-based approach. Finally, an application to a nuclear fusion simulation code is illustrated.

stat.CO↗