arXiv subjects

Anand Singh

Publications and source records attributed to Anand Singh.

11 recordsLinked to original sources

arXiv2026

Variable Importance Identification Through Lazy Training for Binary Classification

Deep neural networks have been widely used in many applications (e.g., computer vision and natural language processing); however, understanding their explainability remains a challenging task. Recently, substantial research has been devoted to improving the explainability of deep neural networks, with most of this work focusing on the regression framework. In this paper, we instead focus on the binary classification framework and adopt a variable-importance framework combined with the idea of lazy training to propose an efficient algorithm for identifying important features. From a theoretical perspective, our method relies on only a minimal set of assumptions and achieves well-controlled error rates. The validity of the proposed method and algorithm is examined through extensive simulation studies and real-data applications.

stat.ML↗

arXiv2026

Reading Speed, Image Quality Ratings, and Comfort Ratings in Augmented Reality

The rendering and display of text is a key use-case for augmented reality (AR). Here, we present the Read-AR, a dataset of reading in AR, for which we collected over 11,000 reading speeds and almost 6000 visual quality and comfort ratings across over 80 different experiment conditions on the same experiment set-up. The consistent, controlled set-up enables the dataset to function as a reference for benchmarking the quality of different AR headset architectures.

cs.HC↗

arXiv2026

Backend-agnostic Julia framework for 3D modeling and inversion of gravity data

This paper presents a high-performance framework for three-dimensional gravity modeling and inversion implemented in Julia, addressing key computational challenges associated with gravity inversion, including large scale problem, ill-posedness, and non-uniqueness. The framework employs a data-space inversion formulation that reduces the dimensionality of the inverse problem, resulting in lower memory requirements and improved computational efficiency. Forward modeling and inversion operators are implemented using a backend-agnostic kernel abstraction, allowing the same computational code to run on multicore CPUs and GPU accelerators. Performance evaluations using NVIDIA CUDA GPUs show significant reductions in computational time relative to CPU execution, particularly for large-scale problems involving up to approximately 3.3 million rectangular prisms and 178,797 gravity observations. The inversion incorporates implicit model constraints through the data-space formulation and depth-weighted sensitivity, which reduces the effect of depth-dependent amplitude decay and promotes geologically coherent density models. Synthetic experiments demonstrate the capability of the framework to recover complex subsurface structures, including vertical and dipping dykes. Application to field gravity data further demonstrates the practical applicability of the proposed approach, with the recovered density distributions showing good agreement with independent geological constraints and previous interpretations. The results demonstrate that GPU-accelerated Julia provides an efficient and extensible platform for large-scale three-dimensional gravity modeling and inversion, enabling high-resolution geophysical investigations with reduced computational and memory requirements.

physics.geo-ph↗

arXiv2025

Three-dimensional inversion of gravity data using implicit neural representations and scientific machine learning

Inversion of gravity data is an important method for investigating subsurface density variations relevant to mineral exploration, geothermal assessment, carbon storage, natural hydrogen, groundwater resources, and tectonic evolution. Here we present a scientific machine-learning approach for three-dimensional gravity inversion that represents subsurface density as a continuous field using an implicit neural representation (INR). The method trains a deep neural network directly through a physics-based forward-model loss, mapping spatial coordinates to a continuous density field without predefined meshes or discretisation. Spatial encoding enhances the network's capacity to capture sharp contrasts and short-wavelength features that conventional coordinate-based networks tend to oversmooth due to spectral bias. We demonstrate the approach on synthetic examples including smooth models, representing realistic geological complexity, and a dipping block model to assess recovery of structures at different depths. The INR framework reconstructs detailed structure and geologically plausible boundaries without explicit regularisation or depth weighting, while reducing the number of inversion parameters as the problem size grows bigger. These results highlight the potential of implicit representations to enable scalable, flexible, and interpretable large-scale geophysical inversion. This framework could generalise to other geophysical methods and for joint/multiphysics inversion.

physics.geo-ph↗

arXiv2025

Range-Only Dynamic Output Feedback Controller for Safe and Secure Target Circumnavigation

The safety and security of robotic systems are paramount when navigating around a hostile target. This paper addresses the problem of circumnavigating an unknown target by a unicycle robot while ensuring it maintains a desired safe distance and remains within the sensing region around the target throughout its motion. The proposed control design methodology is based on the construction of a joint Lyapunov function that incorporates: (i) a quadratic potential function characterizing the desired target-circumnavigation objective, and (ii) a barrier Lyapunov function-based potential term to enforce safety and sensing constraints on the robot's motion. A notable feature of the proposed control design is its reliance exclusively on local range measurements between the robot and the target, realized using a dynamic output feedback controller that treats the range as the only observable output for feedback. Using the Lyapunov stability theory, we show that the desired equilibrium of the closed-loop system is asymptotically stable, and the prescribed safety and security constraints are met under the proposed controllers. We also obtain restrictive bounds on the post-design signals and provide both simulation and experimental results to validate the theoretical contributions.

eess.SY↗

arXiv2022

Shallow Water Bathymetry Survey using an Autonomous Surface Vehicle

Accurate and cost effective mapping of water bodies has an enormous significance for environmental understanding and navigation. However, the quantity and quality of information we acquire from such environmental features is limited by various factors, including cost, time, security, and the capabilities of existing data collection techniques. Measurement of water depth is an important part of such mapping, particularly in shallow locations that could provide navigational risk or have important ecological functions. Erosion and deposition at these locations, for example, due to storms and erosion, can cause rapid changes that require repeated measurements. In this paper, we describe a low-cost, resilient, unmanned autonomous surface vehicle for bathymetry data collection using side-scan sonar. We discuss the adaptation of equipment and sensors for the collection of navigation, control, and bathymetry data and also give an overview of the vehicle setup. This autonomous surface vehicle has been used to collect bathymetry from the Powai Lake in Mumbai, India.

