Searcharxiv⌕ Search

arXiv subjects

Akash Kumar

Publications and source records attributed to Akash Kumar.

At least 37 records · Page 2Linked to original sources

Subarray based Wideband Beamforming and Variational Sparse CSI Estimation for Low-Resolution MU THz MIMO Systems

This work conceives a unified channel estimation and beamforming framework, formulated within the principles of variational Bayesian inference. Recognizing the limitations imposed by hardware constraints, frequency-dependent propagation effects, and the structural restrictions of partially connected architectures in the Terahertz (THz) band, we formulate a dual-wideband channel model incorporating root raised cosine (RRC) pulse shape to account its band-limited nature. To further address the nonlinear distortions introduced by low-resolution ADCs, Bussgang decomposition is employed, enabling a tractable linearized inference process. Unlike conventional techniques, the proposed method accommodates both on-grid and off-grid angular domains, capturing spatial sparsity with improved resolution and robustness. The multi-user (MU) Bayesian Cramér-Rao lower bound is also derived to benchmark the performance of the proposed estimator. Moreover, the framework incorporates a true time delay (TTD)-based hybrid transceiver design that inherently compensates for the beam-squint effect; a frequency-dependent angular deviation that arises due to the fixedphase nature of the conventional beamformer in wideband systems, thereby ensuring accurate directional alignment across all subcarriers. Extensive simulation results validate the effectiveness of the proposed variational Bayesian inference-based estimator and the TTD-enabled beamforming architecture, highlighting their robustness and performance gains under practical wideband THz system.

eess.SP↗

Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs

Consider a bounded-degree graph $G$ that belongs to a minor-closed family (such as planar graphs). Such a graph has a hyperfinite decomposition, wherein, for a sufficiently small $\varepsilon > 0$, one can remove $\varepsilon dn$ edges to obtain connected components of size independent of $n$. (As usual, $n$ is the number of vertices and $d$ is the degree bound.) In a seminal result, Hassidim-Kelner-Nguyen-Onak (FOCS 2009) introduced the partition oracle, a procedure that provides local access to a hyperfinite decomposition. The partition oracle computes the component containing an input vertex $v$ with query complexity (to $G$) independent of $n$. Remarkably, this is done without any preprocessing on $G$. The coordination is done purely through a shared random seed. Despite a line of work on optimizing the query complexity of partition oracles, there were no attempts to bound the size of the random seed. All existing partition oracles use a random seed of size $Ω(n)$, which technically implies a linear setup time. Any blackbox derandomization would likely need $Ω(\log^2n)$ uniform random bits. A natural question is whether the random seed can also have length independent of $n$. We prove the $poly(d\varepsilon^{-1})$-query partition oracles of Kumar-Seshadhri-Stolman can be implemented with a random seed of $poly(d\varepsilon^{-1}) \cdot \log n$ length. To get a deeper understanding on the randomness complexity, we consider a more general model where the vertex labels come from the universe $[N]$, where $N \geq n$. In this setting, we prove that any partition oracle even for cycles requires $ω_N(1)$ random bits.

cs.DS↗

Topologically Driven Giant Effective Spin Mixing Conductance in Antiferromagnetic FeSn/Py Heterostructures

The topological semimetal FeSn antiferromagnet, characterized by its kagome lattice, two-dimensional flat bands, and Dirac-like surface states, holds immense promise for spintronic applications. In this work, for the first time, we investigate the spin pumping behavior in epitaxial-FeSn/Py (Ni$_{80}$Fe$_{20}$) heterostructures. We report a giant effective spin mixing conductance (g$^{\uparrow \downarrow}_{\mathrm{eff}}$) of $(116\pm 7)$~nm$^{-2}$, which is nearly one order of magnitude higher than that of standard Pt/Py heterostructures. The insertion of a 3 nm Al spacer layer results in a two-fold reduction in the effective damping, confirming the interfacial origin of the large g$^{\uparrow\downarrow}_{\mathrm{eff}}$. Consistently, we observe an order-of-magnitude higher inverse spin Hall effect voltage in the FeSn/Py system compared to a reference Pt/Py film stack. We attribute the giant g$^{\uparrow\downarrow}_{\mathrm{eff}}$ to the direct interfacing of the Py layer with the topologically active [001]-kagome surface of epitaxial-FeSn. These findings establish the critical role of topologically active interfaces for advanced quantum-material-based spintronic devices.

cond-mat.mes-hall↗

Autonomous Systems Dependability in the era of AI: Design Challenges in Safety, Security, Reliability and Certification

