arXiv subjects

Nan Tang

Publications and source records attributed to Nan Tang.

At least 91 records · Page 5Linked to original sources

arXiv2023

Skyrmion-Excited Spin Wave Fractal Network

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.

cond-mat.mtrl-sci↗

arXiv2023

VerifAI: Verified Generative AI

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.

cs.DB↗

arXiv2023

Interleaving Pre-Trained Language Models and Large Language Models for Zero-Shot NL2SQL Generation

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.

cs.CL↗

arXiv2023

Three-Dimensional Structure of Hybrid Magnetic Skyrmions Determined by Neutron Scattering

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éel-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éel segments and the diameter of the core.

cond-mat.mes-hall↗

arXiv2023

ChatPipe: Orchestrating Data Preparation Program by Optimizing Human-ChatGPT Interactions

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.

cs.DB↗

arXiv2023

Hole doping in compositionally complex correlated oxide enables tunable exchange biasing

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.

cond-mat.str-el↗

arXiv2022

PASTA: Table-Operations Aware Fact Verification via Sentence-Table Cloze Pre-training

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%).

cs.CL↗

arXiv2022

Anti-microbial properties of a multi-component alloy

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.

physics.bio-ph↗

arXiv2021

Controlling magnetic configuration in soft-hard bilayers probed by polarized neutron reflectometry

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.

cond-mat.mtrl-sci↗

arXiv2021

Magnetism in Metastable and Annealed Compositionally Complex Alloys

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 °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.

cond-mat.mtrl-sci↗

arXiv2021

Phonon spectrum of Pr$_2$Zr$_2$O$_7$ and Pr$_2$Ir$_2$O$_7$ as an evidence of coupling of the lattice with electronic and magnetic degrees of freedom

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.

cond-mat.str-el↗

arXiv2021

Importance of dynamic lattice effects for crystal field excitations in quantum spin ice candidate Pr$_2$Zr$_2$O$_7$

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.

cond-mat.str-el↗

arXiv2021

RPT: Relational Pre-trained Transformer Is Almost All You Need towards Democratizing Data Preparation

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.

cs.LG↗

arXiv2020

Deductive Optimization of Relational Data Storage

Optimizing the physical data storage and retrieval of data are two key database management problems. In this paper, we propose a language that can express a wide range of physical database layouts, going well beyond the row- and column-based methods that are widely used in database management systems. We use deductive synthesis to turn a high-level relational representation of a database query into a highly optimized low-level implementation which operates on a specialized layout of the dataset. We build a compiler for this language and conduct experiments using a popular database benchmark, which shows that the performance of these specialized queries is competitive with a state-of-the-art in memory compiled database system.

cs.PL↗

arXiv2019

Dataset-On-Demand: Automatic View Search and Presentation for Data Discovery

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.

cs.DB↗

arXiv2019

DeepER -- Deep Entity Resolution

Entity resolution (ER) is a key data integration problem. Despite the efforts in 70+ years in all aspects of ER, there is still a high demand for democratizing ER - humans are heavily involved in labeling data, performing feature engineering, tuning parameters, and defining blocking functions. With the recent advances in deep learning, in particular distributed representation of words (a.k.a. word embeddings), we present a novel ER system, called DeepER, that achieves good accuracy, high efficiency, as well as ease-of-use (i.e., much less human efforts). For accuracy, we use sophisticated composition methods, namely uni- and bi-directional recurrent neural networks (RNNs) with long short term memory (LSTM) hidden units, to convert each tuple to a distributed representation (i.e., a vector), which can in turn be used to effectively capture similarities between tuples. We consider both the case where pre-trained word embeddings are available as well the case where they are not; we present ways to learn and tune the distributed representations. For efficiency, we propose a locality sensitive hashing (LSH) based blocking approach that uses distributed representations of tuples; it takes all attributes of a tuple into consideration and produces much smaller blocks, compared with traditional methods that consider only a few attributes. For ease-of-use, DeepER requires much less human labeled data and does not need feature engineering, compared with traditional machine learning based approaches which require handcrafted features, and similarity functions along with their associated thresholds. We evaluate our algorithms on multiple datasets (including benchmarks, biomedical data, as well as multi-lingual data) and the extensive experimental results show that DeepER outperforms existing solutions.

cs.DB↗

arXiv2019

Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries

Given a graph $G$, a source node $s$ and a target node $t$, the personalized PageRank (PPR) of $t$ with respect to $s$ is the probability that a random walk starting from $s$ terminates at $t$. An important variant of the PPR query is single-source PPR (SSPPR), which enumerates all nodes in $G$, and returns the top-$k$ nodes with the highest PPR values with respect to a given source $s$. PPR in general and SSPPR in particular have important applications in web search and social networks, e.g., in Twitter's Who-To-Follow recommendation service. However, PPR computation is known to be expensive on large graphs, and resistant to indexing. Consequently, previous solutions either use heuristics, which do not guarantee result quality, or rely on the strong computing power of modern data centers, which is costly. Motivated by this, we propose effective index-free and index-based algorithms for approximate PPR processing, with rigorous guarantees on result quality. We first present FORA, an approximate SSPPR solution that combines two existing methods Forward Push (which is fast but does not guarantee quality) and Monte Carlo Random Walk (accurate but slow) in a simple and yet non-trivial way, leading to both high accuracy and efficiency. Further, FORA includes a simple and effective indexing scheme, as well as a module for top-$k$ selection with high pruning power. Extensive experiments demonstrate that the proposed solutions are orders of magnitude more efficient than their respective competitors. Notably, on a billion-edge Twitter dataset, FORA answers a top-500 approximate SSPPR query within 1 second, using a single commodity server.

cs.SI↗

arXiv2019

Technical Report: Optimizing Human Involvement for Entity Matching and Consolidation

An end-to-end data integration system requires human feedback in several phases, including collecting training data for entity matching, debugging the resulting clusters, confirming transformations applied on these clusters for data standardization, and finally, reducing each cluster to a single, canonical representation (or "golden record"). The traditional wisdom is to sequentially apply the human feedback, obtained by asking specific questions, within some budget in each phase. However, these questions are highly correlated; the answer to one can influence the outcome of any of the phases of the pipeline. Hence, interleaving them has the potential to offer significant benefits. In this paper, we propose a human-in-the-loop framework that interleaves different types of questions to optimize human involvement. We propose benefit models to measure the quality improvement from asking a question, and cost models to measure the human time it takes to answer a question. We develop a question scheduling framework that judiciously selects questions to maximize the accuracy of the final golden records. Experimental results on three real-world datasets show that our holistic method significantly improves the quality of golden records from 70% to 90%, compared with the state-of-the-art approaches.

cs.DB↗