arXiv subjects

Anirban Chakraborty

Publications and source records attributed to Anirban Chakraborty.

At least 37 records · Page 2Linked to original sources

arXiv2025

Probing Reionization-Era Galaxies with JWST UV Luminosity Functions and Large-Scale Clustering

JWST has transformed our understanding of early galaxy formation, providing an unprecedented view of the first billion years of cosmic history. In this work, we build upon our previously developed semi-analytical framework that self-consistently models the evolving UVLF of galaxies and the global reionization history while incorporating the effects of radiative feedback. Comparing our predictions with JWST and HST data, we identify a fundamental tension: models that match the UVLF fail to reproduce the observed evolution of galaxy clustering (bias) with redshift, and vice versa. To resolve this, we introduce a redshift- and mass-dependent duty cycle linked to the duration of star formation. This duty cycle increases towards higher redshifts, requiring either an enhanced production of UV radiation or increased star formation efficiency at z>10 to match the JWST UVLFs, but declines at lower redshifts (5<z<=9) and towards low-mass halos to remain consistent with the bias and HST UVLF measurements. Reconciling theory with observations requires the characteristic star formation timescale to be longer in massive halos, and to decrease with redshift at fixed halo mass, evolving from ~ 85 Myr at z=6 to ~ 45 Myr at z=14 for $10^{10} M_\odot$ halos. Finally, our extended model, assuming a halo mass-dependent escaping ionizing efficiency ($\varepsilon_{\rm esc} \equiv f_{\rm esc} \times ξ_{\rm ion}$), whose population-averaged value gradually increases with redshift and corresponds to $\langle f_{\rm esc} \rangle \sim$ 15% at z=5 for a fixed value of $ξ_{\rm ion} = 10^{25.23}$ erg$^{-1}$ Hz across all galaxies, produces a reionization history consistent with current constraints. These findings underscore the importance of jointly constraining high-redshift galaxy models using both UVLF and bias statistics to accurately interpret JWST data and refine our understanding of early cosmic evolution.

astro-ph.GA↗

arXiv2025

The Urban Vision Hackathon Dataset and Models: Towards Image Annotations and Accurate Vision Models for Indian Traffic

This report describes the UVH-26 dataset, the first public release by AIM@IISc of a large-scale dataset of annotated traffic-camera images from India. The dataset comprises 26,646 high-resolution (1080p) images sampled from 2800 Bengaluru's Safe-City CCTV cameras over a 4-week period, and subsequently annotated through a crowdsourced hackathon involving 565 college students from across India. In total, 1.8 million bounding boxes were labeled across 14 vehicle classes specific to India: Cycle, 2-Wheeler (Motorcycle), 3-Wheeler (Auto-rickshaw), LCV (Light Commercial Vehicles), Van, Tempo-traveller, Hatchback, Sedan, SUV, MUV, Mini-bus, Bus, Truck and Other. Of these, 283k-316k consensus ground truth bounding boxes and labels were derived for distinct objects in the 26k images using Majority Voting and STAPLE algorithms. Further, we train multiple contemporary detectors, including YOLO11-S/X, RT-DETR-S/X, and DAMO-YOLO-T/L using these datasets, and report accuracy based on mAP50, mAP75 and mAP50:95. Models trained on UVH-26 achieve 8.4-31.5% improvements in mAP50:95 over equivalent baseline models trained on COCO dataset, with RT-DETR-X showing the best performance at 0.67 (mAP50:95) as compared to 0.40 for COCO-trained weights for common classes (Car, Bus, and Truck). This demonstrates the benefits of domain-specific training data for Indian traffic scenarios. The release package provides the 26k images with consensus annotations based on Majority Voting (UVH-26-MV) and STAPLE (UVH-26-ST) and the 6 fine-tuned YOLO and DETR models on each of these datasets. By capturing the heterogeneity of Indian urban mobility directly from operational traffic-camera streams, UVH-26 addresses a critical gap in existing global benchmarks, and offers a foundation for advancing detection, classification, and deployment of intelligent transportation systems in emerging nations with complex traffic conditions.