The design of embedded safety-critical systems such as those used in next-generation automotive and autonomous platforms, is increasingly challenged by escalating system complexity, hardware-software heterogeneity, and the integration of intelligent, data-driven components. Ensuring dependability in such systems requires a holistic approach that spans multiple abstraction layers and encompasses both design- and run-time assurance. Traditional methods for reliability, safety, and security management often fall short in addressing the dynamic and uncertain behaviors introduced by Artificial Intelligence (AI) and Machine Learning (ML) components, especially under stringent real-time, power, and safety constraints. While AI and ML offer powerful predictive, adaptive, and self-optimizing capabilities that can enhance system dependability, their inherent non-determinism, data-dependence, and lack of formal guarantees introduce new challenges for verification, validation, and certification. This paper explores emerging methodologies, architectures, and frameworks for designing dependable autonomous and embedded systems in the era of AI. It highlight advances in reliability modeling, secure system design, and certification approaches that account for imperfect, learning-enabled components, aiming to bridge the gap between AI innovation and certifiable system-level dependability.

cs.AI↗

AnTi-MiCS: Analytical Framework for Bounding Time in Embedded Mixed-Criticality Systems

In Mixed-Criticality (MC) systems, although the high Worst-Case Execution Time (WCET) serves as a conservative upper bound representing the task's maximum execution time under all conditions, obtaining a low WCET is essential for representing realistic executions and improving utilization and Quality-of-Service (QoS). Nevertheless, determining appropriate low WCET(s) for lower-criticality (LO) modes poses a significant challenge. Opting for a very low value of this WCET enhances processor utilization by scheduling more tasks in LO mode. Conversely, employing a larger WCET ensures fewer mode switches, thereby enhancing QoS, albeit at the cost of processor utilization. This paper proposes an analytical approach, AnTi-MiCS, to determine the appropriate low WCET through design-time analysis of task executions. In some cases, a single low WCET may not be adequate to capture large variations in the execution time distribution, for example, in scenarios like bimodal distributions. Therefore, we further propose a scalable approach, MulTi-MiCS, to compute multiple appropriate low WCETs. This approach exploits the temporal correlation between subsequent inputs presented to the application. Experimental results, conducted on a real platform with embedded real-time benchmarks, demonstrate the efficacy of our proposed scheme, in which QoS is improved by 30.27% on average while reducing utilization waste by 35.89%, compared to existing approaches. Besides, MulTi-MiCS improves QoS by 6.41% compared to AnTi-MiCS while reducing utilization waste by 8.23%.

cs.DC↗

Machine Learning-Based Characterization of Solar p-Mode Frequency Shifts during Solar Cycle 25

The solar interior is probed by the properties of the Sun's acoustic oscillations (p-modes) observed on the solar surface. The frequencies of these p-modes measured in the last three decades show long term variation similar to the 11 year cyclic behaviour exhibited by 10.7 cm radio flux, sunspot numbers and other solar activity indices. It is also now established that the cyclic behavior of some of the solar proxies are connected with geomagnetic activities and have implications for space weather. Hence, in recent years efforts have been made using machine-learning methods to forecast these solar proxies with a view to improve our understanding of space weather. Developing a comparable method for forecasting p-mode frequency shifts is therefore of interest for two reasons. Firstly, it will facilitate future investigations into its potential role in tracing energy drivers from the Sun's interior to the geospace response by improving models of solar interior dynamics to coronal and heliospheric plasma conditions. In other words, it will help establish a more robust and quantitative link between the Sun's interior and its exterior. Secondly, it may provide us with an independent indicator or an early indicator of ascending and descending phase of solar activity which might be useful for space weather forecasting. In this article, we develop and apply the standard time-series analysis and machine-learning based methods to characterise p-mode frequency shifts for the remaining solar cycle 25.

astro-ph.SR↗

Terahertz Beamforming and Group Sparse Channel Estimation Relying on Low-Resolution ADCs in MU Hybrid MIMO systems

A unified beamforming and channel estimation framework relying on Bayesian learning is conceived. Recognizing the limitations imposed by low-resolution analog-to-digital converter (ADCs) and frequency-dependent propagation effects occurring in the Terahertz (THz) band, we formulate a dual-wideband channel model incorporating root raised cosine (RRC) pulse shaping. To address the non-linear distortions introduced by low-resolution ADCs, Bussgang decomposition is employed, leading to a tractable linearized inference process. By leveraging the shared sparsity inherent in a multi-user (MU) scenario of THz systems, we propose a Hierarchical Bayesian Group-sparse Regression (HBG-SR) based channel learning technique that exploits the group-sparse structure of THz band channels. The estimated dominant angle-of-arrival/ angle-of-departure (AoA/AoD) indices are then exploited for appropriately configuring the true-time-delay (TTD) elements in the hybrid transceiver, enabling precise beam alignment across subcarriers and the effective compensation of the beam-squint effect occurring in wideband THz systems. Extensive simulation results validate the efficiency of the proposed channel estimator and the TTD-aided beamforming architecture, highlighting their robustness and performance gains under practical wideband THz system constraints.

