SearcharxivSearch

arXiv subjects

Ajinkya Naik

Publications and source records attributed to Ajinkya Naik.

2 recordsLinked to original sources

Nested Sampling for ARIMA Model Selection in Astronomical Time-Series Analysis

The era of large-scale, high-cadence astronomical surveys demands efficient and robust methods for time-series analysis. ARIMA models provide a versatile parametric description of stochastic variability in this context. However, their practical use is limited by the challenge of selecting optimal model orders while avoiding overfitting. We present a novel solution this problem by combining Autoregressive Integrated Moving Average (ARIMA) models with the Nested Sampling algorithm. Our method yields Bayesian evidences for model comparison and also incorporates an intrinsic Occam's penalty for unnecessary model complexity. Using JAX and Blackjax, a vectorized ARIMA-Nested Sampling framework with GPU-acceleration support is implemented, allowing us to perform model selection across grids of Autoregressive (AR) and Moving Average (MA) orders, with efficient inference of selected model parameters. We validate the approach using simulated time series with known ground-truth parameters and demonstrate accurate recovery of both model order and parameters. We then apply the method to several astronomical datasets, including the historical sunspot number record, stellar light curves of KIC 12008916 and Kepler 17 from the Kepler mission, and quasar light curves of 3C 273 and S4 0954+65 from the TESS mission. For all cases, except Kepler 17, the ARIMA models selected by this method were able to accurately model the stochastic variability in the time series data as well as produce accurate multi-step ahead forecasts for the sunspot number time series. Our results demonstrate that nested sampling offers a rigorous and computationally tractable alternative to autoregressive model selection in astronomical time-series analysis.

astro-ph.IM

Quantifying Sensitivity for Tree Ensembles: A symbolic and compositional approach

Decision tree ensembles (DTE) are a popular model for a wide range of AI classification tasks, used in multiple safety critical domains, and hence verifying properties on these models has been an active topic of study over the last decade. One such verification question is the problem of sensitivity, which asks, given a DTE, whether a small change in subset of features can lead to misclassification of the input. In this work, our focus is to build a quantitative notion of sensitivity, tailored to DTEs, by discretizing the input space of the model and enumerating the regions which are susceptible to sensitivity. We propose a novel algorithmic technique that can perform this computation efficiently, within a certified error and confidence bound. Our approach is based on encoding the problem as an algebraic decision diagram (ADD), and further splitting it into subproblems that can be solved efficiently and make the computation compositional and scalable. We evaluate the performance of our technique over benchmarks of varying size in terms of number of trees and depth, comparing it against the performance of model counters over the same problem encoding. Experimental results show that our tool XCount achieves significant speedup over other approaches and can scale well with the increasing sizes of the ensembles.

cs.AI