Search

There's a rise in the employment of uncertified teachers, driven by acute staffing shortages and the flexibility offered by Texas' District of Innovation plans. This reliance on uncertified educators is raising alarms among educators and policymakers alike. Concerns are mounting over whether these teachers, often entering the classroom having never worked in public schools, are equipped to meet the demands of today's classrooms. This brief presents new evidence showing that uncertified teachers are linked to declines in student achievement. The study examines the prevalence, backgrounds, and impacts of uncertified teachers on student achievement and draws attention to significant differences within this diverse group of educators. As schools continue to hire uncertified teachers to address staffing shortages, knowing the backgrounds of these teachers and how they shape student achievement helps stakeholders prioritize transition points, such as hiring individuals with previous classroom experience in non-teaching roles. This brief outlines findings from the 2021-22 and 2022-23 school years and provides recommendations for policymakers and stakeholder groups.

This study addresses the burgeoning phenomenon of fully online alternative teacher certification programs (ACPs). In Texas where most teachers are prepared via ACPs, our research zeroes in on the proportion of teachers who are prepared fully online and the relative effectiveness of teacher preparation programs on student achievement and teacher retention. Using statewide longitudinal data from 2014-2023, our findings show that 1 in 4 of Texas students are being taught by teachers prepared fully online Students taught by teachers prepared online exhibit comparable levels of achievement to those taught by uncertified teachers, underperforming compared to students taught by teachers from other preparation pathways. Moreover, these teachers exhibit a markedly higher turnover rate. This study contributes to the ongoing discourse on teacher preparation quality, offering insights for policymakers and stakeholders.

Policymakers and educational leaders across state and federal agencies have invested considerable effort in identifying how schools can both mitigate and exacerbate student absenteeism. Despite extensive research into school-level characteristics and programs, there remains a notable gap in understanding the impact of classroom-level factors on absenteeism. This study investigates how classmates' absences impact student absenteeism in four Texas school districts, analyzing both in-person and virtual contexts. Using a novel approach that accounts for day-to-day attendance variation, findings indicate that in-person absenteeism among peers significantly increases a student's absenteeism, with effects lasting up to three days, regardless of achievement levels. However, virtual absenteeism showed no similar impact, highlighting distinct absenteeism dynamics in virtual environments. Amid COVID-19 disruptions, this underscores the need for interventions addressing absenteeism across varied learning settings, offering insights for policymakers and educators in navigating the challenges of both physical and virtual classroom dynamics.

When training transformers on graph-structured data, incorporating information about the underlying topology is crucial for good performance. Topological masking, a type of relative position encoding, achieves this by upweighting or downweighting attention depending on the relationship between the query and keys in a graph. In this paper, we propose to parameterise topological masks as a learnable function of a weighted adjacency matrix -- a novel, flexible approach which incorporates a strong structural inductive bias. By approximating this mask with graph random features (for which we prove the first known concentration bounds), we show how this can be made fully compatible with linear attention, preserving $\mathcal{O}(N)$ time and space complexity with respect to the number of input tokens. The fastest previous alternative was $\mathcal{O}(N \log N)$ and only suitable for specific graphs. Our efficient masking algorithms provide strong performance gains for tasks on image and point cloud data, including with $>30$k nodes.

Disaggregated memory breaks the boundary of monolithic servers to enable memory provisioning on demand. Using network-attached memory to provide memory expansion for memory-intensive applications on compute nodes can improve the overall memory utilization on a cluster and reduce the total cost of ownership. However, current software solutions for leveraging network-attached memory must consume resources on the compute node for memory management tasks. Emerging off-path smartNICs provide general-purpose programmability at low-cost low-power cores. This work provides a general architecture design that enables network-attached memory and offloading tasks onto off-path programmable SmartNIC. We provide a prototype implementation called SODA on Nvidia BlueField DPU. SODA adapts communication paths and data transfer alternatives, pipelines data movement stages, and enables customizable data caching and prefetching optimizations. We evaluate SODA in five representative graph applications on real-world graphs. Our results show that SODA can achieve up to 7.9x speedup compared to node-local SSD and reduce network traffic by 42% compared to disaggregated memory without SmartNIC offloading at similar or better performance.

Swarm robotics, or very large-scale robotics (VLSR), has many meaningful applications for complicated tasks. However, the complexity of motion control and energy costs stack up quickly as the number of robots increases. In addressing this problem, our previous studies have formulated various methods employing macroscopic and microscopic approaches. These methods enable microscopic robots to adhere to a reference Gaussian mixture model (GMM) distribution observed at the macroscopic scale. As a result, optimizing the macroscopic level will result in an optimal overall result. However, all these methods require systematic and global generation of Gaussian components (GCs) within obstacle-free areas to construct the GMM trajectories. This work utilizes centroidal Voronoi tessellation to generate GCs methodically. Consequently, it demonstrates performance improvement while also ensuring consistency and reliability., Comment: Submitted to American Control Conference (ACC) 2025

Training deep models for time series forecasting is a critical task with an inherent challenge of time complexity. While current methods generally ensure linear time complexity, our observations on temporal redundancy show that high-level features are learned 98.44\% slower than low-level features. To address this issue, we introduce a new exponentially weighted stochastic gradient descent algorithm designed to achieve constant time complexity in deep learning models. We prove that the theoretical complexity of this learning method is constant. Evaluation of this method on Kernel U-Net (K-U-Net) on synthetic datasets shows a significant reduction in complexity while improving the accuracy of the test set.

