Search

We present a simplified derivation of the optimal checkpoint interval in Young_1974 [1]. The optimal checkpoint interval derivation in [1] is based on minimizing the total lost time as an objective-function. Lost time is a function of checkpoint interval, checkpoint save time, and average failure time. This simplified derivation yields lost-time-optimal that is identical to the one derived in [1]. For large scale-out super-computer or datacenter systems, what is important is the selection of optimal checkpoint interval that maximizes availability. We show that availability-optimal checkpoint interval is different from the one derived in [1]. However, availability-optimal checkpoint interval is asymptotically same as lost-time-optimal checkpoint interval for certain conditions on checkpoint save and recovery time. We show that these optimal checkpoint intervals hold in situations where the error detection latency is significantly smaller than any selected checkpoint interval. However, in cases where the error detection latency is very large then the optimal checkpoint interval is greater than or equal to the error detection latency., Comment: 10 pages, 5 figures

As the demand for internet of things (IoT) and device-to-device (D2D) applications in next generation communication systems increases, we are confronted with a challenge of spectrum scarcity. One promising solution to this problem is cognitive radio network (CRN), where the key element is the spectrum - a valuable and sharable natural resource that should not be wasted. To design efficient and sustainable networks for the future, it is crucial to ensure that spectrum sensing is not only accurate and rapid, but also energy-efficient. Spectrum sensing is a critical aspect of CRNs, and this study is mainly focused on it. In this research, we employ the supervised machine learning algorithm, support vector machine (SVM), to detect primary users (PU). We investigate different variants of SVM, including linear, polynomial, and Gaussian radial basic function (RBF), and employ an ensemble classification-based approach to improve the classifier's performance and productivity. The simulation results demonstrate that the ensemble classifier achieves the highest performance., Comment

Developing artificial intelligence (AI) and machine learning (ML) models for medical imaging typically involves extensive training and testing on large datasets, consuming significant computational time, energy, and resources. There is a need for more efficient methods that can achieve comparable or superior diagnostic performance without the associated resource burden. We investigated the feasibility of replacing conventional training procedures with an embedding-based approach that leverages concise and semantically meaningful representations of medical images. Using pre-trained foundational models-specifically, convolutional neural networks (CNN) like ResNet and multimodal models like Contrastive Language-Image Pre-training (CLIP)-we generated image embeddings for multi-class classification tasks. Simple linear classifiers were then applied to these embeddings. The approach was evaluated across diverse medical imaging modalities, including retinal images, mammography, dermatoscopic images, and chest radiographs. Performance was compared to benchmark models trained and tested using traditional methods. The embedding-based models surpassed the benchmark area under the receiver operating characteristic curve (AUC-ROC) scores by up to 87 percentage in multi-class classification tasks across the various medical imaging modalities. Notably, CLIP embedding models achieved the highest AUC-ROC scores, demonstrating superior classification performance while significantly reducing computational demands. Our study indicates that leveraging embeddings from pre-trained foundational models can effectively replace conventional, resource-intensive training and testing procedures in medical image analysis. This embedding-based approach offers a more efficient alternative for image segmentation, classification, and prediction, potentially accelerating AI technology integration into clinical practice., Comment: 15 pages, 7 figures, 3 tables

Health registers contain rich information about individuals' health histories. Here our interest lies in understanding how individuals' health trajectories evolve in a nationwide longitudinal dataset with coded features, such as clinical codes, procedures, and drug purchases. We introduce a straightforward approach for training a Transformer-based deep learning model in a way that lets us analyze how individuals' trajectories change over time. This is achieved by modifying the training objective and by applying a causal attention mask. We focus here on a general task of predicting the onset of a range of common diseases in a given future forecast interval. However, instead of providing a single prediction about diagnoses that could occur in this forecast interval, our approach enable the model to provide continuous predictions at every time point up until, and conditioned on, the time of the forecast period. We find that this model performs comparably to other models, including a bi-directional transformer model, in terms of basic prediction performance while at the same time offering promising trajectory modeling properties. We explore a couple of ways to use this model for analyzing health trajectories and aiding in early detection of events that forecast possible later disease onsets. We hypothesize that this method may be helpful in continuous monitoring of peoples' health trajectories and enabling interventions in ongoing health trajectories, as well as being useful in retrospective analyses.

An arithmetical structure on a finite and connected graph G is a pair (d, r) of positive integer vectors such that r is primitive (the gcd of its entries is 1) and (diag(d) - A)r = 0, where A is the adjacency matrix of G. In this article, we investigate arithmetical structures on the wheel graphs., Comment: 13pages, 3figures