cs.CV↗

arXiv2025

Capturing Small-Scale Reionization Physics: A Sub-Grid Model for Photon Sinks with SCRIPT

The epoch of reionization represents a major phase transition in cosmic history, during which the first luminous sources ionized the intergalactic medium (IGM). However, the small-scale physics governing ionizing photon sinks - particularly the interplay between recombinations, photon propagation, and self-shielded regions - remains poorly understood. Accurately modeling these processes requires a framework that self-consistently links ionizing emissivity, the clumping factor, mean free path, and photoionization rate. In this work, we extend the photon-conserving semi-numerical framework, SCRIPT, by introducing a self-consistent sub-grid model that dynamically connects these quantities to the underlying density field, enabling a more realistic treatment of inhomogeneous recombinations and photon sinks. We validate our model against a comprehensive set of observational constraints, including the UV luminosity function from HST and JWST, CMB optical depth from Planck, and Lyman-$α$ forest measurements of the IGM temperature, photoionization rate, and mean free path. Our fiducial model also successfully reproduces Lyman-$α$ opacity fluctuations, reinforcing its ability to capture large-scale inhomogeneities in the reionization process. Notably, we demonstrate that traditionally independent parameters, such as the clumping factor and mean free path, are strongly correlated, with implications for the timing, morphology, and thermal evolution of reionization. Looking ahead, we will extend this framework to include machine learning-based parameter inference. With upcoming 21cm experiments poised to provide unprecedented insights, SCRIPT offers a powerful computational tool for interpreting high-redshift observations and refining our understanding of the last major phase transition in the universe.

astro-ph.CO↗

arXiv2025

Addendum: Systematic Evaluation of Randomized Cache Designs against Cache Occupancy

In the main text published at USENIX Security 2025, we presented a systematic analysis of the role of cache occupancy in the design considerations for randomized caches (from the perspectives of performance and security). On the performance front, we presented a uniform benchmarking strategy that allows for a fair comparison among different randomized cache designs. Likewise, from the security perspective, we presented three threat assumptions: (1) covert channels; (2) process fingerprinting side-channel; and (3) AES key recovery. The main takeaway of our work is an open problem of designing a randomized cache of comparable efficiency with modern set-associative LLCs, while still resisting both contention-based and occupancy-based attacks. This note is meant as an addendum to the main text in light of the observations made in [2]. To summarize, the authors in [2] argue that (1) L1d cache size plays a role in adversarial success, and that (2) a patched version of MIRAGE with randomized initial seeding of global eviction map prevents leakage of AES key. We discuss the same in this addendum.

cs.CR↗

arXiv2025

Optimizing Federated Learning for Scalable Power-demand Forecasting in Microgrids

Real-time monitoring of power consumption in cities and micro-grids through the Internet of Things (IoT) can help forecast future demand and optimize grid operations. But moving all consumer-level usage data to the cloud for predictions and analysis at fine time scales can expose activity patterns. Federated Learning~(FL) is a privacy-sensitive collaborative DNN training approach that retains data on edge devices, trains the models on private data locally, and aggregates the local models in the cloud. But key challenges exist: (i) clients can have non-independently identically distributed~(non-IID) data, and (ii) the learning should be computationally cheap while scaling to 1000s of (unseen) clients. In this paper, we develop and evaluate several optimizations to FL training across edge and cloud for time-series demand forecasting in micro-grids and city-scale utilities using DNNs to achieve a high prediction accuracy while minimizing the training cost. We showcase the benefit of using exponentially weighted loss while training and show that it further improves the prediction of the final model. Finally, we evaluate these strategies by validating over 1000s of clients for three states in the US from the OpenEIA corpus, and performing FL both in a pseudo-distributed setting and a Pi edge cluster. The results highlight the benefits of the proposed methods over baselines like ARIMA and DNNs trained for individual consumers, which are not scalable.

cs.DC↗

arXiv2025

Age-stratified clustering of multiple long-term conditions