Diacritical marks in the Hebrew language give words their vocalized form. The task of adding diacritical marks to plain Hebrew text is still dominated by a system that relies heavily on human-curated resources. Recent models trained on diacritized Hebrew texts still present a gap in performance. We use a recently developed char-based PLM to narrowly bridge this gap. Presenting MenakBERT, a character level transformer pretrained on Hebrew text and fine-tuned to produce diacritical marks for Hebrew sentences. We continue to show how finetuning a model for diacritizing transfers to a task such as part of speech tagging., Comment: Published at ISCOL2022 as a poster

After nearly fifty years of searching, the vacuum ultraviolet $^{229}$Th nuclear isomeric transition has recently been directly laser excited [1,2] and measured with high spectroscopic precision [3]. Nuclear clocks based on this transition are expected to be more robust [4,5] than and may outperform [6,7] current optical atomic clocks. They also promise sensitive tests for new physics beyond the standard model [5,8,9]. In light of these important advances and applications, a dramatic increase in the need for $^{229}$Th spectroscopy targets in a variety of platforms is anticipated. However, the growth and handling of high-concentration $^{229}$Th-doped crystals [5] used in previous measurements [1-3,10] are challenging due to the scarcity and radioactivity of the $^{229}$Th material. Here, we demonstrate a potentially scalable solution to these problems by demonstrating laser excitation of the nuclear transition in $^{229}$ThF$_4$ thin films grown with a physical vapor deposition process, consuming only micrograms of $^{229}$Th material. The $^{229}$ThF$_4$ thin films are intrinsically compatible with photonics platforms and nanofabrication tools for integration with laser sources and detectors, paving the way for an integrated and field-deployable solid-state nuclear clock with radioactivity up to three orders of magnitude smaller than typical \thor-doped crystals [1-3,10]. The high nuclear emitter density in $^{229}$ThF$_4$ also potentially enables quantum optics studies in a new regime. Finally, we describe the operation and present the estimation of the performance of a nuclear clock based on a defect-free ThF$_4$ crystal., Comment: 15 pages, 3 figures

Cardiac magnetic resonance imaging (CMR), considered the gold standard for noninvasive cardiac assessment, is a diverse and complex modality requiring a wide variety of image processing tasks for comprehensive assessment of cardiac morphology and function. Advances in deep learning have enabled the development of state-of-the-art (SoTA) models for these tasks. However, model training is challenging due to data and label scarcity, especially in the less common imaging sequences. Moreover, each model is often trained for a specific task, with no connection between related tasks. In this work, we introduce a vision foundation model trained for CMR assessment, that is trained in a self-supervised fashion on 36 million CMR images. We then finetune the model in supervised way for 9 clinical tasks typical to a CMR workflow, across classification, segmentation, landmark localization, and pathology detection. We demonstrate improved accuracy and robustness across all tasks, over a range of available labeled dataset sizes. We also demonstrate improved few-shot learning with fewer labeled samples, a common challenge in medical image analyses. We achieve an out-of-box performance comparable to SoTA for most clinical tasks. The proposed method thus presents a resource-efficient, unified framework for CMR assessment, with the potential to accelerate the development of deep learning-based solutions for image analysis tasks, even with few annotated data available., Comment: 11 pages, 3 figures, 4 tables

Background: One of the key FDA-approved medications for Opioid Use Disorder (OUD) is buprenorphine. Despite its popularity, individuals often report various information needs regarding buprenorphine treatment on social media platforms like Reddit. However, the key challenge is to characterize these needs. In this study, we propose a theme-based framework to curate and analyze large-scale data from social media to characterize self-reported treatment information needs (TINs). Methods: We collected 15,253 posts from r/Suboxone, one of the largest Reddit sub-community for buprenorphine products. Following the standard protocol, we first identified and defined five main themes from the data and then coded 6,000 posts based on these themes, where one post can be labeled with applicable one to three themes. Finally, we determined the most frequently appearing sub-themes (topics) for each theme by analyzing samples from each group. Results: Among the 6,000 posts, 40.3% contained a single theme, 36% two themes, and 13.9% three themes. The most frequent topics for each theme or theme combination came with several key findings - prevalent reporting of psychological and physical effects during recovery, complexities in accessing buprenorphine, and significant information gaps regarding medication administration, tapering, and usage of substances during different stages of recovery. Moreover, self-treatment strategies and peer-driven advice reveal valuable insights and potential misconceptions. Conclusions: The findings obtained using our proposed framework can inform better patient education and patient-provider communication, design systematic interventions to address treatment-related misconceptions and rumors, and streamline the generation of hypotheses for future research.

High-end ARM processors are emerging in data centers and HPC systems, posing as a strong contender to x86 machines. Memory-centric profiling is an important approach for dissecting an application's bottlenecks on memory access and guiding optimizations. Many existing memory profiling tools leverage hardware performance counters and precise event sampling, such as Intel PEBS and AMD IBS, to achieve high accuracy and low overhead. In this work, we present a multi-level memory profiling tool for ARM processors, leveraging Statistical Profiling Extension (SPE). We evaluate the tool using both HPC and Cloud workloads on the ARM Ampere processor. Our results provide the first quantitative assessment of time overhead and sampling accuracy of ARM SPE for memory-centric profiling at different sampling periods and aux buffer sizes., Comment: To be published in Workshop Proceedings of The International Conference for High Performance Computing Networking, Storage, and Analysis (SC-W '24) (2024)

