Tonghe Bai | Searcharxiv

arXiv2025

A High-Performance Training-Free Pipeline for Robust Random Telegraph Signal Characterization via Adaptive Wavelet-Based Denoising and Bayesian Digitization Methods

Random telegraph signal (RTS) analysis is increasingly important for characterizing meaningful temporal fluctuations in physical, chemical, and biological systems. The simplest RTS arises from discrete stochastic switching events between two binary states, quantified by their transition amplitude and dwell times in each state. Quantitative analysis of RTSs provides valuable insights into microscopic processes such as charge trapping in semiconductors. However, analyzing RTS becomes considerably complex when signals exhibit multi-level structures or are corrupted by background white or pink noise. To address these challenges and support high-throughput RTS characterization, we propose a modular, training-free signal processing pipeline that integrates adaptive dual-tree complex wavelet transform (DTCWT) denoising with a lightweight Bayesian digitization strategy. The adaptive DTCWT denoiser incorporates autonomous parameter selection rules for its decomposition level and thresholds, optimizing white noise suppression without manual tuning. Our Bayesian digitizer formulates RTS level assignment as a probabilistic latent-state inference problem incorporating temporal regularization without iterative optimization, effectively resolving binary trap states even under residual notorious background pink noise. Quantitative benchmarking on large synthetic datasets with known ground truth demonstrates improved RTS reconstruction accuracy, trap-state resolution, and dwell-time estimation across diverse noise regimes and multi-trap scenarios, while achieving up to 83x speedups over classical and neural baselines. Qualitative validation on experimental RTS data when no ground truth is available illustrates practical usability and flexibility for real-time or large-scale analysis in real measurement settings.

physics.app-ph↗

arXiv2023

zkDL: Efficient Zero-Knowledge Proofs of Deep Learning Training

The recent advancements in deep learning have brought about significant changes in various aspects of people's lives. Meanwhile, these rapid developments have raised concerns about the legitimacy of the training process of deep neural networks. To protect the intellectual properties of AI developers, directly examining the training process by accessing the model parameters and training data is often prohibited for verifiers. In response to this challenge, we present zero-knowledge deep learning (zkDL), an efficient zero-knowledge proof for deep learning training. To address the long-standing challenge of verifiable computations of non-linearities in deep learning training, we introduce zkReLU, a specialized proof for the ReLU activation and its backpropagation. zkReLU turns the disadvantage of non-arithmetic relations into an advantage, leading to the creation of FAC4DNN, our specialized arithmetic circuit design for modelling neural networks. This design aggregates the proofs over different layers and training steps, without being constrained by their sequential order in the training process. With our new CUDA implementation that achieves full compatibility with the tensor structures and the aggregated proof design, zkDL enables the generation of complete and sound proofs in less than a second per batch update for an 8-layer neural network with 10M parameters and a batch size of 64, while provably ensuring the privacy of data and model parameters. To our best knowledge, we are not aware of any existing work on zero-knowledge proof of deep learning training that is scalable to million-size networks.

cs.LG↗