Search

This paper culminates in the count of the number of 3-Veronese surfaces passing through 13 general points. This follows the case of 2-Veronese surfaces discovered by Coble in the 1920's. One important element of the calculation is a direct construction of a space of "complete triangles." Our construction is different from the classical ordered constructions of Schubert, Collino and Fulton, as it occurs directly on the Hilbert scheme of length 3 subschemes of the plane. We transport the enumerative problem into a 26-dimensional Grassmannian bundle over our space of complete triangles, where we perform Atiyah-Bott localization. Several important questions arise, which we collect at the end of the paper.

This expository article makes a connection between Euler's homogeneous function theorem and a Lagrange integral for a simplified version of the Clairaut Equation. After describing both solutions in detail, we prove a new result, that the Lagrange solution is strictly more general than Euler's solution. This is shown using a few examples which substitute Euler's homogeneous function with a more general surface. The first rather complicated example is based directly on Goursat's definition of a general integral, while the subsequent simpler examples are based on a suitably expanded notion of the general integral. These new examples, and the expanded notion of the general integral may be of interest. We aim to present these classical PDE concepts to readers with a basic knowledge of multivariable calculus., Comment: 14 pages, 7 figures

Legacy software systems, written in outdated languages like MUMPS and mainframe assembly, pose challenges in efficiency, maintenance, staffing, and security. While LLMs offer promise for modernizing these systems, their ability to understand legacy languages is largely unknown. This paper investigates the utilization of LLMs to generate documentation for legacy code using two datasets: an electronic health records (EHR) system in MUMPS and open-source applications in IBM mainframe Assembly Language Code (ALC). We propose a prompting strategy for generating line-wise code comments and a rubric to evaluate their completeness, readability, usefulness, and hallucination. Our study assesses the correlation between human evaluations and automated metrics, such as code complexity and reference-based metrics. We find that LLM-generated comments for MUMPS and ALC are generally hallucination-free, complete, readable, and useful compared to ground-truth comments, though ALC poses challenges. However, no automated metrics strongly correlate with comment quality to predict or measure LLM performance. Our findings highlight the limitations of current automated measures and the need for better evaluation metrics for LLM-generated documentation in legacy systems., Comment: Abbreviated version submitted to LLM4Code 2025 (a workshop co-located with ICSE 2025), 13 pages, 3 figures

In this paper, we evaluate the potential of multiband gravitational wave observations to constrain the properties of static dark matter spikes around intermediate-mass ratio inspirals. The influence of dark matter on the orbital evolution of the compact binary is incorporated as a correction to the inspiral Newtonian gravitational waveform. We show that the observations from the proposed space-based detector GWSat, sensitive within the deci-Hz frequency band, when combined with that of the third-generation ground-based detectors like the Einstein Telescope and Cosmic Explorer, will produce significantly improved error estimates for all parameters. In particular, our results demonstrate that the joint multiband approach substantially refines the bounds on the dark matter spike parameters-namely, the power-law index and spike density-by factors of approximately $10^6$ and $10^3$, respectively, compared to observations employing only third-generation gravitational wave detectors., Comment: 13 pages, 5 figures

Large Language Models (LLMs) have revolutionized natural language processing (NLP), excelling in tasks like text generation and summarization. However, their increasing adoption in mission-critical applications raises concerns about hardware-based threats, particularly bit-flip attacks (BFAs). BFAs, enabled by fault injection methods such as Rowhammer, target model parameters in memory, compromising both integrity and performance. Identifying critical parameters for BFAs in the vast parameter space of LLMs poses significant challenges. While prior research suggests transformer-based architectures are inherently more robust to BFAs compared to traditional deep neural networks, we challenge this assumption. For the first time, we demonstrate that as few as three bit-flips can cause catastrophic performance degradation in an LLM with billions of parameters. Current BFA techniques are inadequate for exploiting this vulnerability due to the difficulty of efficiently identifying critical parameters within the immense parameter space. To address this, we propose AttentionBreaker, a novel framework tailored for LLMs that enables efficient traversal of the parameter space to identify critical parameters. Additionally, we introduce GenBFA, an evolutionary optimization strategy designed to refine the search further, isolating the most critical bits for an efficient and effective attack. Empirical results reveal the profound vulnerability of LLMs to AttentionBreaker. For example, merely three bit-flips (4.129 x 10^-9% of total parameters) in the LLaMA3-8B-Instruct 8-bit quantized (W8) model result in a complete performance collapse: accuracy on MMLU tasks drops from 67.3% to 0%, and Wikitext perplexity skyrockets from 12.6 to 4.72 x 10^5. These findings underscore the effectiveness of AttentionBreaker in uncovering and exploiting critical vulnerabilities within LLM architectures.

With GW170817 being the only multimessenger gravitational wave (GW) event with an associated kilonova (KN) detected so far, there exists a pressing need for realistic estimation of the GW localization uncertainties and rates, as well as optimization of available telescope time to enable the detection of new KNe. For this purpose, we simulate GW events assuming a data-driven, GW-motivated distribution of binary parameters for the LIGO/Virgo/KAGRA (LVK) fourth and fifth observing runs (O4 and O5). For our particular case of estimating KN detection rates in the O4 and O5 runs, we map the binary neutron star (BNS) and neutron star-black hole (NSBH) properties to the optical light curves arising from r-process nucleosynthesis in the ejecta. We use the simulated population of KNe to generate follow-up observing plans, with the primary goal of optimizing detection with the Gravitational Wave Multi-Messenger Astronomy DECam Survey (GW-MMADS). We explore KN detectability as a function of mass, distance, and spin of the binaries. Out of the mergers that produce a KN in our simulations, we expect detectable KNe for DECam-like instruments at a per-year rate of: $1-16$ ($0-1$) for BNS (NSBH) in O4, and $16-165$ ($1-12$) for BNS (NSBH) in O5, using a fiducial exposure time and conditional on the uncertainty on the equation of state (EOS) and volumetric rates of the mergers. Taking into account observability constraints, our scheduler covers the location of the KN $\sim 30-38\%$ of the times for our fiducial EOS. We provide the depths needed to detect a significant fraction of our simulated mergers for the astronomical community to use in their follow-up campaigns., Comment: 18 pages, 10 figures, 10 tables

