Abstract

Skip to content IOP Science home Accessibility Help Search Journals Books Publishing Support Login Engineering Research Express Inclusive Publishing Trusted Science, find out more. Purpose-led Publishing, find out more. ACCEPTED MANUSCRIPT A label-free sensing of creatinine using radio frequency-driven lab-on-chip (loc) system Andleeb Zahra1, Swarnim Sinha2, Alimpan Modak3, Imran Siddiqui4, Azeemuddin Syed5, Prabhakar Bhimalapuram6, Tapan K. Sau7, Pawan Kumar8 and Zia Abbas9 Accepted Manuscript online 2 August 2024 • © 2024 IOP Publishing Ltd What is an Accepted Manuscript? DOI 10.1088/2631-8695/ad6ad5 DownloadAccepted Manuscript PDF Download PDF Article metrics 6 Total downloads Submit Submit to this Journal Permissions Get permission to re-use this article Share this article Article and author information Abstract This paper presents a promising avenue of Radio Frequency (RF) biosensors for sensitive and real-time monitoring of creatinine detection. Knowing creatinine levels in the human body is related to its possible association with renal, muscular, and thyroid dysfunction. The detection was performed using an Inter-Digitated Capacitor (IDC) made of copper (Cu) metal over an FR4 substrate. To demonstrate our methodology, we have chosen Phosphate Buffer (PB) as our solvent for making the creatinine solutions of different concentrations. Moreover, Assayed Chemistry Control (ACC), a reference control consisting of human serum-based solutions has been mixed with the different concentrations of creatinine in a ratio of 1:9 to spike the creatinine value in the ACC solution. The sensor has been designed using a High-Frequency Structure Simulator (HFSS) tool with an operating frequency of 2.53 GHz. Then the design is fabricated over the FR4 printed circuit board (PCB) and tested using a Vector Network Analyzer (VNA). However, the sensitive area of the IDC is introduced to grade 4 Whatman filter paper for the Sample Under Test (SUT) handling unit. The main advantage of using Whatman filter paper is that the uniform spreading of liquid reduces experimental error, and less volume is required for testing the sample. The principal idea implemented in the biosensor design is to track the shift in the operating frequency in the presence of different concentrations of creatinine mix in ACC solution with Phosphate Buffer (PB) solution as a reference.

Abstract

Various studies have shown the advantages of using Machine Learning (ML) techniques for analog and digital IC design automation and optimization. Data scarcity is still an issue for electronic designs, while training highly accurate ML models. This work proposes generating and evaluating artificial data using generative adversarial networks (GANs) for circuit data to aid and improve the accuracy of ML models trained with a small training data set. The training data is obtained by various simulations in the Cadence Virtuoso, HSPICE, and Microcap design environment with TSMC 180 nm and 22 nm CMOS technology nodes. The artificial data is generated and tested for an appropriate set of analog circuits and digital cells. The experimental results show that the proposed artificial data generation significantly improves ML models and reduces the percentage error by more than 50% of the original percentage error, which were previously trained with insufficient data. Furthermore, this research aims to contribute to the extensive application of AI/ML in the field of VLSI design and technology by relieving the training data availability-related challenges.

Abstract

No Results Found

Abstract

Generative AI has seen remarkable growth over the past few years, with diffusion models being state-of-the-art for image generation. This study investigates the use of diffusion models in artificial data generation for electronic circuits to enhance the accuracy of subsequent machine learning models in tasks such as performance assessment, design, and testing when training data is usually known to be very limited. We utilize simulations in the HSPICE design environment with 22nm CMOS technology nodes to obtain representative real training data for our proposed diffusion model. Our results demonstrate the close resemblance of synthetic data using diffusion models to real data. We validate the quality of generated data and demonstrate that data augmentation is certainly effective in the predictive analysis of VLSI design for digital circuits.

Abstract

Generative AI has seen remarkable growth over the past few years, with diffusion models being state-of-the-art for image generation. This study investigates the use of diffusion models in generating artificial data generation for electronic circuits for enhancing the accuracy of subsequent machine learning models in tasks such as performance assessment, design, and testing when training data is usually known to be very limited. We utilize simulations in the HSPICE design environment with 22nm CMOS technology nodes to obtain representative real training data for our proposed diffusion model. Our results demonstrate the close resemblance of synthetic data using diffusion model to real data. We validate the quality of generated data, and demonstrate that data augmentation certainly effective in predictive analysis of VLSI design for digital circuits.

