SearcharxivSearch

arXiv subjects

Ayan Biswas

Publications and source records attributed to Ayan Biswas.

At least 19 recordsLinked to original sources

Do Physics Foundation Models Learn Generalizable Physics? A Bias-Aware Benchmark Across Physical Regimes and Distribution Shifts

Recent physics foundation models claim general spatiotemporal forecasting ability, yet their evaluations often collapse performance into a single average score under a fixed training distribution. This makes it difficult to determine whether a model has learned generalizable physical dynamics or only performs well under particular settings. We construct a benchmark with 8 physical dynamics, 3 training-data mixtures, and 25 test regimes induced by dynamic-scale and initial-condition complexity shifts, covering in-distribution, distribution-shift, and out-of-distribution settings. We evaluate five physics foundation model architectures and four model variants per architecture (scratch and three pretrained sizes), resulting in 60,000 measurements. Our results show that current physics foundation models behave as conditional rather than universal generalists: their generality depends on the physical regime, temporal scale, initial-condition setting, pretraining, model size, and architecture. Improving the training data distribution only partially mitigates this limitation. Pretraining and scaling are also unable to reliably remove their ability biases. We argue that improving physics foundation models requires moving beyond scaling models or expanding data, toward learning mechanisms that better capture transferable physical knowledge across regimes, temporal scales, and distribution shifts.

cs.LG

DiffUNet^2: Bidirectional Prediction, Probabilistic Generation and Collaborative Visual Discovery for Scientific Data

Modeling temporal evolution is important to analyzing and reasoning about scientific phenomena, yet most machine learning methods provide deterministic forward predictions that overlook multiple plausible outcomes and rarely support backward reasoning, limiting their usefulness in practical scientific workflows. We present a framework that integrates diffusion-based generative modeling with interactive visual analytics for scientific exploration. We introduce DiffUNet^2, a conditional diffusion model that enables bidirectional, any-to-any generation across time and captures distributions of plausible system evolutions. Built upon the model, our interactive system supports branching timeline exploration, user-guided state editing, and probability-space navigation, enabling scientists to actively explore alternative hypotheses rather than passively observe predictions. We evaluate the model on 5 datasets across different scientific domains to validate its predictive accuracy and probability-space ensemble quality. In collaboration with domain experts, we demonstrate the effectiveness of our approach in supporting practical scientific temporal data analysis workflows. By integrating modeling and visual interaction, our approach enables scientists to interactively explore system dynamics, transforming generative models into tools for hypothesis-driven scientific analysis.

cs.HC

GMRT Survey of Radio Emission from Magnetic Massive Stars -- I: Emission from Single Stars at sub-GHz Frequencies

With the growing subset of magnetic massive stars, it is now possible to conduct a systematic survey of radio emission from magnetic hot stars to better understand the underlying emission mechanisms. Previous surveys of radio emission from hot star magnetospheres have focused on high frequencies ($>$2 GHz). At lower frequencies, additional emission and absorption mechanisms are expected, increasing the complexity of the observed emission. In this work, we survey towards lower frequencies while also increasing the sample size. We report the study of 28 magnetic hot stars with the Giant Metrewave Radio Telescope (GMRT) during cycles 27 and 28 of its operation. Among these, we found 11 detections and 17 non-detections. We also include 16 additional targets observed with GMRT from the literature. We investigated the dependence of low-frequency radio luminosity on different stellar parameters and searched for a scaling relationship at low frequencies. We further test the centrifugal breakout model for gyrosynchrotron emission. The observed low-frequency radio luminosities show a clear dependence of radio emission on magnetic field strength and rotation period, consistent with high-frequency studies. We observe a trend in scaling relationships with frequency and comment on the statistical behavior of gyrosynchrotron spectra. The observed low-frequency behavior likely reflects a combination of free-free absorption and the location of the low-frequency turnover in the gyrosynchrotron spectrum, which may vary among stars depending on their magnetospheric properties and can suppress detectable sub-GHz emission. One of the detected stars, HD 37742, is the first magnetic O-type star detected at sub-GHz frequencies.

astro-ph.SR

Out-of-distribution transfer of PDE foundation models to material dynamics under extreme loading

