Search

Direct Admissions policies, first pioneered by Idaho in 2015, aim to simplify the path to college for high school students by proactively admitting students to state colleges and universities. Idaho's decision to implement Direct Admissions was motivated by a desire to boost its relatively low college-going rates and ensure that more of its high school graduates pursue higher education, particularly at state institutions. Idaho's Direct Admissions system automatically qualified all 2016 public high school seniors for admission to participating colleges and universities based on their academic performance such as standardized test scores, GPA, and high school course credits, without requiring them to undergo the traditional application process. Using the student's SAT score and GPA, the Idaho Office of the State Board of Education (OSBE) proactively admits high school students to the "Letter of 6" or "Letter of 8." Students receiving the Letter of 8 are admitted to all of Idaho's public higher education institutions, while students receiving the Letter of 6 are admitted to all except Boise State University and the University of Idaho, the two more selective institutions in the state. Once a student is guaranteed a seat at any of the colleges listed in their Direct Admissions letter, students then apply to the institutions of choice to verify their enrollment intentions. Direct Admissions is designed to demystify the college application process, reduce barriers to entry, and encourage a higher rate of postsecondary enrollment. Since its implementation, the policy has garnered attention for its role in increasing postsecondary applications and enrollments. It has also emerged as a potential model for other states considering similar reforms. Previous research on Direct Admissions policies in Idaho has examined the policy's effectiveness on institutional applications and enrollment outcomes. This paper uses data on the receipt of a Letter of 6 and receipt of a Letter of 8 to understand how Direct Admissions policies influence student choice in institutional selectivity.

Inspired by the success of foundation models in applications such as ChatGPT, as graph data has been ubiquitous, one can envision the far-reaching impacts that can be brought by Graph Foundation Models (GFMs) with broader applications in the areas such as scientific research, social network analysis, drug discovery, and e-commerce. Despite the significant progress of pre-trained graph neural networks, there haven't been GFMs that can achieve desired performance on various graph-learning-related tasks. Building GFMs may rely on a vocabulary that encodes transferable patterns shared among different tasks and domains. Unlike image and text, defining such transferable patterns for graphs remains an open question. In this paper, we aim to bridge this gap by rethinking the transferable patterns on graphs as computation trees -- i.e., tree structures derived from the message-passing process. Based on this insight, we propose a cross-task, cross-domain graph foundation model named GFT, short for Graph Foundation model with transferable Tree vocabulary. By treating computation trees as tokens within the transferable vocabulary, GFT improves model generalization and reduces the risk of negative transfer. The theoretical analyses and extensive experimental studies have demonstrated the transferability of computation trees and shown the effectiveness of GFT across diverse tasks and domains in graph learning. The open source code and data are available at https://github.com/Zehong-Wang/GFT., Comment: Accepted by NeurIPS 2024

In this paper we study flow problems on temporal networks, where edge capacities and travel times change over time. We consider a network with $n$ nodes and $m$ edges where the capacity and length of each edge is a piecewise constant function, and use $\mu=\Omega(m)$ to denote the total number of pieces in all of the $2m$ functions. Our goal is to design exact algorithms for various flow problems that run in time polynomial in the parameter $\mu$. Importantly, the algorithms we design are strongly polynomial, i.e. have no dependence on the capacities, flow value, or the time horizon of the flow process, all of which can be exponentially large relative to the other parameters; and return an integral flow when all input parameters are integral. Our main result is an algorithm for checking feasibility of a dynamic transshipment problem on temporal networks -- given multiple sources and sinks with supply and demand values, is it possible to satisfy the desired supplies and demands within a given time horizon? We develop a fast ($O(\mu^3)$ time) algorithm for this feasibility problem when the input network has a certain canonical form, by exploiting the cut structure of the associated time expanded network. We then adapt an approach of \cite{hoppe2000} to show how other flow problems on temporal networks can be reduced to the canonical format. For computing dynamic transshipments on temporal networks, this results in a $O(\mu^7)$ time algorithm, whereas the previous best integral exact algorithm runs in time $\tilde O(\mu^{19})$. We achieve similar improvements for other flow problems on temporal networks., Comment: 33 pages, 8 figures

We combine new and archival MUSE observations with data from the MeerKAT Fornax Survey and the ALMA Fornax Cluster Survey to study the ionised, atomic, and molecular gas in six gas-rich dwarf galaxies in the Fornax cluster in detail. We compare the distributions and velocity fields of the three gas phases with each other, with MUSE white-light images, and with the stellar velocity fields. Additionally, we derive the resolved molecular Kennicutt-Schmidt relation for each object, and compare these with existing relations for field galaxies and for the Fornax and Virgo clusters. Finally, we explore global measurements such as gas deficiencies and star formation rates to paint as complete a picture of their evolutionary state as possible. We find that all six gas-rich dwarf galaxies have very disturbed ISM, with all three gas phases being irregular both in terms of spatial distribution and velocity field. Most objects lie well below the Kennicutt-Schmidt relations from the literature. Furthermore, they are quite deficient in HI (with def_HI between ~1 and ~2 dex), and moderately deficient in H2 (with def_H2 between ~0 and ~1), suggesting that, while both cold gas phases are affected simultaneously, HI is removed in significant quantities before H2. We suggest that these dwarfs are on their first infall into the cluster, and are in the process of transitioning from star-forming to passive. A combination of tidal interactions, mergers/pre-processing, and ram pressure stripping is likely responsible for these transformations., Comment: Accepted for publication in MNRAS. 34 pages including 14 figures, 2 tables, and 1 appendix