Background: Most people with any long-term condition have multiple long-term conditions, but our understanding of how conditions cluster is limited. Many clustering studies identify clusters in the whole population, but the clusters that occur in people of different ages may be distinct. The aim of this paper was to explore similarities and differences in clusters found in different age-groups. Method: We present a method for finding similar clusters in multiple age-groups, referred to as cluster sets, using Latent Class Analysis (LCA) and Chebyshev distance metric. We analyse a primary care electronic health record (EHR) dataset recording the presence of 40 long-term conditions (LTCs) in 570,355 people aged 40-99 years with at least one of these conditions, analysing in five-year age-groups. Findings: We find that the 600 clusters found separately in 12 age-strata can be summarised by 342 cluster sets with 263 cluster sets only being found in a single age-group (singleton cluster sets), and 79 cluster sets being present in multiple age-groups. We observe that 31 conditions of the 40 conditions studied appear in cluster sets with the respective condition being the only condition present with a very high prevalence of more than 0.9 whereas the remaining cluster sets typically contain two to four conditions present with a high prevalence of more than 0.7. Interpretation: Multimorbidity profiles in different age-groups are often distinct (singleton cluster sets observed only in that age-group), but similar clusters with small variations in their composition are also found in multiple age-groups. This demonstrates the age dependency of MLTC clusters and presents a case for age-stratified clustering.

stat.AP↗

arXiv2025

Reionization and its sources

Reionization represents an important phase in the history of our Universe when ultraviolet radiation from the first luminous sources, primarily stars and accreting black holes, ionized the neutral hydrogen atoms in the intergalactic medium (IGM). This process follows the ``Dark Ages'', a period with no luminous sources, and is initiated by the formation of the first sources, marking the ``Cosmic Dawn''. Reionization proceeds through multiple stages: initially, ionized bubbles form around galaxies, then expand and overlap across the IGM, culminating in a fully ionized state, with neutral hydrogen remaining only in dense regions. Understanding reionization involves a diverse range of physical concepts, from large-scale structure formation and star formation to radiation propagation through the IGM. Observationally, reionization can be explored using the cosmic microwave background (CMB), Lyman-$α$ absorption, high-redshift galaxy surveys, and emerging 21~cm experiments, which together offer invaluable insights into this transformative epoch.

astro-ph.CO↗

arXiv2025

Learning non-Gaussian spatial distributions via Bayesian transport maps with parametric shrinkage

Many applications, including climate-model analysis and stochastic weather generators, require learning or emulating the distribution of a high-dimensional and non-Gaussian spatial field based on relatively few training samples. To address this challenge, a recently proposed Bayesian transport map (BTM) approach consists of a triangular transport map with nonparametric Gaussian-process (GP) components, which is trained to transform the distribution of interest distribution to a Gaussian reference distribution. To improve the performance of this existing BTM, we propose to shrink the map components toward a ``base'' parametric Gaussian family combined with a Vecchia approximation for scalability. The resulting ShrinkTM approach is more accurate than the existing BTM, especially for small numbers of training samples. It can even outperform the ``base'' family when trained on a single sample of the spatial field. We demonstrate the advantage of ShrinkTM though numerical experiments on simulated data and on climate-model output.

stat.CO↗

arXiv2025

Systematic Evaluation of Randomized Cache Designs against Cache Occupancy

Randomizing the address-to-set mapping and partitioning of the cache has been shown to be an effective mechanism in designing secured caches. Several designs have been proposed on a variety of rationales: (1) randomized design, (2) randomized-and-partitioned design, and (3) psuedo-fully associative design. This work fills in a crucial gap in current literature on randomized caches: currently most randomized cache designs defend only contention-based attacks, and leave out considerations of cache occupancy. We perform a systematic evaluation of 5 randomized cache designs- CEASER, CEASER-S, MIRAGE, Scatter-Cache, and Sass-cache against cache occupancy wrt. both performance as well as security. With respect to performance, we first establish that benchmarking strategies used by contemporary designs are unsuitable for a fair evaluation (because of differing cache configurations, choice of benchmarking suites, additional implementation-specific assumptions). We thus propose a uniform benchmarking strategy, which allows us to perform a fair and comparative analysis across all designs under various replacement policies. Likewise, with respect to security against cache occupancy attacks, we evaluate the cache designs against various threat assumptions: (1) covert channels, (2) process fingerprinting, and (3) AES key recovery (to the best of our knowledge, this work is the first to demonstrate full AES key recovery on a randomized cache design using cache occupancy attack). Our results establish the need to also consider cache occupancy side-channel in randomized cache design considerations.

