A denoising autoencoder based on U-Net and bidirectional long short-term memory for multi-level random telegraph signal analysis
Bibliographic record
Abstract
Random telegraph signals (RTSs) are specific time-fluctuating signal patterns marked by a series of distinctive switching events between well-defined signal levels. These signals are ubiquitous in many electronic, chemical, and biological devices and systems. Analyzing RTSs unveils associated system structures and internal operation mechanisms, offering valuable insights into performance sensitivity. Therefore, accurate parameter quantification of RTSs is essential for understanding their origin and significance. While two-level RTS analysis is straightforward, complications arise at multiple levels, especially with unwanted background fluctuations. To address this challenge, we developed a novel denoising autoencoder model with U-Net and bidirectional long short-term memory (DAE UBL) for denoising multi-level RTSs degraded by Gaussian white and pink noise. DAE UBL extracts lower-dimensional latent features with its encoder and reconstructs denoised RTS with its decoder. Trained and validated with large datasets of noisy multi-level RTSs, our DAE UBL demonstrates superior and stable denoising performance compared to four classic models with lower average median root mean squared errors by over 78% and 63% for all RTS data accompanying various strengths of white noise and pink noise. Average median signal-to-noise ratios in the DAE UBL analysis are increased by over 65% and 56% for the white noise and pink noise datasets. In the time domain, DAE UBL effectively suppresses both local and global fluctuations, thereby successfully removing background noise. Our model exhibits robust performance in denoising multi-level RTSs with strong pink noise. We envision that our DAE UBL will be an attractive denoising methodology for the complex multi-level RTS analysis.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".