Rapidly-exploring Random Tree (RRT) algorithms have been applied successfully to challenging robot motion planning and under-actuated nonlinear control problems. However a fundamental limitation of the RRT approach is the slow convergence in configuration spaces with narrow channels because of the small probability of generating test points inside narrow channels. This paper presents an improved RRT algorithm that takes advantage of narrow channels between the initial and goal states to find shorter paths by improving the exploration of narrow regions in the configuration space. The proposed algorithm detects the presence of narrow channel by checking for collision of neighborhood points with the infeasible set and attempts to add points within narrow channels with a predetermined bias. This approach is compared with the classical RRT and its variants on a variety of benchmark planning problems. Simulation results indicate that the algorithm presented in this paper computes a significantly shorter path in spaces with narrow channels.

Recent advancements in Large Language Model (LLM)-based frameworks have extended their capabilities to complex real-world applications, such as interactive web navigation. These systems, driven by user commands, navigate web browsers to complete tasks through multi-turn dialogues, offering both innovative opportunities and significant challenges. Despite the introduction of benchmarks for conversational web navigation, a detailed understanding of the key contextual components that influence the performance of these agents remains elusive. This study aims to fill this gap by analyzing the various contextual elements crucial to the functioning of web navigation agents. We investigate the optimization of context management, focusing on the influence of interaction history and web page representation. Our work highlights improved agent performance across out-of-distribution scenarios, including unseen websites, categories, and geographic locations through effective context management. These findings provide insights into the design and optimization of LLM-based agents, enabling more accurate and effective web navigation in real-world applications., Comment: 10 pages, 3 figures, 5 tables

The unique characteristics of text data make classification tasks a complex problem. Advances in unsupervised and semi-supervised learning and autoencoder architectures addressed several challenges. However, they still struggle with imbalanced text classification tasks, a common scenario in real-world applications, demonstrating a tendency to produce embeddings with unfavorable properties, such as class overlap. In this paper, we show that leveraging class-aware contrastive optimization combined with denoising autoencoders can successfully tackle imbalanced text classification tasks, achieving better performance than the current state-of-the-art. Concretely, our proposal combines reconstruction loss with contrastive class separation in the embedding space, allowing a better balance between the truthfulness of the generated embeddings and the model's ability to separate different classes. Compared with an extensive set of traditional and state-of-the-art competing methods, our proposal demonstrates a notable increase in performance across a wide variety of text datasets., Comment: 10 pages, 3 figures, accepted for publication in CODS-COMAD 2024

The XLZD collaboration is developing a two-phase xenon time projection chamber with an active mass of 60 to 80 t capable of probing the remaining WIMP-nucleon interaction parameter space down to the so-called neutrino fog. In this work we show that, based on the performance of currently operating detectors using the same technology and a realistic reduction of radioactivity in detector materials, such an experiment will also be able to competitively search for neutrinoless double beta decay in $^{136}$Xe using a natural-abundance xenon target. XLZD can reach a 3$\sigma$ discovery potential half-life of 5.7$\times$10$^{27}$ yr (and a 90% CL exclusion of 1.3$\times$10$^{28}$ yr) with 10 years of data taking, corresponding to a Majorana mass range of 7.3-31.3 meV (4.8-20.5 meV). XLZD will thus exclude the inverted neutrino mass ordering parameter space and will start to probe the normal ordering region for most of the nuclear matrix elements commonly considered by the community., Comment: 29 pages, 7 figures

This report describes the experimental strategy and technologies for a next-generation xenon observatory sensitive to dark matter and neutrino physics. The detector will have an active liquid xenon target mass of 60-80 tonnes and is proposed by the XENON-LUX-ZEPLIN-DARWIN (XLZD) collaboration. The design is based on the mature liquid xenon time projection chamber technology of the current-generation experiments, LZ and XENONnT. A baseline design and opportunities for further optimization of the individual detector components are discussed. The experiment envisaged here has the capability to explore parameter space for Weakly Interacting Massive Particle (WIMP) dark matter down to the neutrino fog, with a 3$\sigma$ evidence potential for the spin-independent WIMP-nucleon cross sections as low as $3\times10^{-49}\rm cm^2$ (at 40 GeV/c$^2$ WIMP mass). The observatory is also projected to have a 3$\sigma$ observation potential of neutrinoless double-beta decay of $^{136}$Xe at a half-life of up to $5.7\times 10^{27}$ years. Additionally, it is sensitive to astrophysical neutrinos from the atmosphere, sun, and galactic supernovae., Comment: 32 pages, 14 figures