cs.CR↗

arXiv2024

Pose-Transformation and Radial Distance Clustering for Unsupervised Person Re-identification

Person re-identification (re-ID) aims to tackle the problem of matching identities across non-overlapping cameras. Supervised approaches require identity information that may be difficult to obtain and are inherently biased towards the dataset they are trained on, making them unscalable across domains. To overcome these challenges, we propose an unsupervised approach to the person re-ID setup. Having zero knowledge of true labels, our proposed method enhances the discriminating ability of the learned features via a novel two-stage training strategy. The first stage involves training a deep network on an expertly designed pose-transformed dataset obtained by generating multiple perturbations for each original image in the pose space. Next, the network learns to map similar features closer in the feature space using the proposed discriminative clustering algorithm. We introduce a novel radial distance loss, that attends to the fundamental aspects of feature learning - compact clusters with low intra-cluster and high inter-cluster variation. Extensive experiments on several large-scale re-ID datasets demonstrate the superiority of our method compared to state-of-the-art approaches.

cs.CV↗

arXiv2024

Modelling the star-formation activity and ionizing properties of high-redshift galaxies

Early results from the JWST observations have reported a surprisingly high number of UV-bright galaxies at $z \geq 10$, which appears to challenge the theoretical predictions from standard galaxy formation models in the $Λ$CDM framework at these redshifts. To alleviate this tension, several cosmological and astrophysical interpretations have been advanced. However, all of these proposed scenarios carry noteworthy consequences for other large-scale processes in the early Universe, particularly cosmic reionization, since high-redshift galaxies are believed to be the primary ionizing sources during the Epoch of Reionization (EoR). To investigate this, we introduce a semi-analytical model of galaxy formation and evolution that explains the evolving galaxy UV luminosity function (UVLF) over $6 \lesssim z \lesssim 15$, and also jointly tracks the time evolution of the globally averaged neutral hydrogen fraction in the intergalactic medium. The model self-consistently accounts for the suppression of star formation in low-mass galaxies due to reionization feedback and is constrained by comparing the model predictions with various observational probes like the UVLF data from HST and JWST, recent measurements of the neutral hydrogen fraction, and the CMB scattering optical depth. Our analysis confirms that a rapid enhancement in the star-formation rate efficiency and/or UV luminosity per stellar mass formed is necessary for consistency with the JWST UVLF estimates at $z \geq 10$. We further find that it is possible to jointly satisfy the current reionization constraints when the escape fraction is assumed to be halo-mass dependent, requiring higher Lyman-continuum leakage from low-mass galaxies. We also examine the relative contribution of galaxies with different UV luminosities towards the ionizing photon budget for the EoR and investigate the large-scale bias of high-$z$ galaxies.

astro-ph.GA↗

arXiv2024

Improving Domain Adaptation Through Class Aware Frequency Transformation

