Search

We present a comprehensive study of the magnetoelastic properties of the Ising pyrochlore oxide Ho$_{2}$Ti$_{2}$O$_{7}$, known as spin ice, by means of high-field magnetostriction measurements and numerical calculations. When a magnetic field is applied along the crystallographic <111> axis, the longitudinal magnetostriction exhibits a broad maximum in the low-field regime around 30 T, followed by a dramatic lattice contraction due to crystal-field (CF) level crossing at $B_{\rm cf} \sim 65$ T. The transverse magnetostriction exhibits a contrasting behavior, highlighting the anisotropic nature of the CF striction. We identify distinct timescales of spin dynamics and CF-phonon dynamics by applying a magnetic field with different field-sweep rates. Our mean-field calculations, based on a point-charge model, successfully reproduce the overall magnetostriction behavior, revealing the competition between the exchange striction and CF striction. A signature of the CF level crossing is also observed through adiabatic magnetocaloric-effect measurements, consistent with our magnetostriction data., Comment: 10 pages, 8 figures

Translating users' natural language queries (NL) into SQL queries (i.e., NL2SQL) can significantly reduce barriers to accessing relational databases and support various commercial applications. The performance of NL2SQL has been greatly enhanced with the emergence of Large Language Models (LLMs). In this survey, we provide a comprehensive review of NL2SQL techniques powered by LLMs, covering its entire lifecycle from the following four aspects: (1) Model: NL2SQL translation techniques that tackle not only NL ambiguity and under-specification, but also properly map NL with database schema and instances; (2) Data: From the collection of training data, data synthesis due to training data scarcity, to NL2SQL benchmarks; (3) Evaluation: Evaluating NL2SQL methods from multiple angles using different metrics and granularities; and (4) Error Analysis: analyzing NL2SQL errors to find the root cause and guiding NL2SQL models to evolve. Moreover, we provide a rule of thumb for developing NL2SQL solutions. Finally, we discuss the research challenges and open problems of NL2SQL in the LLMs era.

Large language models (LLMs) demonstrate an impressive ability to internalize knowledge and answer natural language questions. Although previous studies validate that LLMs perform well on general knowledge while presenting poor performance on long-tail nuanced knowledge, the community is still doubtful about whether the traditional knowledge graphs should be replaced by LLMs. In this paper, we ask if the schema of knowledge graph (i.e., taxonomy) is made obsolete by LLMs. Intuitively, LLMs should perform well on common taxonomies and at taxonomy levels that are common to people. Unfortunately, there lacks a comprehensive benchmark that evaluates the LLMs over a wide range of taxonomies from common to specialized domains and at levels from root to leaf so that we can draw a confident conclusion. To narrow the research gap, we constructed a novel taxonomy hierarchical structure discovery benchmark named TaxoGlimpse to evaluate the performance of LLMs over taxonomies. TaxoGlimpse covers ten representative taxonomies from common to specialized domains with in-depth experiments of different levels of entities in this taxonomy from root to leaf. Our comprehensive experiments of eighteen state-of-the-art LLMs under three prompting settings validate that LLMs can still not well capture the knowledge of specialized taxonomies and leaf-level entities., Comment: Accepted by VLDB 2024

The growing importance of data visualization in business intelligence and data science emphasizes the need for tools that can efficiently generate meaningful visualizations from large datasets. Existing tools fall into two main categories: human-powered tools (e.g., Tableau and PowerBI), which require intensive expert involvement, and AI-powered automated tools (e.g., Draco and Table2Charts), which often fall short of guessing specific user needs. In this paper, we aim to achieve the best of both worlds. Our key idea is to initially auto-generate a set of high-quality visualizations to minimize manual effort, then refine this process iteratively with user feedback to more closely align with their needs. To this end, we present HAIChart, a reinforcement learning-based framework designed to iteratively recommend good visualizations for a given dataset by incorporating user feedback. Specifically, we propose a Monte Carlo Graph Search-based visualization generation algorithm paired with a composite reward function to efficiently explore the visualization space and automatically generate good visualizations. We devise a visualization hints mechanism to actively incorporate user feedback, thus progressively refining the visualization generation module. We further prove that the top-k visualization hints selection problem is NP-hard and design an efficient algorithm. We conduct both quantitative evaluations and user studies, showing that HAIChart significantly outperforms state-of-the-art human-powered tools (21% better at Recall and 1.8 times faster) and AI-powered automatic tools (25.1% and 14.9% better in terms of Hit@3 and R10@30, respectively)., Comment: VLDB 2024