Most PDE foundation models are pretrained and fine-tuned on fluid-centric benchmarks. Their utility under extreme-loading material dynamics remains unclear. We benchmark out-of-distribution transfer on two discontinuity-dominated regimes in which shocks, evolving interfaces, and fracture produce highly non-smooth fields: shock-driven multi-material interface dynamics (perturbed layered interface or PLI) and dynamic fracture/failure evolution (FRAC). We formulate the downstream task as terminal-state prediction, i.e., learning a long-horizon map that predicts the final state directly from the first snapshot without intermediate supervision. Using a unified training and evaluation protocol, we evaluate two open-source pretrained PDE foundation models, POSEIDON and MORPH, and compare fine-tuning from pretrained weights against training from scratch across training-set sizes to quantify sample efficiency under distribution shift.

cs.LG

PDE foundation model-accelerated inverse estimation of system parameters in inertial confinement fusion

PDE foundation models are typically pretrained on large, diverse corpora of PDE datasets and can be adapted to new settings with limited task-specific data. However, most downstream evaluations focus on forward problems, such as autoregressive rollout prediction. In this work, we study an inverse problem in inertial confinement fusion (ICF): estimating system parameters (inputs) from multi-modal, snapshot-style observations (outputs). Using the open JAG benchmark, which provides hyperspectral X-ray images and scalar observables per simulation, we finetune the PDE foundation model and train a lightweight task-specific head to jointly reconstruct hyperspectral images and regress system parameters. The fine-tuned model achieves accurate hyperspectral reconstruction (test MSE 1.2e-3) and strong parameter-estimation performance (up to R^2=0.995). Data-scaling experiments (5%-100% of the training set) show consistent improvements in both reconstruction and regression losses as the amount of training data increases, with the largest marginal gains in the low-data regime. Finally, finetuning from pretrained MORPH weights outperforms training the same architecture from scratch, demonstrating that foundation-model initialization improves sample efficiency for data-limited inverse problems in ICF.

cs.LG

MORPH: PDE Foundation Models with Arbitrary Data Modality

We introduce MORPH, a modality-agnostic, autoregressive foundation model for partial differential equations (PDEs). MORPH is built on a convolutional vision transformer backbone that seamlessly handles heterogeneous spatiotemporal datasets of varying data modality (1D--3D) at different resolutions, and multiple fields with mixed scalar and vector components. The architecture combines (i) component-wise convolution, which jointly processes scalar and vector channels to capture local interactions, (ii) inter-field cross-attention, which models and selectively propagates information between different physical fields, (iii) axial attentions, which factorize full spatiotemporal self-attention along individual spatial and temporal axes to reduce computational burden while retaining expressivity. We pretrain multiple model variants on a diverse collection of heterogeneous PDE datasets and evaluate transfer to a range of downstream prediction tasks. Using both full-model fine-tuning and parameter-efficient low-rank adapters, MORPH outperforms models trained from scratch. Across extensive evaluations, MORPH matches or surpasses strong baselines and recent state-of-the-art models. Collectively, these capabilities present a flexible and powerful backbone for learning from the heterogeneous and multimodal nature of scientific observations, charting a path toward scalable and data-efficient scientific machine learning. The source code, datasets, and models are publicly available at https://github.com/lanl/MORPH.

cs.CV

The Truth, the Whole Truth, and Nothing but the Truth: Automatic Visualization Evaluation from Reconstruction Quality

Recent advances in AI enable the automatic generation of visualizations directly from textual prompts using agentic workflows. However, visualizations produced via one-shot generative methods often suffer from insufficient quality, typically requiring a human in the loop to refine the outputs. Human evaluation, though effective, is costly and impractical at scale. To alleviate this problem, we propose an automated metric that evaluates visualization quality without relying on extensive human-labeled datasets. Instead, our approach uses the original underlying data as implicit ground truth. Specifically, we introduce a method that measures visualization quality by assessing the reconstruction accuracy of the original data from the visualization itself. This reconstruction-based metric provides an autonomous and scalable proxy for thorough human evaluation, facilitating more efficient and reliable AI-driven visualization workflows.

cs.HC

Towards Reasoning for PDE Foundation Models: A Reward-Model-Driven Inference-Time-Scaling Algorithm