In this work, we explore the usage of the Frequency Transformation for reducing the domain shift between the source and target domain (e.g., synthetic image and real image respectively) towards solving the Domain Adaptation task. Most of the Unsupervised Domain Adaptation (UDA) algorithms focus on reducing the global domain shift between labelled source and unlabelled target domains by matching the marginal distributions under a small domain gap assumption. UDA performance degrades for the cases where the domain gap between source and target distribution is large. In order to bring the source and the target domains closer, we propose a novel approach based on traditional image processing technique Class Aware Frequency Transformation (CAFT) that utilizes pseudo label based class consistent low-frequency swapping for improving the overall performance of the existing UDA algorithms. The proposed approach, when compared with the state-of-the-art deep learning based methods, is computationally more efficient and can easily be plugged into any existing UDA algorithm to improve its performance. Additionally, we introduce a novel approach based on absolute difference of top-2 class prediction probabilities (ADT2P) for filtering target pseudo labels into clean and noisy sets. Samples with clean pseudo labels can be used to improve the performance of unsupervised learning algorithms. We name the overall framework as CAFT++. We evaluate the same on the top of different UDA algorithms across many public domain adaptation datasets. Our extensive experiments indicate that CAFT++ is able to achieve significant performance gains across all the popular benchmarks.

cs.CV↗

arXiv2024

Multimodal Query-guided Object Localization

Consider a scenario in one-shot query-guided object localization where neither an image of the object nor the object category name is available as a query. In such a scenario, a hand-drawn sketch of the object could be a choice for a query. However, hand-drawn crude sketches alone, when used as queries, might be ambiguous for object localization, e.g., a sketch of a laptop could be confused for a sofa. On the other hand, a linguistic definition of the category, e.g., a small portable computer small enough to use in your lap" along with the sketch query, gives better visual and semantic cues for object localization. In this work, we present a multimodal query-guided object localization approach under the challenging open-set setting. In particular, we use queries from two modalities, namely, hand-drawn sketch and description of the object (also known as gloss), to perform object localization. Multimodal query-guided object localization is a challenging task, especially when a large domain gap exists between the queries and the natural images, as well as due to the challenge of combining the complementary and minimal information present across the queries. For example, hand-drawn crude sketches contain abstract shape information of an object, while the text descriptions often capture partial semantic information about a given object category. To address the aforementioned challenges, we present a novel cross-modal attention scheme that guides the region proposal network to generate object proposals relevant to the input queries and a novel orthogonal projection-based proposal scoring technique that scores each proposal with respect to the queries, thereby yielding the final localization results. ...

cs.CV↗

arXiv2024

Shesha: Multi-head Microarchitectural Leakage Discovery in new-generation Intel Processors

Transient execution attacks have been one of the widely explored microarchitectural side channels since the discovery of Spectre and Meltdown. However, much of the research has been driven by manual discovery of new transient paths through well-known speculative events. Although a few attempts exist in literature on automating transient leakage discovery, such tools focus on finding variants of known transient attacks and explore a small subset of instruction set. Further, they take a random fuzzing approach that does not scale as the complexity of search space increases. In this work, we identify that the search space of bad speculation is disjointedly fragmented into equivalence classes, and then use this observation to develop a framework named Shesha, inspired by Particle Swarm Optimization, which exhibits faster convergence rates than state-of-the-art fuzzing techniques for automatic discovery of transient execution attacks. We then use Shesha to explore the vast search space of extensions to the x86 Instruction Set Architecture (ISAs), thereby focusing on previously unexplored avenues of bad speculation. As such, we report five previously unreported transient execution paths in Instruction Set Extensions (ISEs) on new generation of Intel processors. We then perform extensive reverse engineering of each of the transient execution paths and provide root-cause analysis. Using the discovered transient execution paths, we develop attack building blocks to exhibit exploitable transient windows. Finally, we demonstrate data leakage from Fused Multiply-Add instructions through SIMD buffer and extract victim data from various cryptographic implementations.

cs.CR↗

arXiv2024

Sketch-guided Image Inpainting with Partial Discrete Diffusion Process