Large Language Models (LLMs) have demonstrated impressive capabilities across a range of scientific tasks including mathematics, physics, and chemistry. Despite their successes, the effectiveness of LLMs in handling complex statistical tasks remains systematically under-explored. To bridge this gap, we introduce StatQA, a new benchmark designed for statistical analysis tasks. StatQA comprises 11,623 examples tailored to evaluate LLMs' proficiency in specialized statistical tasks and their applicability assessment capabilities, particularly for hypothesis testing methods. We systematically experiment with representative LLMs using various prompting strategies and show that even state-of-the-art models such as GPT-4o achieve a best performance of only 64.83%, indicating significant room for improvement. Notably, while open-source LLMs (e.g. LLaMA-3) show limited capability, those fine-tuned ones exhibit marked improvements, outperforming all in-context learning-based methods (e.g. GPT-4o). Moreover, our comparative human experiments highlight a striking contrast in error types between LLMs and humans: LLMs primarily make applicability errors, whereas humans mostly make statistical task confusion errors. This divergence highlights distinct areas of proficiency and deficiency, suggesting that combining LLM and human expertise could lead to complementary strengths, inviting further investigation into their collaborative potential. Our source code and data are available at https://statqa.github.io/., Comment: Accepted by NeurIPS 2024 D&B. 34 pages, 11 figures, 21 tables

Retrieval-Augmented Generation (RAG) has recently emerged as a promising solution to alleviate Large Language Model (LLM)'s deficiency in lack of knowledge. Existing RAG datasets, however, do not adequately represent the diverse and dynamic nature of real-world Question Answering (QA) tasks. To bridge this gap, we introduce the Comprehensive RAG Benchmark (CRAG), a factual question answering benchmark of 4,409 question-answer pairs and mock APIs to simulate web and Knowledge Graph (KG) search. CRAG is designed to encapsulate a diverse array of questions across five domains and eight question categories, reflecting varied entity popularity from popular to long-tail, and temporal dynamisms ranging from years to seconds. Our evaluation of this benchmark highlights the gap to fully trustworthy QA. Whereas most advanced LLMs achieve <=34% accuracy on CRAG, adding RAG in a straightforward manner improves the accuracy only to 44%. State-of-the-art industry RAG solutions only answer 63% of questions without any hallucination. CRAG also reveals much lower accuracy in answering questions regarding facts with higher dynamism, lower popularity, or higher complexity, suggesting future research directions. The CRAG benchmark laid the groundwork for a KDD Cup 2024 challenge and attracted thousands of participants and submissions. We commit to maintaining CRAG to serve research communities in advancing RAG solutions and general QA solutions. CRAG is available at https://github.com/facebookresearch/CRAG/., Comment: NeurIPS 2024 Datasets and Benchmarks Track

Translating users' natural language questions into SQL queries (i.e., NL2SQL) significantly lowers the barriers to accessing relational databases. The emergence of Large Language Models has introduced a novel paradigm in NL2SQL tasks, enhancing capabilities dramatically. However, this raises a critical question: Are we fully prepared to deploy NL2SQL models in production? To address the posed questions, we present a multi-angle NL2SQL evaluation framework, NL2SQL360, to facilitate the design and test of new NL2SQL methods for researchers. Through NL2SQL360, we conduct a detailed comparison of leading NL2SQL methods across a range of application scenarios, such as different data domains and SQL characteristics, offering valuable insights for selecting the most appropriate NL2SQL methods for specific needs. Moreover, we explore the NL2SQL design space, leveraging NL2SQL360 to automate the identification of an optimal NL2SQL solution tailored to user-specific needs. Specifically, NL2SQL360 identifies an effective NL2SQL method, SuperSQL, distinguished under the Spdier dataset using the execution accuracy metric. Remarkably, SuperSQL achieves competitive performance with execution accuracy of 87% and 62.66% on the Spider and BIRD test sets, respectively., Comment: VLDB 2024

