Searcharxiv⌕ Search

arXiv subjects

Ji Ma

Publications and source records attributed to Ji Ma.

At least 73 records · Page 4Linked to original sources

QAmeleon: Multilingual QA with Only 5 Examples

The availability of large, high-quality datasets has been one of the main drivers of recent progress in question answering (QA). Such annotated datasets however are difficult and costly to collect, and rarely exist in languages other than English, rendering QA technology inaccessible to underrepresented languages. An alternative to building large monolingual training datasets is to leverage pre-trained language models (PLMs) under a few-shot learning setting. Our approach, QAmeleon, uses a PLM to automatically generate multilingual data upon which QA models are trained, thus avoiding costly annotation. Prompt tuning the PLM for data synthesis with only five examples per language delivers accuracy superior to translation-based baselines, bridges nearly 60% of the gap between an English-only baseline and a fully supervised upper bound trained on almost 50,000 hand labeled examples, and always leads to substantial improvements compared to fine-tuning a QA model directly on labeled examples in low resource settings. Experiments on the TyDiQA-GoldP and MLQA benchmarks show that few-shot prompt tuning for data synthesis scales across languages and is a viable alternative to large-scale annotation.

cs.CL↗

Attributed Question Answering: Evaluation and Modeling for Attributed Large Language Models

Large language models (LLMs) have shown impressive results while requiring little or no direct supervision. Further, there is mounting evidence that LLMs may have potential in information-seeking scenarios. We believe the ability of an LLM to attribute the text that it generates is likely to be crucial in this setting. We formulate and study Attributed QA as a key first step in the development of attributed LLMs. We propose a reproducible evaluation framework for the task and benchmark a broad set of architectures. We take human annotations as a gold standard and show that a correlated automatic metric is suitable for development. Our experimental work gives concrete answers to two key questions (How to measure attribution?, and How well do current state-of-the-art methods perform on attribution?), and give some hints as to how to address a third (How to build LLMs with attribution?).

cs.CL↗

Photocarrier Transport of Ferroelectric Photovoltaic Thin Films Detected by the Magnetic Dynamics of Adjacent Ferromagnetic Layers

We have observed photocarrier transport behaviors in BiFeO$_3$/La$_{1-x}$Sr$_x$MnO$_3$~(BFO/LSMO) heterostructures by using time-resolved synchrotron x-ray magnetic circular dichroism in reflectivity. The magnetization of LSMO layers was used as a probe of photo-induced carrier dynamics in the photovoltaic BFO layers. During the photo-induced demagnetization process, the decay time of LSMO~($x$=0.2) magnetization strongly depends on the ferroelectric polarization direction of the BFO layer. The variation of decay time should be attributed to the different sign of accumulated photocarriers at the BFO/LSMO interface induced by the photovoltaic effect of the BFO layer. The photocarriers can reach the BFO/LSMO interface and influence the magnetization distribution in the LSMO layers within the timescale of $\sim$100~ps. Our results provide a novel strategy to investigate carrier dynamics and mechanisms of optical control of magnetization in thin film heterostructures.

cond-mat.mtrl-sci↗

Significant Unconventional Anomalous Hall Effect in Heavy Metal/Antiferromagnetic Insulator Heterostructures

The anomalous Hall effect (AHE) is a quantum coherent transport phenomenon that conventionally vanishes at elevated temperatures because of thermal dephasing. Therefore, it is puzzling that the AHE can survive in heavy metal (HM)/antiferromagnetic (AFM) insulator (AFMI) heterostructures at high temperatures yet disappears at low temperatures. In this paper, we report that an unconventional high-temperature AHE in HM/AFMI is observed only around the Néel temperature of AFM, with large anomalous Hall resistivity up to 40 n$Ω$ cm. This mechanism is attributed to the emergence of a noncollinear AFM spin texture with a non-zero net topological charge. Atomistic spin dynamics simulation shows that such a unique spin texture can be stabilized by the subtle interplay among the collinear AFM exchange coupling, interfacial Dyzaloshinski-Moriya interaction, thermal fluctuation, and bias magnetic field.

cond-mat.mes-hall↗

HYRR: Hybrid Infused Reranking for Passage Retrieval