eess.SP↗

Two-Stage Hybrid Transceiver Design Relying on Low-Resolution ADCs in Partially Connected MU Terahertz (THz) MIMO Systems

A two-stage hybrid transceiver is designed by considering a partially connected architecture at the base station (BS) for a low-resolution multi-user (MU) THz massive multiple input multiple output (MIMO) system. Due to its high bandwidth coupled with a high number of antennas, the THz band suffers from the deleterious spatial-wideband and frequency-wideband effects jointly termed as the dual-wideband effect. To address this undesired phenomenon, we rigorously model the THz MIMO channel at each subarray corresponding to each user by incorporating the absorption, reflection, and free-space losses. Subsequently, a novel beamforming technique is proposed that employs only a few true time delay (TTD) lines for eliminating the beam-split effect, which is the manifestation of the spatial-wideband effect in the frequency domain. Our simulation results demonstrate a performance improvement of around 13% in terms of spectral efficiency over the existing state-of-the-art techniques.

eess.SP↗

MCEL: Margin-Based Cross-Entropy Loss for Error-Tolerant Quantized Neural Networks

Robustness to bit errors is a key requirement for the reliable use of neural networks (NNs) on emerging approximate computing platforms and error-prone memory technologies. A common approach to achieve bit error tolerance in NNs is injecting bit flips during training according to a predefined error model. While effective in certain scenarios, training-time bit flip injection introduces substantial computational overhead, often degrades inference accuracy at high error rates, and scales poorly for larger NN architectures. These limitations make error injection an increasingly impractical solution for ensuring robustness on future approximate computing platforms and error-prone memory technologies. In this work, we investigate the mechanisms that enable NNs to tolerate bit errors without relying on error-aware training. We establish a direct connection between bit error tolerance and classification margins at the output layer. Building on this insight, we propose a novel loss function, the Margin Cross-Entropy Loss (MCEL), which explicitly promotes logit-level margin separation while preserving the favorable optimization properties of the standard cross-entropy loss. Furthermore, MCEL introduces an interpretable margin parameter that allows robustness to be tuned in a principled manner. Extensive experimental evaluations across multiple datasets of varying complexity, diverse NN architectures, and a range of quantization schemes demonstrate that MCEL substantially improves bit error tolerance, up to 15 % in accuracy for an error rate of 1 %. Our proposed MCEL method is simple to implement, efficient, and can be integrated as a drop-in replacement for standard CEL. It provides a scalable and principled alternative to training-time bit flip injection, offering new insights into the origins of NN robustness and enabling more efficient deployment on approximate computing and memory systems.

cs.LG↗

BiKA: Kolmogorov-Arnold-Network-inspired Ultra Lightweight Neural Network Hardware Accelerator

Lightweight neural network accelerators are essential for edge devices with limited resources and power constraints. While quantization and binarization can efficiently reduce hardware cost, they still rely on the conventional Artificial Neural Network (ANN) computation pattern. The recently proposed Kolmogorov-Arnold Network (KAN) presents a novel network paradigm built on learnable nonlinear functions. However, it is computationally expensive for hardware deployment. Inspired by KAN, we propose BiKA, a multiply-free architecture that replaces nonlinear functions with binary, learnable thresholds, introducing an extremely lightweight computational pattern that requires only comparators and accumulators. Our FPGA prototype on Ultra96-V2 shows that BiKA reduces hardware resource usage by 27.73% and 51.54% compared with binarized and quantized neural network systolic array accelerators, while maintaining competitive accuracy. BiKA provides a promising direction for hardware-friendly neural network design on edge devices.

cs.AR↗

RobustGait: Robustness Analysis for Appearance Based Gait Recognition