Large language models (LLMs) have catalyzed a paradigm shift in natural language processing, yet their limited controllability poses a significant challenge for downstream applications. We aim to address this by drawing inspiration from the neural mechanisms of the human brain, specifically Broca's and Wernicke's areas, which are crucial for language generation and comprehension, respectively. In particular, Broca's area receives cognitive decision signals from Wernicke's area, treating the language generation as an intricate decision-making process, which differs from the fully auto-regressive language generation of existing LLMs. In a similar vein, our proposed system, the BWArea model, conceptualizes language generation as a decision-making task. This model has three components: a language world model, an inverse dynamics model, and a cognitive policy. Like Wernicke's area, the inverse dynamics model is designed to deduce the underlying cognitive intentions, or latent actions, behind each token. The BWArea model is amenable to both pre-training and fine-tuning like existing LLMs. With 30B clean pre-training tokens, we have trained a BWArea model, which achieves competitive performance with LLMs of equal size (1B parameters). Unlike fully auto-regressive LLMs, its pre-training performance does not degenerate if dirty data unintentionally appears. This shows the advantage of a decomposed structure of BWArea model in reducing efforts in laborious data selection and labeling. Finally, we reveal that the BWArea model offers enhanced controllability via fine-tuning the cognitive policy with downstream reward metrics, thereby facilitating alignment with greater simplicity. On 9 out of 10 tasks from two suites, TextWorld and BigBench Hard, our method shows superior performance to auto-regressive LLMs.

Chart question answering (ChartQA) tasks play a critical role in interpreting and extracting insights from visualization charts. While recent advancements in multimodal large language models (MLLMs) like GPT-4o have shown promise in high-level ChartQA tasks, such as chart captioning, their effectiveness in low-level ChartQA tasks (e.g., identifying correlations) remains underexplored. In this paper, we address this gap by evaluating MLLMs on low-level ChartQA using a newly curated dataset, ChartInsights, which consists of 22,347 (chart, task, query, answer) covering 10 data analysis tasks across 7 chart types. We systematically evaluate 19 advanced MLLMs, including 12 open-source and 7 closed-source models. The average accuracy rate across these models is 39.8%, with GPT-4o achieving the highest accuracy at 69.17%. To further explore the limitations of MLLMs in low-level ChartQA, we conduct experiments that alter visual elements of charts (e.g., changing color schemes, adding image noise) to assess their impact on the task effectiveness. Furthermore, we propose a new textual prompt strategy, Chain-of-Charts, tailored for low-level ChartQA tasks, which boosts performance by 14.41%, achieving an accuracy of 83.58%. Finally, incorporating a visual prompt strategy that directs attention to relevant visual elements further improves accuracy to 84.32%.

Reinforcement learning (RL) trains agents to accomplish complex tasks through environmental interaction data, but its capacity is also limited by the scope of the available data. To obtain a knowledgeable agent, a promising approach is to leverage the knowledge from large language models (LLMs). Despite previous studies combining LLMs with RL, seamless integration of the two components remains challenging due to their semantic gap. This paper introduces a novel method, Knowledgeable Agents from Language Model Rollouts (KALM), which extracts knowledge from LLMs in the form of imaginary rollouts that can be easily learned by the agent through offline reinforcement learning methods. The primary challenge of KALM lies in LLM grounding, as LLMs are inherently limited to textual data, whereas environmental data often comprise numerical vectors unseen to LLMs. To address this, KALM fine-tunes the LLM to perform various tasks based on environmental data, including bidirectional translation between natural language descriptions of skills and their corresponding rollout data. This grounding process enhances the LLM's comprehension of environmental dynamics, enabling it to generate diverse and meaningful imaginary rollouts that reflect novel skills. Initial empirical evaluations on the CLEVR-Robot environment demonstrate that KALM enables agents to complete complex rephrasings of task goals and extend their capabilities to novel tasks requiring unprecedented optimal behaviors. KALM achieves a success rate of 46% in executing tasks with unseen goals, substantially surpassing the 26% success rate achieved by baseline methods. Furthermore, KALM effectively enables the LLM to comprehend environmental dynamics, resulting in the generation of meaningful imaginary rollouts that reflect novel skills and demonstrate the seamless integration of large language models and reinforcement learning.