We present Hybrid Infused Reranking for Passages Retrieval (HYRR), a framework for training rerankers based on a hybrid of BM25 and neural retrieval models. Retrievers based on hybrid models have been shown to outperform both BM25 and neural models alone. Our approach exploits this improved performance when training a reranker, leading to a robust reranking model. The reranker, a cross-attention neural model, is shown to be robust to different first-stage retrieval systems, achieving better performance than rerankers simply trained upon the first-stage retrievers in the multi-stage systems. We present evaluations on a supervised passage retrieval task using MS MARCO and zero-shot retrieval tasks using BEIR. The empirical results show strong performance on both evaluations.

cs.CL↗

Distributed Prediction-Correction Algorithms for Time-Varying Nash Equilibrium Tracking

This paper focuses on a time-varying Nash equilibrium trajectory tracking problem, that is applicable to a wide range of non-cooperative game applications arising in dynamic environments. To solve this problem, we propose a distributed prediction correction algorithm, termed DPCA, in which each player predicts future strategies based on previous observations and then exploits predictions to effectively track the NE trajectory by using one or multiple distributed gradient descent steps across a network. We rigorously demonstrate that the tracking sequence produced by the proposed algorithm is able to track the time-varying NE with a bounded error. We also show that the tracking error can be arbitrarily close to zero when the sampling period is small enough. Furthermore, we achieve linear convergence for the time-invariant Nash equilibrium seeking problem as a special case of our results. Finally, a numerical simulation of a multi-robot surveillance scenario verifies the tracking performance and the prediction necessary for the proposed algorithm.

math.OC↗

Recycling of Perovskite Substrate

The use of water-soluble sacrificial layer of Sr$_3$Al$_2$O$_6$ has tremendously boosted the research on freestanding functional oxide thin films, especially thanks to its ultimate capability to produce high-quality epitaxial perovskite thin films. However, the costly single-crystalline substrates, e.g. SrTiO$_3$, were generally discarded after obtaining the freestanding thin films. Here, we demonstrate that the SrTiO$_3$ substrates can be recycled to fabricate La$_{0.7}$Sr$_{0.3}$MnO$_3$ films with nearly identical structural and electrical properties. After attaining freestanding thin films, the residues on SrTiO$_3$ can be removed by 80 \degree C hot water soaking and rinsing treatments. Consequently, the surface of SrTiO$_3$ reverted to its original step-and-terrace structure.

physics.app-ph↗

RankT5: Fine-Tuning T5 for Text Ranking with Ranking Losses

Recently, substantial progress has been made in text ranking based on pretrained language models such as BERT. However, there are limited studies on how to leverage more powerful sequence-to-sequence models such as T5. Existing attempts usually formulate text ranking as classification and rely on postprocessing to obtain a ranked list. In this paper, we propose RankT5 and study two T5-based ranking model structures, an encoder-decoder and an encoder-only one, so that they not only can directly output ranking scores for each query-document pair, but also can be fine-tuned with "pairwise" or "listwise" ranking losses to optimize ranking performances. Our experiments show that the proposed models with ranking losses can achieve substantial ranking performance gains on different public text ranking data sets. Moreover, when fine-tuned with listwise ranking losses, the ranking model appears to have better zero-shot ranking performance on out-of-domain data sets compared to the model fine-tuned with classification losses.

cs.IR↗

Promptagator: Few-shot Dense Retrieval From 8 Examples

Much recent research on information retrieval has focused on how to transfer from one task (typically with abundant supervised data) to various other tasks where supervision is limited, with the implicit assumption that it is possible to generalize from one task to all the rest. However, this overlooks the fact that there are many diverse and unique retrieval tasks, each targeting different search intents, queries, and search domains. In this paper, we suggest to work on Few-shot Dense Retrieval, a setting where each task comes with a short description and a few examples. To amplify the power of a few examples, we propose Prompt-base Query Generation for Retriever (Promptagator), which leverages large language models (LLM) as a few-shot query generator, and creates task-specific retrievers based on the generated data. Powered by LLM's generalization ability, Promptagator makes it possible to create task-specific end-to-end retrievers solely based on a few examples {without} using Natural Questions or MS MARCO to train %question generators or dual encoders. Surprisingly, LLM prompting with no more than 8 examples allows dual encoders to outperform heavily engineered models trained on MS MARCO like ColBERT v2 by more than 1.2 nDCG on average on 11 retrieval sets. Further training standard-size re-rankers using the same generated data yields another 5.0 point nDCG improvement. Our studies determine that query generation can be far more effective than previously observed, especially when a small amount of task-specific knowledge is given.