We present the localization and host galaxy of FRB 20190208A, a repeating source of fast radio bursts (FRBs) discovered using CHIME/FRB. As part of the PRECISE repeater localization program on the EVN, we monitored FRB 20190208A for 65.6 hours at $\sim1.4$ GHz and detected a single burst, which led to its VLBI localization with 260 mas uncertainty (2$\sigma$). Follow-up optical observations with the MMT Observatory ($i\gtrsim 25.7$ mag (AB)) found no visible host at the FRB position. Subsequent deeper observations with the GTC, however, revealed an extremely faint galaxy ($r=27.32 \pm0.16$ mag), very likely ($99.95 \%$) associated with FRB 20190208A. Given the dispersion measure of the FRB ($\sim580$ pc cm$^{-3}$), even the most conservative redshift estimate ($z_{\mathrm{max}}\sim0.83$) implies that this is the lowest-luminosity FRB host to date ($\lesssim10^8L_{\odot}$), even less luminous than the dwarf host of FRB 20121102A. We investigate how localization precision and the depth of optical imaging affect host association, and discuss the implications of such a low-luminosity dwarf galaxy. Unlike the other repeaters with low-luminosity hosts, FRB 20190208A has a modest Faraday rotation measure of a few tens of rad m$^{-2}$, and EVN plus VLA observations reveal no associated compact persistent radio source. We also monitored FRB 20190208A for 40.4 hours over 2 years as part of the \'ECLAT repeating FRB monitoring campaign on the Nan\c{c}ay Radio Telescope, and detected one burst. Our results demonstrate that, in some cases, the robust association of an FRB with a host galaxy will require both high localization precision, as well as deep optical follow-up., Comment: submitted to ApJL

We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.1\times10^{-48}$ cm$^{2}$ at the 90% confidence level at a mass of 36 GeV/$c^2$, and the best SI median sensitivity achieved is $5.0\times10^{-48}$ cm$^{2}$ for a mass of 40 GeV/$c^2$., Comment: 9 pages, 7 figures. See https://www.hepdata.net/record/155182 for a data release related to this paper

Fast radio bursts (FRBs) are sufficiently energetic to be detectable from luminosity distances up to at least seven billion parsecs (redshift $z > 1$). Probing the maximum energies and luminosities of FRBs constrains their emission mechanism and cosmological population. Here we investigate the maximum energetics of a highly active repeater, FRB 20220912A, using 1,500h of observations. We detect $130$ high-energy bursts and find a break in the burst energy distribution, with a flattening of the power-law slope at higher energy. This is consistent with the behaviour of another highly active repeater, FRB 20201124A. Furthermore, we model the rate of the highest-energy bursts and find a turnover at a characteristic spectral energy density of $E^{\textrm{char}}_{\nu} = 2.09^{+3.78}_{-1.04}\times10^{32}$ erg/Hz. This characteristic maximum energy agrees well with observations of apparently one-off FRBs, suggesting a common physical mechanism for their emission. The extreme burst energies push radiation and source models to their limit., Comment: Comments welcome

Research involving virtual reality (VR) has dramatically increased since the introduction of consumer VR systems. In turn, research on VR games has gained popularity within several fields. However, most VR games are closed source, which limits research opportunities. Some VR games are open source, but most of them are either very basic or too complex to be easily used in research. In this paper, we present two source-available VR games developed from freely available Unity Learn games: a kart racing game and a 3D adventure game. Our hope is that other researchers find them easy to use for VR studies, as Unity Technologies developed the games for beginners and has provided tutorials on using them.

Laboratory accidents pose significant risks to human life and property, underscoring the importance of robust safety protocols. Despite advancements in safety training, laboratory personnel may still unknowingly engage in unsafe practices. With the increasing reliance on large language models (LLMs) for guidance in various fields, including laboratory settings, there is a growing concern about their reliability in critical safety-related decision-making. Unlike trained human researchers, LLMs lack formal lab safety education, raising questions about their ability to provide safe and accurate guidance. Existing research on LLM trustworthiness primarily focuses on issues such as ethical compliance, truthfulness, and fairness but fails to fully cover safety-critical real-world applications, like lab safety. To address this gap, we propose the Laboratory Safety Benchmark (LabSafety Bench), a comprehensive evaluation framework based on a new taxonomy aligned with Occupational Safety and Health Administration (OSHA) protocols. This benchmark includes 765 multiple-choice questions verified by human experts, assessing LLMs and vision language models (VLMs) performance in lab safety contexts. Our evaluations demonstrate that while GPT-4o outperforms human participants, it is still prone to critical errors, highlighting the risks of relying on LLMs in safety-critical environments. Our findings emphasize the need for specialized benchmarks to accurately assess the trustworthiness of LLMs in real-world safety applications., Comment: 50 pages, 19 figures