The rise of large language models (LLMs) has revolutionized the way that we interact with artificial intelligence systems through natural language. However, LLMs often misinterpret user queries because of their uncertain intention, leading to less helpful responses. In natural human interactions, clarification is sought through targeted questioning to uncover obscure information. Thus, in this paper, we introduce LaMAI (Language Model with Active Inquiry), designed to endow LLMs with this same level of interactive engagement. LaMAI leverages active learning techniques to raise the most informative questions, fostering a dynamic bidirectional dialogue. This approach not only narrows the contextual gap but also refines the output of the LLMs, aligning it more closely with user expectations. Our empirical studies, across a variety of complex datasets where LLMs have limited conversational context, demonstrate the effectiveness of LaMAI. The method improves answer accuracy from 31.9% to 50.9%, outperforming other leading question-answering frameworks. Moreover, in scenarios involving human participants, LaMAI consistently generates responses that are superior or comparable to baseline methods in more than 82% of the cases. The applicability of LaMAI is further evidenced by its successful integration with various LLMs, highlighting its potential for the future of interactive language models.

We present electrical resistivity measurements on the prototypical heavy-fermion metal YbRh$_{2}$Si$_{2}$ (YRS) under $a$-axis tensile and compressive strain and focus on the evolution of the resistivity maximum near 136~K that arises from the interplay of the Kondo effect and the crystal electric field (CEF) splitting. While compressive strain reduces $T_{\rm max}$, similar as previously reported for hydrostatic pressure, $T_{\rm max}$ is enhanced up to 145~K for 0.13\% tensile strain. Model calculations for the strain effect on CEF splitting in YRS reveal a negligible shift of the levels. Instead, the enhancement of the resistivity maximum indicates a 20\% increase of the Kondo temperature. This opens the perspective to access the hidden zero-field QCP in pure YRS.

Entity resolution (ER) is an important data integration task with a wide spectrum of applications. The state-of-the-art solutions on ER rely on pre-trained language models (PLMs), which require fine-tuning on a lot of labeled matching/non-matching entity pairs. Recently, large languages models (LLMs), such as GPT-4, have shown the ability to perform many tasks without tuning model parameters, which is known as in-context learning (ICL) that facilitates effective learning from a few labeled input context demonstrations. However, existing ICL approaches to ER typically necessitate providing a task description and a set of demonstrations for each entity pair and thus have limitations on the monetary cost of interfacing LLMs. To address the problem, in this paper, we provide a comprehensive study to investigate how to develop a cost-effective batch prompting approach to ER. We introduce a framework BATCHER consisting of demonstration selection and question batching and explore different design choices that support batch prompting for ER. We also devise a covering-based demonstration selection strategy that achieves an effective balance between matching accuracy and monetary cost. We conduct a thorough evaluation to explore the design space and evaluate our proposed strategies. Through extensive experiments, we find that batch prompting is very cost-effective for ER, compared with not only PLM-based methods fine-tuned with extensive labeled data but also LLM-based methods with manually designed prompting. We also provide guidance for selecting appropriate design choices for batch prompting., Comment: 14 pages, 7 figures

Magnetic skyrmions exhibit unique, technologically relevant pseudo-particle behaviors which arise from their topological protection, including well-defined, three-dimensional dynamic modes that occur at microwave frequencies. During dynamic excitation, spin waves are ejected into the interstitial regions between skyrmions, creating the magnetic equivalent of a turbulent sea. However, since the spin waves in these systems have a well-defined length scale, and the skyrmions are on an ordered lattice, ordered structures from spin wave interference can precipitate from the chaos. This work uses small angle neutron scattering (SANS) to capture the dynamics in hybrid skyrmions and investigate the spin wave structure. Performing simultaneous ferromagnetic resonance and SANS, the diffraction pattern shows a large increase in low-angle scattering intensity which is present only in the resonance condition. This scattering pattern is best fit using a mass fractal model, which suggests the spin waves form a long-range fractal network. The fractal structure is constructed of fundamental units with a size that encodes the spin wave emissions and are constrained by the skyrmion lattice. These results offer critical insights into the nanoscale dynamics of skyrmions, identify a new dynamic spin wave fractal structure, and demonstrates SANS as a unique tool to probe high-speed dynamics.

Data curation tasks that prepare data for analytics are critical for turning data into actionable insights. However, due to the diverse requirements of applications in different domains, generic off-the-shelf tools are typically insufficient. As a result, data scientists often have to develop domain-specific solutions tailored to both the dataset and the task, e.g. writing domain-specific code or training machine learning models on a sufficient number of annotated examples. This process is notoriously difficult and time-consuming. We present SEED, an LLM-as-compiler approach that automatically generates domain-specific data curation solutions via Large Language Models (LLMs). Once the user describes a task, input data, and expected output, the SEED compiler produces a hybrid pipeline that combines LLM querying with more cost-effective alternatives, such as vector-based caching, LLM-generated code, and small models trained on LLM-annotated data. SEED features an optimizer that automatically selects from the four LLM-assisted modules and forms a hybrid execution pipeline that best fits the task at hand. To validate this new, revolutionary approach, we conducted experiments on $9$ datasets spanning over $5$ data curation tasks. In comparison to solutions that use the LLM on every data record, SEED achieves state-of-the-art or comparable few-shot performance, while significantly reducing the number of LLM calls., Comment: preprint, 20 pages, 4 figures