Appearance-based gait recognition have achieved strong performance on controlled datasets, yet systematic evaluation of its robustness to real-world corruptions and silhouette variability remains lacking. We present RobustGait, a framework for fine-grained robustness evaluation of appearance-based gait recognition systems. RobustGait evaluation spans four dimensions: the type of perturbation (digital, environmental, temporal, occlusion), the silhouette extraction method (segmentation and parsing networks), the architectural capacities of gait recognition models, and various deployment scenarios. The benchmark introduces 15 corruption types at 5 severity levels across CASIA-B, CCPG, and SUSTech1K, with in-the-wild validation on MEVID, and evaluates six state-of-the-art gait systems. We came across several exciting insights. First, applying noise at the RGB level better reflects real-world degradation, and reveal how distortions propagate through silhouette extraction to the downstream gait recognition systems. Second, gait accuracy is highly sensitive to silhouette extractor biases, revealing an overlooked source of benchmark bias. Third, robustness is dependent on both the type of perturbation and the architectural design. Finally, we explore robustness-enhancing strategies, showing that noise-aware training and knowledge distillation improve performance and move toward deployment-ready systems. Code is available at https://reeshoon.github.io/robustgaitbenchmark

cs.CV↗

Corrosion-resistant and conductive Ti-Nb-O coatings tailored for ultra-low Pt-loaded BPPs and PTLs in PEM electrolyzers

We develop highly corrosion-resistant and conductive Ti-Nb-O coatings for metallic components -- bipolar plates (BPPs) and porous transport layers (PTLs) -- in PEM water electrolyzers. Using reactive high-power impulse magnetron sputtering (HiPIMS), we deposit compact 200 nm bilayer coatings onto SS316L substrates, systematically tailoring their composition. By precisely controlling oxygen partial pressure and Nb/Ti ratio, we adjust stoichiometry and structure, directly affecting electrical resistivity and corrosion resistance. We examine interfacial contact resistance (ICR) and electrochemical parameters before and after accelerated corrosion testing. Optimized coatings exhibit resistivity on the order of 10^-4 Ohmcm and extremely low corrosion current densities (J_corr = 0.01-0.08 uA/cm^2), well below the U.S. DOE 2026 target. Most importantly, these coatings enable the ICR target after accelerated corrosion testing with a Pt overlayer as thin as 5 nm, reducing Pt loading by up to two orders of magnitude compared to conventional approaches.

cond-mat.mtrl-sci↗

Direct observation of propagating spin waves in a spin-Hall nano-oscillator

Constriction-based spin Hall nano-oscillators (SHNOs) show great promise for application as highly tunable microwave sources with straightforward scalability toward large coupled networks. However, details of the magnetization dynamics within SHNOs have thus far not been addressed experimentally, due to the minute time and length scales involved. In this work, we present direct imaging of the magnetization dynamics within a single CoFeB-based SHNO using time-resolved scanning transmission X-ray microscopy (STXM). Our measurements reveal that the magnon amplitude is the strongest at the two constriction edges, with a pronounced assymetry favoring one edge, and that emitted spin waves exhibit strongly anisotropic propagation. Micromagnetic simulations suggest that grain boundaries and the Dzyaloshinskii-Moriya interaction (DMI) play a key role in both effects. Furthermore, the magnetodynamics changed during the measurement, indicating that the CoFeB/MgO interface may be more susceptible to X-ray induced modifications than previously recognized, challenging its presumed radiation hardness.

cond-mat.mes-hall↗

Scheduling for TWDM-EPON-Based Fronthaul Without a Dedicated Registration Wavelength

The adoption of Centralized Radio Access Network (C-RAN) architectures requires fronthaul systems capable of carrying large volumes of radio data while meeting stringent delay and jitter requirements. Ethernet Passive Optical Networks (EPONs) have emerged as a promising fronthaul solution due to their cost efficiency and compatibility with existing infrastructure. However, the traditional registration process for EPON systems halts the ongoing data transmissions during the registration period, thereby violating the enhanced Common Public Radio Interface (eCPRI) delay and jitter requirements. This limitation has been acknowledged by the ITU-T, which recommends the use of a dedicated wavelength channel for registration, leading to inefficient bandwidth utilization. In this paper, we propose a novel scheduling framework for a Time and Wavelength Division Multiplexed (TWDM) EPON-based fronthaul that enables periodic registration without wasting an additional wavelength channel. Performance evaluation demonstrates that the proposed method achieves up to a 71\% increase in the number of Radio Units (RUs) supported for a given number of wavelength channels, compared to a baseline scheme employing a dedicated registration wavelength.

cs.NI↗

Giant Damping-like Spin-Torque Conductivity in a GeTe/Py van der Waals Heterostructure