Christiano et al. (2022) define a *heuristic estimator* to be a hypothetical algorithm that estimates the values of mathematical expressions from arguments. In brief, a heuristic estimator $\mathbb{G}$ takes as input a mathematical expression $Y$ and a formal "heuristic argument" $\pi$, and outputs an estimate $\mathbb{G}(Y \mid \pi)$ of $Y$. In this work, we argue for the informal principle that a heuristic estimator ought not to be able to predict its own errors, and we explore approaches to formalizing this principle. Most simply, the principle suggests that $\mathbb{G}(Y - \mathbb{G}(Y \mid \pi) \mid \pi)$ ought to equal zero for all $Y$ and $\pi$. We argue that an ideal heuristic estimator ought to satisfy two stronger properties in this vein, which we term *iterated estimation* (by analogy to the law of iterated expectations) and *error orthogonality*. Although iterated estimation and error orthogonality are intuitively appealing, it can be difficult to determine whether a given heuristic estimator satisfies the properties. As an alternative approach, we explore *accuracy*: a property that (roughly) states that $\mathbb{G}$ has zero average error over a distribution of mathematical expressions. However, in the context of two estimation problems, we demonstrate barriers to creating an accurate heuristic estimator. We finish by discussing challenges and potential paths forward for finding a heuristic estimator that accords with our intuitive understanding of how such an estimator ought to behave, as well as the potential applications of heuristic estimators to understanding the behavior of neural networks., Comment: 47 pages, 2 tables, 1 figure

Given a smooth proper family $\phi:X\rightarrow S$, we study the (quasi)-periods of the fibers of $\phi$ as (germs of) functions on $S$. We show that they field they generate has the same algebraic closure as that given by the flag variety co-ordinates parametrizing the corresponding Hodge filtration, together with their derivatives. Moreover, in the more general context of an arbitrary flat vector bundle, we determine the transcendence degree of the function field generated by the flat coordinates of algebraic sections. Our results are inspired by and generalize work of Bertrand--Zudilin., Comment: 17 pages, comments welcome!

We show that if a topological insulator is truncated along a curve that separates the plane in two sufficiently large regions, then the edge system admits absolutely continuous spectrum. Our approach combines a recent version of the bulk-edge correspondence along curves that separates geometry and intrinsic conductance [DZ24], with a result about absolutely continuous spectrum for straight edges [BW22]., Comment: 19 pages, 4 figures

We prove that for every Shimura variety $S$, there is an integral model $\mathcal{S}$ such that all CM points of $S$ have good reduction with respect to $\mathcal{S}$. In other words, every CM point is contained in $\mathcal{S}(\overline{\mathbb{Z}})$. This follows from a stronger local result wherein we characterize the points of $S$ with potentially-good reduction (with respect to some auxiliary prime $\ell$) as being those that extend to integral points of $\mathcal{S}$., Comment: 8 pages. Comments welcome!

Toxicity is a widespread phenomenon in competitive online video games. In addition to its direct undesirable effects, there is a concern that toxicity can spread to others, amplifying the harm caused by a single player's misbehavior. In this study, we estimate whether and to what extent a player's toxic speech spreads, causing their teammates to behave similarly. To this end, we analyze proprietary data from the free-to-play first-person action game Call of Duty: Warzone. We formulate and implement an instrumental variable identification strategy that leverages the network of interactions among players across matches. Our analysis reveals that all else equal, all of a player's teammates engaging in toxic speech increases their probability of engaging in similar behavior by 26.1 to 30.3 times the average player's likelihood of engaging in toxic speech. These findings confirm the viral nature of toxicity, especially toxic speech, in competitive online video games.

Generative artificial intelligence (AI) technology is revolutionizing the computing industry. Not only its applications have broadened to various sectors but also poses new system design and optimization opportunities. The technology is capable of understanding and responding in multiple modalities. However, the advanced capability currently comes with significant system resource demands. To sustainably scale generative AI capabilities to billions of users in the world, inference must be fast and efficient. This paper pinpoints key system design and optimization opportunities by characterizing a family of emerging multi-modal generation models on real systems. Auto-regressive token generation is a critical latency performance bottleneck, typically dominated by GPU idle time. In addition to memory-intensive attention across the generative AI models, linear operations constitute significant inference latency due to the feed forward networks in Transformer-based models. We demonstrate that state-of-the-art optimization levers, spanning from applications to system software and hardware, set a 3.88x better baseline., Comment: 13 pages including references. 8 Figures. Under review to HPCA 2025 Industry Track

Hundreds of exoplanets between 1-1.8 times the size of the Earth have been discovered on close in orbits. However, these planets show such a diversity in densities that some appear to be made entirely of iron, while others appear to host gaseous envelopes. To test this diversity in composition, we update the masses of 5 rocky exoplanets (HD 93963 A b, Kepler-10 b, Kepler-100 b, Kepler-407 b, and TOI-1444 b) and present the confirmation of a new planet (TOI-1011) using 187 high precision RVs from Gemini/MAROON-X and Keck/KPF. Our updated planet masses suggest compositions closer to that of the Earth than previous literature values for all planets in our sample. In particular, we report that two previously identified ``super-Mercuries'' (Kepler-100 b and HD 93963 A b) have lower masses that suggest less iron-rich compositions. We then compare the ratio of iron to rock-building species to the abundance ratios of those elements in their host stars. These updated planet compositions do not suggest a steep relationship between planet and host star compositions, contradictory to previous results, and suggest that planets and host stars have similar abundance ratios., Comment: Submitted to AJ 09/30/2024

Let $A\subseteq \mathbb{Z}_p^2$ be a set of size $2p+1$ for prime $p\geq 5$. In this paper, we prove that $A\hat{+}A=\{a_1+a_2\mid a_1,a_2\in A, a_1\neq a_2\}$ has cardinality at least $4p$. This result is the first advancement in over two decades on a variant of the Erd\H{o}s-Heilbronn problem studied by Eliahou and Kervaire., Comment: 20 pages, preprint to be submitted shortly