Generative AI has made significant strides, yet concerns about the accuracy and reliability of its outputs continue to grow. Such inaccuracies can have serious consequences such as inaccurate decision-making, the spread of false information, privacy violations, legal liabilities, and more. Although efforts to address these risks are underway, including explainable AI and responsible AI practices such as transparency, privacy protection, bias mitigation, and social and environmental responsibility, misinformation caused by generative AI will remain a significant challenge. We propose that verifying the outputs of generative AI from a data management perspective is an emerging issue for generative AI. This involves analyzing the underlying data from multi-modal data lakes, including text files, tables, and knowledge graphs, and assessing its quality and consistency. By doing so, we can establish a stronger foundation for evaluating the outputs of generative AI models. Such an approach can ensure the correctness of generative AI, promote transparency, and enable decision-making with greater confidence. Our vision is to promote the development of verifiable generative AI and contribute to a more trustworthy and responsible use of AI., Comment: 8 pages, 4 figures

Zero-shot NL2SQL is crucial in achieving natural language to SQL that is adaptive to new environments (e.g., new databases, new linguistic phenomena or SQL structures) with zero annotated NL2SQL samples from such environments. Existing approaches either fine-tune pre-trained language models (PLMs) based on annotated data or use prompts to guide fixed large language models (LLMs) such as ChatGPT. PLMs can perform well in schema alignment but struggle to achieve complex reasoning, while LLMs is superior in complex reasoning tasks but cannot achieve precise schema alignment. In this paper, we propose a ZeroNL2SQL framework that combines the complementary advantages of PLMs and LLMs for supporting zero-shot NL2SQL. ZeroNL2SQL first uses PLMs to generate an SQL sketch via schema alignment, then uses LLMs to fill the missing information via complex reasoning. Moreover, in order to better align the generated SQL queries with values in the given database instances, we design a predicate calibration method to guide the LLM in completing the SQL sketches based on the database instances and select the optimal SQL query via an execution-based strategy. Comprehensive experiments show that ZeroNL2SQL can achieve the best zero-shot NL2SQL performance on real-world benchmarks. Specifically, ZeroNL2SQL outperforms the state-of-the-art PLM-based methods by 3.2% to 13% and exceeds LLM-based methods by 10% to 20% on execution accuracy., Comment: Working in progress

Orchestrating a high-quality data preparation program is essential for successful machine learning (ML), but it is known to be time and effort consuming. Despite the impressive capabilities of large language models like ChatGPT in generating programs by interacting with users through natural language prompts, there are still limitations. Specifically, a user must provide specific prompts to iteratively guide ChatGPT in improving data preparation programs, which requires a certain level of expertise in programming, the dataset used and the ML task. Moreover, once a program has been generated, it is non-trivial to revisit a previous version or make changes to the program without starting the process over again. In this paper, we present ChatPipe, a novel system designed to facilitate seamless interaction between users and ChatGPT. ChatPipe provides users with effective recommendation on next data preparation operations, and guides ChatGPT to generate program for the operations. Also, ChatPipe enables users to easily roll back to previous versions of the program, which facilitates more efficient experimentation and testing. We have developed a web application for ChatPipe and prepared several real-world ML tasks from Kaggle. These tasks can showcase the capabilities of ChatPipe and enable VLDB attendees to easily experiment with our novel features to rapidly orchestrate a high-quality data preparation program.