BPS states in type II string compactified on a Calabi-Yau threefold can typically be decomposed as moduli-dependent bound states of absolutely stable constituents, with a hierarchical structure labelled by attractor flow trees. This decomposition is best understood from the scattering diagram, an arrangement of real codimension-one loci (or rays) in the space of stability conditions where BPS states of given electromagnetic charge and fixed phase of the central charge exist. The consistency of the diagram when rays intersect determines all BPS indices in terms of the `attractor indices' carried by the initial rays. In this work we study the scattering diagram for a non-compact toric CY threefold known as local $\mathbb{F}_0$, namely the total space of the canonical bundle over $\mathbb{P}^1\times \mathbb{P}^1$. We first construct the scattering diagram for the quiver, valid near the orbifold point, and for the large volume slice, valid when both $\mathbb{P}^1$'s have large (and nearly equal) area. We then combine the insights gained from these simple limits to construct the scattering diagram along the physical slice of $\Pi$-stability conditions, which carries an action of a $\mathbb{Z}^4$ extension of the modular group $\Gamma_0(4)$. We sketch a proof of the Split Attractor Flow Tree Conjecture in this example, albeit for a restricted range of the central charge phase. Most arguments are similar to our early study of local $\mathbb{P}^2$ [arXiv:2210.10712], but complicated by the occurence of an extra mass parameter and ramification points on the $\Pi$-stability slice., Comment: 64 pages, 36 colorful figures

The problem of analyzing data streams of very large volumes is important and is very desirable for many application domains. In this paper we present and demonstrate effective working of an algorithm to find clusters and anomalous data points in a streaming datasets. Entropy minimization is used as a criterion for defining and updating clusters formed from a streaming dataset. As the clusters are formed we also identify anomalous datapoints that show up far away from all known clusters. With a number of 2-D datasets we demonstrate the effectiveness of discovering the clusters and also identifying anomalous data points.

Traditional greedy tokenization methods have been a critical step in Natural Language Processing (NLP), influencing how text is converted into tokens and directly impacting model performance. While subword tokenizers like Byte-Pair Encoding (BPE) are widely used, questions remain about their optimality across model scales and languages. In this work, we demonstrate through extensive experiments that an optimal BPE configuration significantly reduces token count compared to greedy segmentation, yielding improvements in token-saving percentages and performance benefits, particularly for smaller models. We evaluate tokenization performance across various intrinsic and extrinsic tasks, including generation and classification. Our findings suggest that compression-optimized tokenization strategies could provide substantial advantages for multilingual and low-resource language applications, highlighting a promising direction for further research and inclusive NLP., Comment: LoResLM @ COLING 2025

Proper use of personal protective equipment (PPE) can save the lives of industry workers and it is a widely used application of computer vision in the large manufacturing industries. However, most of the applications deployed generate a lot of false alarms (violations) because they tend to generalize the requirements of PPE across the industry and tasks. The key to resolving this issue is to understand the action being performed by the worker and customize the inference for the specific PPE requirements of that action. In this paper, we propose a system that employs activity recognition models to first understand the action being performed and then use object detection techniques to check for violations. This leads to a 23% improvement in the F1-score compared to the PPE-based approach on our test dataset of 109 videos.

We present a classical kinetically constrained model of interacting particles on a triangular ladder, which displays diffusion and jamming and can be treated by means of a classical-quantum mapping. Interpreted as a theory of interacting fermions, the diffusion coefficient is the inverse of the effective mass of the quasiparticles which can be computed using mean-field theory. At a critical density \r{ho} = 2/3, the model undergoes a dynamical phase transition in which exponentially many configurations become jammed while others remain diffusive. The model can be generalized to two dimensions., Comment: 16 pages, 8 figures

We consider the relaxation of finite-wavevector density waves in a facilitated classical lattice gas. Linear hydrodynamics predicts that such perturbations should relax exponentially, but nonlinear effects were predicted to cause subexponential relaxation via nonperturbative long-time tails. We present a detailed numerical study of this effect. While our results clearly indicate the importance of nonlinear effects, we find that the wavevector-dependence of the late-time relaxation is clearly inconsistent with theoretical predictions. We discuss manifestations of hydrodynamic nonlinearities in mesoscopic samples and at short times., Comment: 12 pages, 12 figures

We demonstrate theoretically the ability to control non-relativistic magnonic and electronic spin splitting by manipulating phonon modes. Using MnF$_2$ as a representative material, exhibiting non-relativistic spin splitting in its electronic bands, we identify an equivalent $d$-wave splitting in magnon modes of specific handedness. Our study reveals a direct correlation between magnonic and electronic splittings, showing that the energy splitting in both magnon and electronic bands can be tuned by jointly modulating the A$_{2u}$ and A$_{1g}$ phonon modes with frequencies of 8.52 and 9.74 THz, respectively. These findings highlight the intricate interplay between charge, spin, and lattice degrees of freedom in spin-split antiferromagnets, offering new pathways for phonon-driven control in magnonic applications., Comment: 8 pages, 5 figures

We investigate accretion onto an isolated black hole from uniform winds. If the winds are directed towards the black hole, then the accretion process can be well described by the classical Bondi-Hoyle Lyttleton or BHL accretion. If the wind is not directed towards the black hole and flows past it, then a smaller fraction of the flow can be attracted by the black hole, and this type of accretion cannot be described by the classical BHL, and we coin the second kind as the lateral BHL. We show that the classical BHL cannot form an accretion disk, while lateral BHL can form transient accretion disks. To describe the thermodynamics of the flow, we have used a variable adiabatic index equation of state which depends on the temperature of the flow as well as the composition of the gas. We show that the electron-proton gas forms an accretion disk, which disappears and forms a shock cone, only to form the disk again at a later time, while for flows with less protons, the accretion disk, once lost, does not reappear again. Only when the flow is pair-dominated does it form a persistent accretion disk. We also show that a shock cone is less luminous than the accretion disk., Comment: Accepted for publication in ApJ. 15 pages, 12 figures, one table

In this work, optical observations of the nova V5584 Sgr are presented. These observations cover different phases including pre-maximum, early decline, and nebular. The spectra are dominated by hydrogen Balmer, Fe II, and O I lines with P-Cygni profiles in the early phase, which are subsequently observed in complete emission. The presence of numerous Fe II lines and low ejecta velocity aligns with the Fe II type nova classification. From optical and NIR colors it is clear that this nova manifests dust formation in the ejecta. The dust temperature and mass were estimated from a spectral energy distribution (SED) fit to the JHK band magnitudes and the WISE data. Light curve analysis shows t$_2$ and t$_3$ values of $\sim$ 26 and $\sim$ 48 days, classifying the nova as moderately fast. The physical and chemical properties during early decline and later phases were evaluated using the photoionization code CLOUDY. The best-fit model parameters from two epochs of multiwavelength spectra are compatible with a hot white dwarf source with a roughly constant luminosity of $\sim$ (2.08 $\pm$ 0.10) $\times$ 10$^{36}$ erg s$^{-1}$. We find an ejected mass of $\sim$ (1.59 $\pm$ 0.04) $\times$ 10$^{-4}$M$_{\odot}$. Abundance analysis indicates that the ejecta is significantly enriched relative to solar values, with O/H = 30.2, C/H = 10.8, He/H = 1.8, Mg/H = 1.68, Na/H = 1.55, and N/H = 45.5 in the early decline phase, and O/H = 4.5, Ne/H = 1.5, and N/H = 24.5 in the nebular phase., Comment: 13 pages, 10 figures, 5 tables, Accepted for publication in MNRAS. arXiv admin note: text overlap with arXiv:2408.01924

Rapid advancements in Large Language models (LLMs) has significantly enhanced their reasoning capabilities. Despite improved performance on benchmarks, LLMs exhibit notable gaps in their cognitive processes. Additionally, as reflections of human-generated data, these models have the potential to inherit cognitive biases, raising concerns about their reasoning and decision making capabilities. In this paper we present a framework to interpret, understand and provide insights into a host of cognitive biases in LLMs. Conducting our research on frontier language models we're able to elucidate reasoning limitations and biases, and provide reasoning behind these biases by constructing influence graphs that identify phrases and words most responsible for biases manifested in LLMs. We further investigate biases such as round number bias and cognitive bias barrier revealed when noting framing effect in language models.

It is a fundamental question why quantum mechanics employs complex numbers rather than solely real numbers. In this letter, we conduct the first analysis of imaginarity quantification in neutrino flavor and spin-flavor oscillations. As quantum systems in coherent superposition, neutrinos are ideal candidates for quantifying imaginarity within the resource theoretic framework, using measures such as the $\ell_1$-norm and the relative entropy of imaginarity. Our findings reveal that even in the case of two-flavor mixing, these measures of imaginarity are nonzero. The measures of imaginarity reach their extreme values when the probabilistic features of quantum theory are fully maximized, i.e., both the transitional and survival probabilities are approximately equal, averaging around $1/2$. We further extend our analysis to explore the dynamics of three-flavor neutrino mixing, incorporating the effects of a nonzero CP phase. Our study reveals that the imaginarity in neutrino systems is not solely attributed to the CP-violating phase. More importantly, it can also arise from the intrinsic quantum dynamics of the neutrino mixing system itself., Comment: 7 pages, 2 figures

Image tokenizers play a critical role in shaping the performance of subsequent generative models. Since the introduction of VQ-GAN, discrete image tokenization has undergone remarkable advancements. Improvements in architecture, quantization techniques, and training recipes have significantly enhanced both image reconstruction and the downstream generation quality. In this paper, we present XQ-GAN, an image tokenization framework designed for both image reconstruction and generation tasks. Our framework integrates state-of-the-art quantization techniques, including vector quantization (VQ), residual quantization (RQ), multi-scale residual quantization (MSVQ), product quantization (PQ), lookup-free quantization (LFQ), and binary spherical quantization (BSQ), within a highly flexible and customizable training environment. On the standard ImageNet 256x256 benchmark, our released model achieves an rFID of 0.64, significantly surpassing MAGVIT-v2 (0.9 rFID) and VAR (0.9 rFID). Furthermore, we demonstrate that using XQ-GAN as a tokenizer improves gFID metrics alongside rFID. For instance, with the same VAR architecture, XQ-GAN+VAR achieves a gFID of 2.6, outperforming VAR's 3.3 gFID by a notable margin. To support further research, we provide pre-trained weights of different image tokenizers for the community to directly train the subsequent generative models on it or fine-tune for specialized tasks., Comment: Code: https://github.com/lxa9867/ImageFolder

We present the analytic evaluation of the gravitational energy and of the angular momentum flux with tidal effects for inspiraling compact binaries, at next-to-next-to-leading post-Newtoian (2PN) order, within the effective field theory diagrammatic approach. We first compute the stress-energy tensor for a binary system, that requires the evaluation of two-point Feynman integrals, up to two loops. Then, we extract the multipole moments of the system, which we present for generic orbits in center-of-mass coordinates, and which are needed for the evaluation of the total gravitational energy and the angular momentum flux, for generic orbits. Finally, we provide the expression of gauge invariant quantities such as the fluxes, and the mode amplitudes and phase of the emitted gravitational wave, for circular orbits. Our findings are useful to update earlier theoretical studies as well as related phenomenological analyses, and waveform models, Comment: 25 pages, 1 figure, 1 table

The integration of deep learning tools in gastrointestinal vision holds the potential for significant advancements in diagnosis, treatment, and overall patient care. A major challenge, however, is these tools' tendency to make overconfident predictions, even when encountering unseen or newly emerging disease patterns, undermining their reliability. We address this critical issue of reliability by framing it as an out-of-distribution (OOD) detection problem, where previously unseen and emerging diseases are identified as OOD examples. However, gastrointestinal images pose a unique challenge due to the overlapping feature representations between in- Distribution (ID) and OOD examples. Existing approaches often overlook this characteristic, as they are primarily developed for natural image datasets, where feature distinctions are more apparent. Despite the overlap, we hypothesize that the features of an in-distribution example will cluster closer to the centroids of their ground truth class, resulting in a shorter distance to the nearest centroid. In contrast, OOD examples maintain an equal distance from all class centroids. Based on this observation, we propose a novel nearest-centroid distance deficit (NCCD) score in the feature space for gastrointestinal OOD detection. Evaluations across multiple deep learning architectures and two publicly available benchmarks, Kvasir2 and Gastrovision, demonstrate the effectiveness of our approach compared to several state-of-the-art methods. The code and implementation details are publicly available at: https://github.com/bhattarailab/NCDD

In recent times, more and more people are posting about their mental states across various social media platforms. Leveraging this data, AI-based systems can be developed that help in assessing the mental health of individuals, such as suicide risk. This paper is a study done on suicidal risk assessments using Reddit data leveraging Base language models to identify patterns from social media posts. We have demonstrated that using smaller language models, i.e., less than 500M parameters, can also be effective in contrast to LLMs with greater than 500M parameters. We propose Su-RoBERTa, a fine-tuned RoBERTa on suicide risk prediction task that utilized both the labeled and unlabeled Reddit data and tackled class imbalance by data augmentation using GPT-2 model. Our Su-RoBERTa model attained a 69.84% weighted F1 score during the Final evaluation. This paper demonstrates the effectiveness of Base language models for the analysis of the risk factors related to mental health with an efficient computation pipeline, Comment: 8 pages, 7 figures, Accepted at IEEE International Conference on Big Data (IEEE BigData 2024)

Recent advances in video question answering (VideoQA) offer promising applications, especially in traffic monitoring, where efficient video interpretation is critical. Within ITS, answering complex, real-time queries like "How many red cars passed in the last 10 minutes?" or "Was there an incident between 3:00 PM and 3:05 PM?" enhances situational awareness and decision-making. Despite progress in vision-language models, VideoQA remains challenging, especially in dynamic environments involving multiple objects and intricate spatiotemporal relationships. This study evaluates state-of-the-art VideoQA models using non-benchmark synthetic and real-world traffic sequences. The framework leverages GPT-4o to assess accuracy, relevance, and consistency across basic detection, temporal reasoning, and decomposition queries. VideoLLaMA-2 excelled with 57% accuracy, particularly in compositional reasoning and consistent answers. However, all models, including VideoLLaMA-2, faced limitations in multi-object tracking, temporal coherence, and complex scene interpretation, highlighting gaps in current architectures. These findings underscore VideoQA's potential in traffic monitoring but also emphasize the need for improvements in multi-object tracking, temporal reasoning, and compositional capabilities. Enhancing these areas could make VideoQA indispensable for incident detection, traffic flow management, and responsive urban planning. The study's code and framework are open-sourced for further exploration: https://github.com/joe-rabbit/VideoQA_Pilot_Study

This paper presents GPSM4K, a comprehensive geometry multimodal dataset tailored to augment the problem-solving capabilities of Large Vision Language Models (LVLMs). GPSM4K encompasses 2157 multimodal question-answer pairs manually extracted from mathematics textbooks spanning grades 7-12 and is further augmented to 5340 problems, consisting of both numerical and theorem-proving questions. In contrast to PGPS9k, Geometry3K, and Geo170K which feature only objective-type questions, GPSM4K offers detailed step-by-step solutions in a consistent format, facilitating a comprehensive evaluation of problem-solving approaches. This dataset serves as an excellent benchmark for assessing the geometric reasoning capabilities of LVLMs. Evaluation of our test set shows that there is scope for improvement needed in open-source language models in geometry problem-solving. Finetuning on our training set increases the geometry problem-solving capabilities of models. Further, We also evaluate the effectiveness of techniques such as image captioning and Retrieval Augmentation generation (RAG) on model performance. We leveraged LLM to automate the task of final answer evaluation by providing ground truth and predicted solutions. This research will help to assess and improve the geometric reasoning capabilities of LVLMs., Comment: 15 pages

Large Language Models (LLMs) demonstrate remarkable capabilities in various reasoning tasks. However, they encounter significant challenges when it comes to scientific reasoning, particularly in physics, which requires not only mathematical reasoning but also factual and conceptual understanding. When addressing complex physics problems, LLMs typically face three key issues: problem miscomprehension, incorrect concept application, and computational errors. While each of these problems can be addressed individually, there is a need for a generalized approach that can tackle all three issues simultaneously. To address this, we introduce Mixture of Refinement Agents (MoRA), a novel agentic refinement framework that iteratively refines the LLM generated base solution by correcting the aforementioned errors, resulting in a significant performance improvement for open-source LLMs. Our approach aims to bridge the gap between opensource LLMs and GPT-4o by utilizing the latter as error identifier to guide these refinement agents. We evaluate our approach on the SciEval and MMLU subsets along with our own physics dataset (PhysicsQA). MoRA significantly improves the performance of Llama-3-70B and Gemma-2-27B on these datasets, achieving up to a 16% increase in final answer accuracy., Comment: 7 pages

Remote estimation is a crucial element of real time monitoring of a stochastic process. While most of the existing works have concentrated on obtaining optimal sampling strategies, motivated by malicious attacks on cyber-physical systems, we model sensing under surveillance as a game between an attacker and a defender. This introduces strategic elements to conventional remote estimation problems. Additionally, inspired by increasing detection capabilities, we model an element of information leakage for each player. Parameterizing the game in terms of uncertainty on each side, information leakage, and cost of sampling, we consider the Stackelberg Equilibrium (SE) concept where one of the players acts as the leader and the other one as the follower. By focusing our attention on stationary probabilistic sampling policies, we characterize the SE of this game and provide simulations to show the efficacy of our results.

Optical data center networks (DCNs) are emerging as a promising solution for cloud infrastructure in the post-Moore's Law era, particularly with the advent of 'fast-switched' optical architectures capable of circuit reconfiguration at microsecond or even nanosecond scales. However, frequent reconfiguration of optical circuits introduces a unique challenge: in-flight packets risk loss during these transitions, hindering the deployment of many mature optical hardware designs due to the lack of suitable routing solutions. In this paper, we present Unified Routing for Optical networks (URO), a general routing framework designed to support fast-switched optical DCNs across various hardware architectures. URO combines theoretical modeling of this novel routing problem with practical implementation on programmable switches, enabling precise, time-based packet transmission. Our prototype on Intel Tofino2 switches achieves a minimum circuit duration of 2us, ensuring end-to-end, loss-free application performance. Large-scale simulations using production DCN traffic validate URO's generality across different hardware configurations, demonstrating its effectiveness and efficient system resource utilization.

Mining parallel document pairs poses a significant challenge because existing sentence embedding models often have limited context windows, preventing them from effectively capturing document-level information. Another overlooked issue is the lack of concrete evaluation benchmarks comprising high-quality parallel document pairs for assessing document-level mining approaches, particularly for Indic languages. In this study, we introduce Pralekha, a large-scale benchmark for document-level alignment evaluation. Pralekha includes over 2 million documents, with a 1:2 ratio of unaligned to aligned pairs, covering 11 Indic languages and English. Using Pralekha, we evaluate various document-level mining approaches across three dimensions: the embedding models, the granularity levels, and the alignment algorithm. To address the challenge of aligning documents using sentence and chunk-level alignments, we propose a novel scoring method, Document Alignment Coefficient (DAC). DAC demonstrates substantial improvements over baseline pooling approaches, particularly in noisy scenarios, achieving average gains of 20-30% in precision and 15-20% in F1 score. These results highlight DAC's effectiveness in parallel document mining for Indic languages., Comment: Work in Progress

In recent years, graph representation learning has undergone a paradigm shift, driven by the emergence and proliferation of graph neural networks (GNNs) and their heterogeneous counterparts. Heterogeneous GNNs have shown remarkable success in extracting low-dimensional embeddings from complex graphs that encompass diverse entity types and relationships. While meta-path-based techniques have long been recognized for their ability to capture semantic affinities among nodes, their dependence on manual specification poses a significant limitation. In contrast, matrix-focused methods accelerate processing by utilizing structural cues but often overlook contextual richness. In this paper, we challenge the current paradigm by introducing ontology as a fundamental semantic primitive within complex graphs. Our goal is to integrate the strengths of both matrix-centric and meta-path-based approaches into a unified framework. We propose perturbation Ontology-based Graph Attention Networks (POGAT), a novel methodology that combines ontology subgraphs with an advanced self-supervised learning paradigm to achieve a deep contextual understanding. The core innovation of POGAT lies in our enhanced homogeneous perturbing scheme designed to generate rigorous negative samples, encouraging the model to explore minimal contextual features more thoroughly. Through extensive empirical evaluations, we demonstrate that POGAT significantly outperforms state-of-the-art baselines, achieving a groundbreaking improvement of up to 10.78\% in F1-score for the critical task of link prediction and 12.01\% in Micro-F1 for the critical task of node classification.

Optical data center networks (DCNs) are emerging as a promising design for cloud infrastructure. However, existing optical DCN architectures operate as closed ecosystems, tying software solutions to specific optical hardware. We introduce Lighthouse, an open research framework that decouples software from hardware, allowing them to evolve independently. Central to Lighthouse is the time-flow table abstraction, serving as a common interface between optical hardware and software. We develop Lighthouse on programmable switches, achieving a minimum optical circuit duration of 2 {\mu}s, the shortest duration realized by commodity devices to date. We demonstrate Lighthouse's generality by implementing six optical architectures on an optical testbed and conducted extensive benchmarks on a 108-ToR setup, highlighting system efficiency. Additionally, we present case studies that identify potential research topics enabled by Lighthouse.

Neutron stars provide a compelling testing ground for gravity, nuclear dynamics, and physics beyond the Standard Model, and so it will be useful to locate the neutron stars nearest to Earth. To that end, we revisit pulsar distance estimates extracted from the dispersion measure of pulsar radio waves scattering on electrons. In particular, we create a new electron density map for the local kiloparsec by fitting to parallax measurements of the nearest pulsars, which complements existing maps that are fit on the Galactic scale. This ``near-Earth'' electron density map implies that pulsars previously estimated to be 100-200 pc away may be as close as tens of parsecs away, which motivates a parallax-based measurement campaign to follow-up on these very-near candidate pulsars. Such nearby neutron stars would be valuable laboratories for testing fundamental physics phenomena, including several late-stage neutron star heating mechanisms, using current and forthcoming telescopes. We illustrate this by estimating the sensitivities of the upcoming Extremely Large Telescope and Thirty Meter Telescope to neutron stars heated by dark matter capture.

Various biological phenomena, like cell differentiation and pattern formation in multicellular organisms, are explained using the bifurcation theory. Molecular network motifs like positive feedback and mutual repressor exhibit bifurcation and are responsible for the emergence of diverse cell types. Mathematical investigations of such problems usually focus on bifurcation in a molecular network in individual cells. However, in a multicellular organism, cells interact, and intercellular interactions affect individual cell dynamics. Therefore, the bifurcation in an ensemble of cells could differ from that for a single cell. This work considers a ring of identical cells. When independent, each cell exhibits supercritical pitchfork bifurcation. Using analytical and numerical tools, we investigate the bifurcation in this ensemble when cells interact through positive and negative coupling. We show that within a specific parameter zone, an ensemble of positively coupled cells behaves like a single cell with supercritical pitchfork bifurcation. In this regime, all cells are synchronized and have the same steady state. However, this unique behaviour is lost when cells interact through negative coupling. Apart from the synchronized (or homogenous) states, cell-cell coupling leads to certain heterogeneous steady states with unique patterns. We also investigate the distribution of such heterogeneous states under positive and negative coupling., Comment: 32 pages, 5 figures

Transition-Edge Sensors (TESs) are very effective photon-number-resolving (PNR) detectors that have enabled many photonic quantum technologies. However, their relatively slow thermal recovery time severely limits their operation rate in experimental scenarios compared to leading non-PNR detectors. In this work, we develop an algorithmic approach that enables TESs to detect and accurately classify photon pulses without waiting for a full recovery time between detection events. We propose two machine-learning-based signal processing methods: one supervised learning method and one unsupervised clustering method. By benchmarking against data obtained using coherent states and squeezed states, we show that the methods extend the TES operation rate to 800 kHz, achieving at least a four-fold improvement, whilst maintaining accurate photon-number assignment up to at least five photons. Our algorithms will find utility in applications where high rates of PNR detection are required and in technologies which demand fast active feed-forward of PNR detection outcomes., Comment: 18 pages, 7 figures including supplimental material

Large Language Models (LLMs) have shown impressive proficiency across a range of natural language processing tasks yet remain vulnerable to adversarial prompts, known as jailbreak attacks, carefully designed to elicit harmful responses from LLMs. Traditional methods rely on manual heuristics, which suffer from limited generalizability. While being automatic, optimization-based attacks often produce unnatural jailbreak prompts that are easy to detect by safety filters or require high computational overhead due to discrete token optimization. Witnessing the limitations of existing jailbreak methods, we introduce Generative Adversarial Suffix Prompter (GASP), a novel framework that combines human-readable prompt generation with Latent Bayesian Optimization (LBO) to improve adversarial suffix creation in a fully black-box setting. GASP leverages LBO to craft adversarial suffixes by efficiently exploring continuous embedding spaces, gradually optimizing the model to improve attack efficacy while balancing prompt coherence through a targeted iterative refinement procedure. Our experiments show that GASP can generate natural jailbreak prompts, significantly improving attack success rates, reducing training times, and accelerating inference speed, thus making it an efficient and scalable solution for red-teaming LLMs., Comment: 28 pages, 9 tables, 13 figures; under review at CVPR '25

We investigate the reflected entropy for bipartite mixed state configurations in a $T\bar{T}$ deformed boundary conformal field theory in $2$ dimensions (BCFT$_2$). The bulk dual is described by asymptotically AdS$_3$ geometries with the cut off surface pushed deeper into the bulk and truncated by an end of the world brane. We obtain the reflected entropy up to a linear order in the radial cut-off for static and time dependent configurations involving an eternal black hole, from the island and defect extremal surface (DES) prescriptions in the context of the deformed AdS/BCFT. We observe agreement of the leading order correction for all cases between the two prescriptions. We also obtain the analogous of the Page curves for the reflected entropy and investigate the modification due to the $T\bar{T}$ deformation., Comment: 46 pages, 28 figures

The curse of dimensionality poses a significant challenge to modern multilayer perceptron-based architectures, often causing performance stagnation and scalability issues. Addressing this limitation typically requires vast amounts of data. In contrast, Kolmogorov-Arnold Networks have gained attention in the machine learning community for their bold claim of being unaffected by the curse of dimensionality. This paper explores the Kolmogorov-Arnold representation theorem and the mathematical principles underlying Kolmogorov-Arnold Networks, which enable their scalability and high performance in high-dimensional spaces. We begin with an introduction to foundational concepts necessary to understand Kolmogorov-Arnold Networks, including interpolation methods and Basis-splines, which form their mathematical backbone. This is followed by an overview of perceptron architectures and the Universal approximation theorem, a key principle guiding modern machine learning. This is followed by an overview of the Kolmogorov-Arnold representation theorem, including its mathematical formulation and implications for overcoming dimensionality challenges. Next, we review the architecture and error-scaling properties of Kolmogorov-Arnold Networks, demonstrating how these networks achieve true freedom from the curse of dimensionality. Finally, we discuss the practical viability of Kolmogorov-Arnold Networks, highlighting scenarios where their unique capabilities position them to excel in real-world applications. This review aims to offer insights into Kolmogorov-Arnold Networks' potential to redefine scalability and performance in high-dimensional learning tasks.

Several initiatives have been undertaken to conceptually model the domain of scholarly data using ontologies and to create respective Knowledge Graphs. Yet, the full potential seems unleashed, as automated means for automatic population of said ontologies are lacking, and respective initiatives from the Semantic Web community are not necessarily connected: we propose to make scholarly data more sustainably accessible by leveraging Wikidata's infrastructure and automating its population in a sustainable manner through LLMs by tapping into unstructured sources like conference Web sites and proceedings texts as well as already existing structured conference datasets. While an initial analysis shows that Semantic Web conferences are only minimally represented in Wikidata, we argue that our methodology can help to populate, evolve and maintain scholarly data as a community within Wikidata. Our main contributions include (a) an analysis of ontologies for representing scholarly data to identify gaps and relevant entities/properties in Wikidata, (b) semi-automated extraction -- requiring (minimal) manual validation -- of conference metadata (e.g., acceptance rates, organizer roles, programme committee members, best paper awards, keynotes, and sponsors) from websites and proceedings texts using LLMs. Finally, we discuss (c) extensions to visualization tools in the Wikidata context for data exploration of the generated scholarly data. Our study focuses on data from 105 Semantic Web-related conferences and extends/adds more than 6000 entities in Wikidata. It is important to note that the method can be more generally applicable beyond Semantic Web-related conferences for enhancing Wikidata's utility as a comprehensive scholarly resource. Source Repository: https://github.com/scholarly-wikidata/ DOI: https://doi.org/10.5281/zenodo.10989709 License: Creative Commons CC0 (Data), MIT (Code), Comment: 17 pages, accepted at EKAW-24

Training a high-quality Federated Learning (FL) model at the network edge is challenged by limited transmission resources. Although various device scheduling strategies have been proposed, it remains unclear how scheduling decisions affect the FL model performance under temporal constraints. This is pronounced when the wireless medium is shared to enable the participation of heterogeneous Internet of Things (IoT) devices with distinct communication modes: (1) a scheduling (pull) scheme, that selects devices with valuable updates, and (2) random access (push), in which interested devices transmit model parameters. The motivation for pushing data is the improved representation of own data distribution within the trained FL model and thereby better generalization. The scheduling strategy affects the transmission opportunities for push-based communication during the access phase, extending the number of communication rounds required for model convergence. This work investigates the interplay of push-pull interactions in a time-constrained FL setting, where the communication opportunities are finite, with a utility-based analytical model. Using real-world datasets, we provide a performance tradeoff analysis that validates the significance of strategic device scheduling under push-pull wireless access for several practical settings. The simulation results elucidate the impact of the device sampling strategy on learning efficiency under timing constraints.

In this work, we show that the class of multivariate degree-$d$ polynomials mapping $\{0,1\}^{n}$ to any Abelian group $G$ is locally correctable with $\widetilde{O}_{d}((\log n)^{d})$ queries for up to a fraction of errors approaching half the minimum distance of the underlying code. In particular, this result holds even for polynomials over the reals or the rationals, special cases that were previously not known. Further, we show that they are locally list correctable up to a fraction of errors approaching the minimum distance of the code. These results build on and extend the prior work of the authors [ABPSS24] (STOC 2024) who considered the case of linear polynomials and gave analogous results. Low-degree polynomials over the Boolean cube $\{0,1\}^{n}$ arise naturally in Boolean circuit complexity and learning theory, and our work furthers the study of their coding-theoretic properties. Extending the results of [ABPSS24] from linear to higher-degree polynomials involves several new challenges and handling them gives us further insights into properties of low-degree polynomials over the Boolean cube. For local correction, we construct a set of points in the Boolean cube that lie between two exponentially close parallel hyperplanes and is moreover an interpolating set for degree-$d$ polynomials. To show that the class of degree-$d$ polynomials is list decodable up to the minimum distance, we stitch together results on anti-concentration of low-degree polynomials, the Sunflower lemma, and the Footprint bound for counting common zeroes of polynomials. Analyzing the local list corrector of [ABPSS24] for higher degree polynomials involves understanding random restrictions of non-zero degree-$d$ polynomials on a Hamming slice. In particular, we show that a simple random restriction process for reducing the dimension of the Boolean cube is a suitably good sampler for Hamming slices., Comment: 64 pages, To appear in SODA 2025, deleted image files

In this study, we apply two pillars of Scientific Machine Learning: Neural Ordinary Differential Equations (Neural ODEs) and Universal Differential Equations (UDEs) to the Lotka Volterra Predator Prey Model, a fundamental ecological model describing the dynamic interactions between predator and prey populations. The Lotka-Volterra model is critical for understanding ecological dynamics, population control, and species interactions, as it is represented by a system of differential equations. In this work, we aim to uncover the underlying differential equations without prior knowledge of the system, relying solely on training data and neural networks. Using robust modeling in the Julia programming language, we demonstrate that both Neural ODEs and UDEs can be effectively utilized for prediction and forecasting of the Lotka-Volterra system. More importantly, we introduce the forecasting breakdown point: the time at which forecasting fails for both Neural ODEs and UDEs. We observe how UDEs outperform Neural ODEs by effectively recovering the underlying dynamics and achieving accurate forecasting with significantly less training data. Additionally, we introduce Gaussian noise of varying magnitudes (from mild to high) to simulate real-world data perturbations and show that UDEs exhibit superior robustness, effectively recovering the underlying dynamics even in the presence of noisy data, while Neural ODEs struggle with high levels of noise. Through extensive hyperparameter optimization, we offer insights into neural network architectures, activation functions, and optimizers that yield the best results. This study opens the door to applying Scientific Machine Learning frameworks for forecasting tasks across a wide range of ecological and scientific domains., Comment: 16 pages, 7 figures, 1 table

Vision Transformers and U-Net architectures have been widely adopted in the implementation of Diffusion Models. However, each architecture presents specific challenges while realizing them on-device. Vision Transformers require positional embedding to maintain correspondence between the tokens processed by the transformer, although they offer the advantage of using fixed-size, reusable repetitive blocks following tokenization. The U-Net architecture lacks these attributes, as it utilizes variable-sized intermediate blocks for down-convolution and up-convolution in the noise estimation backbone for the diffusion process. To address these issues, we propose an architecture that utilizes a fixed-size, reusable transformer block as a core structure, making it more suitable for hardware implementation. Our architecture is characterized by low complexity, token-free design, absence of positional embeddings, uniformity, and scalability, making it highly suitable for deployment on mobile and resource-constrained devices. The proposed model exhibit competitive and consistent performance across both unconditional and conditional image generation tasks. The model achieved a state-of-the-art FID score of 1.6 on unconditional image generation with the CelebA., Comment: 8 pages

The adsorption of charged clay nanoplatelets plays an important role in stabilizing emulsions by forming a barrier around the emulsion droplets and preventing coalescence. In this work, the adsorption of charged clay nanoplatelets on a preformed Latex microsphere in an aqueous medium is investigated at high temporal resolution using optical tweezer-based single-colloid electrophoresis. Above a critical clay concentration, charged clay nanoplatelets in an aqueous medium self-assemble gradually to form gel-like networks that become denser with increasing medium salinity. In a previous publication [R. Biswas et. al., Soft Matter, 2023, 19, 24007-2416], some of us had demonstrated that a Latex microsphere, optically trapped in a clay gel medium, is expected to attach to the network strands of the gel. In the present contribution, we show that for different ionic conditions of the suspending medium, the adsorption of clay nanoplatelets increases the effective surface charge on an optically trapped Latex microsphere while also enhancing the drag experienced by the latter. Besides the ubiquitous contribution of non-electrostatic dispersion forces in driving the adsorption process, we demonstrate the presence of an electrostatically-driven adsorption mechanism when the microsphere was trapped in a clay gel. These observations are qualitatively verified via cryogenic field emission scanning electron microscopy and are useful in achieving colloidal stabilisation, for example, during the preparation of clay-armoured Latex particles in Pickering emulsion polymerisation., Comment: 32 pages, 14 figures and supporting information included

Extracting multiscale contextual information and higher-order correlations among skeleton sequences using Graph Convolutional Networks (GCNs) alone is inadequate for effective action classification. Hypergraph convolution addresses the above issues but cannot harness the long-range dependencies. Transformer proves to be effective in capturing these dependencies and making complex contextual features accessible. We propose an Autoregressive Adaptive HyperGraph Transformer (AutoregAd-HGformer) model for in-phase (autoregressive and discrete) and out-phase (adaptive) hypergraph generation. The vector quantized in-phase hypergraph equipped with powerful autoregressive learned priors produces a more robust and informative representation suitable for hyperedge formation. The out-phase hypergraph generator provides a model-agnostic hyperedge learning technique to align the attributes with input skeleton embedding. The hybrid (supervised and unsupervised) learning in AutoregAd-HGformer explores the action-dependent feature along spatial, temporal, and channel dimensions. The extensive experimental results and ablation study indicate the superiority of our model over state-of-the-art hypergraph architectures on NTU RGB+D, NTU RGB+D 120, and NW-UCLA datasets., Comment: Accepted to WACV 2025

Lensless imaging offers a significant opportunity to develop ultra-compact cameras by removing the conventional bulky lens system. However, without a focusing element, the sensor's output is no longer a direct image but a complex multiplexed scene representation. Traditional methods have attempted to address this challenge by employing learnable inversions and refinement models, but these methods are primarily designed for 2D reconstruction and do not generalize well to 3D reconstruction. We introduce GANESH, a novel framework designed to enable simultaneous refinement and novel view synthesis from multi-view lensless images. Unlike existing methods that require scene-specific training, our approach supports on-the-fly inference without retraining on each scene. Moreover, our framework allows us to tune our model to specific scenes, enhancing the rendering and refinement quality. To facilitate research in this area, we also present the first multi-view lensless dataset, LenslessScenes. Extensive experiments demonstrate that our method outperforms current approaches in reconstruction accuracy and refinement quality. Code and video results are available at https://rakesh-123-cryp.github.io/Rakesh.github.io/

Automatic Speech Translation (AST) datasets for Indian languages remain critically scarce, with public resources covering fewer than 10 of the 22 official languages. This scarcity has resulted in AST systems for Indian languages lagging far behind those available for high-resource languages like English. In this paper, we first evaluate the performance of widely-used AST systems on Indian languages, identifying notable performance gaps and challenges. Our findings show that while these systems perform adequately on read speech, they struggle significantly with spontaneous speech, including disfluencies like pauses and hesitations. Additionally, there is a striking absence of systems capable of accurately translating colloquial and informal language, a key aspect of everyday communication. To this end, we introduce BhasaAnuvaad, the largest publicly available dataset for AST involving 13 out of 22 scheduled Indian languages and English spanning over 44,400 hours and 17M text segments. BhasaAnuvaad contains data for English speech to Indic text, as well as Indic speech to English text. This dataset comprises three key categories: (1) Curated datasets from existing resources, (2) Large-scale web mining, and (3) Synthetic data generation. By offering this diverse and expansive dataset, we aim to bridge the resource gap and promote advancements in AST for Indian languages., Comment: Work in Progress

Secondary research use of Electronic Health Records (EHRs) is often hampered by the abundance of missing data in this valuable resource. Missingness in EHRs occurs naturally as a result of the data recording practices during routine clinical care, but handling it is crucial to the precision of medical analysis and the decision-making that follows. The literature contains a variety of imputation methodologies based on deep neural networks. Those aim to overcome the dynamic, heterogeneous and multivariate missingness patterns of EHRs, which cannot be handled by classical and statistical imputation methods. However, all existing deep imputation methods rely on end-to-end pipelines that incorporate both imputation and downstream analyses, e.g. classification. This coupling makes it difficult to assess the quality of imputation and takes away the flexibility of re-using the imputer for a different task. Furthermore, most end-to-end deep architectures tend to use complex networks to perform the downstream task, in addition to the already sophisticated deep imputation network. We, therefore ask if the high performance reported in the literature is due to the imputer or the classifier and further ask if an optimised state-of-the-art imputer is used, a simpler classifier can achieve comparable performance. This paper explores the development of a modular, deep learning-based imputation and classification pipeline, specifically built to leverage the capabilities of state-of-the-art imputation models for downstream classification tasks. Such a modular approach enables a) objective assessment of the quality of the imputer and classifier independently, and b) enables the exploration of the performance of simpler classification architectures using an optimised imputer.

The radio galaxy NGC 1275, located at the central region of Perseus cluster, is a well-known very high-energy (VHE) gamma-ray emitter. The Major Atmospheric Cherenkov Experiment Telescope has detected two distinct episodes of VHE (E > 80 GeV) gamma-ray emission from NGC 1275 during 2022 December and 2023 January. The second outburst, observed on 2023 January 10, was the more intense of the two, with flux reaching 58$\%$ of the Crab Nebula flux above 80 GeV. The differential energy spectrum measured between 80 GeV and 1.5 TeV can be described by a power law with a spectral index of $\Gamma = - 2.90 \pm 0.16_{stat}$ for both flaring events. The broadband spectral energy distribution derived from these flares, along with quasisimultaneous low-energy counterparts, suggests that the observed gamma-ray emission can be explained using a homogeneous single-zone synchrotron self-Compton model. The physical parameters derived from this model for both flaring states are similar. The intermediate state observed between two flaring episodes is explained by a lower Doppler factor or magnetic field, which subsequently returned to its previous value during the high-activity state observed on 2023 January 10., Comment: 7 Pages, 5 Figures, and 1 Table

Molecular dynamics and parallel-replica dynamics simulations are applied to investigate the atomic structures and diffusion processes at {\text{Al}\{111\}}\parallel{\text{Si}}\{111\} interphase boundaries constructed by simulated vapor deposition of Al(Si) alloy on Si(111) substrates. Different orientation relationships and interface structures are obtained for different pre-deposition Si (111) surface reconstructions. Diffusion of both Al and Si atoms at the interfaces is calculated and compared with diffusion along grain boundaries, triple junctions, contact lines, and threading dislocations in the Al-Si system. It is found that {\text{Al}\{111\}}\parallel{\text{Si}}\{111\} interphase boundaries exhibit the lowest diffusivity among these structures and are closest to the lattice diffusivity. In most cases (except for the Si substrate), Si atoms are more mobile than Al atoms. The diffusion processes are typically mediated by Al vacancies and Si interstitial atoms migrating by either direct or indirect interstitial mechanisms.