We consider a wireless network where a source generates packets and forwards them to a network containing $n$ nodes. The nodes in the network use the asynchronous push, pull or push-pull gossip communication protocols to maintain the most recent updates from the source. We use the version age of information metric to quantify the freshness of information in the network. Prior to this work, only the push gossiping protocol has been studied for age of information analysis. In this paper, we use the stochastic hybrid systems (SHS) framework to obtain recursive equations for the expected version age of sets of nodes in the time limit. We then show that the pull and push-pull protocols can achieve constant version age, while it is already known that the push protocol can only achieve logarithmic version age. We then show that the push-pull protocol performs better than the push and the pull protocol. Finally, we carry out numerical simulations to evaluate these results.

We present the Duke Humanoid, an open-source 10-degrees-of-freedom humanoid, as an extensible platform for locomotion research. The design mimics human physiology, with minimized leg distances and symmetrical body alignment in the frontal plane to maintain static balance with straight knees. We develop a reinforcement learning policy that can be deployed zero-shot on the hardware for velocity-tracking walking tasks. Additionally, to enhance energy efficiency in locomotion, we propose an end-to-end reinforcement learning algorithm that encourages the robot to leverage passive dynamics. Our experiment results show that our passive policy reduces the cost of transport by up to $50\%$ in simulation and $31\%$ in real-world testing. Our website is http://generalroboticslab.com/DukeHumanoidv1/ ., Comment: submitted to ICRA 2025

Fix two words over the binary alphabet $\{0,1\}$, and generate iid Bernoulli$(p)$ bits until one of the words occurs in sequence. This setup, commonly known as Penney's ante, was popularized by Conway, who found (in unpublished work) a simple formula for the probability that a given word occurs first. We study win probabilities in Penney's ante from an analytic and combinatorial perspective, building on previous results for the case $p = \frac{1}{2}$ and words of the same length. For words of arbitrary lengths, our results bound how large the win probability can be for the longer word. When $p = \frac{1}{2}$ we characterize when a longer word can be statistically favorable, and for $p \neq \frac{1}{2}$ we present a conjecture describing the optimal pairs, which is supported by computer computations. Additionally, we find that Penney's ante often exhibits symmetry under the transformation $p \to 1-p$. We construct new explicit bijections that account for these symmetries, under conditions that can be easily verified by examining auto- and cross-correlations of the words., Comment: 20 pages, 2 figures

Land management could help mitigate climate change by sequestering atmospheric carbon dioxide as soil organic carbon (SOC). The impact of a given management change on the SOC content of a given volume of soil is generally unknown, but is likely moderated by features of the land that collectively determine its sequestration potential. To maximize sequestration, management interventions should be preferentially applied to fields with the highest sequestration potential and the lowest cost of application. We present a design-based statistical framework for estimating sequestration potential, average treatment effects, and optimal management policies from a randomized experiment with baseline covariate information. We review the myriad and nested sources of uncertainty that arise in this context and formalize the problem using potential outcomes. We show that a particular regression estimator -- regressing field-level SOC on management indicators and their interactions with covariates -- can help identify effective policies. The regression estimator also gives asymptotically valid inference on average treatment effects under the randomized design -- without modeling assumptions -- and can increase precision and power compared to the difference-in-means $T$-test. We conclude by discussing the saturation hypothesis in relation to sequestration potential, other study designs including observational studies of SOC, models for policy costs, nonparametric inference, and broader policy uncertainties., Comment: 34 pages, 4 figures, 2 tables

Crossed Andreev reflection (CAR) is a process that creates entanglement between spatially separated electrons and holes. Such entangled pairs have potential applications in quantum information processing, and it is therefore relevant to determine how the probability for CAR can be increased. CAR competes with another non-local process called elastic cotunneling (EC), which does not create entanglement. In conventional normal metal/superconductor/normal metal heterostructures, earlier theoretical work predicted that EC dominates over CAR. Nevertheless, we show numerically that when the Keldysh-Usadel equations are solved self-consistently in the superconductor, CAR can dominate over EC. Self-consistency is necessary both for the conversion from a quasiparticle current to a supercurrent and to describe the spatial variation of the order parameter correctly. A requirement for the CAR probability to surpass the EC probability is that the inverse proximity effect is small. Otherwise, the subvoltage density of states becomes large and EC is strengthened by quasiparticles flowing through the superconductor. Therefore, CAR becomes dominant in the non-local transport with increasing interface resistance and length of the superconducting region. Our results show that even the simplest possible experimental setup with easily accessible normal metals and superconductors can provide dominant CAR by designing the experimental parameters correctly. We also find that spin-splitting in the superconductor increases the subvoltage density of states, and thus always favors EC over CAR. Finally, we tune the chemical potential in the leads such that transport is governed by electrons of one spin type. This can increase the CAR probability at finite values of the spin-splitting compared to using a spin-degenerate voltage bias, and provides a way to control the spin of the conduction electrons electrically., Comment: 9 pages, 8 figures

In this paper, we explore the concept of $\sigma$-quasiconvexity for functions defined on normed vector spaces. This notion encompasses two important and well-established concepts: quasiconvexity and strong quasiconvexity. We start by analyzing certain operations on functions that preserve $\sigma$-quasiconvexity. Next, we present new results concerning the strong quasiconvexity of norm and Minkowski functions in infinite dimensions. Furthermore, we extend a recent result by F. Lara [16] on the supercoercive properties of strongly quasiconvex functions, with applications to the existence and uniqueness of minima, from finite dimensions to infinite dimensions. Finally, we address counterexamples related to strong quasiconvexity.