Partial Differential Equations (PDEs) are the bedrock for modern computational sciences and engineering, and inherently computationally expensive. While PDE foundation models have shown much promise for simulating such complex spatio-temporal phenomena, existing models remain constrained by the pretraining datasets and struggle with auto-regressive rollout performance, especially in out-of-distribution (OOD) cases. Furthermore, they have significant compute and training data requirements which hamper their use in many critical applications. Inspired by recent advances in ``thinking" strategies used in large language models (LLMs), we introduce the first test-time computing (TTC) strategy for PDEs that utilizes computational resources during inference to achieve more accurate predictions with fewer training samples and smaller models. We accomplish this with two types of reward models that evaluate predictions of a stochastic based model for spatio-temporal consistency. We demonstrate this method on compressible Euler-equation simulations from the PDEGym benchmark and show that TTC captures improved predictions relative to standard non-adaptive auto-regressive inference. This TTC framework marks a foundational step towards more advanced reasoning algorithms or PDE modeling, inluding building reinforcement-learning-based approaches, potentially transforming computational workflows in physics and engineering.

cs.LG

Discovery of a rapidly evolving global magnetic field in the M-dwarf YZ Cet and constraints on the magnetic field of its planet YZ Cet b

We present a spectropolarimetric study of the nearby M4.5V exoplanet host star YZ Cet, based on near-infrared observations obtained with the SpectroPolarimètre InfraRouge (SPIRou) at the Canada--France--Hawaii Telescope. We detect striking changes in the large-scale magnetic field strength and geometry over the course of just a few stellar rotations, a level of short-term global magnetic field evolution rarely reported in M dwarfs. We modeled the temporal variation of the longitudinal magnetic field using a Gaussian regression process, which allowed us to robustly determine the stellar rotation period and quantify the evolution timescale of the magnetic field. Independent Zeeman Doppler Imaging reconstructions of the two epochs confirm a significant reconfiguration of the star's global magnetic strength and topology. The detection of a weaker, complex, axisymmetric magnetic field (mean $|B| \sim 201$~G), which changes into a stronger, non-axisymmetric, dipole-dominated field (mean $|B| \sim 276$~G) over a few rotation cycles, is in contrast to results from similar fully convective M-dwarf stars. YZ Cet is known to exhibit polarized radio bursts potentially driven by auroral radio emission from star--planet interaction (SPI). By combining our magnetic maps with recent radio observations, we refine the constraints on the magnetic field strength of the innermost planet, YZ Cet b. These results underscore the importance of monitoring stellar magnetic variability to interpret multi-wavelength SPI signatures and to characterize the magnetospheres of potentially habitable exoplanets.

astro-ph.SR

Efficient Level-Crossing Probability Calculation for Gaussian Process Modeled Data

Almost all scientific data have uncertainties originating from different sources. Gaussian process regression (GPR) models are a natural way to model data with Gaussian-distributed uncertainties. GPR also has the benefit of reducing I/O bandwidth and storage requirements for large scientific simulations. However, the reconstruction from the GPR models suffers from high computation complexity. To make the situation worse, classic approaches for visualizing the data uncertainties, like probabilistic marching cubes, are also computationally very expensive, especially for data of high resolutions. In this paper, we accelerate the level-crossing probability calculation efficiency on GPR models by subdividing the data spatially into a hierarchical data structure and only reconstructing values adaptively in the regions that have a non-zero probability. For each region, leveraging the known GPR kernel and the saved data observations, we propose a novel approach to efficiently calculate an upper bound for the level-crossing probability inside the region and use this upper bound to make the subdivision and reconstruction decisions. We demonstrate that our value occurrence probability estimation is accurate with a low computation cost by experiments that calculate the level-crossing probability fields on different datasets.

stat.ML

SPUS: A Lightweight and Parameter-Efficient Foundation Model for PDEs

We introduce Small PDE U-Net Solver (SPUS), a compact and efficient foundation model (FM) designed as a unified neural operator for solving a wide range of partial differential equations (PDEs). Unlike existing state-of-the-art PDE FMs-primarily based on large complex transformer architectures with high computational and parameter overhead-SPUS leverages a lightweight residual U-Net-based architecture that has been largely underexplored as a foundation model architecture in this domain. To enable effective learning in this minimalist framework, we utilize a simple yet powerful auto-regressive pretraining strategy which closely replicates the behavior of numerical solvers to learn the underlying physics. SPUS is pretrained on a diverse set of fluid dynamics PDEs and evaluated across 6 challenging unseen downstream PDEs spanning various physical systems. Experimental results demonstrate that SPUS using residual U-Net based architecture achieves state-of-the-art generalization on these downstream tasks while requiring significantly fewer parameters and minimal fine-tuning data, highlighting its potential as a highly parameter-efficient FM for solving diverse PDE systems.