Recent observations of large unconventional spin-orbit torques in van der Waals (vdW) materials are driving intense interest for energy-efficient spintronic applications. A key limitation of ferromagnet (FM)/vdW heterostructures is their lower value of damping-like torque conductivity ($σ{\rm_{DL}^{y}}$) compared to the conventional heavy metal-based systems, limiting their prospects for commercial spintronic devices. Here, we report both a giant $σ{\rm_{DL}^{y}}$ of $-(1.25 \pm 0.11)\times 10^{5}~\hbar/ 2e~Ω^{-1}$m$^{-1}$ and an unconventional spin-orbit torque in a heterostructure comprising an FM (Ni$_{80}$Fe$_{20}$) and the vdW material GeTe. The value of $σ{\rm_{DL}^{y}}$ represents the highest reported torque conductivity for any FM/vdW interface and is comparable to benchmark heavy metal heterostructures. First-principles calculations reveal that this substantial torque originates from the cooperative interplay of the spin Hall effect, orbital Hall effect, and orbital Rashba effect, assisted by interfacial charge transfer. These findings demonstrate the potential of carefully engineered vdW heterostructures to achieve highly efficient electrical manipulation of magnetization at room temperature, paving the way for next-generation low-power spintronic devices.

cond-mat.mes-hall↗

A Gap Between Decision Trees and Neural Networks

We study when geometric simplicity of decision boundaries, used here as a notion of interpretability, can conflict with accurate approximation of axis-aligned decision trees by shallow neural networks. Decision trees induce rule-based, axis-aligned decision regions (finite unions of boxes), whereas shallow ReLU networks are typically trained as score models whose predictions are obtained by thresholding. We analyze the infinite-width, bounded-norm, single-hidden-layer ReLU class through the Radon total variation ($\mathrm{R}\mathrm{TV}$) seminorm, which controls the geometric complexity of level sets. We first show that the hard tree indicator $1_A$ has infinite $\mathrm{R}\mathrm{TV}$. Moreover, two natural split-wise continuous surrogates--piecewise-linear ramp smoothing and sigmoidal (logistic) smoothing--also have infinite $\mathrm{R}\mathrm{TV}$ in dimensions $d>1$, while Gaussian convolution yields finite $\mathrm{R}\mathrm{TV}$ but with an explicit exponential dependence on $d$. We then separate two goals that are often conflated: classification after thresholding (recovering the decision set) versus score learning (learning a calibrated score close to $1_A$). For classification, we construct a smooth barrier score $S_A$ with finite $\mathrm{R}\mathrm{TV}$ whose fixed threshold $τ=1$ exactly recovers the box. Under a mild tube-mass condition near $\partial A$, we prove an $L_1(P)$ calibration bound that decays polynomially in a sharpness parameter, along with an explicit $\mathrm{R}\mathrm{TV}$ upper bound in terms of face measures. Experiments on synthetic unions of rectangles illustrate the resulting accuracy--complexity tradeoff and how threshold selection shifts where training lands along it.

cs.LG↗

Metrics for spin-based computing

Spin-based computing is emerging as a powerful approach for energy-efficient and high-performance solutions to future data processing hardware. Spintronic devices function by electrically manipulating the collective dynamics of the electron spin, that is inherently non-volatile, nonlinear and fast-operating, and can couple to other degrees of freedom such as photonic and phononic systems. This review explores key advances in integrating magnetic and spintronic elements into computational architectures, ranging from fundamental components like radio-frequency neurons/synapses and spintronic probabilistic-bits to broader frameworks such as reservoir computing and magnetic Ising machines. We discuss hardware-specific and task-dependent metrics to evaluate the computing performance of spin-based components and associate them with physical properties. Finally, we discuss challenges and future opportunities, highlighting the potential of spin-based computing in next-generation technologies.

cond-mat.mes-hall↗

Dictionary Learning: The Complexity of Learning Sparse Superposed Features with Feedback

The success of deep networks is crucially attributed to their ability to capture latent features within a representation space. In this work, we investigate whether the underlying learned features of a model can be efficiently retrieved through feedback from an agent, such as a large language model (LLM), in the form of relative \tt{triplet comparisons}. These features may represent various constructs, including dictionaries in LLMs or a covariance matrix of Mahalanobis distances. We analyze the feedback complexity associated with learning a feature matrix in sparse settings. Our results establish tight bounds when the agent is permitted to construct activations and demonstrate strong upper bounds in sparse scenarios when the agent's feedback is limited to distributional information. We validate our theoretical findings through experiments on two distinct applications: feature recovery from Recursive Feature Machines and dictionary extraction from sparse autoencoders trained on Large Language Models.

cs.LG↗