Semiconductor crosshatch patterns in thin film heterostructures form as a result of strain relaxation processes and dislocation pile-ups during growth of lattice mismatched materials. Due to their connection with the internal misfit dislocation network, these crosshatch patterns are a complex fingerprint of internal strain relaxation and growth anisotropy. Therefore, this mesoscopic fingerprint not only describes the residual strain state of a near-surface quantum well, but also could provide an indicator of the quality of electron transport through the material. Here, we present a method utilizing computer vision and machine learning to analyze AFM crosshatch patterns that exhibits this correlation. Our analysis reveals optimized electron transport for moderate values of $\lambda$ (crosshatch wavelength) and $\epsilon$ (crosshatch height), roughly 1 $\mu$m and 4 nm, respectively, that define the average waveform of the pattern. Simulated 2D AFM crosshatch patterns are used to train a machine learning model to correlate the crosshatch patterns to dislocation density. Furthermore, this model is used to evaluate the experimental AFM images and predict a dislocation density based on the crosshatch waveform. Predicted dislocation density, experimental AFM crosshatch data, and experimental transport characterization are used to train a final model to predict 2D electron gas mean free path. This model shows electron scattering is strongly correlated with elastic effects (e.g. dislocation scattering) below 200 nm $\lambda_{MFP}$.

The Majorana fermion offers fascinating possibilities such as non-Abelian statistics and non-local robust qubits, and hunting it is one of the most important topics in current condensed matter physics. Most of the efforts have been focused on the Majorana bound state at zero energy in terms of scanning tunneling spectroscopy searching for the quantized conductance. On the other hand, a chiral Majorana edge channel appears at the surface of a three-dimensional topological insulator when engineering an interface between proximity-induced superconductivity and ferromagnetism. Recent advances in microwave spectroscopy of topological edge states open a new avenue for observing signatures of such Majorana edge states through the local optical conductivity. As a guide to future experiments, we show how the local optical conductivity and density of states present distinct qualitative features depending on the symmetry of the superconductivity, that can be tuned via the magnetization and temperature. In particular, the presence of the Majorana edge state leads to a characteristic non-monotonic temperature dependence achieved by tuning the magnetization., Comment: Main text: 9 pages, 5 figures. Supplemental Information: 4 pages, 3 figures

A recently proposed analytical solution for the equations of motion of the one-body Green function of the double quantum dot is extended to the out-of-equilibrium situation. By solving a linear system for the density correlators, not only the local occupations but also charge and heat currents as well as transport coefficients and the figure of merit are analytically derived in terms of system parameters and external driving forces. The emerging regions of stable occupation and finite currents are explained in terms of addition and removal energies, corresponding to the poles of the Green function. The analytical results are validated against the hierarchical equations of motion method, showing excellent agreement., Comment: 16 pages, 5 figures

Data representation in non-Euclidean spaces has proven effective for capturing hierarchical and complex relationships in real-world datasets. Hyperbolic spaces, in particular, provide efficient embeddings for hierarchical structures. This paper introduces the Hyperbolic Vision Transformer (HVT), a novel extension of the Vision Transformer (ViT) that integrates hyperbolic geometry. While traditional ViTs operate in Euclidean space, our method enhances the self-attention mechanism by leveraging hyperbolic distance and M\"obius transformations. This enables more effective modeling of hierarchical and relational dependencies in image data. We present rigorous mathematical formulations, showing how hyperbolic geometry can be incorporated into attention layers, feed-forward networks, and optimization. We offer improved performance for image classification using the ImageNet dataset.

Non-invasive imaging of microwave (MW) magnetic fields with microscale lateral resolution is pivotal for various applications, such as MW technologies and integrated circuit failure analysis. Diamond nitrogen-vacancy (NV) center magnetometry has emerged as an ideal tool, offering $\mu$m-scale resolution, millimeter-scale field of view, high sensitivity, and non-invasive imaging compatible with diverse samples. However, up until now, it has been predominantly used for imaging of static or low-frequency magnetic fields or, concerning MW field imaging, to directly characterize the same microwave device used to drive the NV spin transitions. In this work we leverage an NV center ensemble in diamond for wide-field imaging of MW magnetic fields generated by a test device employing a differential measurement protocol. The microscope is equipped with a MW loop to induce Rabi oscillations between NV spin states, and the MW field from the device-under-test is measured through local deviations in the Rabi frequency. This differential protocol yields magnetic field maps of a 2.57 GHz MW field with a sensitivity of $\sim$ 9 $\mu$T Hz$^{-1/2}$ for a total measurement duration of $T = 357$ s, covering a $340\times340$ $\mu$m$^2$ field of view with a $\mu$m-scale spatial resolution and a DUT input power dynamic range of 30 dB. This work demonstrates a novel NV magnetometry protocol, based on differential Rabi frequency measurement, that extends NV wide-field imaging capabilities to imaging of weak MW magnetic fields that would be difficult to measure directly through standard NV Rabi magnetometry.