Magnetic skyrmions are topologically protected chiral spin textures which present opportunities for next-generation magnetic data storage and logic information technologies. The topology of these structures originates in the geometric configuration of the magnetic spins - more generally described as the structure. While the skyrmion structure is most often depicted using a 2D projection of the three-dimensional structure, recent works have emphasized the role of all three dimensions in determining the topology and their response to external stimuli. In this work, grazing-incidence small-angle neutron scattering and polarized neutron reflectometry are used to determine the three-dimensional structure of hybrid skyrmions. The structure of the hybrid skyrmions, which includes a combination of N\'eel-like and Bloch-like components along their length, is expected to significantly contribute to their notable stability, which includes ambient conditions. To interpret the neutron scattering data, micromagnetic simulations of the hybrid skyrmions were performed, and the corresponding diffraction patterns were determined using a Born approximation transformation. The converged magnetic profile reveals the magnetic structure along with the skyrmion depth profile, including the thickness of the Bloch and N\'eel segments and the diameter of the core.

Can foundation models (such as ChatGPT) clean your data? In this proposal, we demonstrate that indeed ChatGPT can assist in data cleaning by suggesting corrections for specific cells in a data table (scenario 1). However, ChatGPT may struggle with datasets it has never encountered before (e.g., local enterprise data) or when the user requires an explanation of the source of the suggested clean values. To address these issues, we developed a retrieval-based method that complements ChatGPT's power with a user-provided data lake. The data lake is first indexed, we then retrieve the top-k relevant tuples to the user's query tuple and finally leverage ChatGPT to infer the correct value (scenario 2). Nevertheless, sharing enterprise data with ChatGPT, an externally hosted model, might not be feasible for privacy reasons. To assist with this scenario, we developed a custom RoBERTa-based foundation model that can be locally deployed. By fine-tuning it on a small number of examples, it can effectively make value inferences based on the retrieved tuples (scenario 3). Our proposed system, RetClean, seamlessly supports all three scenarios and provides a user-friendly GUI that enables the VLDB audience to explore and experiment with the system.

Magnetic interfaces and the phenomena arising from them drive both the design of modern spintronics and fundamental research. Recently, it was revealed that through designing magnetic frustration in configurationally complex entropy stabilized oxides, exchange bias can occur in structurally single crystal films. This eliminates the need for complex heterostructures and nanocomposites in the design and control of magnetic response phenomena. In this work, we demonstrate through hole doping of a high entropy perovskite oxide that tuning of magnetic responses can be achieved. With detailed magnetometry, we show magnetic coupling exhibiting a variety of magnetic responses including exchange bias and antiferromagnetic spin reversal in the entropy stabilized ABO3 perovskite oxide La1-xSrx(Cr0.2Mn0.2Fe0.2Co0.2Ni0.2)O3 family. We find that manipulation of the A-site charge state can be used to balance magnetic phase compositions and coupling responses. This allows for the creation of highly tunable exchange bias responses. In the low Sr doping regime, a spin frustrated region arising at the antiferromagnetic phase boundary is shown to directly couple to the antiferromagnetic moments of the film and emerges as the dominant mechanism, leading to a vertical shift of magnetization loops in response to field biasing. At higher concentrations, direct coupling of antiferromagnetic and ferromagnetic regions is observed. This tunability of magnetic coupling is discussed within the context of these three competing magnetic phases, revealing critical features in designing exchange bias through exploiting spin frustration and disorder in high entropy oxides.

Fact verification has attracted a lot of research attention recently, e.g., in journalism, marketing, and policymaking, as misinformation and disinformation online can sway one's opinion and affect one's actions. While fact-checking is a hard task in general, in many cases, false statements can be easily debunked based on analytics over tables with reliable information. Hence, table-based fact verification has recently emerged as an important and growing research area. Yet, progress has been limited due to the lack of datasets that can be used to pre-train language models (LMs) to be aware of common table operations, such as aggregating a column or comparing tuples. To bridge this gap, in this paper we introduce PASTA, a novel state-of-the-art framework for table-based fact verification via pre-training with synthesized sentence-table cloze questions. In particular, we design six types of common sentence-table cloze tasks, including Filter, Aggregation, Superlative, Comparative, Ordinal, and Unique, based on which we synthesize a large corpus consisting of 1.2 million sentence-table pairs from WikiTables. PASTA uses a recent pre-trained LM, DeBERTaV3, and further pretrains it on our corpus. Our experimental results show that PASTA achieves new state-of-the-art performance on two table-based fact verification benchmarks: TabFact and SEM-TAB-FACTS. In particular, on the complex set of TabFact, which contains multiple operations, PASTA largely outperforms the previous state of the art by 4.7 points (85.6% vs. 80.9%), and the gap between PASTA and human performance on the small TabFact test set is narrowed to just 1.5 points (90.6% vs. 92.1%)., Comment: EMNLP 2022

