Interpretable statistical feature engineering for early disruption prediction in the short pulse ADITYA tokamak

• URL: http://arxiv.org/abs/2608.22515v1
• Date: Sun, 23 Aug 2026 17:29:46 GMT
• Title: Interpretable statistical feature engineering for early disruption prediction in the short pulse ADITYA tokamak
• Abstract summary: This work develops an interpretable machine learning framework for early disruption prediction in short pulse tokamaks.<n>A decision tree based feature selection is employed to identify physically meaningful disruption precursors.<n>The proposed framework achieves stable predictive performance across different analysis windows, with a maximum ROC-AUC of 0.87 for 0-35 ms and 0-40 ms windows.
• Score: 1.4984384033732472
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reliable early disruption prediction is critical for the safe operation and real-time control of tokamaks. However, machine learning based prediction frameworks have predominantly targeted medium and long pulse devices, with comparatively limited attention given to short pulse tokamaks where available warning time is inherently constrained. In this work, an interpretable machine learning framework is developed for feature engineering and early prediction of disruptions in the ADITYA using the initial plasma evolution information, prior to the activation of the negative converter of the ohmic transformer power supply. Statistical descriptors comprising the mean, variance, skewness, kurtosis and wavelet energy entropy are extracted from routinely available plasma diagnostics over different operation time windows. Decision tree based feature selection is employed to identify physically meaningful disruption precursors and to reduce feature dimensionality. These selected features are used to train a random forest classifier. The proposed framework achieves stable predictive performance across different analysis windows, with a maximum ROC-AUC of 0.87 for 0-35 ms and 0-40 ms windows. Comparable and in some cases improved, performance is obtained using the reduced feature set, demonstrating that the selected statistical descriptors retain the essential information required for disruption prediction. The proposed methodology provides an interpretable and computationally efficient framework for real time disruption prediction in short pulse tokamaks and establishes that carefully engineered statistical descriptors can effectively replace raw time series inputs for early disruption prediction, thereby offering a practical pathway toward real time plasma control in short pulse tokamaks similar to ADITYA and ADITYA-U.

Related papers

• Causally-Constrained Probabilistic Forecasting for Time-Series Anomaly Detection [1.8995711908407733]
  This study introduces a causally-constrained probabilistic forecasting framework for anomaly detection.<n>It integrates an explicit time-lagged causal graph prior with deep sequence modeling.<n>Experiments indicate that the proposed method achieves state-of-the-art detection performance.
  arXiv  Detail & Related papers  (2026-04-20T09:24:28Z)
• Streaming Real-Time Trajectory Prediction Using Endpoint-Aware Modeling [54.94692733670454]
  Future trajectories of neighboring traffic agents have a significant influence on the path planning and decision-making of autonomous vehicles.<n>We propose a lightweight yet highly accurate streaming-based trajectory forecasting approach.<n>Our approach significantly reduces inference latency, making it well-suited for real-world deployment.
  arXiv  Detail & Related papers  (2026-03-02T13:44:23Z)
• Towards Anytime-Valid Statistical Watermarking [63.02116925616554]
  We develop the first e-value-based watermarking framework, Anchored E-Watermarking, that unifies optimal sampling with anytime-valid inference.<n>Our framework can significantly enhance sample efficiency, reducing the average token budget required for detection by 13-15% relative to state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-02-19T18:32:26Z)
• Temporal convolutional and fusional transformer model with Bi-LSTM encoder-decoder for multi-time-window remaining useful life prediction [0.0]
  We propose a novel framework that integrates Temporal Convolutional Networks (TCNs) for localized temporal feature extraction.<n>This architecture effectively bridges short- and long-term dependencies while emphasizing salient temporal patterns.<n>The proposed model reduces the average RMSE by up to 5.5%, underscoring its improved predictive accuracy compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-11-06T11:29:57Z)
• A Unified Frequency Domain Decomposition Framework for Interpretable and Robust Time Series Forecasting [81.73338008264115]
  Current approaches for time series forecasting, whether in the time or frequency domain, predominantly use deep learning models based on linear layers or transformers.<n>We propose FIRE, a unified frequency domain decomposition framework that provides a mathematical abstraction for diverse types of time series.<n>Fire consistently outperforms state-of-the-art models on long-term forecasting benchmarks.
  arXiv  Detail & Related papers  (2025-10-11T09:59:25Z)
• Revisiting Multivariate Time Series Forecasting with Missing Values [65.30332997607141]
  Missing values are common in real-world time series.<n>Current approaches have developed an imputation-then-prediction framework that uses imputation modules to fill in missing values, followed by forecasting on the imputed data.<n>This framework overlooks a critical issue: there is no ground truth for the missing values, making the imputation process susceptible to errors that can degrade prediction accuracy.<n>We introduce Consistency-Regularized Information Bottleneck (CRIB), a novel framework built on the Information Bottleneck principle.
  arXiv  Detail & Related papers  (2025-09-27T20:57:48Z)
• Dynamic Aware: Adaptive Multi-Mode Out-of-Distribution Detection for Trajectory Prediction in Autonomous Vehicles [8.920589816043298]
  Trajectory prediction is central to the safe and seamless operation of autonomous vehicles.<n>In deployment, prediction models inevitably face distribution shifts between training data and real-world conditions.<n>We propose a new framework that introduces adaptive mechanisms to achieve robust detection in complex driving environments.
  arXiv  Detail & Related papers  (2025-09-16T22:37:21Z)
• Forecasting Particle Accelerator Interruptions Using Logistic LASSO Regression [62.997667081978825]
  Unforeseen particle accelerator interruptions, also known as interlocks, lead to abrupt operational changes despite being necessary safety measures. We propose a simple yet powerful binary classification model aiming to forecast such interruptions. The model is formulated as logistic regression penalized by at least absolute shrinkage and selection operator.
  arXiv  Detail & Related papers  (2023-03-15T23:11:30Z)
• Time Series Prediction under Distribution Shift using Differentiable Forgetting [0.0]
  We frame time series prediction under distribution shift as a weighted empirical risk minimisation problem. The weighting of previous observations in the empirical risk is determined by a forgetting mechanism. We propose a gradient-based learning method for the parameters of the forgetting mechanism.
  arXiv  Detail & Related papers  (2022-07-23T10:32:37Z)
• Evaluating Short-Term Forecasting of Multiple Time Series in IoT Environments [67.24598072875744]
  Internet of Things (IoT) environments are monitored via a large number of IoT enabled sensing devices. To alleviate this issue, sensors are often configured to operate at relatively low sampling frequencies. This can hamper dramatically subsequent decision-making, such as forecasting.
  arXiv  Detail & Related papers  (2022-06-15T19:46:59Z)
• Bandit Quickest Changepoint Detection [55.855465482260165]
  Continuous monitoring of every sensor can be expensive due to resource constraints. We derive an information-theoretic lower bound on the detection delay for a general class of finitely parameterized probability distributions. We propose a computationally efficient online sensing scheme, which seamlessly balances the need for exploration of different sensing options with exploitation of querying informative actions.
  arXiv  Detail & Related papers  (2021-07-22T07:25:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.