The characterization of young planets (< 300 Myr) is pivotal for understanding planet formation and evolution. We present the 3-5$\mu$m transmission spectrum of the 17 Myr, Jupiter-size ($R$ $\sim$10$R_{\oplus}$) planet, HIP 67522 b, observed with JWST/NIRSpec/G395H. To check for spot contamination, we obtain a simultaneous $g$-band transit with SOAR. The spectrum exhibits absorption features 30-50% deeper than the overall depth, far larger than expected from an equivalent mature planet, and suggests that HIP 67522 b's mass is $<$20 $M_{\oplus}$ irrespective of cloud cover and stellar contamination. A Bayesian retrieval analysis returns a mass constraint of $13.8\pm1.0M_{\oplus}$. This challenges the previous classification of HIP 67522 b as a hot Jupiter and instead, positions it as a precursor to the more common sub-Neptunes. With a density of $<$0.10g/cm$^{3}$, HIP 67522 b is one of the lowest density planets known. We find strong absorption from H$_{2}$O and CO$_{2}$ ($\ge7\sigma$), a modest detection of CO (3.5$\sigma$), and weak detections of H$_2$S and SO$_2$ ($\simeq2\sigma$). Comparisons with radiative-convective equilibrium models suggest supersolar atmospheric metallicities and solar-to-subsolar C/O ratios, with photochemistry further constraining the inferred atmospheric metallicity to 3$\times$10 Solar due to the amplitude of the SO$_2$ feature. These results point to the formation of HIP 67522 b beyond the water snowline, where its envelope was polluted by icy pebbles and planetesimals. The planet is likely experiencing substantial mass loss (0.01-0.03 M$_{\oplus}$ Myr$^{-1}$), sufficient for envelope destruction within a Gyr. This highlights the dramatic evolution occurring within the first 100 Myr of its existence., Comment: Accepted for publication in The Astronomical Journal; 32 pages, 18 figures, 7 tables

Advancements in 3D rendering like Gaussian Splatting (GS) allow novel view synthesis and real-time rendering in virtual reality (VR). However, GS-created 3D environments are often difficult to edit. For scene enhancement or to incorporate 3D assets, segmenting Gaussians by class is essential. Existing segmentation approaches are typically limited to certain types of scenes, e.g., ''circular'' scenes, to determine clear object boundaries. However, this method is ineffective when removing large objects in non-''circling'' scenes such as large outdoor scenes. We propose Semantics-Controlled GS (SCGS), a segmentation-driven GS approach, enabling the separation of large scene parts in uncontrolled, natural environments. SCGS allows scene editing and the extraction of scene parts for VR. Additionally, we introduce a challenging outdoor dataset, overcoming the ''circling'' setup. We outperform the state-of-the-art in visual quality on our dataset and in segmentation quality on the 3D-OVS dataset. We conducted an exploratory user study, comparing a 360-video, plain GS, and SCGS in VR with a fixed viewpoint. In our subsequent main study, users were allowed to move freely, evaluating plain GS and SCGS. Our main study results show that participants clearly prefer SCGS over plain GS. We overall present an innovative approach that surpasses the state-of-the-art both technically and in user experience.

The Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is one of the most successful examples of a derandomized evolution strategy. However, it still relies on randomly sampling offspring, which can be done via a uniform distribution and subsequently transforming into the required Gaussian. Previous work has shown that replacing this uniform sampling with a low-discrepancy sampler, such as Halton or Sobol sequences, can improve performance over a wide set of problems. We show that iterating through small, fixed sets of low-discrepancy points can still perform better than the default uniform distribution. Moreover, using only 128 points throughout the search is sufficient to closely approximate the empirical performance of using the complete pseudorandom sequence up to dimensionality 40 on the BBOB benchmark. For lower dimensionalities (below 10), we find that using as little as 32 unique low discrepancy points performs similar or better than uniform sampling. In 2D, for which we have highly optimized low discrepancy samples available, we demonstrate that using these points yields the highest empirical performance and requires only 16 samples to improve over uniform sampling. Overall, we establish a clear relation between the $L_2$ discrepancy of the used point set and the empirical performance of the CMA-ES.

Privacy-preserving voice conversion aims to remove only the attributes of speech audio that convey identity information, keeping other speech characteristics intact. This paper presents a mechanism for privacy-preserving voice conversion that allows controlling the leakage of identity-bearing information using adversarial information hiding. This enables a deliberate trade-off between maintaining source-speech characteristics and modification of speaker identity. As such, the approach improves on voice-conversion techniques like CycleGAN and StarGAN, which were not designed for privacy, meaning that converted speech may leak personal information in unpredictable ways. Our approach is also more flexible than ASR-TTS voice conversion pipelines, which by design discard all prosodic information linked to textual content. Evaluations show that the proposed system successfully modifies perceived speaker identity whilst well maintaining source lexical content., Comment: Accepted for publication in proceedings of 4th symposium on security and privacy in speech communication

Dreams offer a unique window into the cognitive and affective dynamics of the sleeping and the waking mind. Recent quantitative linguistic approaches have shown promise in obtaining corpus-level measures of dream sentiment and topic occurrence. However, it is currently unclear how the affective content of individual dreams relates to their semantic content and structure. Here, we combine word embedding, topic modeling, and network analysis to investigate this relationship. By applying Discourse Atom Topic Modeling (DATM) to the DreamBank corpus of >18K dream reports, we represent the latent themes arising within dreams as a sparse dictionary of topics and identify the affective associations of those topics. We show that variation in dream affect (valence and arousal) is associated with changes in topical content. By representing each dream report as a network of topics, we demonstrate that the affective content of dreams is also coupled to semantic structure. Specifically, positively valenced dreams exhibit more coherent, structured, and linear narratives, whilst negatively valenced dreams have more narrative loops and dominant topics. Additionally, topic networks of high arousal dreams are structurally dominated by few high arousal topics and incoherent topical connections, whereas low arousal dreams contain more loops. These findings suggest that affective processes are associated with both the content and structure of dreams. Our approach showcases the potential of integrating natural language processing and network analysis with psychology to elucidate the interplay of affect, cognition and narrative in dreams. This methodology has broad applications for the study of narrated experience and psychiatric symptomatology.