Molecule optimization is a critical task in drug discovery to optimize desired properties of a given molecule through chemical modification. Despite Large Language Models (LLMs) holding the potential to efficiently simulate this task by using natural language to direct the optimization, straightforwardly utilizing them shows limited performance. In this work, we facilitate utilizing LLMs in an iterative paradigm by proposing a simple yet highly effective domain feedback provider, namely $\text{Re}^3$DF. In detail, $\text{Re}^3$DF harnesses an external toolkit, RDKit, to handle the molecule hallucination, if the modified molecule is chemically invalid. Otherwise, its desired properties are computed and compared to the original one, establishing reliable domain feedback with correct direction and distance towards the objective, followed by a retrieved example, to guide the LLM to refine the modified molecule. We conduct experiments across both single- and multi-property objectives with 2 thresholds, where $\text{Re}^3$DF shows significant improvements. Particularly, for 20 single-property objectives, $\text{Re}^3$DF enhances Hit ratio by 16.95% and 20.76% under loose (\texttt{l}) and strict (\texttt{s}) thresholds, respectively. For 32 multi-property objectives, $\text{Re}^3$DF enhances Hit ratio by 6.04% and 5.25%.

Large language models (LLMs) offer powerful capabilities but also introduce significant risks. One way to mitigate these risks is through comprehensive pre-deployment evaluations using benchmarks designed to test for specific vulnerabilities. However, the rapidly expanding body of LLM benchmark literature lacks a standardized method for documenting crucial benchmark details, hindering consistent use and informed selection. BenchmarkCards addresses this gap by providing a structured framework specifically for documenting LLM benchmark properties rather than defining the entire evaluation process itself. BenchmarkCards do not prescribe how to measure or interpret benchmark results (e.g., defining ``correctness'') but instead offer a standardized way to capture and report critical characteristics like targeted risks and evaluation methodologies, including properties such as bias and fairness. This structured metadata facilitates informed benchmark selection, enabling researchers to choose appropriate benchmarks and promoting transparency and reproducibility in LLM evaluation.

LLM-as-a-Judge has been widely utilized as an evaluation method in various benchmarks and served as supervised rewards in model training. However, despite their excellence in many domains, potential issues are under-explored, undermining their reliability and the scope of their utility. Therefore, we identify 12 key potential biases and propose a new automated bias quantification framework-CALM-which systematically quantifies and analyzes each type of bias in LLM-as-a-Judge by using automated and principle-guided modification. Our experiments cover multiple popular language models, and the results indicate that while advanced models have achieved commendable overall performance, significant biases persist in certain specific tasks. Empirical results suggest that there remains room for improvement in the reliability of LLM-as-a-Judge. Moreover, we also discuss the explicit and implicit influence of these biases and give some suggestions for the reliable application of LLM-as-a-Judge. Our work highlights the need for stakeholders to address these issues and remind users to exercise caution in LLM-as-a-Judge applications.

Generative Artificial Intelligence (GenAI) is becoming ubiquitous in our daily lives. The increase in computational power and data availability has led to a proliferation of both single- and multi-modal models. As the GenAI ecosystem matures, the need for extensible and model-agnostic risk identification frameworks is growing. To meet this need, we introduce the Python Risk Identification Toolkit (PyRIT), an open-source framework designed to enhance red teaming efforts in GenAI systems. PyRIT is a model- and platform-agnostic tool that enables red teamers to probe for and identify novel harms, risks, and jailbreaks in multimodal generative AI models. Its composable architecture facilitates the reuse of core building blocks and allows for extensibility to future models and modalities. This paper details the challenges specific to red teaming generative AI systems, the development and features of PyRIT, and its practical applications in real-world scenarios.

We developed SaludConectaMX as a comprehensive system to track and understand the determinants of complications throughout chemotherapy treatment for children with cancer in Mexico. SaludConectaMX is unique in that it integrates patient clinical indicators with social determinants and caregiver mental health, forming a social-clinical perspective of the patient's evolving health trajectory. The system is composed of a web application (for hospital staff) and a mobile application (for family caregivers), providing the opportunity for cooperative patient monitoring in both hospital and home settings. This paper presents the system's preliminary design and usability evaluation results from a 1.5-year pilot study. Our findings indicate that while the hospital web app demonstrates high completion rates and user satisfaction, the family mobile app requires additional improvements for optimal accessibility; statistical and qualitative data analysis illuminate pathways for system improvement. Based on this evidence, we formalize suggestions for health system development in LMICs, which HCI researchers may leverage in future work.

A Machine Learning (ML) network based on transfer learning and transformer networks is applied to wave propagation models for complex indoor settings. This network is designed to predict signal propagation in environments with a variety of objects, effectively simulating the diverse range of furniture typically found in indoor spaces. We propose Attention U-Net with Efficient Networks as the backbone, to process images encoded with the essential information of the indoor environment. The indoor environment is defined by its fundamental structure, such as the arrangement of walls, windows, and doorways, alongside varying configurations of furniture placement. An innovative algorithm is introduced to generate a 3D environment from a 2D floorplan, which is crucial for efficient collection of data for training. The model is evaluated by comparing the predicted signal coverage map with ray tracing (RT) simulations. The prediction results show a root mean square error of less than 6 dB across all tested scenarios, with significant improvements observed when using a Double U-Net structure compared to a single U-Net model.