cs.CL↗

ED2LM: Encoder-Decoder to Language Model for Faster Document Re-ranking Inference

State-of-the-art neural models typically encode document-query pairs using cross-attention for re-ranking. To this end, models generally utilize an encoder-only (like BERT) paradigm or an encoder-decoder (like T5) approach. These paradigms, however, are not without flaws, i.e., running the model on all query-document pairs at inference-time incurs a significant computational cost. This paper proposes a new training and inference paradigm for re-ranking. We propose to finetune a pretrained encoder-decoder model using in the form of document to query generation. Subsequently, we show that this encoder-decoder architecture can be decomposed into a decoder-only language model during inference. This results in significant inference time speedups since the decoder-only architecture only needs to learn to interpret static encoder embeddings during inference. Our experiments show that this new paradigm achieves results that are comparable to the more expensive cross-attention ranking approaches while being up to 6.8X faster. We believe this work paves the way for more efficient neural rankers that leverage large pretrained models.

cs.CL↗

Large Dual Encoders Are Generalizable Retrievers

It has been shown that dual encoders trained on one domain often fail to generalize to other domains for retrieval tasks. One widespread belief is that the bottleneck layer of a dual encoder, where the final score is simply a dot-product between a query vector and a passage vector, is too limited to make dual encoders an effective retrieval model for out-of-domain generalization. In this paper, we challenge this belief by scaling up the size of the dual encoder model {\em while keeping the bottleneck embedding size fixed.} With multi-stage training, surprisingly, scaling up the model size brings significant improvement on a variety of retrieval tasks, especially for out-of-domain generalization. Experimental results show that our dual encoders, \textbf{G}eneralizable \textbf{T}5-based dense \textbf{R}etrievers (GTR), outperform %ColBERT~\cite{khattab2020colbert} and existing sparse and dense retrievers on the BEIR dataset~\cite{thakur2021beir} significantly. Most surprisingly, our ablation study finds that GTR is very data efficient, as it only needs 10\% of MS Marco supervised data to achieve the best out-of-domain performance. All the GTR models are released at https://tfhub.dev/google/collections/gtr/1.

cs.IR↗

Sentence-T5: Scalable Sentence Encoders from Pre-trained Text-to-Text Models

We provide the first exploration of sentence embeddings from text-to-text transformers (T5). Sentence embeddings are broadly useful for language processing tasks. While T5 achieves impressive performance on language tasks cast as sequence-to-sequence mapping problems, it is unclear how to produce sentence embeddings from encoder-decoder models. We investigate three methods for extracting T5 sentence embeddings: two utilize only the T5 encoder and one uses the full T5 encoder-decoder model. To support our investigation, we establish a new sentence representation transfer benchmark, SentGLUE, which extends the SentEval toolkit to nine tasks from the GLUE benchmark. Our encoder-only models outperforms Sentence-BERT and SimCSE sentence embeddings on both SentEval and SentGLUE transfer tasks, including semantic textual similarity (STS). Scaling up T5 from millions to billions of parameters is found to produce consistent further improvements. Finally, our encoder-decoder method achieves a new state-of-the-art on STS when using sentence embeddings. Our models are released at https://tfhub.dev/google/collections/sentence-t5/1.

cs.CL↗

Distributed Nash Equilibrium Seeking under Quantization Communication

This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-players networks with finite bandwidth communication. A distributed quantized algorithm is presented, which consists of local gradient play, distributed decision estimating, and adaptive quantization. Exponential convergence of the algorithm is established, and a relationship between the convergence rate and the bandwidth is quantitatively analyzed. Finally, a simulation of an energy consumption game is presented to validate the proposed results.

cs.DC↗

Observation of fractional edge excitations in nanographene spin chains