High traffic touch surfaces such as doorknobs, countertops, and handrails can be transmission points for the spread of pathogens, emphasizing the need to develop materials that actively self-sanitize. Metals are frequently used for these surfaces due to their durability, but many metals also possess antimicrobial properties which function through a variety of mechanisms. This work investigates metallic alloys comprised of several bioactive metals with the target of achieving broad-spectrum, rapid bioactivity through synergistic activity. An entropy-motivated stabilization paradigm is proposed to prepare scalable alloys of copper, silver, nickel and cobalt. Using combinatorial sputtering, thin-film alloys were prepared on 100 mm wafers with 50% compositional grading of each element across the wafer. The films were then annealed and investigated for alloy stability. Bioactivity testing was performed on both the as-grown alloys and the annealed films using four microorganisms -- Phi6, MS2, Bacillus subtilis and Escherichia coli -- as surrogates for human viral and bacterial pathogens. Testing showed that after 30 s of contact with some of the test alloys, Phi6, an enveloped, single-stranded RNA bacteriophage that serves as a SARS-CoV 2 surrogate, was reduced up to 6.9 orders of magnitude (>99.9999%). Additionally, the non-enveloped, double-stranded DNA bacteriophage MS2, and the Gram-negative E. coli and Gram-positive B. subtilis bacterial strains showed a 5.0, 6.4, and 5.7 log reduction in activity after 30, 20 and 10 minutes, respectively. Bioactivity in the alloy samples showed a strong dependence on the composition, with the log reduction scaling directly with the Cu content. Concentration of Cu by phase separation after annealing improved activity in some of the samples. The results motivate a variety of themes which can be leveraged to design ideal bioactive surfaces., Comment: 15 pages, 6 figures

Hard/soft magnetic bilayer thin films have been widely used in data storage technologies and permanent magnet applications. The magnetic configuration and response to temperatures and magnetic fields in these heterostructures are considered to be highly dependent on the interfacial coupling. However, the intrinsic properties of each of the layers, such as the saturation magnetization and layer thickness, also strongly influence the magnetic configuration. Changing these parameters provides an effective method to tailor magnetic properties in composite magnets. Here, we use polarized neutron reflectometry (PNR) to experimentally probe the interfacial magnetic configurations in hard/soft bilayer thin films: L10-FePt/A1-FePt, [Co/Pd] /CoPd, [Co/Pt] /FeNi and L10-FePt/Fe, which all have a perpendicular magnetic anisotropy in the hard layer. These films were designed with different soft and hard layer thicknesses (t_soft and t_hard) and saturation magnetization (M_s^soft and M_s^hard), respectively. The influences of an in-plane magnetic field (H_ip) and temperature (T) are also studied using a L10 FePt/A1-FePt bilayer sample. Comparing the PNR results to micromagnetic simulations reveals that the interfacial magnetic configuration is highly dependent on t_soft, M_s^soft and the external factors (H_ip and T), and has a relatively weak dependence on t_hard and M_s^hard. Key among these results, for thin t_soft, the hard and soft layers are rigidly coupled in the out-of-plane direction, then undergo a transition to relax in-plane. This transition can be delayed to larger t_soft by decreasing M_s^soft. Understanding the influence of these parameters on the magnetic configuration is critical to designing functional composite magnets for applications., Comment: 8 pages, 4 figures

Compositionally complex materials (CCMs) present a potential paradigm shift in the design of magnetic materials. These alloys exhibit long-range structural order coupled with limited or no chemical order. As a result, extreme local environments exist with a large opposing magnetic energy term, which can manifest large changes in the magnetic behavior. In the current work, the magnetic properties of (Cr, Mn, Fe, Ni) alloys are presented. These materials were prepared by room-temperature combinatorial sputtering, resulting in a range of compositions with a single BCC structural phase and no chemical ordering. The combinatorial growth technique allows CCMs to be prepared outside of their thermodynamically stable phase, enabling the exploration of otherwise inaccessible order. The mixed ferromagnetic and antiferromagnetic interactions in these alloys causes frustrated magnetic behavior, which results in an extremely low coercivity (<1 mT), which increases rapidly at 50 K. At low temperatures, the coercivity achieves values of nearly 500 mT, which is comparable to some high-anisotropy magnetic materials. Commensurate with the divergent coercivity is an atypical drop in the temperature dependent magnetization. These effects are explained by a mixed magnetic phase model, consisting of ferro-, antiferro , and frustrated magnetic regions, and are rationalized by simulations. A machine-learning algorithm is employed to visualize the parameter space and inform the development of subsequent compositions. Annealing the samples at 600 {\deg}C orders the sample, more-than doubling the Curie temperature and increasing the saturation magnetization by as much as 5x. Simultaneously, the large coercivities are suppressed, resulting in magnetic behavior that is largely temperature independent over a range of 350 K., Comment: 13 pages, 6 figures