While scaling laws provide a reliable methodology for predicting train loss across compute scales for a single data distribution, less is known about how these predictions should change as we change the distribution. In this paper, we derive a strategy for predicting one loss from another and apply it to predict across different pre-training datasets and from pre-training data to downstream task data. Our predictions extrapolate well even at 20x the largest FLOP budget used to fit the curves. More precisely, we find that there are simple shifted power law relationships between (1) the train losses of two models trained on two separate datasets when the models are paired by training compute (train-to-train), (2) the train loss and the test loss on any downstream distribution for a single model (train-to-test), and (3) the test losses of two models trained on two separate train datasets (test-to-test). The results hold up for pre-training datasets that differ substantially (some are entirely code and others have no code at all) and across a variety of downstream tasks. Finally, we find that in some settings these shifted power law relationships can yield more accurate predictions than extrapolating single-dataset scaling laws.

Despite rapid advancements in TTS models, a consistent and robust human evaluation framework is still lacking. For example, MOS tests fail to differentiate between similar models, and CMOS's pairwise comparisons are time-intensive. The MUSHRA test is a promising alternative for evaluating multiple TTS systems simultaneously, but in this work we show that its reliance on matching human reference speech unduly penalises the scores of modern TTS systems that can exceed human speech quality. More specifically, we conduct a comprehensive assessment of the MUSHRA test, focusing on its sensitivity to factors such as rater variability, listener fatigue, and reference bias. Based on our extensive evaluation involving 471 human listeners across Hindi and Tamil we identify two primary shortcomings: (i) reference-matching bias, where raters are unduly influenced by the human reference, and (ii) judgement ambiguity, arising from a lack of clear fine-grained guidelines. To address these issues, we propose two refined variants of the MUSHRA test. The first variant enables fairer ratings for synthesized samples that surpass human reference quality. The second variant reduces ambiguity, as indicated by the relatively lower variance across raters. By combining these approaches, we achieve both more reliable and more fine-grained assessments. We also release MANGO, a massive dataset of 47,100 human ratings, the first-of-its-kind collection for Indian languages, aiding in analyzing human preferences and developing automatic metrics for evaluating TTS systems., Comment: 19 pages, 12 Figures

Handling sparse and unstructured geometric data, such as point clouds or event-based vision, is a pressing challenge in the field of machine vision. Recently, sequence models such as Transformers and state-space models entered the domain of geometric data. These methods require specialized preprocessing to create a sequential view of a set of points. Furthermore, prior works involving sequence models iterate geometric data with either uniform or learned step sizes, implicitly relying on the model to infer the underlying geometric structure. In this work, we propose to encode geometric structure explicitly into the parameterization of a state-space model. State-space models are based on linear dynamics governed by a one-dimensional variable such as time or a spatial coordinate. We exploit this dynamic variable to inject relative differences of coordinates into the step size of the state-space model. The resulting geometric operation computes interactions between all pairs of N points in O(N) steps. Our model deploys the Mamba selective state-space model with a modified CUDA kernel to efficiently map sparse geometric data to modern hardware. The resulting sequence model, which we call STREAM, achieves competitive results on a range of benchmarks from point-cloud classification to event-based vision and audio classification. STREAM demonstrates a powerful inductive bias for sparse geometric data by improving the PointMamba baseline when trained from scratch on the ModelNet40 and ScanObjectNN point cloud analysis datasets. It further achieves, for the first time, 100% test accuracy on all 11 classes of the DVS128 Gestures dataset.