Significant work has been conducted in the domain of food computing, yet these studies typically focus on single tasks such as t2t (instruction generation from food titles and ingredients), i2t (recipe generation from food images), or t2i (food image generation from recipes). None of these approaches integrate all modalities simultaneously. To address this gap, we introduce a novel food computing foundation model that achieves true multimodality, encompassing tasks such as t2t, t2i, i2t, it2t, and t2ti. By leveraging large language models (LLMs) and pre-trained image encoder and decoder models, our model can perform a diverse array of food computing-related tasks, including food understanding, food recognition, recipe generation, and food image generation. Compared to previous models, our foundation model demonstrates a significantly broader range of capabilities and exhibits superior performance, particularly in food image generation and recipe generation tasks. We open-sourced ChefFusion at GitHub.

Deep learning models have achieved great success in automating skin lesion diagnosis. However, the ethnic disparity in these models' predictions needs to be addressed before deploying them. We introduce a novel approach, PatchAlign, to enhance skin condition image classification accuracy and fairness by aligning with clinical text representations of skin conditions. PatchAlign uses Graph Optimal Transport (GOT) Loss as a regularizer to perform cross-domain alignment. The representations obtained are robust and generalize well across skin tones, even with limited training samples. To reduce the effect of noise and artifacts in clinical dermatology images, we propose a learnable Masked Graph Optimal Transport for cross-domain alignment that further improves fairness metrics. We compare our model to the state-of-the-art FairDisCo on two skin lesion datasets with different skin types: Fitzpatrick17k and Diverse Dermatology Images (DDI). PatchAlign enhances the accuracy of skin condition image classification by 2.8% (in-domain) and 6.2% (out-domain) on Fitzpatrick17k, and 4.2% (in-domain) on DDI compared to FairDisCo. Additionally, it consistently improves the fairness of true positive rates across skin tones. The source code for the implementation is available at the following GitHub repository: https://github.com/aayushmanace/PatchAlign24, enabling easy reproduction and further experimentation., Comment: MICCAI 2024. Early Accept Paper (amongst the top 11% of 2869 papers submitted)

Efficient load balancing is crucial in cloud computing environments to ensure optimal resource utilization, minimize response times, and prevent server overload. Traditional load balancing algorithms, such as round-robin or least connections, are often static and unable to adapt to the dynamic and fluctuating nature of cloud workloads. In this paper, we propose a novel adaptive load balancing framework using Reinforcement Learning (RL) to address these challenges. The RL-based approach continuously learns and improves the distribution of tasks by observing real-time system performance and making decisions based on traffic patterns and resource availability. Our framework is designed to dynamically reallocate tasks to minimize latency and ensure balanced resource usage across servers. Experimental results show that the proposed RL-based load balancer outperforms traditional algorithms in terms of response time, resource utilization, and adaptability to changing workloads. These findings highlight the potential of AI-driven solutions for enhancing the efficiency and scalability of cloud infrastructures., Comment: Length: 6 pages (including references) Figures: 3 figures Submission Type: Conference paper Keywords: Reinforcement Learning, Load Balancing, Cloud Computing, Adaptive Algorithms, AI-driven Load Management

The broad physics reach of the LUX-ZEPLIN (LZ) experiment covers rare phenomena beyond the direct detection of dark matter. We report precise measurements of the extremely rare decay of $^{124}$Xe through the process of two-neutrino double electron capture (2$\nu$2EC), utilizing a $1.39\,\mathrm{kg} \times \mathrm{yr}$ isotopic exposure from the first LZ science run. A half-life of $T_{1/2}^{2\nu2\mathrm{EC}} = (1.09 \pm 0.14_{\text{stat}} \pm 0.05_{\text{sys}}) \times 10^{22}\,\mathrm{yr}$ is observed with a statistical significance of $8.3\,\sigma$, in agreement with literature. First empirical measurements of the KK capture fraction relative to other K-shell modes were conducted, and demonstrate consistency with respect to recent signal models at the $1.4\,\sigma$ level., Comment: 15 pages, 3 figures

Modern artificial intelligence (AI) systems are powered by foundation models. This paper presents a new set of foundation models, called Llama 3. It is a herd of language models that natively support multilinguality, coding, reasoning, and tool usage. Our largest model is a dense Transformer with 405B parameters and a context window of up to 128K tokens. This paper presents an extensive empirical evaluation of Llama 3. We find that Llama 3 delivers comparable quality to leading language models such as GPT-4 on a plethora of tasks. We publicly release Llama 3, including pre-trained and post-trained versions of the 405B parameter language model and our Llama Guard 3 model for input and output safety. The paper also presents the results of experiments in which we integrate image, video, and speech capabilities into Llama 3 via a compositional approach. We observe this approach performs competitively with the state-of-the-art on image, video, and speech recognition tasks. The resulting models are not yet being broadly released as they are still under development.