cs.CV

Implementation of a 8-bit Wallace Tree Multiplier

Wallace tree multipliers are a parallel digital multiplier architecture designed to minimize the worst-case time complexity of the circuit depth relative to the input size [1]. In particular, it seeks to perform long multiplication in the binary sense, reducing as many partial products per stage as possible through full and half adders circuits, achieving O(log(n)) where n = bit length of input. This paper provides an overview of the design, progress and methodology in the final project of ECE 55900, consisting of the schematic and layout of a Wallace tree 8-bit input multiplier on the gpdk45 technology in Cadence Virtuoso, as well as any design attempts prior to the final product. This also includes our endeavors in designing the final MAC (Multiply Accumulate) unit with undefined targets, which we chose to implement as a 16 bit combinational multiply-add.

cs.AR

System design and realisation towards optimising secure key bits in free space QKD

Quantum Key Distribution (QKD) is rapidly transitioning from cutting-edge laboratory research to real-world deployment in established communication networks. Although QKD promises future-proof security, practical challenges stil exist due to imperfections in physical devices. Many protocols offer strong security guarantees, but their implementation can be complex and difficult. To bridge this gap, we present a practical and systematic framework for implementing QKD, focused on the BB84 protocol but designed with broader applicability in mind. The article includes key concepts for device calibration, synchronisation,optical alignment, and key post-processing. We outline a simple algorithm for key sifting that is easily implementable in hardware. Our results highlight the importance of selecting the temporal window to optimise both the key rate and the quantum bit error rate (QBER). In addition, we show that random sampling of the sifted key bits for error estimation yields more reliable results than sequential sampling. We also integrate the Entrapped Pulse Coincidence Detection (EPCD) protocol to boost key generation rates, further enhancing performance. Although our work focuses on BB84, the techniques and practices outlined are general enough to support a wide range of QKD protocols. This makes our framework a valuable tool for both research and real-world deployment of secure quantum communication systems.

quant-ph

A Partitioned Sparse Variational Gaussian Process for Fast, Distributed Spatial Modeling

The next generation of Department of Energy supercomputers will be capable of exascale computation. For these machines, far more computation will be possible than that which can be saved to disk. As a result, users will be unable to rely on post-hoc access to data for uncertainty quantification and other statistical analyses and there will be an urgent need for sophisticated machine learning algorithms which can be trained in situ. Algorithms deployed in this setting must be highly scalable, memory efficient and capable of handling data which is distributed across nodes as spatially contiguous partitions. One suitable approach involves fitting a sparse variational Gaussian process (SVGP) model independently and in parallel to each spatial partition. The resulting model is scalable, efficient and generally accurate, but produces the undesirable effect of constructing discontinuous response surfaces due to the disagreement between neighboring models at their shared boundary. In this paper, we extend this idea by allowing for a small amount of communication between neighboring spatial partitions which encourages better alignment of the local models, leading to smoother spatial predictions and a better fit in general. Due to our decentralized communication scheme, the proposed extension remains highly scalable and adds very little overhead in terms of computation (and none, in terms of memory). We demonstrate this Partitioned SVGP (PSVGP) approach for the Energy Exascale Earth System Model (E3SM) and compare the results to the independent SVGP case.

cs.LG

VizGenie: Toward Self-Refining, Domain-Aware Workflows for Next-Generation Scientific Visualization