Abstract

A reliable critic is central to on-policy actor-critic learning. But it becomes challenging to learn a reliable critic in a multi-agent sparse reward scenario due to two factors: 1) The joint action space grows exponentially with the number of agents 2) This, combined with the reward sparseness and environment noise, leads to large sample requirements for accurate learning. We show that regularising the critic with spectral normalization (SN) enables it to learn more robustly, even in multi-agent on-policy sparse reward scenarios. Our experiments show that the regularised critic is quickly able to learn from the sparse rewarding experience in the complex SMAC and RWARE domains. These findings highlight the importance of regularisation in the critic for stable learning.

Abstract

Recent advances in Reinforcement Learning (RL) have led to many exciting applications. These advancements have been driven by improvements in both algorithms and engineering, which have resulted in faster training of RL agents. We present marl-jax, a multi-agent reinforcement learning software package for training and evaluating social generalization of the agents. The package is designed for training a population of agents in multi-agent environments and evaluating their ability to generalize to diverse background agents. It is built on top of DeepMind's JAX ecosystem~\cite{deepmind2020jax} and leverages the RL ecosystem developed by DeepMind. Our framework marl-jax is capable of working in cooperative and competitive, simultaneous-acting environments with multiple agents. The package offers an intuitive and user-friendly command-line interface for training a population and evaluating its generalization capabilities. In conclusion, marl-jax provides a valuable resource for researchers interested in exploring social generalization in the context of MARL. The open-source code for marl-jax is available at: \href{this https URL}{this https URL}

Abstract

A large number of computational and scientific methods commonly require decomposing a sparse matrix into triangular factors as LU decomposition. A common problem faced during this decomposition is that even though the given matrix may be very sparse, the decompo- sition may lead to a denser triangular factors due to fill-in. A significant fill-in may lead to prohibitively larger computational costs and memory requirement during decomposition as well as during the solve phase. To this end, several heuristic sparse matrix reordering methods have been proposed to reduce fill-in before the decomposition. However, finding an optimal reordering algorithm that leads to minimal fill-in during such de- composition is known to be a NP-hard problem. A reinforcement learning based approach is proposed for this problem. The sparse matrix reorder- ing problem is formulated as a single player game. More specifically, Monte-Carlo tree search in combination with neural network is used as a decision making algorithm to search for the best move in our game. The proposed method, Alpha Elimination is found to produce significantly lesser non-zeros in the LU decomposition as compared to existing state- of-the-art heuristic algorithms with little to no increase in overall running time of the algorithm. The code for the project is publicly available 1. Keywords: Reinforcement Learning · Sparse Matrices · Deep Learning · LU · MCTS

Abstract

Extreme multi-label (XML) classification refers to the task of supervised multi-label learning that involves a large number of labels. Hence, scalability of the classifier with increasing label dimension is an important consideration. In this paper, we develop a method called LightDXML which modifies the recently developed deep learning based XML framework by using label embeddings instead of feature embedding for negative sampling and iterating cyclically through three major phases: (1) proxy training of label embeddings (2) shortlisting of labels for negative sampling and (3) final classifier training using the negative samples. Consequently, LightDXML also removes the requirement of a re-ranker module, thereby, leading to further savings on time and memory requirements. The proposed method achieves the best of both worlds: while the training time, model size and prediction times are on par or better compared to the tree-based methods, it attains much better prediction accuracy that is on par with the deep learning based methods. Moreover, the proposed approach achieves the best tail-label prediction accuracy over most state-of-the-art XML methods on some of the large datasets1 . Code: https://github.com/misterpawan/ LightDXML

Abstract

In our work, we propose a novel yet simple approach to obtain an adaptive learning rate for gradient-based descent methods on classification tasks. Instead of the traditional approach of selecting adaptive learning rates via the decayed expectation of gradient-based terms, we use the angle between the current gradient and the new gradient: this new gradient is computed from the direction orthogonal to the current gradient, which further helps us in determining a better adaptive learning rate based on angle history, thereby, leading to relatively better accuracy compared to the existing state-of-the-art optimizers. On a wide variety of benchmark datasets with prominent image classification architectures such as ResNet, DenseNet, EfficientNet, and VGG, we find that our method leads to the highest accuracy in most of the datasets. Moreover, we prove that our method is convergent. Index Terms—Adam, Image Classification, Optimization, Angle, Gradient Descent, Neural Networks, ResNet