We present cosmological results from the measurement of clustering of galaxy, quasar and Lyman-$\alpha$ forest tracers from the first year of observations with the Dark Energy Spectroscopic Instrument (DESI Data Release 1). We adopt the full-shape (FS) modeling of the power spectrum, including the effects of redshift-space distortions, in an analysis which has been validated in a series of supporting papers. In the flat $\Lambda$CDM cosmological model, DESI (FS+BAO), combined with a baryon density prior from Big Bang Nucleosynthesis and a weak prior on the scalar spectral index, determines matter density to $\Omega_\mathrm{m}=0.2962\pm 0.0095$, and the amplitude of mass fluctuations to $\sigma_8=0.842\pm 0.034$. The addition of the cosmic microwave background (CMB) data tightens these constraints to $\Omega_\mathrm{m}=0.3056\pm 0.0049$ and $\sigma_8=0.8121\pm 0.0053$, while further addition of the the joint clustering and lensing analysis from the Dark Energy Survey Year-3 (DESY3) data leads to a 0.4% determination of the Hubble constant, $H_0 = (68.40\pm 0.27)\,{\rm km\,s^{-1}\,Mpc^{-1}}$. In models with a time-varying dark energy equation of state, combinations of DESI (FS+BAO) with CMB and type Ia supernovae continue to show the preference, previously found in the DESI DR1 BAO analysis, for $w_0>-1$ and $w_a<0$ with similar levels of significance. DESI data, in combination with the CMB, impose the upper limits on the sum of the neutrino masses of $\sum m_\nu < 0.071\,{\rm eV}$ at 95% confidence. DESI data alone measure the modified-gravity parameter that controls the clustering of massive particles, $\mu_0=0.11^{+0.45}_{-0.54}$, while the combination of DESI with the CMB and the clustering and lensing analysis from DESY3 constrains both modified-gravity parameters, giving $\mu_0 = 0.04\pm 0.22$ and $\Sigma_0 = 0.044\pm 0.047$, in agreement with general relativity. [Abridged.], Comment: This DESI Collaboration Key Publication is part of the 2024 publication series using the first year of observations (see https://data.desi.lbl.gov/doc/papers/). 55 pages, 10 figures

We present the samples of galaxies and quasars used for DESI 2024 cosmological analyses, drawn from the DESI Data Release 1 (DR1). We describe the construction of large-scale structure (LSS) catalogs from these samples, which include matched sets of synthetic reference `randoms' and weights that account for variations in the observed density of the samples due to experimental design and varying instrument performance. We detail how we correct for variations in observational completeness, the input `target' densities due to imaging systematics, and the ability to confidently measure redshifts from DESI spectra. We then summarize how remaining uncertainties in the corrections can be translated to systematic uncertainties for particular analyses. We describe the weights added to maximize the signal-to-noise of DESI DR1 2-point clustering measurements. We detail measurement pipelines applied to the LSS catalogs that obtain 2-point clustering measurements in configuration and Fourier space. The resulting 2-point measurements depend on window functions and normalization constraints particular to each sample, and we present the corrections required to match models to the data. We compare the configuration- and Fourier-space 2-point clustering of the data samples to that recovered from simulations of DESI DR1 and find they are, generally, in statistical agreement to within 2\% in the inferred real-space over-density field. The LSS catalogs, 2-point measurements, and their covariance matrices will be released publicly with DESI DR1., Comment: This DESI Collaboration Key Publication is part of the 2024 publication series using the first year of observations (see https://data.desi.lbl.gov/doc/papers/)

We present the measurements and cosmological implications of the galaxy two-point clustering using over 4.7 million unique galaxy and quasar redshifts in the range $0.1

Dysgraphia is a learning disorder that affects handwriting abilities, making it challenging for children to write legibly and consistently. Early detection and monitoring are crucial for providing timely support and interventions. This study applies deep learning techniques to address the dual tasks of dysgraphia detection and optical character recognition (OCR) on handwriting samples from children with potential dysgraphic symptoms. Using a dataset of handwritten samples from Malaysian schoolchildren, we developed a custom Convolutional Neural Network (CNN) model, alongside VGG16 and ResNet50, to classify handwriting as dysgraphic or non-dysgraphic. The custom CNN model outperformed the pre-trained models, achieving a test accuracy of 91.8% with high precision, recall, and AUC, demonstrating its robustness in identifying dysgraphic handwriting features. Additionally, an OCR pipeline was created to segment and recognize individual characters in dysgraphic handwriting, achieving a character recognition accuracy of approximately 43.5%. This research highlights the potential of deep learning in supporting dysgraphia assessment, laying a foundation for tools that could assist educators and clinicians in identifying dysgraphia and tracking handwriting progress over time. The findings contribute to advancements in assistive technologies for learning disabilities, offering hope for more accessible and accurate diagnostic tools in educational and clinical settings.

In a setting where segmentation models have to be built for multiple datasets, each with its own corresponding label set, a straightforward way is to learn one model for every dataset and its labels. Alternatively, multi-task architectures with shared encoders and multiple segmentation heads or shared weights with compound labels can also be made use of. This work proposes a novel label sharing framework where a shared common label space is constructed and each of the individual label sets are systematically mapped to the common labels. This transforms multiple datasets with disparate label sets into a single large dataset with shared labels, and therefore all the segmentation tasks can be addressed by learning a single model. This eliminates the need for task specific adaptations in network architectures and also results in parameter and data efficient models. Furthermore, label sharing framework is naturally amenable for incremental learning where segmentations for new datasets can be easily learnt. We experimentally validate our method on various medical image segmentation datasets, each involving multi-label segmentation. Furthermore, we demonstrate the efficacy of the proposed method in terms of performance and incremental learning ability vis-a-vis alternative methods.

This article discusses $\Delta$-convexity on simple connected graphs. We establish general bounds for the Helly number, Radon number, and rank with respect to $\Delta$-convexity on graphs. Additionally, we give the exact values for the Helly number and Radon number for chordal graphs, as well as the rank for block graphs., Comment: 14 pages , 2 figures

Autonomous multi-agent systems such as hospital robots and package delivery drones often operate in highly uncertain environments and are expected to achieve complex temporal task objectives while ensuring safety. While learning-based methods such as reinforcement learning are popular methods to train single and multi-agent autonomous systems under user-specified and state-based reward functions, applying these methods to satisfy trajectory-level task objectives is a challenging problem. Our first contribution is the use of weighted automata to specify trajectory-level objectives, such that, maximal paths induced in the weighted automaton correspond to desired trajectory-level behaviors. We show how weighted automata-based specifications go beyond timeliness properties focused on deadlines to performance properties such as expeditiousness. Our second contribution is the use of evolutionary game theory (EGT) principles to train homogeneous multi-agent teams targeting homogeneous task objectives. We show how shared experiences of agents and EGT-based policy updates allow us to outperform state-of-the-art reinforcement learning (RL) methods in minimizing path length by nearly 30\% in large spaces. We also show that our algorithm is computationally faster than deep RL methods by at least an order of magnitude. Additionally our results indicate that it scales better with an increase in the number of agents as compared to other methods.

As AI systems become integral to critical operations across industries and services, ensuring their reliability and safety is essential. We offer a framework that integrates established reliability and resilience engineering principles into AI systems. By applying traditional metrics such as failure rate and Mean Time Between Failures (MTBF) along with resilience engineering and human reliability analysis, we propose an integrate framework to manage AI system performance, and prevent or efficiently recover from failures. Our work adapts classical engineering methods to AI systems and outlines a research agenda for future technical studies. We apply our framework to a real-world AI system, using system status data from platforms such as openAI, to demonstrate its practical applicability. This framework aligns with emerging global standards and regulatory frameworks, providing a methodology to enhance the trustworthiness of AI systems. Our aim is to guide policy, regulation, and the development of reliable, safe, and adaptable AI technologies capable of consistent performance in real-world environments.

Mixture-of-Experts (MoE) architectures have recently gained popularity in enabling efficient scaling of large language models. However, we uncover a fundamental tension: while MoEs are designed for selective expert activation, production serving requires request batching, which forces the activation of all experts and negates MoE's efficiency benefits during the decode phase. We present Lynx, a system that enables efficient MoE inference through dynamic, batch-aware expert selection. Our key insight is that expert importance varies significantly across tokens and inference phases, creating opportunities for runtime optimization. Lynx leverages this insight through a lightweight framework that dynamically reduces active experts while preserving model accuracy. Our evaluations show that Lynx achieves up to 1.55x reduction in inference latency while maintaining negligible accuracy loss from baseline model across complex code generation and mathematical reasoning tasks.

Bug fixing and code generation have been core research topics in software development for many years. The recent explosive growth in Large Language Models has completely transformed these spaces, putting in reach incredibly powerful tools for both. In this survey, 27 recent papers have been reviewed and split into two groups: one dedicated to Automated Program Repair (APR) and LLM integration and the other to code generation using LLMs. The first group consists of new methods for bug detection and repair, which include locating semantic errors, security vulnerabilities, and runtime failure bugs. The place of LLMs in reducing manual debugging efforts is emphasized in this work by APR toward context-aware fixes, with innovations that boost accuracy and efficiency in automatic debugging. The second group dwells on code generation, providing an overview of both general-purpose LLMs fine-tuned for programming and task-specific models. It also presents methods to improve code generation, such as identifier-aware training, fine-tuning at the instruction level, and incorporating semantic code structures. This survey work contrasts the methodologies in APR and code generation to identify trends such as using LLMs, feedback loops to enable iterative code improvement and open-source models. It also discusses the challenges of achieving functional correctness and security and outlines future directions for research in LLM-based software development., Comment: A survey of recent developments in AI-assisted automated program repair

We explore some of the existing research in HCI around technology for older adults and examine the role of LLMs in enhancing it. We also discuss the digital divide and emphasize the need for inclusive technology design. At the same time, we also surface concerns regarding privacy, security, and the accuracy of information provided by LLMs, alongside the importance of user-centered design to make technology accessible and effective for the elderly. We show the transformative possibilities of LLM-supported interactions at the intersection of aging, technology, and human-computer interaction, advocating for further research and development in this area., Comment: This short paper was accepted at CHI 2024 Workshop on HCI and Aging: New Directions, New Principles

We motivate an intuitive way to think about quantum circuit optimization problem inspired by Feynman's path formalism. While the use of path integrals in quantum circuits remains largely underdeveloped due to the lack of definition of the action functional for such systems. However this feynman's path perspective leads us to consider about how entanglement evolution throughout the circuit can serve as a guiding principle for optimizing circuit design. We conjecture that an optimal state-path is highly likely to belong to a family of paths with the minimum possible path-entanglement sum. This could enhance the efficiency of circuit optimization problems by narrowing the state-path search space, leading to faster convergence and reliable output. Further, we discuss that for some special target states this conjecture may not provide significant insights to the circuit optimization problem and argue that such cases constitute only a small subset of the target sets encountered by a circuit optimization algorithm., Comment: 9 pages, 4 figures

A quantitative spectroscopic study of blue supergiant stars in the Hubble constant anchor galaxy NGC 4258 is presented. The non-LTE analysis of Keck I telescope LRIS spectra yields a central logarithmic metallicity (in units of the solar value) of [Z] = -0.05\pm0.05 and a very shallow gradient of -(0.09\pm0.11)r/r25 with respect to galactocentric distance in units of the isophotal radius. Good agreement with the mass-metallicity relationship of star forming galaxies based on stellar absorption line studies is found. A comparison with HII region oxygen abundances obtained from the analysis of strong emission lines shows reasonable agreement when the Pettini & Pagel (2004) calibration is used, while the Zaritsky et al. (1994) calibration yields values that are 0.2 to 0.3 dex larger. These results allow to put the metallicity calibration of the Cepheid Period--Luminosity relation in this anchor galaxy on a purely stellar basis. Interstellar reddening and extinction are determined using HST and JWST photometry. Based on extinction-corrected magnitudes, combined with the stellar effective temperatures and gravities we determine, we use the Flux-weighted Gravity--Luminosity Relationship (FGLR) to estimate an independent spectroscopic distance. We obtain a distance modulus m-M = 29.38\pm0.12 mag, in agreement with the geometrical distance derived from the analysis of the water maser orbits in the galaxy's central circumnuclear disk., Comment: accepted for publication in the Astrophysical Journal

The scenario approach is widely used in robust control system design and chance-constrained optimization, maintaining convexity without requiring assumptions about the probability distribution of uncertain parameters. However, the approach can demand large sample sizes, making it intractable for safety-critical applications that require very low levels of constraint violation. To address this challenge, we propose a novel yet simple constraint scaling method, inspired by large deviations theory. Under mild nonparametric conditions on the underlying probability distribution, we show that our method yields an exponential reduction in sample size requirements for bilinear constraints with low violation levels compared to the classical approach, thereby significantly improving computational tractability. Numerical experiments on robust pole assignment problems support our theoretical findings.

Azurin and its derived peptides, notably p28, exhibit significant anticancer properties, primarily by stabilizing the tumor suppressor protein p53 and preventing its degradation. Previous studies have shown that p28 binds to p53's DNA-binding domain, protecting it from degradation mechanisms. Expanding on these findings, our research explored whether p28 acts on additional cancer pathways beyond p53 stabilization. Specifically, we examined the interactions between p28 and Human Double Minute 2 (HDM2), a protein that downregulates p53's tumor-suppressive activity by binding to its transactivation domain (TAD). HDM2 is crucial in diminishing p53's function, and our study aimed to determine if p28 disrupts this HDM2-p53 interaction. Using HADDOCK docking and molecular dynamics simulations, we identified three stable conformations of the HDM2-p28 complex. These conformations effectively block HDM2's hydrophobic pocket, allowing for sustained inter-chain interactions and showing favorable binding energies. Further analysis pinpointed essential residues in these interactions, and we calculated interaction energies using the Molecular Mechanics Poisson-Boltzmann Surface Area (MMPBSA) method. Our findings reveal that by blocking HDM2's binding sites, p28 helps maintain p53's transcriptional activity, thus enhancing its tumor-suppressive functions, including apoptosis and cell cycle arrest in cancer cells. This study enhances understanding of azurin-derived peptides' anticancer mechanisms and highlights p28's potential as a peptide-based anticancer agent. These findings also suggest the possibility of designing additional peptide therapies targeting HDM2 and other cancer-related pathways, opening new directions in anticancer therapeutics.

Whispering gallery mode (WGM) microdisk resonators are promising optical devices that confine light efficiently and enable enhanced nonlinear optical effects. This work presents a novel approach to reduce sidewall roughness in SiO\textsubscript{2} microdisk resonators using focused ion beam (FIB) polishing. The microdisks, with varying diameter ranging from 5 to 20 $\mu$m are fabricated using a multi-step fabrication scheme. However, the etching process introduces significant sidewall roughness, which increases with decreasing microdisk radius, degrading the resonators' quality. To address this issue, a FIB system is employed to polish the sidewalls, using optimized process parameters to minimize Ga ion implantation. White light interferometry measurements reveal a significant reduction in surface roughness from 7 nm to 20 nm for a 5 $\mu$m diameter microdisk, leading to a substantial enhancement in the scattering quality factor (Qss) from $3\times 10^2$ to $2\times 10^6$. These findings demonstrate the effectiveness of FIB polishing in improving the quality of microdisk resonators and open up new possibilities for the fabrication of advanced photonic devices.

The maximum likelihood (ML) decoder in the two-dimensional surface code with generic unitary errors is governed by a statistical mechanics model with complex weights, which can be simulated via (1+1)D transfer matrix contraction. Information loss with an increasing error rate manifests as a ferromagnetic-to-paramagnetic transition in the contraction dynamics. In this work, we establish entanglement as a separate obstruction to decoding; it can undergo a transition from area- to volume-law scaling in the transfer matrix contraction with increasing unitary error rate. In particular, the volume-law entanglement can coexist with ferromagnetic order, giving rise to a phase in which the encoded information is retained yet is effectively undecodable. We numerically simulate the ML decoding in the surface code subject to both single- and two-qubit Pauli-X rotations and obtain a phase diagram that contains a ferromagnetic area-law, a paramagnetic volume-law, and a potential ferromagnetic volume-law phase. We further show that, starting from the paramagnetic volume-law phase, tilting the single-qubit rotation away from the X-axis couples the stat-mech models for X and Z errors and can lead to a ferromagnetic volume-law phase in which, although Z errors remain correctable, the encoded classical information is hard to recover. To perform numerical simulations, we develop an algorithm for syndrome sampling based on the isometric tensor network representation of the surface code., Comment: 5 + 13 pages

We present the results of microscopic investigations of antiferromagnetic CeNiGe$_3$, using neutron powder diffraction (NPD), inelastic neutron scattering (INS), and muon spin relaxation ($\mu$SR) measurements. CeNiGe$_3$ crystallizes in a centrosymmetric orthorhombic crystal structure (space group: $Cmmm$) and undergoes antiferromagnetic (AFM) ordering. The occurrence of long-range AFM ordering at $T_{\rm N} \approx 5.2$~K is confirmed by magnetic susceptibility, heat capacity, neutron diffraction, and $\mu$SR measurements. The NPD data characterize the AFM state with an incommensurate helical magnetic structure having a propagation vector $k$ = (0, 0.41, 1/2). In addition, INS measurements at 10~K identified two crystal electric field (CEF) excitations at 9.17~meV and 18.42~meV. We analyzed the INS data using a CEF model for an orthorhombic environment of Ce$^{3+}$ ($J=5/2$) and determined the CEF parameters and ground state wavefunctions of CeNiGe$_3$. Moreover, zero-field $\mu$SR data for CeNiGe$_3$ at $T< T_{\rm N}$ show long-range AFM ordering with three distinct oscillation frequencies corresponding to three different internal fields at the muon sites. The internal fields at the muon-stopping sites have been further investigated using density functional theory calculations., Comment: 13 pages, 9 figures

A graph $G$ is cordial if there exists a function $f$ from the vertices of $G$ to $\{0,1\}$ such that the number of vertices labelled $0$ and the number of vertices labelled $1$ differ by at most $1$, and if we assign to each edge $xy$ the label $|f(x)-f(y)|$, the number of edges labelled $0$ and the number of edges labelled $1$ also differ at most by $1$. We introduce two measures of how close a graph is to being cordial, and compute these measures for a variety of classes of graphs., Comment: 13 pages, 3 tables, 11 references

The Legacy Survey of Space and Time (LSST) at Vera C. Rubin Observatory is planned to begin in the Fall of 2025. The LSST survey cadence has been designed via a community-driven process regulated by the Survey Cadence Optimization Committee (SCOC), which recommended up to 3% of the observing time to carry out Target of Opportunity (ToO) observations. Experts from the scientific community, Rubin Observatory personnel, and members of the SCOC were brought together to deliver a recommendation for the implementation of the ToO program during a workshop held in March 2024. Four main science cases were identified: gravitational wave multi-messenger astronomy, high energy neutrinos, Galactic supernovae, and small potentially hazardous asteroids possible impactors. Additional science cases were identified and briefly addressed in the documents, including lensed or poorly localized gamma-ray bursts and twilight discoveries. Trigger prioritization, automated response, and detailed strategies were discussed for each science case. This document represents the outcome of the Rubin ToO 2024 workshop, with additional contributions from members of the Rubin Science Collaborations. The implementation of the selection criteria and strategies presented in this document has been endorsed in the SCOC Phase 3 Recommendations document (PSTN-056). Although the ToO program is still to be finalized, this document serves as a baseline plan for ToO observations with the Rubin Observatory.

With the rapid advancement of neural language models, the deployment of over-parameterized models has surged, increasing the need for interpretable explanations comprehensible to human inspectors. Existing post-hoc interpretability methods, which often focus on unigram features of single input textual instances, fail to capture the models' decision-making process fully. Additionally, many methods do not differentiate between decisions based on spurious correlations and those based on a holistic understanding of the input. Our paper introduces DISCO, a novel method for discovering global, rule-based explanations by identifying causal n-gram associations with model predictions. This method employs a scalable sequence mining technique to extract relevant text spans from training data, associate them with model predictions, and conduct causality checks to distill robust rules that elucidate model behavior. These rules expose potential overfitting and provide insights into misleading feature combinations. We validate DISCO through extensive testing, demonstrating its superiority over existing methods in offering comprehensive insights into complex model behaviors. Our approach successfully identifies all shortcuts manually introduced into the training data (100% detection rate on the MultiRC dataset), resulting in an 18.8% regression in model performance -- a capability unmatched by any other method. Furthermore, DISCO supports interactive explanations, enabling human inspectors to distinguish spurious causes in the rule-based output. This alleviates the burden of abundant instance-wise explanations and helps assess the model's risk when encountering out-of-distribution (OOD) data.

Large language models (LLMs) offer promise in generating educational content, providing instructor feedback, and reducing teacher workload on assessments. While prior studies have focused on studying LLM-powered learning analytics, limited research has examined how effective LLMs are in a bilingual context. In this paper, we study the effectiveness of multilingual large language models (MLLMs) across monolingual (English-only, Spanish-only) and bilingual (Spanglish) student writing. We present a learning analytics use case that details LLM performance in assessing acceptable and unacceptable explanations of Science and Social Science concepts. Our findings reveal a significant bias in the grading performance of pre-trained models for bilingual writing compared to English-only and Spanish-only writing. Following this, we fine-tune open-source MLLMs including Llama 3.1 and Mistral NeMo using synthetic datasets generated in English, Spanish, and Spanglish. Our experiments indicate that the models perform significantly better for all three languages after fine-tuning with bilingual data. This study highlights the potential of enhancing MLLM effectiveness to support authentic language practices amongst bilingual learners. It also aims to illustrate the value of incorporating non-English languages into the design and implementation of language models in education.

The use of parallel manipulators in aerospace engineering has gained significant attention due to their ability to provide improved stability and precision. This paper presents the design, control, and analysis of 'STEWIE', which is a three-degree-of-freedom (DoF) parallel manipulator robot developed by members of the thrustMIT rocketry team, as a payload stabilization mechanism for their sounding rocket, 'Altair'. The goal of the robot was to demonstrate the attitude control of the parallel plate against the continuous change in orientation experienced by the rocket during its flight, stabilizing the payloads. At the same time, the high gravitational forces (G-forces) and vibrations experienced by the sounding rocket are counteracted. A novel design of the mechanism, inspired by a standard Stewart platform, is proposed which was down-scaled to fit inside a 4U CubeSat within its space constraints. The robot uses three micro servo motors to actuate the links that control the alignment of the parallel plate. In addition to the actuation mechanism, a robust control system for its manipulation was developed for the robot. The robot represents a significant advancement in the field of space robotics in the aerospace industry by demonstrating the successful implementation of complex robotic mechanisms in small, confined spaces such as CubeSats, which are standard form factors for large payloads in the aerospace industry., Comment: For code and design files, refer to https://github.com/utkarshanand140/Stewie-Robot

Answering reasoning-based complex questions over text and hybrid sources, including tables, is a challenging task. Recent advances in large language models (LLMs) have enabled in-context learning (ICL), allowing LLMs to acquire proficiency in a specific task using only a few demonstration samples (exemplars). A critical challenge in ICL is the selection of optimal exemplars, which can be either task-specific (static) or test-example-specific (dynamic). Static exemplars provide faster inference times and increased robustness across a distribution of test examples. In this paper, we propose an algorithm for static exemplar subset selection for complex reasoning tasks. We introduce EXPLORA, a novel exploration method designed to estimate the parameters of the scoring function, which evaluates exemplar subsets without incorporating confidence information. EXPLORA significantly reduces the number of LLM calls to ~11% of those required by state-of-the-art methods and achieves a substantial performance improvement of 12.24%. We open-source our code and data (https://github.com/kiranpurohit/EXPLORA).

The growing demand for robust scene understanding in mobile robotics and autonomous driving has highlighted the importance of integrating multiple sensing modalities. By combining data from diverse sensors like cameras and LIDARs, fusion techniques can overcome the limitations of individual sensors, enabling a more complete and accurate perception of the environment. We introduce a novel approach to multi-modal sensor fusion, focusing on developing a graph-based state representation that supports critical decision-making processes in autonomous driving. We present a Sensor-Agnostic Graph-Aware Kalman Filter [3], the first online state estimation technique designed to fuse multi-modal graphs derived from noisy multi-sensor data. The estimated graph-based state representations serve as a foundation for advanced applications like Multi-Object Tracking (MOT), offering a comprehensive framework for enhancing the situational awareness and safety of autonomous systems. We validate the effectiveness of our proposed framework through extensive experiments conducted on both synthetic and real-world driving datasets (nuScenes). Our results showcase an improvement in MOTA and a reduction in estimated position errors (MOTP) and identity switches (IDS) for tracked objects using the SAGA-KF. Furthermore, we highlight the capability of such a framework to develop methods that can leverage heterogeneous information (like semantic objects and geometric structures) from various sensing modalities, enabling a more holistic approach to scene understanding and enhancing the safety and effectiveness of autonomous systems., Comment: An extended abstract accepted at Young Researchers' Symposium, ICVGIP '24. This extended abstract contains the following: 1. Short summary of our work, SAGA-KF, accepted at ICPR'24. 2. A proposal that was awarded the Qualcomm Innovation Fellowship'24

Objective: To assess the antioxidant, wound healing, anti-ulcer, and anti-inflammatory properties of Jatropha maheshwari. Methods: Jatropha maheshwari was collected from Kanyakumari district and authenticated. Ethanol was used for continuous hot percolation extraction of the plant. Antioxidant activity was evaluated using DPPH and ABTS assays. The wound healing potential was assessed through a wound scratch assay using 3T3-L1 murine fibroblast cell lines. Anti-ulcer activity was measured using the acid-neutralizing capacity (ANC) and H+/K+-ATPase inhibitory activity methods. Anti-inflammatory effects were determined through dose-dependent studies of the ethanol extract. Results: Antioxidant Activity: The crude extract exhibited strong antioxidant capacity with percentage inhibition values of 88% (DPPH) and 75.7% (ABTS). Wound Healing Activity: The wound closure rate in treated 3T3-L1 cell lines reached 97.88%, indicating potent wound healing properties. Anti-Ulcer Activity: The extract demonstrated an 80.1% inhibition compared to the control when tested alongside omeprazole. ANC per gram of antacid was recorded at 20 and 26 for oral doses of 10 and 500 {\mu}g/ml, respectively. Anti-Inflammatory Activity: Dose-dependent inhibition percentages of 30.1% (10 {\mu}g/ml) and 96.5% (500 {\mu}g/ml) were observed (p<0.001) relative to inflammation control. Additional percentages of 26.3% (10 {\mu}g/ml) and 42.6% (500 {\mu}g/ml) further confirmed the anti-inflammatory activity. Conclusion: Jatropha maheshwari demonstrates significant antioxidant, wound healing, anti-ulcer, and anti-inflammatory properties. Further research is warranted to elucidate the mechanisms underlying these pharmacological effects.

Recent advancements in black hole thermodynamics have introduced corrections to elucidate the relationship between entropy and extremality bound of black holes. Traditionally, this relationship has been studied in the context of black holes characterized by Bekenstein-Hawking entropy. However, this study extends the investigation to encompass non-extensive generalizations of entropy. We introduce a minor constant correction, denoted as $(\varepsilon)$, and examine the universal relations for a charged Anti-de Sitter (AdS) black hole. Our findings indicate that these universal relations do not hold for the charged AdS black hole when described by the non-extensive generalizations of entropy. Of course, with some adjustments, the universality relations are met. In contrast, the universal relations remain compatible when the black hole is described by Bekenstein-Hawking entropy., Comment: 19 pages

Like any form of technology, social media services embed values. To examine how societal values may be present in these systems, we focus on exploring political ideology as a value system. We organised four co-design workshops with political representatives from five major parties in Finland to investigate what values they would incorporate into social media services. The participants were divided into one right-leaning group, two left-leaning groups, and one mixed group. This approach allows us to examine how their political ideologies, i.e., value systems, influenced the design of social media. We analysed produced artefacts (early-stage paper mockups) to identify different features and affordances for each group and then contrasted the ideological compositions. Our results revealed a clear distinction between groups: right-leaning groups favoured market-based visibility, while left-leaning groups rejected such design principles in favour of open profile work. Additionally, we found tentative differences in design outcomes along the liberal-conservative dimension. These findings underscore the importance of acknowledging existing political value systems in the design of social computing systems. They also highlight the need for further research to map out political ideologies in technology design., Comment: 18 pages, 4 figures, in review

Future cosmic microwave background (CMB) experiments are primarily targeting a detection of the primordial $B$-mode polarisation. The faintness of this signal requires exquisite control of systematic effects which may bias the measurements. In this work, we derive requirements on the relative calibration accuracy of the overall polarisation gain ($\Delta g_\nu$) for LiteBIRD experiment, through the application of the blind Needlet Internal Linear Combination (NILC) foreground-cleaning method. We find that minimum variance techniques, as NILC, are less affected by gain calibration uncertainties than a parametric approach, which requires a proper modelling of these instrumental effects. The tightest constraints are obtained for frequency channels where the CMB signal is relatively brighter (166 GHz channel, $\Delta {g}_\nu \approx 0.16 \%$), while, with a parametric approach, the strictest requirements were on foreground-dominated channels. We then propagate gain calibration uncertainties, corresponding to the derived requirements, into all frequency channels simultaneously. We find that the overall impact on the estimated $r$ is lower than the required budget for LiteBIRD by almost a factor $5$. The adopted procedure to derive requirements assumes a simple Galactic model. We therefore assess the robustness of obtained results against more realistic scenarios by injecting the gain calibration uncertainties, according to the requirements, into LiteBIRD simulated maps and assuming intermediate- and high-complexity sky models. In this case, we employ the so-called Multi-Clustering NILC (MC-NILC) foreground-cleaning pipeline and obtain that the impact of gain calibration uncertainties on $r$ is lower than the LiteBIRD gain systematics budget for the intermediate-complexity sky model. For the high-complexity case, instead, it would be necessary to tighten the requirements by a factor $1.8$., Comment: 29 pages, 11 figures

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

One of the major bottlenecks for efficient deployment of neural network based recommendation systems is the memory footprint of their embedding tables. Although many neural network based recommendation systems could benefit from the faster on-chip memory access and increased computational power of hardware accelerators, the large embedding tables in these models often cannot fit on the constrained memory of accelerators. Despite the pervasiveness of these models, prior methods in memory optimization and parallelism fail to address the memory and communication costs of large embedding tables on accelerators. As a result, the majority of models are trained on CPUs, while current implementations of accelerators are hindered by issues such as bottlenecks in inter-device communication and main memory lookups. In this paper, we propose a theoretical framework that analyses the communication costs of arbitrary distributed systems that use lookup tables. We use this framework to propose algorithms that maximize throughput subject to memory, computation, and communication constraints. Furthermore, we demonstrate that our method achieves strong theoretical performance across dataset distributions and memory constraints, applicable to a wide range of use cases from mobile federated learning to warehouse-scale computation. We implement our framework and algorithms in PyTorch and achieve up to 6x increases in training throughput on GPU systems over baselines, on the Criteo Terabytes dataset.

Training transformer models requires substantial GPU compute and memory resources. In homogeneous clusters, distributed strategies allocate resources evenly, but this approach is inefficient for heterogeneous clusters, where GPUs differ in power and memory. As high-end GPUs are costly and limited in availability, heterogeneous clusters with diverse GPU types are becoming more common. Existing methods attempt to balance compute across GPUs based on capacity but often underutilize compute due to memory constraints. We present Cephalo, a system that optimizes compute and memory usage by decoupling compute distribution from training state assignment. Cephalo outperforms state-of-the-art methods by achieving significantly higher training throughput while supporting larger models and batch sizes.

In 1994, Erd\H{o}s and Gy\'arf\'as conjectured that every graph with minimum degree at least 3 has a cycle of length a power of 2. In 2022, Gao and Shan (Graphs and Combinatorics) proved that the conjecture is true for $P_8$-free graphs, i.e., graphs without any induced copies of a path on 8 vertices. In 2024, Hu and Shen (Discrete Mathematics) improved this result by proving that the conjecture is true for $P_{10}$-free graphs. With the aid of a computer search, we improve this further by proving that the conjecture is true for $P_{13}$-free graphs., Comment: 5 pages

Supervised deep learning has emerged as an effective tool for carrying out power side-channel attacks on cryptographic implementations. While increasingly-powerful deep learning-based attacks are regularly published, comparatively-little work has gone into using deep learning to defend against these attacks. In this work we propose a technique for identifying which timesteps in a power trace are responsible for leaking a cryptographic key, through an adversarial game between a deep learning-based side-channel attacker which seeks to classify a sensitive variable from the power traces recorded during encryption, and a trainable noise generator which seeks to thwart this attack by introducing a minimal amount of noise into the power traces. We demonstrate on synthetic datasets that our method can outperform existing techniques in the presence of common countermeasures such as Boolean masking and trace desynchronization. Results on real datasets are weak because the technique is highly sensitive to hyperparameters and early-stop point, and we lack a holdout dataset with ground truth knowledge of leaking points for model selection. Nonetheless, we believe our work represents an important first step towards deep side-channel leakage localization without relying on strong assumptions about the implementation or the nature of its leakage. An open-source PyTorch implementation of our experiments is provided.

Personalized recommendation is a ubiquitous application on the internet, with many industries and hyperscalers extensively leveraging Deep Learning Recommendation Models (DLRMs) for their personalization needs (like ad serving or movie suggestions). With growing model and dataset sizes pushing computation and memory requirements, GPUs are being increasingly preferred for executing DLRM inference. However, serving newer DLRMs, while meeting acceptable latencies, continues to remain challenging, making traditional deployments increasingly more GPU-hungry, resulting in higher inference serving costs. In this paper, we show that the embedding stage continues to be the primary bottleneck in the GPU inference pipeline, leading up to a 3.2x embedding-only performance slowdown. To thoroughly grasp the problem, we conduct a detailed microarchitecture characterization and highlight the presence of low occupancy in the standard embedding kernels. By leveraging direct compiler optimizations, we achieve optimal occupancy, pushing the performance by up to 53%. Yet, long memory latency stalls continue to exist. To tackle this challenge, we propose specialized plug-and-play-based software prefetching and L2 pinning techniques, which help in hiding and decreasing the latencies. Further, we propose combining them, as they complement each other. Experimental evaluations using A100 GPUs with large models and datasets show that our proposed techniques improve performance by up to 103% for the embedding stage, and up to 77% for the overall DLRM inference pipeline., Comment: This work has been accepted in the 57th MICRO (https://microarch.org/micro57/program/). Please check appendix for details on reproducing our work including codebase and steps

In this study, we investigate the Weak Gravity Conjecture (WGC) and Weak Cosmic Censorship Conjecture (WCCC) for a quantum-corrected Reissner-Nordstr\"om Anti-de Sitter (RN-AdS) black hole embedded in Kiselev spacetime. By making small perturbations to the action and using WGC, we investigate the stability of black holes and predict the existence of lighter particles in the spectrum. Using the scattering of a charged scalar field, we study the WCCC. We verify under certain conditions on the temperature of the black hole, the second law holds for near-extremal black holes. Finally, we demonstrate that the WCCC holds for both extremal and near-extremal black holes., Comment: Comments are Welcome

We propose a novel method for evaluating the performance of a content search system that measures the semantic match between a query and the results returned by the search system. We introduce a metric called "on-topic rate" to measure the percentage of results that are relevant to the query. To achieve this, we design a pipeline that defines a golden query set, retrieves the top K results for each query, and sends calls to GPT 3.5 with formulated prompts. Our semantic evaluation pipeline helps identify common failure patterns and goals against the metric for relevance improvements., Comment: Accepted by 3rd International Workshop on Industrial Recommendation Systems (at CIKM 2024)

In this work, we explore a new approach to designing both algorithms and error detection codes for preparing approximate ground states of molecules. We propose a classical algorithm to find the optimal stabilizer state by using excitations of the Hartree-Fock state, followed by constructing quantum error-detection codes based on this stabilizer state using codeword-stabilized codes. Through various numerical experiments, we confirm that our method finds the best stabilizer approximations to the true ground states of molecules up to 36 qubits in size. Additionally, we construct generalized stabilizer states that offer a better approximation to the true ground states. Furthermore, for a simple noise model, we demonstrate that both the stabilizer and (some) generalized stabilizer states can be prepared with higher fidelity using the error-detection codes we construct. Our work represents a promising step toward designing algorithms for early fault-tolerant quantum computation.