The class of graph deletion problems has been extensively studied in theoretical computer science, particularly in the field of parameterized complexity. Recently, a new notion of graph deletion problems was introduced, called deletion to scattered graph classes, where after deletion, each connected component of the graph should belong to at least one of the given graph classes. While fixed-parameter algorithms were given for a wide variety of problems, little progress has been made on the kernelization complexity of any of them. In this paper, we present the first non-trivial polynomial kernel for one such deletion problem, where, after deletion, each connected component should be a clique or a tree - that is, as densest as possible or as sparsest as possible (while being connected). We develop a kernel consisting of O(k^5) vertices for this problem., Comment: 20 pages, 4 figures, An extended abstract accepted to ISAAC-2024

Since the first direct detection of gravitational waves by the LIGO--Virgo collaboration in 2015, the size of the gravitational-wave transient catalog has grown to nearly 100 events, with more than as many observed during the ongoing fourth observing run. Extracting astrophysical/cosmological information from these observations is a hierarchical Bayesian inference problem. GWPopulation is designed to provide simple-to-use, robust, and extensible tools for hierarchical inference in gravitational-wave astronomy/cosmology. It has been widely adopted for gravitational-wave astronomy, including producing flagship results for the LIGO-Virgo-KAGRA collaborations. While designed to work with observations of compact binary coalescences, GWPopulation may be available to a wider range of hierarchical Bayesian inference problems., Comment: Paper submitted to JOSS describing https://github.com/ColmTalbot/gwpopulation

Generative AI has shown its values for many software engineering tasks. Still in its infancy, large language model (LLM)-based proof generation lags behind LLM-based code generation. In this paper, we present AutoVerus. AutoVerus uses LLM to automatically generate correctness proof for Rust code. AutoVerus is designed to match the unique features of Verus, a verification tool that can prove the correctness of Rust code using proofs and specifications also written in Rust. AutoVerus consists of a network of LLM agents that are crafted and orchestrated to mimic human experts' three phases of proof construction: preliminary proof generation, proof refinement guided by generic tips, and proof debugging guided by verification errors. To thoroughly evaluate AutoVerus and help foster future research in this direction, we have built a benchmark suite of 150 non-trivial proof tasks, based on existing code-generation benchmarks and verification benchmarks. Our evaluation shows that AutoVerus can automatically generate correct proof for more than 90% of them, with more than half of them tackled in less than 30 seconds or 3 LLM calls.

Language models (LMs) can produce errors that are hard to detect for humans, especially when the task is complex. RLHF, the most popular post-training method, may exacerbate this problem: to achieve higher rewards, LMs might get better at convincing humans that they are right even when they are wrong. We study this phenomenon under a standard RLHF pipeline, calling it "U-SOPHISTRY" since it is Unintended by model developers. Specifically, we ask time-constrained (e.g., 3-10 minutes) human subjects to evaluate the correctness of model outputs and calculate humans' accuracy against gold labels. On a question-answering task (QuALITY) and programming task (APPS), RLHF makes LMs better at convincing our subjects but not at completing the task correctly. RLHF also makes the model harder to evaluate: our subjects' false positive rate increases by 24.1% on QuALITY and 18.3% on APPS. Finally, we show that probing, a state-of-the-art approach for detecting Intended Sophistry (e.g. backdoored LMs), does not generalize to U-SOPHISTRY. Our results highlight an important failure mode of RLHF and call for more research in assisting humans to align them.

In gossip networks, a source node forwards time-stamped updates to a network of observers according to a Poisson process. The observers then update each other on this information according to Poisson processes as well. The Age of Information (AoI) of a given node is the difference between the current time and the most recent time-stamp of source information that the node has received. We provide a method for evaluating the AoI of a node in terms of first passage percolation. We then use this distributional identity to prove matching upper and lower bounds on the AoI in terms of connectivity properties of the underlying network. In particular, if one sets $X_v$ to be the AoI of node $v$ on a finite graph $G$ with $n$ nodes, then we define $m_\ast = \min\{m : m \cdot |B_m(v)| \geq n\}$ where $B_m(v)$ is the ball of radius $m$ in $G$. In the case when the maximum degree of $G$ is bounded by $\Delta$ we prove $\mathbb{E} X_v = \Theta_\Delta(m_\ast)$. As corollaries, we solve multiple open problems in the literature such as showing the age of information on a subset of $\mathbb{Z}^d$ is $\Theta(n^{1/(d+1)})$. We also demonstrate examples of graphs with AoI scaling like $n^{\alpha}$ for each $\alpha \in (0,1/2)$. These graphs are not vertex-transitive and in fact we show that if one considers the AoI on a graph coming from a vertex-transitive infinite graph then either $\mathbb{E} X_v = \Theta(n^{1/k})$ for some integer $k \geq 2$ or $\mathbb{E} X_v = n^{o(1)}$., Comment: 12 pages

The MMT Adaptive optics exoPlanet characterization System (MAPS) is currently in its engineering phase, operating on-sky at the MMT Telescope on Mt. Hopkins in southern Arizona. The MAPS Adaptive Secondary Mirror's actuators are controlled by a closed loop modified PID control law and an open loop feed-forward law, which in combination allows for faster actuator response time. An essential element of achieving the secondary's performance goals involves the process of PID gain tuning. To start, we briefly discuss the design of the MAPS ASM and its actuators. We then describe the actuator positional control system and control law. Next, we discuss a few of the issues that make ASM tuning difficult. We then outline our initial attempts at tuning the actuator controllers and discuss the use of actuator positional power spectra for both tuning and determining the health and failure states of individual actuators. We conclude by presenting the results of our latest round of tuning configuration trials, which have been successful at decreasing mirror latency, increasing operational mirror modes and improving image PSF., Comment: To be published in Proceedings of SPIE, Optics and Photonics 2024. 24 pages, 16 figures, 5 tables. Lead Author, J. Johnson. Second Lead Author, A. Vaz. Project P.I., K. Morzinski. Project Second P.I.s, J. Patience and S. Sivanandam, Project Manager, M. Montoya

