arXiv subjects

Sankaraleengam Alagapan

Publications and source records attributed to Sankaraleengam Alagapan.

5 recordsLinked to original sources

arXiv2026

Subspace Learning with Interval-Censored Likelihoods for Dequantizing Percept PC LFP Snapshots

Implanted neurostimulators that sense local field potentials now enable chronic electrophysiology based biomarker tracking in patients at home. The Medtronic Percept PC, the only commercially available sensing-enabled deep brain stimulation (DBS) device, stores spectral amplitudes as 16-bit integers at approximately 0.1 $μ$V per bit (quantum $q \approx 0.11$ $μ$Vp). At frequencies where the true amplitude spans only a few quantization levels, consecutive bins round to the same stored value. Standard spectral parameterization (FOOOF, fitting oscillations and one over f), which separates periodic peaks from the aperiodic 1/f activity, treats every value as exact and fits oscillatory peaks to these plateaus. Because these spectra feed clinical biomarker pipelines and spectral foundation models for symptom decoding, spurious peaks can corrupt downstream inference. Across 9,438 spectra from 14 hemispheres in 7 subcallosal cingulate DBS patients, 20.6% of peaks detected at [2, 45] Hz have no match in ground truth synthesized by quantizing clean in-clinic BrainSense recordings, while aggregate beta band power and the aperiodic exponent are preserved. We formalize dequantization as interval-censored subspace estimation and compare five classes of correction methods. Quantized probabilistic PCA is the only tested method that reduces the spurious rate (20.6% to 18.3%) while preserving true peak detection and keeping noise floor RMSE below $q/\sqrt{12}$.

eess.SP↗

arXiv2026

Toward individual-level calibration in affect recognition with perceptual adjustment queries

Behavioral tasks measuring facial affect perception assume that identical stimuli impose equivalent perceptual difficulty across participants. However, this assumption is systematically violated by individual differences in perceptual sensitivity. Using an affective perception task as our testbed, we propose a framework to normalize for perceptual difficulty that directly estimates each participant's Just Noticeable Difference (JND) along the facial affect spectrum via cognitively lightweight perceptual adjustment queries (PAQs). We use these PAQ-inferred JNDs to re-express stimulus distances, constructing difficulty-equated tasks in perceptual space. We validate the framework in a Two-Alternative Forced-Choice (2AFC) task using two complementary behavioral measures: binary metacognitive difficulty judgments and response time variance decomposition. We find that PAQ calibration significantly equalizes perceived task difficulty at an individual level when compared to both the non-calibrated baseline and population-level Weibull calibration, while also reducing mean response time and between-subject variance in response time. These results establish PAQ as a principled and practical instrument for individualized perceptual calibration in facial affect recognition.

cs.LG↗

arXiv2026

LORE: Jointly Learning the Intrinsic Dimensionality and Relative Similarity Structure From Ordinal Data

Learning the intrinsic dimensionality of subjective perceptual spaces such as taste, smell, or aesthetics from ordinal data is a challenging problem. We introduce LORE (Low Rank Ordinal Embedding), a scalable framework that jointly learns both the intrinsic dimensionality and an ordinal embedding from noisy triplet comparisons of the form, "Is A more similar to B than C?". Unlike existing methods that require the embedding dimension to be set apriori, LORE regularizes the solution using the nonconvex Schatten-$p$ quasi norm, enabling automatic joint recovery of both the ordinal embedding and its dimensionality. We optimize this joint objective via an iteratively reweighted algorithm and establish convergence guarantees. Extensive experiments on synthetic datasets, simulated perceptual spaces, and real world crowdsourced ordinal judgements show that LORE learns compact, interpretable and highly accurate low dimensional embeddings that recover the latent geometry of subjective percepts. By simultaneously inferring both the intrinsic dimensionality and ordinal embeddings, LORE enables more interpretable and data efficient perceptual modeling in psychophysics and opens new directions for scalable discovery of low dimensional structure from ordinal data in machine learning.

cs.LG↗

arXiv2024

Probabilistic Decomposed Linear Dynamical Systems for Robust Discovery of Latent Neural Dynamics

Time-varying linear state-space models are powerful tools for obtaining mathematically interpretable representations of neural signals. For example, switching and decomposed models describe complex systems using latent variables that evolve according to simple locally linear dynamics. However, existing methods for latent variable estimation are not robust to dynamical noise and system nonlinearity due to noise-sensitive inference procedures and limited model formulations. This can lead to inconsistent results on signals with similar dynamics, limiting the model's ability to provide scientific insight. In this work, we address these limitations and propose a probabilistic approach to latent variable estimation in decomposed models that improves robustness against dynamical noise. Additionally, we introduce an extended latent dynamics model to improve robustness against system nonlinearities. We evaluate our approach on several synthetic dynamical systems, including an empirically-derived brain-computer interface experiment, and demonstrate more accurate latent variable inference in nonlinear systems with diverse noise conditions. Furthermore, we apply our method to a real-world clinical neurophysiology dataset, illustrating the ability to identify interpretable and coherent structure where previous models cannot.

stat.ML↗

arXiv2018

Diffusion geometry approach to efficiently remove electrical stimulation artifacts in intracranial electroencephalography

Cortical oscillations, electrophysiological activity patterns, associated with cognitive functions and impaired in many psychiatric disorders can be observed in intracranial electroencephalography (iEEG). Direct cortical stimulation (DCS) may directly target these oscillations and may serve as therapeutic approaches to restore functional impairments. However, the presence of electrical stimulation artifacts in neurophysiological data limits the analysis of the effects of stimulation. Currently available methods suffer in performance in the presence of nonstationarity inherent in biological data. Our algorithm, Shape Adaptive Nonlocal Artifact Removal (SANAR) is based on unsupervised manifold learning. By estimating the Euclidean median of k nearest neighbors of each artifact in a nonlocal fashion, we obtain a faithful representation of the artifact which is then subtracted. This approach overcomes the challenges presented by nonstationarity. SANAR is effective in removing stimulation artifacts in the time domain while preserving the spectral content of the endogenous neurophysiological signal. We demonstrate the performance in a simulated dataset as well as in human iEEG data. Using two quantitative measures, that capture how much of information from endogenous activity is retained, we demonstrate that SANAR's performance exceeds that of one of the widely used approaches, independent component analysis, in the time domain as well as the frequency domain. This approach allows for the analysis of iEEG data, single channel or multiple channels, during DCS, a crucial step in advancing our understanding of the effects of periodic stimulation and developing new therapies.

physics.med-ph↗