Magnetic materials with pyrochlore crystal structure form exotic magnetic states due to the high lattice frustration. In this work we follow the effects of coupling of the lattice and electronic and magnetic degrees of freedom in two Praseodymium-based pyrochlores Pr$_2$Zr$_2$O$_7$ and Pr$_2$Ir$_2$O$_7$. In both materials the presence of magnetic interactions does not lead to magnetically ordered low temperature states, however their electronic properties are different. A comparison of Raman phonon spectra of Pr$_2$Zr$_2$O$_7$ and Pr$_2$Ir$_2$O$_7$ allows us to identify magneto-elastic coupling in Pr$_2$Zr$_2$O$_7$ that elucidates its magnetic properties at intermediate temperatures, and allows us to characterize phonon-electron coupling in the semimetallic Pr$_2$Ir$_2$O$_7$. We also show that the effects of random disorder on the Raman phonon spectra is small., Comment: 6 pages, 5 figures

Pr$_2$Zr$_2$O$_7$ is a pyrochlore quantum spin-ice candidate. Using Raman scattering spectroscopy we probe crystal electric field excitations of Pr$^{3+}$, and demonstrate the importance of their interactions with the lattice. We identify a vibronic interaction with a phonon that leads to a splitting of a doublet crystal field excitation at around 55~meV. We also probe a splitting of the non-Kramers ground state doublet of Pr$^{3+}$ by observing a double line of the excitations to the first excited singlet state $E^0_g \rightarrow A_{1g}$. We show that the splitting has a strong temperature dependence, with the doublet structure most prominent between 50~K and 100~K, and the weight of one of the components strongly decreases on cooling. We suggest a static or dynamic deviation of Pr$^{3+}$ from the position in the ideal crystal structure can be the origin of the effect, with the deviation strongly decreasing at low temperatures., Comment: 6 pages, 3 figures

Can AI help automate human-easy but computer-hard data preparation tasks that burden data scientists, practitioners, and crowd workers? We answer this question by presenting RPT, a denoising auto-encoder for tuple-to-X models (X could be tuple, token, label, JSON, and so on). RPT is pre-trained for a tuple-to-tuple model by corrupting the input tuple and then learning a model to reconstruct the original tuple. It adopts a Transformer-based neural translation architecture that consists of a bidirectional encoder (similar to BERT) and a left-to-right autoregressive decoder (similar to GPT), leading to a generalization of both BERT and GPT. The pre-trained RPT can already support several common data preparation tasks such as data cleaning, auto-completion and schema matching. Better still, RPT can be fine-tuned on a wide range of data preparation tasks, such as value normalization, data transformation, data annotation, etc. To complement RPT, we also discuss several appealing techniques such as collaborative training and few-shot learning for entity resolution, and few-shot learning and NLP question-answering for information extraction. In addition, we identify a series of research opportunities to advance the field of data preparation.

Many data problems are solved when the right view of a combination of datasets is identified. Finding such a view is challenging because of the many tables spread across many databases, data lakes, and cloud storage in modern organizations. Finding relevant tables, and identifying how to combine them is a difficult and time-consuming process that hampers users' productivity. In this paper, we describe Dataset-On-Demand (DoD), a system that lets users specify the schema of the view they want, and have the system find views for them. With many underlying data sources, the number of resulting views for any given query is high, and the burden of choosing the right one is onerous to users. DoD uses a new method, 4C, to reduce the size of the view choice space for users. 4C classifies views into 4 classes: compatible views are exactly the same, contained views present a subsumption relationship, complementary views are unionable, and contradictory views have incompatible values that indicate fundamental differences between views. These 4 classes permit different presentation strategies to reduce the total number of views a user must consider. We evaluate DoD on two key metrics of interest: its ability to reduce the size of the choice space, and the end to end performance. DoD finds all views within minutes, and reduces the number of views presented to users by 2-10x.