We present VizGenie, a self-improving, agentic framework that advances scientific visualization through large language model (LLM) by orchestrating of a collection of domain-specific and dynamically generated modules. Users initially access core functionalities--such as threshold-based filtering, slice extraction, and statistical analysis--through pre-existing tools. For tasks beyond this baseline, VizGenie autonomously employs LLMs to generate new visualization scripts (e.g., VTK Python code), expanding its capabilities on-demand. Each generated script undergoes automated backend validation and is seamlessly integrated upon successful testing, continuously enhancing the system's adaptability and robustness. A distinctive feature of VizGenie is its intuitive natural language interface, allowing users to issue high-level feature-based queries (e.g., ``visualize the skull"). The system leverages image-based analysis and visual question answering (VQA) via fine-tuned vision models to interpret these queries precisely, bridging domain expertise and technical implementation. Additionally, users can interactively query generated visualizations through VQA, facilitating deeper exploration. Reliability and reproducibility are further strengthened by Retrieval-Augmented Generation (RAG), providing context-driven responses while maintaining comprehensive provenance records. Evaluations on complex volumetric datasets demonstrate significant reductions in cognitive overhead for iterative visualization tasks. By integrating curated domain-specific tools with LLM-driven flexibility, VizGenie not only accelerates insight generation but also establishes a sustainable, continuously evolving visualization practice. The resulting platform dynamically learns from user interactions, consistently enhancing support for feature-centric exploration and reproducible research in scientific visualization.

cs.HC

Lost in OCR Translation? Vision-Based Approaches to Robust Document Retrieval

Retrieval-Augmented Generation (RAG) has become a popular technique for enhancing the reliability and utility of Large Language Models (LLMs) by grounding responses in external documents. Traditional RAG systems rely on Optical Character Recognition (OCR) to first process scanned documents into text. However, even state-of-the-art OCRs can introduce errors, especially in degraded or complex documents. Recent vision-language approaches, such as ColPali, propose direct visual embedding of documents, eliminating the need for OCR. This study presents a systematic comparison between a vision-based RAG system (ColPali) and more traditional OCR-based pipelines utilizing Llama 3.2 (90B) and Nougat OCR across varying document qualities. Beyond conventional retrieval accuracy metrics, we introduce a semantic answer evaluation benchmark to assess end-to-end question-answering performance. Our findings indicate that while vision-based RAG performs well on documents it has been fine-tuned on, OCR-based RAG is better able to generalize to unseen documents of varying quality. We highlight the key trade-offs between computational efficiency and semantic accuracy, offering practical guidance for RAG practitioners in selecting between OCR-dependent and vision-based document retrieval systems in production environments.

cs.CV

LLM-Assisted Translation of Legacy FORTRAN Codes to C++: A Cross-Platform Study

Large Language Models (LLMs) are increasingly being leveraged for generating and translating scientific computer codes by both domain-experts and non-domain experts. Fortran has served as one of the go to programming languages in legacy high-performance computing (HPC) for scientific discoveries. Despite growing adoption, LLM-based code translation of legacy code-bases has not been thoroughly assessed or quantified for its usability. Here, we studied the applicability of LLM-based translation of Fortran to C++ as a step towards building an agentic-workflow using open-weight LLMs on two different computational platforms. We statistically quantified the compilation accuracy of the translated C++ codes, measured the similarity of the LLM translated code to the human translated C++ code, and statistically quantified the output similarity of the Fortran to C++ translation.

cs.SE

A Non-Stop Aurora? The Intriguing Radio Emission from the Rapidly Rotating Magnetic Massive Star HR 5907

HR 5907 (HD 142184) stands out among magnetic OB stars for its rapid rotation, exceptionally hard X-ray emission, and strong magnetic field. High-frequency (>5 GHz) radio emission from the star exhibits an approximately flat spectrum that can be attributed to gyrosynchrotron emission from a dense centrifugal magnetosphere. In a survey of radio emission from massive stars at sub-GHz frequencies, we noticed remarkable low-frequency radio emission from this star, characterized by high circular polarization and brightness temperature, which is inconsistent with the gyrosynchrotron model. We present a follow-up low-frequency radio study of this star with the upgraded Giant Metrewave Radio Telescope (uGMRT) in search of emission mechanisms that can go undiagnosed at higher frequencies. We detect variable radio emission characterized by varying degrees of circular polarization (15-45%) throughout the rotation cycle. The broad-band spectral fitting also suggests additional emission components at lower frequencies. We show that the observed emission is likely auroral emission via electron cyclotron maser emission (ECME), and identify this star as a Main-sequence Radio Pulse emitter (MRP). For MRPs, ECME is usually observed as short polarized enhancements near the magnetic nulls of the star. The detection of a high degree of circular polarization (>15%) at all times makes HR 5907 unique among MRPs. This is only the second MRP after $ρ$ Oph C (detected polarization fraction: 0-60%) that exhibits persistent coherent radio emission attributed to the nearly aligned stellar magnetic and rotational axes.

astro-ph.SR