Gayathri R. Prabhu

Gayathri R. Prabhu

Auto-generated profile, based on publicly available information

Gayathri R. Prabhu

Amrita School of Engineering,Department of Electronics and Communication Engineering,Amritapuri,India

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 March 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
GPGayathri R. Prabhu
Gayathri R. Prabhu
SBSrikrishna Bhashyam
Srikrishna Bhashyam
AGAditya Gopalan
Aditya Gopalan
RSRajesh Sundaresan
Rajesh Sundaresan
We consider a multi-hypothesis testing problem involving a $K$ -armed bandit. Each arm’s signal follows a distribution from a vector exponential family. The actual parameters of the arms are unknown to the decision maker. The decision maker incurs a delay cost for delay until a decision and a switching cost whenever he switches from one arm to another. His goal is to minimise the overall cost until a decision is reached on the true hypothesis. Of interest are policies that satisfy a given constraint on the probability of false detection. This is a sequential decision making problem where the decision maker gets only a limited view of the true state of nature at each stage, but can control his view by choosing the arm to observe at each stage. An information-theoretic lower bound on the total cost (expected time for a reliable decision plus total switching cost) is first identified, and a variation on a sequential policy based on the generalised likelihood ratio statistic is then studied. Due to the vector exponential family assumption, the signal processing at each stage is simple; the associated conjugate prior distribution on the unknown model parameters enables easy updates of the posterior distribution. The proposed policy, with a suitable threshold for stopping, is shown to satisfy the given constraint on the probability of false detection. Under a continuous selection assumption, the policy is also shown to be asymptotically optimal in terms of the total cost among all policies that satisfy the constraint on the probability of false detection.

16 October 2023
Verified
Conference Paper
Closed access
PMPoornima Mohan
Poornima Mohan
GPGayathri R Prabhu
Gayathri R Prabhu
KBKarthi Balasubramanian
Karthi Balasubramanian
Nithin NagarajNithin Nagaraj
Nithin Nagaraj
Effort-To-Compress (ETC) has been proposed earlier as a compression complexity measure for analysing regularity of time-series data. It is a measure of effort to compress an input time series using a lossless compression algorithm known as “Non-Sequential Recursive Pair Substitution”, ETC has been demonstrated as a useful measure for characterizing time series, especially, biomedical signals. Few examples of ETC's applications to biomedical time series include blood flow analysis in human skin, analysis of heart rate variability, complexity analysis of consciousness, classification of corona viruses, and many more. However, the interpretation and relationship of ETC to classical signal parameters is still missing. We address this gap in this study by applying ETC for characterizing synthetic signals that emulate biomedical signals. We also compare the results obtained with Lempel-Ziv complexity, a popular measure that is widely used for biomedical signal analysis.