eess.SY↗

arXiv2022

Deriving Surface Resistivity from Polarimetric SAR Data Using Dual-Input UNet

Traditional survey methods for finding surface resistivity are time-consuming and labor intensive. Very few studies have focused on finding the resistivity/conductivity using remote sensing data and deep learning techniques. In this line of work, we assessed the correlation between surface resistivity and Synthetic Aperture Radar (SAR) by applying various deep learning methods and tested our hypothesis in the Coso Geothermal Area, USA. For detecting the resistivity, L-band full polarimetric SAR data acquired by UAVSAR were used, and MT (Magnetotellurics) inverted resistivity data of the area were used as the ground truth. We conducted experiments to compare various deep learning architectures and suggest the use of Dual Input UNet (DI-UNet) architecture. DI-UNet uses a deep learning architecture to predict the resistivity using full polarimetric SAR data by promising a quick survey addition to the traditional method. Our proposed approach accomplished improved outcomes for the mapping of MT resistivity from SAR data.

physics.geo-ph↗

arXiv2019

Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms

The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach. Graph coloring is one of the essential fields to provide an efficient solution for combinatorial applications such as flight scheduling, frequency allocation in networking, and register allocation. In particular, some optimization algorithms have been proposed to solve the multi-coloring graph problems but most of the cases a simple searching method would be the best approach to find an optimal solution for graph coloring problems. However, this naive approach can increase the computation cost exponentially as the graph size and the number of colors increase. To mitigate such intolerable overhead, we investigate the methods to take the advantages of quantum computing properties to find a solution for multi-coloring graph problems in polynomial time. We utilize the variational quantum eigensolver (VQE) technique and quantum approximate optimization algorithm (QAOA) to find solutions for three combinatorial applications by both transferring each problem model to the corresponding Ising model and by using the calculated Hamiltonian matrices. Our results demonstrate that VQE and QAOA algorithms can find one of the best solutions for each application. Therefore, our modeling approach with hybrid quantum algorithms can be applicable for combinatorial problems in various fields to find an optimal solution in polynomial time.

quant-ph↗

arXiv2019

An Improved Implementation Approach for Quantum Phase Estimation on Quantum Computers

Quantum phase estimation (QPE) is one of the core algorithms for quantum computing. It has been extensively studied and applied in a variety of quantum applications such as the Shor's factoring algorithm, quantum sampling algorithms and the calculation of the eigenvalues of unitary matrices. The QPE algorithm has been combined with Kitaev's algorithm and the inverse quantum Fourier transform (IQFT) which are utilized as a fundamental component of such quantum algorithms. In this paper, we explore the computational challenges of implementing QPE algorithms on noisy intermediate-scale quantum (NISQ) machines using the IBM Q Experience (e.g., the IBMQX4, 5-qubit quantum computing hardware platform). Our experimental results indicate that the accuracy of finding the phase using these QPE algorithms is severely constrained by the NISQ computer's physical characteristics such as coherence time and error rates. To mitigate these physical limitations, we propose implementing a modified solution by reducing the number of controlled rotation gates and phase shift operations, thereby increasing the accuracy of the finding phase in near-term quantum computers.

quant-ph↗

arXiv2019

Learning compositionally through attentive guidance

While neural network models have been successfully applied to domains that require substantial generalisation skills, recent studies have implied that they struggle when solving the task they are trained on requires inferring its underlying compositional structure. In this paper, we introduce Attentive Guidance, a mechanism to direct a sequence to sequence model equipped with attention to find more compositional solutions. We test it on two tasks, devised precisely to assess the compositional capabilities of neural models, and we show that vanilla sequence to sequence models with attention overfit the training distribution, while the guided versions come up with compositional solutions that fit the training and testing distributions almost equally well. Moreover, the learned solutions generalise even in cases where the training and testing distributions strongly diverge. In this way, we demonstrate that sequence to sequence models are capable of finding compositional solutions without requiring extra components. These results helps to disentangle the causes for the lack of systematic compositionality in neural networks, which can in turn fuel future work.

cs.CL↗

arXiv2019

Experimental Challenges of Implementing Quantum Phase Estimation Algorithms on IBM Quantum Computer

Many researchers have been heavily investigated on quantum phase estimation (QPE) algorithms to find the unknown phase, since QPE is the core building block of the most quantum algorithms such as the Shor's factoring algorithm, quantum sampling algorithms, and finding the eigenvalues of unitary matrices. Kitaev's algorithm and QPE algorithms using inverse Quantum Fourier transform were proposed and widely used by researchers as a key component for their quantum algorithms. In this paper, we explore the experimental challenges of QPE algorithms on Noisy Intermediate-Scale Quantum (NISQ) computers by implementing various QPE algorithms on the state-of-the-art IBM quantum computer. Our experimental results demonstrate that the accuracy of finding the phase using these algorithms are severely constrained by NISQ's physical characteristics such as coherence time and error rates. To mitigate such physical limitations, we propose modified solutions of these algorithms by reducing the number of control gates and phase shift operations. Our experimental results showed that our solutions can significantly increase the accuracy of the finding phase in near-term quantum computers.

quant-ph↗