Fractionalization is a phenomenon in which strong interactions in a quantum system drive the emergence of excitations with quantum numbers that are absent in the building blocks. Outstanding examples are excitations with charge e/3 in the fractional quantum Hall effect, solitons in one-dimensional conducting polymers and Majorana states in topological superconductors. Fractionalization is also predicted to manifest itself in low-dimensional quantum magnets, such as one-dimensional antiferromagnetic S = 1 chains. The fundamental features of this system are gapped excitations in the bulk and, remarkably, S = 1/2 edge states at the chain termini, leading to a four-fold degenerate ground state that reflects the underlying symmetry-protected topological order. Here, we use on-surface synthesis to fabricate one-dimensional spin chains that contain the S = 1 polycyclic aromatic hydrocarbon triangulene as the building block. Using scanning tunneling microscopy and spectroscopy at 4.5 K, we probe length-dependent magnetic excitations at the atomic scale in both open-ended and cyclic spin chains, and directly observe gapped spin excitations and fractional edge states therein. Exact diagonalization calculations provide conclusive evidence that the spin chains are described by the S = 1 bilinear-biquadratic Hamiltonian in the Haldane symmetry-protected topological phase. Our results open a bottom-up approach to study strongly correlated quantum spin liquid phases in purely organic materials, with the potential for the realization of measurement-based quantum computation.

cond-mat.mes-hall↗

Zero-shot Neural Passage Retrieval via Domain-targeted Synthetic Question Generation

A major obstacle to the wide-spread adoption of neural retrieval models is that they require large supervised training sets to surpass traditional term-based techniques, which are constructed from raw corpora. In this paper, we propose an approach to zero-shot learning for passage retrieval that uses synthetic question generation to close this gap. The question generation system is trained on general domain data, but is applied to documents in the targeted domain. This allows us to create arbitrarily large, yet noisy, question-passage relevance pairs that are domain specific. Furthermore, when this is coupled with a simple hybrid term-neural model, first-stage retrieval performance can be improved further. Empirically, we show that this is an effective strategy for building neural passage retrieval models in the absence of large training corpora. Depending on the domain, this technique can even approach the accuracy of supervised models.

cs.IR↗

Neural Passage Retrieval with Improved Negative Contrast

In this paper we explore the effects of negative sampling in dual encoder models used to retrieve passages for automatic question answering. We explore four negative sampling strategies that complement the straightforward random sampling of negatives, typically used to train dual encoder models. Out of the four strategies, three are based on retrieval and one on heuristics. Our retrieval-based strategies are based on the semantic similarity and the lexical overlap between questions and passages. We train the dual encoder models in two stages: pre-training with synthetic data and fine tuning with domain-specific data. We apply negative sampling to both stages. The approach is evaluated in two passage retrieval tasks. Even though it is not evident that there is one single sampling strategy that works best in all the tasks, it is clear that our strategies contribute to improving the contrast between the response and all the other passages. Furthermore, mixing the negatives from different strategies achieve performance on par with the best performing strategy in all tasks. Our results establish a new state-of-the-art level of performance on two of the open-domain question answering datasets that we evaluated.

cs.CL↗

RRF102: Meeting the TREC-COVID Challenge with a 100+ Runs Ensemble

In this paper, we report the results of our participation in the TREC-COVID challenge. To meet the challenge of building a search engine for rapidly evolving biomedical collection, we propose a simple yet effective weighted hierarchical rank fusion approach, that ensembles together 102 runs from (a) lexical and semantic retrieval systems, (b) pre-trained and fine-tuned BERT rankers, and (c) relevance feedback runs. Our ablation studies demonstrate the contributions of each of these systems to the overall ensemble. The submitted ensemble runs achieved state-of-the-art performance in rounds 4 and 5 of the TREC-COVID challenge.

cs.IR↗

QURIOUS: Question Generation Pretraining for Text Generation

Recent trends in natural language processing using pretraining have shifted focus towards pretraining and fine-tuning approaches for text generation. Often the focus has been on task-agnostic approaches that generalize the language modeling objective. We propose question generation as a pretraining method, which better aligns with the text generation objectives. Our text generation models pretrained with this method are better at understanding the essence of the input and are better language models for the target task. When evaluated on two text generation tasks, abstractive summarization and answer-focused question generation, our models result in state-of-the-art performances in terms of automatic metrics. Human evaluators also found our summaries and generated questions to be more natural, concise and informative.

cs.CL↗