In this work, we study the task of sketch-guided image inpainting. Unlike the well-explored natural language-guided image inpainting, which excels in capturing semantic details, the relatively less-studied sketch-guided inpainting offers greater user control in specifying the object's shape and pose to be inpainted. As one of the early solutions to this task, we introduce a novel partial discrete diffusion process (PDDP). The forward pass of the PDDP corrupts the masked regions of the image and the backward pass reconstructs these masked regions conditioned on hand-drawn sketches using our proposed sketch-guided bi-directional transformer. The proposed novel transformer module accepts two inputs -- the image containing the masked region to be inpainted and the query sketch to model the reverse diffusion process. This strategy effectively addresses the domain gap between sketches and natural images, thereby, enhancing the quality of inpainting results. In the absence of a large-scale dataset specific to this task, we synthesize a dataset from the MS-COCO to train and extensively evaluate our proposed framework against various competent approaches in the literature. The qualitative and quantitative results and user studies establish that the proposed method inpaints realistic objects that fit the context in terms of the visual appearance of the provided sketch. To aid further research, we have made our code publicly available at https://github.com/vl2g/Sketch-Inpainting .

cs.CV↗

arXiv2024

Data-free Defense of Black Box Models Against Adversarial Attacks

Several companies often safeguard their trained deep models (i.e., details of architecture, learnt weights, training details etc.) from third-party users by exposing them only as black boxes through APIs. Moreover, they may not even provide access to the training data due to proprietary reasons or sensitivity concerns. In this work, we propose a novel defense mechanism for black box models against adversarial attacks in a data-free set up. We construct synthetic data via generative model and train surrogate network using model stealing techniques. To minimize adversarial contamination on perturbed samples, we propose 'wavelet noise remover' (WNR) that performs discrete wavelet decomposition on input images and carefully select only a few important coefficients determined by our 'wavelet coefficient selection module' (WCSM). To recover the high-frequency content of the image after noise removal via WNR, we further train a 'regenerator' network with an objective to retrieve the coefficients such that the reconstructed image yields similar to original predictions on the surrogate model. At test time, WNR combined with trained regenerator network is prepended to the black box network, resulting in a high boost in adversarial accuracy. Our method improves the adversarial accuracy on CIFAR-10 by 38.98% and 32.01% on state-of-the-art Auto Attack compared to baseline, even when the attacker uses surrogate architecture (Alexnet-half and Alexnet) similar to the black box architecture (Alexnet) with same model stealing strategy as defender. The code is available at https://github.com/vcl-iisc/data-free-black-box-defense

cs.LG↗

arXiv2024

Realization of a Spin Glass in a two-dimensional van der Waals material

Recent advances in van der Waals (vdW) materials have sparked renewed interest in the impact of dimensionality on magnetic phase transitions. While ordered magnetic phases have been demonstrated to survive in the two-dimensional (2D) limit, the quest for a spin-glass with quenched magnetic disorder in lower dimensions has proven elusive. Here we show evidence of a spin-glass emerging from randomly distributed Fe atoms in Fe3GeTe2, the first time such a state has been reported in a vdW material. AC magnetic susceptibility displays a strong frequency dependence indicative of slow spin dynamics. Additional distinctive phenomena, including ageing, chaos, and memory effects, further substantiate the existence of a glassy state. Remarkably, we find that this state persists even in single-unit-cell thick Fe3GeTe2, thereby confirming the existence of a 2D spin-glass. The formation of spin-glass states via intercalation in vdW systems allows for highly tunable spin-glass states that are otherwise difficult to realize.

cond-mat.mes-hall↗

arXiv2023

Scalable Model-Based Gaussian Process Clustering

Gaussian process is an indispensable tool in clustering functional data, owing to it's flexibility and inherent uncertainty quantification. However, when the functional data is observed over a large grid (say, of length $p$), Gaussian process clustering quickly renders itself infeasible, incurring $O(p^2)$ space complexity and $O(p^3)$ time complexity per iteration; and thus prohibiting it's natural adaptation to large environmental applications. To ensure scalability of Gaussian process clustering in such applications, we propose to embed the popular Vecchia approximation for Gaussian processes at the heart of the clustering task, provide crucial theoretical insights towards algorithmic design, and finally develop a computationally efficient expectation maximization (EM) algorithm. Empirical evidence of the utility of our proposal is provided via simulations and analysis of polar temperature anomaly (\href{https://www.ncei.noaa.gov/access/monitoring/climate-at-a-glance/global/time-series}{noaa.gov}) data-sets.

stat.CO↗