In this study, we integrate the established obstacle problem formulation from ice sheet modeling with cutting-edge deep learning methodologies to enhance ice thickness predictions, specifically targeting the Greenland ice sheet. By harmonizing the mathematical structure with an energy minimization framework tailored for neural network approximations, our method's efficacy is confirmed through both 1D and 2D numerical simulations. Utilizing the NSIDC-0092 dataset for Greenland and incorporating bedrock topography for model pre-training, we register notable advances in prediction accuracy. Our research underscores the potent combination of traditional mathematical models and advanced computational techniques in delivering precise ice thickness estimations.

App markets have evolved into highly competitive and dynamic environments for developers. While the traditional app life cycle involves incremental updates for feature enhancements and issue resolution, some apps deviate from this norm by undergoing significant transformations in their use cases or market positioning. We define this previously unstudied phenomenon as 'app metamorphosis'. In this paper, we propose a novel and efficient multi-modal search methodology to identify apps undergoing metamorphosis and apply it to analyse two snapshots of the Google Play Store taken five years apart. Our methodology uncovers various metamorphosis scenarios, including re-births, re-branding, re-purposing, and others, enabling comprehensive characterisation. Although these transformations may register as successful for app developers based on our defined success score metric (e.g., re-branded apps performing approximately 11.3% better than an average top app), we shed light on the concealed security and privacy risks that lurk within, potentially impacting even tech-savvy end-users., Comment: 15 pages, 14 figures

Recent innovations in language model training have demonstrated that it is possible to create highly performant models that are small enough to run on a smartphone. As these models are deployed in an increasing number of domains, it is critical to ensure that they are aligned with human preferences and safety considerations. In this report, we present our methodology for safety aligning the Phi-3 series of language models. We utilized a "break-fix" cycle, performing multiple rounds of dataset curation, safety post-training, benchmarking, red teaming, and vulnerability identification to cover a variety of harm areas in both single and multi-turn scenarios. Our results indicate that this approach iteratively improved the performance of the Phi-3 models across a wide range of responsible AI benchmarks. Finally, we include additional red teaming strategies and evaluations that were used to test the safety behavior of Phi-3.5-mini and Phi-3.5-MoE, which were optimized for multilingual capabilities.

The rapid progress in machine learning (ML) has brought forth many large language models (LLMs) that excel in various tasks and areas. These LLMs come with different abilities and costs in terms of computation or pricing. Since the demand for each query can vary, e.g., because of the queried domain or its complexity, defaulting to one LLM in an application is not usually the best choice, whether it is the biggest, priciest, or even the one with the best average test performance. Consequently, picking the right LLM that is both accurate and cost-effective for an application remains a challenge. In this paper, we introduce MetaLLM, a framework that dynamically and intelligently routes each query to the optimal LLM (among several available LLMs) for classification tasks, achieving significantly improved accuracy and cost-effectiveness. By framing the selection problem as a multi-armed bandit, MetaLLM balances prediction accuracy and cost efficiency under uncertainty. Our experiments, conducted on popular LLM platforms such as OpenAI's GPT models, Amazon's Titan, Anthropic's Claude, and Meta's LLaMa, showcase MetaLLM's efficacy in real-world scenarios, laying the groundwork for future extensions beyond classification tasks.

Machine learning (ML) models have difficulty generalizing when the number of training class instances are numerically imbalanced. The problem of generalization in the face of data imbalance has largely been attributed to the lack of training data for under-represented classes and to feature overlap. The typical remedy is to implement data augmentation for classes with fewer instances or to assign a higher cost to minority class prediction errors or to undersample the prevalent class. However, we show that one of the central causes of impaired generalization when learning with imbalanced data is the inherent manner in which ML models perform inference. These models have difficulty generalizing due to their heavy reliance on the magnitude of encoded signals. During inference, the models predict classes based on a combination of encoded signal magnitudes that linearly sum to the largest scalar. We demonstrate that even with aggressive data augmentation, which generally improves minority class prediction accuracy, parametric ML models still associate a class label with a limited number of feature combinations that sum to a prediction, which can affect generalization.