Feeding the growing human population sustainably amidst climate change is one of the most important challenges in the 21st century. Current practices often lead to the overuse of agronomic inputs, such as synthetic fertilizers and water, resulting in environmental contamination and diminishing returns on crop productivity. The complexity of agricultural systems, involving plant-environment interactions and human management, presents significant scientific and technical challenges for developing sustainable practices. Addressing these challenges necessitates transdisciplinary research, involving intense collaboration among fields such as plant science, engineering, computer science, and social sciences. Here, we present five case studies from two research centers demonstrating successful transdisciplinary approaches toward more sustainable water and fertilizer use. These case studies span multiple scales. Starting from whole-plant signaling, we explore how reporter plants can transform our understanding of plant communication and enable efficient application of water and fertilizers. We then show how new fertilizer technologies could increase the availability of phosphorus in the soil. To accelerate advancements in breeding new cultivars, we discuss robotic technologies for high-throughput plant screening in different environments at a population scale. At the ecosystem scale, we investigate phosphorus recovery from aquatic systems and methods to minimize phosphorus leaching. Finally, as agricultural outputs affect all people, we show how to integrate stakeholder perspectives and needs into the research. With these case studies, we hope to encourage the scientific community to adopt transdisciplinary research and promote cross-training among biologists, engineers, and social scientists to drive discovery and innovation in advancing sustainable agricultural systems.

With close to three years of observations in hand, the NEID Earth Twin Survey (NETS) is starting to unearth new astrophysical signals for a curated sample of bright, radial velocity (RV)-quiet stars. We present the discovery of the first NETS exoplanet, HD 86728 b, a $m_p\sin i = 9.16^{+0.55}_{-0.56}\ \rm{M}_\oplus$ planet on a circular, $P=31.1503^{+0.0062}_{-0.0066}$ d orbit, thereby confirming a candidate signal identified by Hirsch et al. (2021). We confirm the planetary origin of the detected signal, which has a semi-amplitude of just $K=1.91^{+0.11}_{-0.12}$ m s$^{-1}$, via careful analysis of the NEID RVs and spectral activity indicators, and we constrain the mass and orbit via fits to NEID and archival RV measurements. The host star is intrinsically quiet at the $\sim1$ m s$^{-1}$ level, with the majority of this variability likely stemming from short-timescale granulation. HD 86728 b is among the small fraction of exoplanets with similar masses and periods that have no known planetary siblings., Comment: Submitted to AAS Journals. 18 pages, 10 figures, 3 tables, 1 appendix

In this paper, we study generalized versions of the k-center problem, which involves finding k circles of the smallest possible equal radius that cover a finite set of points in the plane. By utilizing the Minkowski gauge function, we extend this problem to generalized balls induced by various convex sets in finite dimensions, rather than limiting it to circles in the plane. First, we establish several fundamental properties of the global optimal solutions to this problem. We then introduce the notion of local optimal solutions and provide a sufficient condition for their existence. We also provide several illustrative examples to clarify the proposed problems.

Over the past decade, there has been a steady advancement in enhancing face recognition algorithms leveraging advanced machine learning methods. The role of the loss function is pivotal in addressing face verification problems and playing a game-changing role. These loss functions have mainly explored variations among intra-class or inter-class separation. This research examines the natural phenomenon of facial symmetry in the face verification problem. The symmetry between the left and right hemi faces has been widely used in many research areas in recent decades. This paper adopts this simple approach judiciously by splitting the face image vertically into two halves. With the assumption that the natural phenomena of facial symmetry can enhance face verification methodology, we hypothesize that the two output embedding vectors of split faces must project close to each other in the output embedding space. Inspired by this concept, we penalize the network based on the disparity of embedding of the symmetrical pair of split faces. Symmetrical loss has the potential to minimize minor asymmetric features due to facial expression and lightning conditions, hence significantly increasing the inter-class variance among the classes and leading to more reliable face embedding. This loss function propels any network to outperform its baseline performance across all existing network architectures and configurations, enabling us to achieve SoTA results., Comment: 11 Pages, 6 Figures, 5 Tables, Submitted for WACV 2025

The increasing popularity of spatial audio in applications such as teleconferencing, entertainment, and virtual reality has led to the recent developments of binaural reproduction methods. However, only a few of these methods are well-suited for wearable and mobile arrays, which typically consist of a small number of microphones. One such method is binaural signal matching (BSM), which has been shown to produce high-quality binaural signals for wearable arrays. However, BSM may be suboptimal in cases of high direct-to-reverberant ratio (DRR) as it is based on the diffuse sound field assumption. To overcome this limitation, previous studies incorporated sound-field models other than diffuse. However, this approach was not studied comprehensively. This paper extensively investigates two BSM-based methods designed for high DRR scenarios. The methods incorporate a sound field model composed of direct and reverberant components.The methods are investigated both mathematically and using simulations, finally validated by a listening test. The results show that the proposed methods can significantly improve the performance of BSM , in particular in the direction of the source, while presenting only a negligible degradation in other directions. Furthermore, when source direction estimation is inaccurate, performance of these methods degrade to equal that of the BSM, presenting a desired robustness quality.