The repeating fast radio burst source FRB 20220912A was remarkably active in the weeks after its discovery. Here we report 696 bursts detected with the Nan\c{c}ay Radio Telescope (NRT) as part of the Extragalactic Coherent Light from Astrophysical Transients (\'ECLAT) monitoring campaign. We present 68 observations, conducted from October 2022 to April 2023, with a total duration of 61 hours and an event rate peaking at $75^{+10}_{-9}$ bursts per hour above a fluence threshold of 0.59 Jy ms in the $1.2-1.7$-GHz band. Most bursts in the sample occur towards the bottom of the observing band. They follow a bimodal wait-time distribution, with peaks at 33.4 ms and 67.0 s. We find a roughly constant dispersion measure (DM) over time ($\delta$DM $\lesssim$ 2 pc cm$^{-3}$) when taking into account `sad-trombone' drift, with a mean drift rate of $-8.8 $MHz ms$^{-1}$. Nonetheless, we confirm small $\sim0.3$ pc cm$^{-3}$ DM variations using microshot structure, while finding that microstructure is rare in our sample -- despite the 16 $\mu$s time resolution of the data. The cumulative spectral energy distribution shows more high-energy bursts ($E_\nu \gtrsim 10^{31}$ erg/Hz) than would be expected from a simple power-law distribution. The burst rate per observation appears Poissonian, but the full set of observations is better modelled by a Weibull distribution, showing clustering. We discuss the various observational similarities that FRB 20220912A shares with other (hyper)active repeaters, which as a group are beginning to show a common set of phenomenological traits that provide multiple useful dimensions for their quantitative comparison and modelling., Comment: 18 pages, 20 figures

The roadmap is organized into several thematic sections, outlining current computing challenges, discussing the neuromorphic computing approach, analyzing mature and currently utilized technologies, providing an overview of emerging technologies, addressing material challenges, exploring novel computing concepts, and finally examining the maturity level of emerging technologies while determining the next essential steps for their advancement., Comment: 90 pages, 22 figures, roadmap, neuromorphic

We embed the Penrose limit into the Weyl classical double copy. Thereby, we provide a lift of the double copy properties of plane wave spacetimes into black hole geometries and we open a novel avenue towards taking the classical double copy beyond statements about algebraically special backgrounds. In particular, the Penrose limit, viewed as the leading order Fermi coordinate expansion around a null geodesic, complements approaches leveraging asymptotic flatness such as the asymptotic Weyl double copy. Along the way, we show how our embedding of the Penrose limit within the Weyl double copy naturally fixes the functional ambiguity in the double copy for Petrov type N spacetimes. We also highlight the utility of a spinorial approach to the Penrose limit. In particular, we use this spinorial approach to derive a simple analytical expression for arbitrary Penrose limits of four-dimensional, vacuum type D spacetimes., Comment: 44+18 pages

Existing ML benchmarks lack the depth and diversity of annotations needed for evaluating models on business process management (BPM) tasks. BPM is the practice of documenting, measuring, improving, and automating enterprise workflows. However, research has focused almost exclusively on one task - full end-to-end automation using agents based on multimodal foundation models (FMs) like GPT-4. This focus on automation ignores the reality of how most BPM tools are applied today - simply documenting the relevant workflow takes 60% of the time of the typical process optimization project. To address this gap we present WONDERBREAD, the first benchmark for evaluating multimodal FMs on BPM tasks beyond automation. Our contributions are: (1) a dataset containing 2928 documented workflow demonstrations; (2) 6 novel BPM tasks sourced from real-world applications ranging from workflow documentation to knowledge transfer to process improvement; and (3) an automated evaluation harness. Our benchmark shows that while state-of-the-art FMs can automatically generate documentation (e.g. recalling 88% of the steps taken in a video demonstration of a workflow), they struggle to re-apply that knowledge towards finer-grained validation of workflow completion (F1 < 0.3). We hope WONDERBREAD encourages the development of more "human-centered" AI tooling for enterprise applications and furthers the exploration of multimodal FMs for the broader universe of BPM tasks. We publish our dataset and experiments here: https://github.com/HazyResearch/wonderbread

Large Language Models (LLMs) with their strong task-handling capabilities have shown remarkable advancements across a spectrum of fields, moving beyond natural language understanding. However, their proficiency within the chemistry domain remains restricted, especially in solving professional molecule-related tasks. This challenge is attributed to their inherent limitations in comprehending molecules using only common textual representations, i.e., SMILES strings. In this study, we seek to enhance the ability of LLMs to comprehend molecules by equipping them with a multi-modal external module, namely MolX. In particular, instead of directly using a SMILES string to represent a molecule, we utilize specific encoders to extract fine-grained features from both SMILES string and 2D molecular graph representations for feeding into an LLM. Moreover, a handcrafted molecular fingerprint is incorporated to leverage its embedded domain knowledge. Then, to establish an alignment between MolX and the LLM's textual input space, the whole model in which the LLM is frozen, is pre-trained with a versatile strategy including a diverse set of tasks. Experimental evaluations show that our proposed method outperforms baselines across 4 downstream molecule-related tasks ranging from molecule-to-text translation to retrosynthesis, with and without fine-tuning the LLM, while only introducing a small number of trainable parameters 0.53% and 0.82%, respectively.

The quantum-classical hybrid variational quantum eigensolver (VQE) algorithm is among the most actively studied topics in atomic and molecular calculations on quantum computers, yet few studies address properties other than energies or account for relativistic effects. This work presents high-precision 18-qubit relativistic VQE simulations for calculating the permanent electric dipole moments (PDMs) of BeH to RaH molecules on traditional computers, and 6- and 12-qubit PDM computations for SrH on IonQ quantum devices. To achieve high precision on current noisy intermediate scale era quantum hardware, we apply various resource reduction methods, including Reinforcement Learning and causal flow preserving ZX-Calculus routines, along with error mitigation and post-selection techniques. Our approach reduces the two-qubit gate count in our 12-qubit circuit by 99.71%, with only a 2.35% trade-off in precision for PDM when evaluated classically within a suitably chosen active space. On the current generation IonQ Forte-I hardware, the error in PDM is -1.17% relative to classical calculations and only 1.21% compared to the unoptimized circuit.

Protective applications require energy-absorbing materials that are soft and compressible enough to absorb kinetic energy from impacts, yet stiff enough to bear crushing loads. Achieving this balance requires careful consideration of both mechanical properties and geometric design. Conventional shock-absorbing pads are made of very thick foams that exhibit a plateau of constant stress in their stress-strain response. Contrary to this belief, we report that foams with a nonlinear stress-strain response can be useful to achieve simultaneously thin and lightweight protective pads. We introduce a new framework for the thickness or volume-constrained design of compact and lightweight protective foams while ensuring the desired structural integrity and mechanical performance. Our streamlined dimensional analysis approach provides geometric constraints on the dimensionless thickness and cross-sectional area of a protective foam with a given stress-strain response to limit the acceleration and compressive strain within desired critical limits. We also identify optimal mechanical properties that will result in the most compact and lightest protective foam layer for absorbing a given kinetic energy of impact. Guided by this design framework, we achieve optimal protective properties in hierarchically architected vertically aligned carbon nanotube (VACNT) foams, enabling next generation protective applications in extreme environments.

There are vast number of configurable parameters in a Radio Access Telecom Network. A significant amount of these parameters is configured by Radio Node or cell based on their deployment setting. Traditional methods rely on domain knowledge for individual parameter configuration, often leading to sub-optimal results. To improve this, a framework using a Deep Generative Graph Neural Network (GNN) is proposed. It encodes the network into a graph, extracts subgraphs for each RAN node, and employs a Siamese GNN (S-GNN) to learn embeddings. The framework recommends configuration parameters for a multitude of parameters and detects misconfigurations, handling both network expansion and existing cell reconfiguration. Tested on real-world data, the model surpasses baselines, demonstrating accuracy, generalizability, and robustness against concept drift., Comment: 4 pages, 4 figures

Weakly interacting massive particles (WIMPs) may interact with a virtual pion that is exchanged between nucleons. This interaction channel is important to consider in models where the spin-independent isoscalar channel is suppressed. Using data from the first science run of the LUX-ZEPLIN dark matter experiment, containing 60 live days of data in a 5.5~tonne fiducial mass of liquid xenon, we report the results on a search for WIMP-pion interactions. We observe no significant excess and set an upper limit of $1.5\times10^{-46}$~cm$^2$ at a 90\% confidence level for a WIMP mass of 33~GeV/c$^2$ for this interaction.

A long-standing dilemma prevents the broader application of explanation methods: general applicability and inference speed. On the one hand, existing model-agnostic explanation methods usually make minimal pre-assumptions about the prediction models to be explained. Still, they require additional queries to the model through propagation or back-propagation to approximate the models' behaviors, resulting in slow inference and hindering their use in time-sensitive tasks. On the other hand, various model-dependent explanations have been proposed that achieve low-cost, fast inference but at the expense of limiting their applicability to specific model structures. In this study, we bridge the gap between the universality of model-agnostic approaches and the efficiency of model-specific approaches by proposing a novel framework without assumptions on the prediction model's structures, achieving high efficiency during inference and allowing for real-time explanations. To achieve this, we first define explanations through a set of human-comprehensible concepts and propose a framework to elucidate model predictions via minimal feasible concept sets. Second, we show that a minimal feasible set generator can be learned as a companion explainer to the prediction model, generating explanations for predictions. Finally, we validate this framework by implementing a novel model-agnostic method that provides robust explanations while facilitating real-time inference. Our claims are substantiated by comprehensive experiments, highlighting the effectiveness and efficiency of our approach.

Despite being a heavily researched topic, Adversarial Training (AT) is rarely, if ever, deployed in practical AI systems for two primary reasons: (i) the gained robustness is frequently accompanied by a drop in generalization and (ii) generating adversarial examples (AEs) is computationally prohibitively expensive. To address these limitations, we propose SMAAT, a new AT algorithm that leverages the manifold conjecture, stating that off-manifold AEs lead to better robustness while on-manifold AEs result in better generalization. Specifically, SMAAT aims at generating a higher proportion of off-manifold AEs by perturbing the intermediate deepnet layer with the lowest intrinsic dimension. This systematically results in better scalability compared to classical AT as it reduces the PGD chains length required for generating the AEs. Additionally, our study provides, to the best of our knowledge, the first explanation for the difference in the generalization and robustness trends between vision and language models, ie., AT results in a drop in generalization in vision models whereas, in encoder-based language models, generalization either improves or remains unchanged. We show that vision transformers and decoder-based models tend to have low intrinsic dimensionality in the earlier layers of the network (more off-manifold AEs), while encoder-based models have low intrinsic dimensionality in the later layers. We demonstrate the efficacy of SMAAT; on several tasks, including robustifying (i) sentiment classifiers, (ii) safety filters in decoder-based models, and (iii) retrievers in RAG setups. SMAAT requires only 25-33% of the GPU time compared to standard AT, while significantly improving robustness across all applications and maintaining comparable generalization.