Search

Asian Americans as a group are overrepresented among STEM college graduates and have the highest average college enrollment rate of any racial or ethnic category. Thus, Asian Americans are typically excluded from educational interventions directed at improving STEM education for Students of Color because they are not considered to be underrepresented minorities. However, statistics obscure the individual needs of the more than 20 ethnic subgroups that fall under the umbrella term Asian Americans. Using a participatory action research approach, this paper documents the institutional and sociocultural factors that push out HMoob (or Hmong) American college students from STEM programs at one large, predominantly White university; and the coordinate processes of gatekeeping and transactional advising that either redirect those students toward non-STEM programs or force them out of the university completely.

We study the three-dimensional Carrollian field theory on the Rindler horizon which is dual to a bulk massless scalar field theory in the four-dimensional Rindler wedge. The Carrollian field theory could be mapped to a two-dimensional Euclidean field theory in the transverse plane by a Fourier transform. After defining the incoming and outgoing states at the future and past Rindler horizon, respectively, we construct the boundary-to-boundary and bulk-to-boundary propagators that are consistent with the bulk Green's function in the literature. We investigate the tree-level Carrollian amplitudes up to four points. The tree-level four-point Carrollian amplitude in $\Phi^4$ theory has the same structure as the one-loop triangle Feynman integral in the Lee-Pomeransky representation with complex powers in the propagators and spacetime dimension. Moreover, the four-point Carrollian amplitude with a zero energy state inserted at infinity in $\Phi^4$ theory is proportional to the three-point Carrollian amplitude in $\Phi^3$ theory., Comment: 78 pages, 14 figures, 8 tables

Employing aberration-corrected scanning transmission electron microscopy (STEM), we meticulously investigated the intrinsic chemical heterogeneity of Fe1+yTe, Fe1+yTe0.8Se0.2, and Fe1+yTe0.5Se0.5. Comprehensive analysis reveals the presence of interstitial iron atoms (Feint) across all samples, pre-dominantly occupying the 2c site of the P4/nmm space group. Moreover, a superstructure phase characterized by a wave vector q = 2/5a + 1/2c, originating from the ordering of Feint, is distinctly observable in the parent compound Fe1+yTe. In this scenario, the Feint atoms interact with adjacent Fe atoms, forming iron polycomplex and leading to an evident distortion of the FeTe4 tetrahedral. Experimental results further demonstrate effective suppression of Feint concentration and ordering through appropriate Se substitution; notably, Fe1+yTe0.5Se0.5 manifests the lowest concentration of Feint atoms. Our findings additionally indicate that Se substitution is random, and nanoscale phase separation induced by Te/Se chemical heterogeneity is commonly observed within Fe1+yTe1-xSex crystals., Comment: 14 pages, 5 figures

We introduce FinDVer, a comprehensive benchmark specifically designed to evaluate the explainable claim verification capabilities of LLMs in the context of understanding and analyzing long, hybrid-content financial documents. FinDVer contains 2,400 expert-annotated examples, divided into three subsets: information extraction, numerical reasoning, and knowledge-intensive reasoning, each addressing common scenarios encountered in real-world financial contexts. We assess a broad spectrum of LLMs under long-context and RAG settings. Our results show that even the current best-performing system, GPT-4o, still lags behind human experts. We further provide in-depth analysis on long-context and RAG setting, Chain-of-Thought reasoning, and model reasoning errors, offering insights to drive future advancements. We believe that FinDVer can serve as a valuable benchmark for evaluating LLMs in claim verification over complex, expert-domain documents., Comment: EMNLP 2024

The dissociation of quarkonium states with different binding energies produced in heavy-ion collisions is a powerful probe for investigating the formation and properties of the quark-gluon plasma. The ratio of production cross-sections of $\psi(2S)$ and $J/\psi$ mesons times the ratio of their branching fractions into the dimuon final state is measured as a function of centrality using data collected by the LHCb detector in PbPb collisions at $\sqrt{s_{\text{NN}}}$ = 5.02 TeV. The measured ratio shows no dependence on the collision centrality, and is compared to the latest theory predictions and to the recent measurements in literature., Comment: All figures and tables, along with any supplementary material and additional information, are available at https://cern.ch/lhcbproject/Publications/p/LHCb-PAPER-2024-041.html (LHCb public pages)

Large Language Models (LLMs), with gradually improving reading comprehension and reasoning capabilities, are being applied to a range of complex language tasks, including the automatic generation of language data for various purposes. However, research on applying LLMs for automatic data generation in low-resource languages like Vietnamese is still underdeveloped and lacks comprehensive evaluation. In this paper, we explore the use of LLMs for automatic data generation for the Vietnamese fact-checking task, which faces significant data limitations. Specifically, we focus on fact-checking data where claims are synthesized from multiple evidence sentences to assess the information synthesis capabilities of LLMs. We develop an automatic data construction process using simple prompt techniques on LLMs and explore several methods to improve the quality of the generated data. To evaluate the quality of the data generated by LLMs, we conduct both manual quality assessments and performance evaluations using language models. Experimental results and manual evaluations illustrate that while the quality of the generated data has significantly improved through fine-tuning techniques, LLMs still cannot match the data quality produced by humans.

The configuration interaction relativistic Hartree-Fock (CI-RHF) model is developed in this work. Compared to the conventional configuration interaction shell model calculations, the CI-RHF model can be applied to study the structural properties of a wide range of nuclei without readjusting any parameters, because the effective Hamiltonian for different model space can be deduced consistently from a universal density-dependent Lagrangian based on the Hartree-Fock single-particle basis. The convergence of intermediate-state excitations has been examined in evaluating the effective interactions, and the core-polarization effects are illustrated, by using $^{18}$O as an example. Employing the CI-RHF model, both the bulk properties and low-lying spectra of neon isotopes in the $sd$ shell have been well reproduced without introducing additional parameters besides those well-defined in the phenomenological Lagrangian. Moreover, the study of the isotopic evolution of charge radii and low-lying spectra highlights the shell closure at $N=14$ for neon isotopes., Comment: 5 figures

The ubiquitous noise in quantum system hinders the advancement of quantum information processing and has driven the emergence of different hardware-efficient quantum error correction protocols. Among them, qubits with structured noise, especially with biased noise, are one of the most promising platform to achieve fault-tolerance due to the high error thresholds of quantum error correction codes tailored for them. Nevertheless, their quantum operations are challenging and the demonstration of their performance beyond the fault-tolerant threshold remain incomplete. Here, we leverage Schr\"odinger cat states in a scalable planar superconducting nonlinear oscillator to thoroughly characterize the high-fidelity single-qubit quantum operations with systematic quantum tomography and benchmarking tools, demonstrating the state-of-the-art performance of operations crossing the fault-tolerant threshold of the XZZX surface code. These results thus embody a transformative milestone in the exploration of quantum systems with structured error channels. Notably, our framework is extensible to other types of structured-noise systems, paving the way for systematic characterization and validation of novel quantum platforms with structured noise., Comment: 19 pages, 12 figures

Axion-like particles may form a network of cosmic strings in the Universe today that can rotate the plane of polarization of cosmic microwave background (CMB) photons. Future CMB observations with improved sensitivity might detect this axion-string-induced birefringence effect, thereby revealing an as-yet unseen constituent of the Universe and offering a new probe of particles and forces that are beyond the Standard Model of Elementary Particle Physics. In this work, we explore how spherical convolutional neural networks (SCNNs) may be used to extract information about the axion string network from simulated birefringence maps. We construct a pipeline to simulate the anisotropic birefringence that would arise from an axion string network, and we train SCNNs to estimate three parameters related to the cosmic string length, the cosmic string abundance, and the axion-photon coupling. Our results demonstrate that neural networks are able to extract information from a birefringence map that is inaccessible with two-point statistics alone (i.e., the angular power spectrum). We also assess the impact of noise on the accuracy of our SCNN estimators, demonstrating that noise at the level anticipated for Stage IV (CMB-S4) measurements would significantly bias parameter estimation for SCNNs trained on noiseless simulated data, and necessitate modeling the noise in the training data., Comment: 23 pages, 7 figures, 4 tables

Empirical evidence suggests that LLMs exhibit spontaneous cross-lingual alignment. Our findings suggest that although LLMs also demonstrate promising cross-lingual alignment in Information Extraction, there remains significant imbalance across languages, revealing an underlying deficiency in the IE alignment. To address this issue, we propose AlignXIE, a powerful code-based LLM that significantly enhances cross-lingual IE alignment through two strategies. Firstly, AlignXIE formulates IE across different languages, especially non-English ones, as code generation tasks, standardizing the representation of various schemas using Python classes to ensure consistency of the same ontology in different languages and align the schema. Secondly, it incorporates an IE cross-lingual alignment phase through a translated instance prediction task proposed in this paper to align the extraction process, utilizing ParallelNER, an IE bilingual parallel dataset with 257,190 samples, generated by our proposed LLM-based automatic pipeline for IE parallel data construction, with manual annotation to ensure quality. Ultimately, we obtain AlignXIE through multilingual IE instruction tuning. Although without training in 9 unseen languages, AlignXIE surpasses ChatGPT by $30.17\%$ and SoTA by $20.03\%$, thereby demonstrating superior cross-lingual IE capabilities. Comprehensive evaluations on 63 IE benchmarks in Chinese and English under various settings, demonstrate that AlignXIE significantly enhances cross-lingual and multilingual IE through boosting the IE alignment., Comment: Work in progress

This document summarizes the discussions which took place during the PITT-PACC Workshop entitled "Non-Standard Cosmological Epochs and Expansion Histories," held in Pittsburgh, Pennsylvania, Sept. 5-7, 2024. Much like the non-standard cosmological epochs that were the subject of these discussions, the format of this workshop was also non-standard. Rather than consisting of a series of talks from participants, with each person presenting their own work, this workshop was instead organized around free-form discussion blocks, with each centered on a different overall theme and guided by a different set of Discussion Leaders. This document is not intended to serve as a comprehensive review of these topics, but rather as an informal record of the discussions that took place during the workshop, in the hope that the content and free-flowing spirit of these discussions may inspire new ideas and research directions., Comment: 33 pages, LaTeX, 2 figures

In the era of the sixth generation (6G) and industrial Internet of Things (IIoT), an industrial cyber-physical system (ICPS) drives the proliferation of sensor devices and computing-intensive tasks. To address the limited resources of IIoT sensor devices, unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) has emerged as a promising solution, providing flexible and cost-effective services in close proximity of IIoT sensor devices (ISDs). However, leveraging aerial MEC to meet the delay-sensitive and computation-intensive requirements of the ISDs could face several challenges, including the limited communication, computation and caching (3C) resources, stringent offloading requirements for 3C services, and constrained on-board energy of UAVs. To address these issues, we first present a collaborative aerial MEC-assisted ICPS architecture by incorporating the computing capabilities of the macro base station (MBS) and UAVs. We then formulate a service delay minimization optimization problem (SDMOP). Since the SDMOP is proved to be an NP-hard problem, we propose a joint computation offloading, caching, communication resource allocation, computation resource allocation, and UAV trajectory control approach (JC5A). Specifically, JC5A consists of a block successive upper bound minimization method of multipliers (BSUMM) for computation offloading and service caching, a convex optimization-based method for communication and computation resource allocation, and a successive convex approximation (SCA)-based method for UAV trajectory control. Moreover, we theoretically prove the convergence and polynomial complexity of JC5A. Simulation results demonstrate that the proposed approach can achieve superior system performance compared to the benchmark approaches and algorithms.

Determining the difficulty of a text involves assessing various textual features that may impact the reader's text comprehension, yet current research in Vietnamese has only focused on statistical features. This paper introduces a new approach that integrates statistical and semantic approaches to assessing text readability. Our research utilized three distinct datasets: the Vietnamese Text Readability Dataset (ViRead), OneStopEnglish, and RACE, with the latter two translated into Vietnamese. Advanced semantic analysis methods were employed for the semantic aspect using state-of-the-art language models such as PhoBERT, ViDeBERTa, and ViBERT. In addition, statistical methods were incorporated to extract syntactic and lexical features of the text. We conducted experiments using various machine learning models, including Support Vector Machine (SVM), Random Forest, and Extra Trees and evaluated their performance using accuracy and F1 score metrics. Our results indicate that a joint approach that combines semantic and statistical features significantly enhances the accuracy of readability classification compared to using each method in isolation. The current study emphasizes the importance of considering both statistical and semantic aspects for a more accurate assessment of text difficulty in Vietnamese. This contribution to the field provides insights into the adaptability of advanced language models in the context of Vietnamese text readability. It lays the groundwork for future research in this area.

Attaining superconducting critical temperatures (Tc) beyond the limit around 14 K observed thus far in spinel compounds AB2X4 (A, B = transition metals, X = O/chalcogen) could elucidate interaction intricacies and inform materials design. This work spotlights CuIr2S4, which exhibits a distinct metal-insulator transition below 230 K, as an unconventional candidate for activation under high pressure. Through transport, diffraction, and spectroscopy experiments conducted at pressures up to 224 GPa, we unveil pressure-tuning that suppressed CuIr2S4's transition, yielding two superconducting phases with an un-precedented Tc for spinels. Initially, 3.8 K onset rose monotonically, reaching 18.2 K at 133 GPa. Unexpectedly, a distinct phase with Tc = 2.2 K distinctly emerged at higher pressures, intimating unconventional couplings. Our findings suggest that both geometric frustration and electron-electron interactions play crucial roles in the superconductivity observed in CuIr2S4. The findings stretch perceived temperature limits in spinels and provide structure-property insights to guide the optimiza-tion of quantum materials interactions for tailored targeted functionalities., Comment: 12 pages, 7 gifures

This paper concerns the numerical approximation for the invariant distribution of Markovian switching L\'evy-driven stochastic differential equations. By combining the tamed-adaptive Euler-Maruyama scheme with the Multi-level Monte Carlo method, we propose an approximation scheme that can be applied to stochastic differential equations with super-linear growth drift and diffusion coefficients.

In this paper, we describe the wall-crossing of the two parameter K-moduli space of pairs (P 2,aQ + bL), where Q is a plane quintic curve and L is a line., Comment: 29 Pages, comments are very welcome!

Traditional CNC technology mostly uses the method of increasing the degree of interpolation polynomial when constructing $C^2$ continuous NURBS curves, but this often leads to the appearance of Runge phenomenon in interpolation curves. Alternatively,the method of adding boundary conditions at the endpoints can often make it difficult to control the error range of the interpolation curve. This article presents a $C^2$ continuous cubic B-spline curve interpolation method,which achieves $C^2$ continuity of the interpolation curve when the interpolation polynomial is cubic. At the same time, this article also studies the corresponding error control methods., Comment: in Chinese language

As a well-known open cluster, NGC 2323 (also called M50) has been widely investigated for over a hundred years and has always been considered a classical single cluster. In this work, with the help of Gaia DR3, we study the binary structure nature of this cluster. Although indistinguishable in the spatial space, the small but undeniable difference in the proper motion indicates that they may be two individual clusters. After investigating the properties of the two clusters, it is found that they have very close positions (three-dimensional $\Delta$pos = 12.3 pc, $\sigma_{\Delta \mathrm{pos}} = 3.4$ pc) and similar tangential velocities (two-dimensional $\Delta$V = 2.2 km s$^{-1}$, $\sigma_{\Delta \mathrm{V}} = 0.02$ km s$^{-1}$), indicating the existence of their physical association. Moreover, the best isochrone fitting ages of the two clusters are the same (158 Myr), further proving their possibly common origin. To comprehensively understand the formation and evolution of this binary cluster, we employ the PETAR $N$-body code to trace back their birthplace and deduce their dynamical evolutionary fate. With observational mean cluster properties, the simulations suggest that they may form together, and then orbit each other as a binary cluster for over 200 Myr. After that, because of their gradual mass loss, the two clusters will eventually separate and evolve into two independent clusters. Meanwhile, the numerical $N$-body simulation suggests that the less massive cluster is unlikely to be the cluster tidal tails created by the differential rotation of the Milky Way., Comment: 14 pages, 8 figures

Recently, multi-view learning has witnessed a considerable interest on the research of trusted decision-making. Previous methods are mainly inspired from an important paper published by Han et al. in 2021, which formulates a Trusted Multi-view Classification (TMC) framework that aggregates evidence from different views based on Dempster's combination rule. All these methods only consider inter-view aggregation, yet lacking exploitation of intra-view information. In this paper, we propose a generalized trusted multi-view classification framework with hierarchical opinion aggregation. This hierarchical framework includes a two-phase aggregation process: the intra-view and inter-view aggregation hierarchies. In the intra aggregation, we assume that each view is comprised of common information shared with other views, as well as its specific information. We then aggregate both the common and specific information. This aggregation phase is useful to eliminate the feature noise inherent to view itself, thereby improving the view quality. In the inter-view aggregation, we design an attention mechanism at the evidence level to facilitate opinion aggregation from different views. To the best of our knowledge, this is one of the pioneering efforts to formulate a hierarchical aggregation framework in the trusted multi-view learning domain. Extensive experiments show that our model outperforms some state-of-art trust-related baselines.

An amplitude analysis of the $D_{s1}(2460)^+\to D_{s}^{+}\pi^{+}\pi^{-}$ transition is performed simultaneously in $B^{0}\to D^{-}D_{s}^{+}\pi^{+}\pi^{-}$, $B^{+}\to{\bar{D}}^{0} D_{s}^{+}\pi^{+}\pi^{-}$, and $B^{0}\to D^{*-}D_{s}^{+}\pi^{+}\pi^{-}$ decays. The study is based on a data sample of proton-proton collisions recorded with the LHCb detector at centre-of-mass energies of $\sqrt{s}=7,8,$ and $13\,$TeV, corresponding to a total integrated luminosity of $9\,\rm{fb}^{-1}$. A clear double-peak structure is observed in the $m(\pi^{+}\pi^{-})$ spectrum of the $D_{s1}(2460)^{+}\to D_{s}^{+}\pi^{+}\pi^{-}$ decay. The data can be described either with a model including $f_0(500)$, $f_0(980)$ and $f_2(1270)$ resonances, in which the contributions of $f_0(980)$ and $f_2(1270)$ are unexpectedly large, or with a model including $f_0(500)$, a doubly charged open-charm tetraquark state $T_{c\bar{s}}^{++}$ and its isospin partner $T_{c\bar{s}}^{0}$. If the former is considered implausible, the $T_{c\bar{s}}$ states are observed with high significance, and the data are consistent with isospin symmetry. When imposing isospin constraints between the two $T_{c\bar{s}}$ states, their mass and width are determined to be $2327\pm13\pm13\,$MeV and $96\pm16\,^{+170}_{-23}\,$MeV, respectively, where the first uncertainty is statistical and the second is systematic. The mass is slightly below the $DK$ threshold, and a spin-parity of $0^+$ is favoured with high significance., Comment: All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3280/ (LHCb public pages)

We study episodic linear mixture MDPs with the unknown transition and adversarial rewards under full-information feedback, employing dynamic regret as the performance measure. We start with in-depth analyses of the strengths and limitations of the two most popular methods: occupancy-measure-based and policy-based methods. We observe that while the occupancy-measure-based method is effective in addressing non-stationary environments, it encounters difficulties with the unknown transition. In contrast, the policy-based method can deal with the unknown transition effectively but faces challenges in handling non-stationary environments. Building on this, we propose a novel algorithm that combines the benefits of both methods. Specifically, it employs (i) an occupancy-measure-based global optimization with a two-layer structure to handle non-stationary environments; and (ii) a policy-based variance-aware value-targeted regression to tackle the unknown transition. We bridge these two parts by a novel conversion. Our algorithm enjoys an $\widetilde{\mathcal{O}}(d \sqrt{H^3 K} + \sqrt{HK(H + \bar{P}_K)})$ dynamic regret, where $d$ is the feature dimension, $H$ is the episode length, $K$ is the number of episodes, $\bar{P}_K$ is the non-stationarity measure. We show it is minimax optimal up to logarithmic factors by establishing a matching lower bound. To the best of our knowledge, this is the first work that achieves near-optimal dynamic regret for adversarial linear mixture MDPs with the unknown transition without prior knowledge of the non-stationarity measure., Comment: NeurIPS 2024

We consider the linear response of a near-equilibrium charged relativistic gas in the presence of electromagnetic and gravitational field in a generic stationary spacetime up to the second order of relaxation time and calculate the tensorial kinetic coefficients introduced by the presence of the strong electromagnetic and/or gravitational field. Using the covariant transfer equations thus developed, a covariant heat equation governing the relativistic heat conduction is derived, which, in Minkowski spacetime, reduces into a form which is remarkably similar to the well-known Cattaneo equation but with a different sign in front of the second-order time derivative term. We also perform a comparative analysis on the different behaviors of our heat equation and the Cattaneo equation in Minkowski spacetime. Furthermore, the effect of gravity on the heat conduction predicted by our heat equation is illustrated around Schwarzschild black hole, which makes a sharp contrast to the Minkowski case., Comment: 25 pages, 2 fifures

Human-scene vision-language tasks are increasingly prevalent in diverse social applications, yet recent advancements predominantly rely on models specifically tailored to individual tasks. Emerging research indicates that large vision-language models (VLMs) can enhance performance across various downstream vision-language understanding tasks. However, general-domain models often underperform in specialized fields. This study introduces a domain-specific Large Vision-Language Model, Human-Scene Vision-Language Model (HumanVLM), designed to provide a foundation for human-scene Vision-Language tasks. Specifically, (1) we create a large-scale human-scene multimodal image-text dataset (HumanCaption-10M) sourced from the Internet to facilitate domain-specific alignment; (2) develop a captioning approach for human-centered images, capturing human faces, bodies, and backgrounds, and construct a high-quality Human-Scene image-text dataset (HumanCaptionHQ, about 311k pairs) that contain as much detailed information as possible about human; (3) Using HumanCaption-10M and HumanCaptionHQ, we train a HumanVLM. In the experiments, we then evaluate our HumanVLM across varous downstream tasks, where it demonstrates superior overall performance among multimodal models of comparable scale, particularly excelling in human-related tasks and significantly outperforming similar models, including Qwen2VL and ChatGPT-4o. HumanVLM, alongside the data introduced, will stimulate the research in human-around fields., Comment: 34 pages,11 figures

This document is comprised of a collection of updated preliminary parameters for the key parts of the muon collider. The updated preliminary parameters follow on from the October 2023 Tentative Parameters Report. Particular attention has been given to regions of the facility that are believed to hold greater technical uncertainty in their design and that have a strong impact on the cost and power consumption of the facility. The data is collected from a collaborative spreadsheet and transferred to overleaf.

Photoacoustic imaging (PAI) represents an innovative biomedical imaging modality that harnesses the advantages of optical resolution and acoustic penetration depth while ensuring enhanced safety. Despite its promising potential across a diverse array of preclinical and clinical applications, the clinical implementation of PAI faces significant challenges, including the trade-off between penetration depth and spatial resolution, as well as the demand for faster imaging speeds. This paper explores the fundamental principles underlying PAI, with a particular emphasis on three primary implementations: photoacoustic computed tomography (PACT), photoacoustic microscopy (PAM), and photoacoustic endoscopy (PAE). We undertake a critical assessment of their respective strengths and practical limitations. Furthermore, recent developments in utilizing conventional or deep learning (DL) methodologies for image reconstruction and artefact mitigation across PACT, PAM, and PAE are outlined, demonstrating considerable potential to enhance image quality and accelerate imaging processes. Furthermore, this paper examines the recent developments in quantitative analysis within PAI, including the quantification of haemoglobin concentration, oxygen saturation, and other physiological parameters within tissues. Finally, our discussion encompasses current trends and future directions in PAI research while emphasizing the transformative impact of deep learning on advancing PAI.

Implementing and tuning chirality is fundamental in physics, chemistry, and material science. Chiral charge density waves (CDWs), where chirality arises from correlated charge orders, are attracting intense interest due to their exotic transport and optical properties. However, a general framework for predicting chiral CDW materials is lacking, primarily because the underlying mechanisms remain elusive. Here, we address this challenge by developing the first comprehensive predictive framework, systematically identifying chiral CDW materials via first-principles calculations. The key lies in the previously overlooked phase difference of the CDW Q-vectors between layers, which is linked to opposite collective atomic displacements across different layers. This phase difference induces a spiral arrangement of the Q-vectors, ultimately giving rise to a chiral structure in real space. We validate our framework by applying it to the kagome lattice AV$_{3}$Sb$_{5}$ (A = K, Rb, Cs), successfully predicting emergent structural chirality. To demonstrate the generality of our approach, we extend it to predict chiral CDWs in the triangular-lattice NbSe$_{2}$. Beyond material predictions, our theory uncovers a universal and unprecedented Hall effect in chiral CDW materials, occurring without external magnetic fields or intrinsic magnetization. Our experiments on CsV$_{3}$Sb$_{5}$ confirm this prediction, observing a unique signature where the Hall conductivity's sign reverses when the input current is reversed, a phenomenon distinct from known Hall effects. Our findings elucidate the mechanisms behind chiral CDWs and open new avenues for discovering materials with unconventional quantum properties, with potential applications in next-generation electronic and spintronic devices.

Large language models (LLMs) have shown remarkable potential as autonomous agents, particularly in web-based tasks. However, existing LLM web agents heavily rely on expensive proprietary LLM APIs, while open LLMs lack the necessary decision-making capabilities. This paper introduces WebRL, a self-evolving online curriculum reinforcement learning framework designed to train high-performance web agents using open LLMs. WebRL addresses three key challenges in building LLM web agents, including the scarcity of training tasks, sparse feedback signals, and policy distribution drift in online learning. Specifically, WebRL incorporates 1) a self-evolving curriculum that generates new tasks from unsuccessful attempts, 2) a robust outcome-supervised reward model (ORM), and 3) adaptive reinforcement learning strategies to ensure consistent improvements. We apply WebRL to transform open Llama-3.1 and GLM-4 models into proficient web agents. On WebArena-Lite, WebRL improves the success rate of Llama-3.1-8B from 4.8% to 42.4%, and from 6.1% to 43% for GLM-4-9B. These open models significantly surpass the performance of GPT-4-Turbo (17.6%) and GPT-4o (13.9%) and outperform previous state-of-the-art web agents trained on open LLMs (AutoWebGLM, 18.2%). Our findings demonstrate WebRL's effectiveness in bridging the gap between open and proprietary LLM-based web agents, paving the way for more accessible and powerful autonomous web interaction systems.

When learning an input-output mapping from very few examples, is it better to first infer a latent function that explains the examples, or is it better to directly predict new test outputs, e.g. using a neural network? We study this question on ARC, a highly diverse dataset of abstract reasoning tasks. We train neural models for induction (inferring latent functions) and transduction (directly predicting the test output for a given test input). Our models are trained on synthetic data generated by prompting LLMs to produce Python code specifying a function to be inferred, plus a stochastic subroutine for generating inputs to that function. We find inductive and transductive models solve very different problems, despite training on the same problems, and despite sharing the same neural architecture.

The emergence of models like GPTs, Claude, LLaMA, and Qwen has reshaped AI applications, presenting vast new opportunities across industries. Yet, the integration of tabular data remains notably underdeveloped, despite its foundational role in numerous real-world domains. This gap is critical for three main reasons. First, database or data warehouse data integration is essential for advanced applications; second, the vast and largely untapped resource of tabular data offers immense potential for analysis; and third, the business intelligence domain specifically demands adaptable, precise solutions that many current LLMs may struggle to provide. In response, we introduce TableGPT2, a model rigorously pre-trained and fine-tuned with over 593.8K tables and 2.36M high-quality query-table-output tuples, a scale of table-related data unprecedented in prior research. This extensive training enables TableGPT2 to excel in table-centric tasks while maintaining strong general language and coding abilities. One of TableGPT2's key innovations is its novel table encoder, specifically designed to capture schema-level and cell-level information. This encoder strengthens the model's ability to handle ambiguous queries, missing column names, and irregular tables commonly encountered in real-world applications. Similar to visual language models, this pioneering approach integrates with the decoder to form a robust large multimodal model. We believe the results are compelling: over 23 benchmarking metrics, TableGPT2 achieves an average performance improvement of 35.20% in the 7B model and 49.32% in the 72B model over prior benchmark-neutral LLMs, with robust general-purpose capabilities intact.

In this report, we argue that there is a realistic possibility that some AI systems will be conscious and/or robustly agentic in the near future. That means that the prospect of AI welfare and moral patienthood, i.e. of AI systems with their own interests and moral significance, is no longer an issue only for sci-fi or the distant future. It is an issue for the near future, and AI companies and other actors have a responsibility to start taking it seriously. We also recommend three early steps that AI companies and other actors can take: They can (1) acknowledge that AI welfare is an important and difficult issue (and ensure that language model outputs do the same), (2) start assessing AI systems for evidence of consciousness and robust agency, and (3) prepare policies and procedures for treating AI systems with an appropriate level of moral concern. To be clear, our argument in this report is not that AI systems definitely are, or will be, conscious, robustly agentic, or otherwise morally significant. Instead, our argument is that there is substantial uncertainty about these possibilities, and so we need to improve our understanding of AI welfare and our ability to make wise decisions about this issue. Otherwise there is a significant risk that we will mishandle decisions about AI welfare, mistakenly harming AI systems that matter morally and/or mistakenly caring for AI systems that do not.

Model editing aims to data-efficiently correct predictive errors of large pre-trained models while ensuring generalization to neighboring failures and locality to minimize unintended effects on unrelated examples. While significant progress has been made in editing Transformer-based large language models, effective strategies for editing vision Transformers (ViTs) in computer vision remain largely untapped. In this paper, we take initial steps towards correcting predictive errors of ViTs, particularly those arising from subpopulation shifts. Taking a locate-then-edit approach, we first address the where-to-edit challenge by meta-learning a hypernetwork on CutMix-augmented data generated for editing reliability. This trained hypernetwork produces generalizable binary masks that identify a sparse subset of structured model parameters, responsive to real-world failure samples. Afterward, we solve the how-to-edit problem by simply fine-tuning the identified parameters using a variant of gradient descent to achieve successful edits. To validate our method, we construct an editing benchmark that introduces subpopulation shifts towards natural underrepresented images and AI-generated images, thereby revealing the limitations of pre-trained ViTs for object recognition. Our approach not only achieves superior performance on the proposed benchmark but also allows for adjustable trade-offs between generalization and locality. Our code is available at https://github.com/hustyyq/Where-to-Edit.

In this paper we construct high order numerical methods for solving third and fourth orders nonlinear functional differential equations (FDE). They are based on the discretization of iterative methods on continuous level with the use of the trapezoidal quadrature formulas with corrections. Depending on the number of terms in the corrections we obtain methods of $O(h^4)$ and $O(h^6)$ accuracy. Some numerical experiments demonstrate the validity of the obtained theoretical results. The approach used here for the third and fourth orders nonlinear functional differential equations can be applied to functional differential equations of any orders., Comment: 25 pages

We propose a tamed-adaptive Milstein scheme for stochastic differential equations in which the first-order derivatives of the coefficients are locally H\"older continuous of order $\alpha$. We show that the scheme converges in the $L_2$-norm with a rate of $(1+\alpha)/2$ over both finite intervals $[0, T]$ and the infinite interval $(0, +\infty)$, under certain growth conditions on the coefficients.

Most methods in explainable AI (XAI) focus on providing reasons for the prediction of a given set of features. However, we solve an inverse explanation problem, i.e., given the deviation of a label, find the reasons of this deviation. We use a Bayesian framework to recover the ``true'' features, conditioned on the observed label value. We efficiently explain the deviation of a label value from the mode, by identifying and ranking the influential features using the ``distances'' in the ANOVA functional decomposition. We show that the new method is more human-intuitive and robust than methods based on mean values, e.g., SHapley Additive exPlanations (SHAP values). The extra costs of solving a Bayesian inverse problem are dimension-independent.

Deploying Convolutional Neural Networks (CNNs) on resource-constrained devices necessitates efficient management of computational resources, often via distributed systems susceptible to latency from straggler nodes. This paper introduces the Flexible Coded Distributed Convolution Computing (FCDCC) framework to enhance fault tolerance and numerical stability in distributed CNNs. We extend Coded Distributed Computing (CDC) with Circulant and Rotation Matrix Embedding (CRME) which was originally proposed for matrix multiplication to high-dimensional tensor convolution. For the proposed scheme, referred to as Numerically Stable Coded Tensor Convolution (NSCTC) scheme, we also propose two new coded partitioning schemes: Adaptive-Padding Coded Partitioning (APCP) for input tensor and Kernel-Channel Coded Partitioning (KCCP) for filter tensor. These strategies enable linear decomposition of tensor convolutions and encoding them into CDC sub-tasks, combining model parallelism with coded redundancy for robust and efficient execution. Theoretical analysis identifies an optimal trade-off between communication and storage costs. Empirical results validate the framework's effectiveness in computational efficiency, fault tolerance, and scalability across various CNN architectures., Comment: 14 pages, 6 figures

A plethora of text-guided image editing methods has recently been developed by leveraging the impressive capabilities of large-scale diffusion-based generative models especially Stable Diffusion. Despite the success of diffusion models in producing high-quality images, their application to small object generation has been limited due to difficulties in aligning cross-modal attention maps between text and these objects. Our approach offers a training-free method that significantly mitigates this alignment issue with local and global attention guidance , enhancing the model's ability to accurately render small objects in accordance with textual descriptions. We detail the methodology in our approach, emphasizing its divergence from traditional generation techniques and highlighting its advantages. What's more important is that we also provide~\textit{SOEBench} (Small Object Editing), a standardized benchmark for quantitatively evaluating text-based small object generation collected from \textit{MSCOCO} and \textit{OpenImage}. Preliminary results demonstrate the effectiveness of our method, showing marked improvements in the fidelity and accuracy of small object generation compared to existing models. This advancement not only contributes to the field of AI and computer vision but also opens up new possibilities for applications in various industries where precise image generation is critical. We will release our dataset on our project page: \href{https://soebench.github.io/}{https://soebench.github.io/}., Comment: 9 pages, 8 figures, Accepted by ACMMM 2024

Sequential recommendation (SR) systems excel at capturing users' dynamic preferences by leveraging their interaction histories. Most existing SR systems assign a single embedding vector to each item to represent its features, and various types of models are adopted to combine these item embeddings into a sequence representation vector to capture the user intent. However, we argue that this representation alone is insufficient to capture an item's multi-faceted nature (e.g., movie genres, starring actors). Besides, users often exhibit complex and varied preferences within these facets (e.g., liking both action and musical films in the facet of genre), which are challenging to fully represent. To address the issues above, we propose a novel structure called Facet-Aware Multi-Head Mixture-of-Experts Model for Sequential Recommendation (FAME). We leverage sub-embeddings from each head in the last multi-head attention layer to predict the next item separately. This approach captures the potential multi-faceted nature of items without increasing model complexity. A gating mechanism integrates recommendations from each head and dynamically determines their importance. Furthermore, we introduce a Mixture-of-Experts (MoE) network in each attention head to disentangle various user preferences within each facet. Each expert within the MoE focuses on a specific preference. A learnable router network is adopted to compute the importance weight for each expert and aggregate them. We conduct extensive experiments on four public sequential recommendation datasets and the results demonstrate the effectiveness of our method over existing baseline models., Comment: This paper has been accepted by WSDM'25. The final camera-ready version will be available soon

In Federated Learning (FL), training is conducted on client devices, typically with limited computational resources and storage capacity. To address these constraints, we propose an automatic pruning scheme tailored for FL systems. Our solution improves computation efficiency on client devices, while minimizing communication costs. One of the challenges of tuning pruning hyper-parameters in FL systems is the restricted access to local data. Thus, we introduce an automatic pruning paradigm that dynamically determines pruning boundaries. Additionally, we utilized a structured pruning algorithm optimized for mobile devices that lack hardware support for sparse computations. Experimental results demonstrate the effectiveness of our approach, achieving accuracy comparable to existing methods. Our method notably reduces the number of parameters by 89% and FLOPS by 90%, with minimal impact on the accuracy of the FEMNIST and CelebFaces datasets. Furthermore, our pruning method decreases communication overhead by up to 5x and halves inference time when deployed on Android devices.

Current Face Anti-spoofing (FAS) models tend to make overly confident predictions even when encountering unfamiliar scenarios or unknown presentation attacks, which leads to serious potential risks. To solve this problem, we propose a Confidence Aware Face Anti-spoofing (CA-FAS) model, which is aware of its capability boundary, thus achieving reliable liveness detection within this boundary. To enable the CA-FAS to "know what it doesn't know", we propose to estimate its confidence during the prediction of each sample. Specifically, we build Gaussian distributions for both the live faces and the known attacks. The prediction confidence for each sample is subsequently assessed using the Mahalanobis distance between the sample and the Gaussians for the "known data". We further introduce the Mahalanobis distance-based triplet mining to optimize the parameters of both the model and the constructed Gaussians as a whole. Extensive experiments show that the proposed CA-FAS can effectively recognize samples with low prediction confidence and thus achieve much more reliable performance than other FAS models by filtering out samples that are beyond its reliable range., Comment: v1

At least 25 kinds of detector-like devices need to be integrated in Phase I of the High Energy Photon Source (HEPS), and the work needs to be carefully planned to maximise productivity with highly limited human resources. After a systematic analysis on the actual work involved in detector integration, a separation of concerns between collaborating groups of personnel is established to minimise the duplication of efforts. To facilitate software development for detector integration, the ADGenICam library, which abstracts repeated code in EPICS modules for cameras, is extended to support a much wider range of detectors. An increasingly considerable fraction of detectors, both inside and outside HEPS, offer performance that exceed capabilities of the areaDetector framework in EPICS. Given this background, areaDetector's limitations in performance and architecture are analysed, and a QueueIOC -based framework that overcomes these limitations is introduced. A simple, flexible ZeroMQ-based protocol is used for data transport in this framework, while RDMA transport and multi-node readout will be explored for higher data throughputs. By calling C/C++ libraries from within Python, the performance of the former and the expressiveness of the latter can coexist nicely; the expressiveness allows for much higher efficiency in the implementation and use of integration modules functionally comparable to their EPICS counterparts., Comment: 11 pages, 3 figures

The Water Cherenkov Detector Array (WCDA) is one of the components of Large High Altitude Air Shower Observatory (LHAASO) and can monitor any sources over two-thirds of the sky for up to 7 hours per day with >98\% duty cycle. In this work, we report the detection of two outbursts of the Fanaroff-Riley I radio galaxy NGC 1275 that were detected by LHAASO-WCDA between November 2022 and January 2023 with statistical significance of 5.2~$\sigma$ and 8.3~$\sigma$. The observed spectral energy distribution in the range from 500 GeV to 3 TeV is fitted by a power-law with a best-fit spectral index of $\alpha=-3.37\pm0.52$ and $-3.35\pm0.29$, respectively. The outburst flux above 0.5~TeV was ($4.55\pm 4.21)\times~10^{-11}~\rm cm^{-2}~s^{-1}$ and ($3.45\pm 1.78)\times~10^{-11}~\rm cm^{-2}~s^{-1}$, corresponding to 60\%, 45\% of Crab Nebula flux. Variation analysis reveals the variability time-scale of days at the TeV energy band. A simple test by one-zone synchrotron self-Compton model reproduces the data in the gamma-ray band well., Comment: 11 pages, 8 figures, 3 tables

Quantum batteries (QBs) exploit principles of quantum mechanics to accelerate the charging process and aim to achieve optimal energy storage. However, analytical results for investigating these problems remain lacking due to the challenges associated with nonequilibrium dynamics. In this work, we analytically investigate a central-spin QB model in which $N_b$ spin-1/2 battery cells interact with $N_c$ spin-1/2 charger units, using $m$ initially excited charger units as a resource. By employing the invariant subspace method and the shifted Holstein-Primakoff (HP) transformation, we identify four scenarios in which optimal energy storage can be achieved: 1) $N_b\!\ll\!m\!\ll\!N_c$; 2) $m\!\ll\!N_b\!\ll\!N_c$; 3) $m\!\ll\!N_c\!\ll\!N_b$; and 4) $N_b\!\ll\!m\!=\!kN_c$ [$k\!\in\!(0,1)$]. In these cases, optimal storage is ensured by the SU(2) symmetry emerging from the charging dynamics. The first three cases map the central-spin QB to different Tavis-Cummings (TC) QBs, while the fourth corresponds to the non-TC limit. We analytically determine the charging time and demonstrate that in the fully charging cases (1) and (4), the collective charging exhibits an $N_b$-fold enhancement in speedup compared to the parallel charging scheme. Additionally, we numerically observe a unified charging behavior when $m\!=\!N_c$, showing that asymptotically optimal energy storage is possible when $N_b\!=\!m\!=\!N_c$. In this case, we find a collective charging enhancement scaling as $N_b^{0.8264}$. Our results highlight the crucial role of dynamically emergent SU(2) symmetry in providing an analytical understanding of non-equilibrium charging dynamics in QBs., Comment: 8 pages, 5 figures

Zero-shot coordination problem in multi-agent reinforcement learning (MARL), which requires agents to adapt to unseen agents, has attracted increasing attention. Traditional approaches often rely on the Self-Play (SP) framework to generate a diverse set of policies in a policy pool, which serves to improve the generalization capability of the final agent. However, these frameworks may struggle to capture the full spectrum of potential strategies, especially in real-world scenarios that demand agents balance cooperation with competition. In such settings, agents need strategies that can adapt to varying and often conflicting goals. Drawing inspiration from Social Value Orientation (SVO)-where individuals maintain stable value orientations during interactions with others-we propose a novel framework called \emph{Role Play} (RP). RP employs role embeddings to transform the challenge of policy diversity into a more manageable diversity of roles. It trains a common policy with role embedding observations and employs a role predictor to estimate the joint role embeddings of other agents, helping the learning agent adapt to its assigned role. We theoretically prove that an approximate optimal policy can be achieved by optimizing the expected cumulative reward relative to an approximate role-based policy. Experimental results in both cooperative (Overcooked) and mixed-motive games (Harvest, CleanUp) reveal that RP consistently outperforms strong baselines when interacting with unseen agents, highlighting its robustness and adaptability in complex environments.

End-to-end visual information extraction (VIE) aims at integrating the hierarchical subtasks of VIE, including text spotting, word grouping, and entity labeling, into a unified framework. Dealing with the gaps among the three subtasks plays a pivotal role in designing an effective VIE model. OCR-dependent methods heavily rely on offline OCR engines and inevitably suffer from OCR errors, while OCR-free methods, particularly those employing a black-box model, might produce outputs that lack interpretability or contain hallucinated content. Inspired by CenterNet, DeepSolo, and ESP, we propose HIP, which models entities as HIerarchical Points to better conform to the hierarchical nature of the end-to-end VIE task. Specifically, such hierarchical points can be flexibly encoded and subsequently decoded into desired text transcripts, centers of various regions, and categories of entities. Furthermore, we devise corresponding hierarchical pre-training strategies, categorized as image reconstruction, layout learning, and language enhancement, to reinforce the cross-modality representation of the hierarchical encoders. Quantitative experiments on public benchmarks demonstrate that HIP outperforms previous state-of-the-art methods, while qualitative results show its excellent interpretability.

The rapid development of large language models has brought many new smart applications, especially the excellent multimodal human-computer interaction in GPT-4o has brought impressive experience to users. In this background, researchers have proposed many multimodal LLMs that can achieve speech-to-speech dialogue recently. In this paper, we propose a speech-text multimodal LLM architecture called Freeze-Omni. Our main contribution is the speech input and output modalities can connected to the LLM while keeping the LLM frozen throughout the training process. We designed 3-stage training strategies both for the modeling of speech input and output, enabling Freeze-Omni to obtain speech-to-speech dialogue ability using text-speech paired data (such as ASR and TTS data) and only 60,000 multi-round text Q&A data on 8 GPUs. Moreover, we can effectively ensure that the intelligence of the Freeze-Omni in the speech modality is at the same level compared with that in the text modality of its backbone LLM, while the end-to-end latency of the spoken response achieves a low level. In addition, we also designed a method to achieve duplex dialogue ability through multi-task training, making Freeze-Omni have a more natural style of dialogue ability between the users. Freeze-Omni mainly provides a possibility for researchers to conduct multimodal LLM under the condition of a frozen LLM, avoiding various impacts caused by the catastrophic forgetting of LLM caused by fewer data and training resources., Comment: Project Page: https://freeze-omni.github.io/

The double neutron star PSR J1846-0513 is discovered by the Five-hundred-meter Aperture Spherical radio Telescope (FAST) in Commensal Radio Astronomy FAST Survey. The pulsar is revealed to be harbored in an eccentric orbit with $e=0.208$ and orbital period of 0.613 days. The total mass of the system is constrained to be $2.6287(35)\rm{M}_{\odot}$, with a mass upper limit of $1.3455{\rm~M}_{\odot}$ for the pulsar and a mass lower limit of $1.2845{\rm~M}_{\odot}$ for the companion star. To reproduce its evolution history, we perform a 1D model for the formation of PSR J1846-0513 whose progenitor is assumed to be neutron star - helium (He) star system via MESA code. Since the large eccentricity is widely believed to originate from an asymmetric supernova explosion, we also investigate the dynamical effects of the supernova explosion. Our simulated results show that the progenitor of PSR J1846-0513 could be a binary system consisting of a He star of $3.3-4.0{\rm~M}_\odot$ and a neutron star in a circular orbit with an initial period of $\sim0.5$ days., Comment: 15 pages, 7 figures, Accepted to be published on RAA

We present Multi-expert Prompting, a novel enhancement of ExpertPrompting (Xu et al., 2023), designed to improve the large language model (LLM) generation. Specifically, it guides an LLM to fulfill an input instruction by simulating multiple experts, aggregating their responses, and selecting the best among individual and aggregated responses. This process is performed in a single chain of thoughts through our seven carefully designed subtasks derived from the Nominal Group Technique (Ven and Delbecq, 1974), a well-established decision-making framework. Our evaluations demonstrate that Multi-expert Prompting significantly outperforms ExpertPrompting and comparable baselines in enhancing the truthfulness, factuality, informativeness, and usefulness of responses while reducing toxicity and hurtfulness. It further achieves state-of-the-art truthfulness by outperforming the best baseline by 8.69% with ChatGPT. Multi-expert Prompting is efficient, explainable, and highly adaptable to diverse scenarios, eliminating the need for manual prompt construction., Comment: EMNLP 2024 Main Conference

The identification of large numbers of localised transient EUV brightenings, with small spatial scales, in the quiet-Sun corona has been one of the key early results from Solar Orbiter. However, much is still unknown about these events. Here, we aim to better understand EUV brightenings by investigating their spatial distributions, specifically whether they occur co-spatial with specific line-of-sight magnetic field topologies in the photospheric network. EUV brightenings are detected using an automated algorithm applied to a high-cadence (3 s) dataset sampled over ~30 min on 8 March 2022 by the Extreme Ultraviolet Imager's 17.4 nm EUV High Resolution Imager. Data from the Solar Dynamics Observatory's Helioseismic and Magnetic Imager and Atmospheric Imaging Assembly are used to provide context about the line-of-sight magnetic field and for alignment purposes. We found a total of 5064 EUV brightenings within this dataset that are directly comparable to events reported previously in the literature. These events occurred within around 0.015-0.020 % of pixels for any given frame. We compared eight different thresholds to split the EUV brightenings into four different categories related to the line-of-sight magnetic field. Using our preferred threshold, we found that 627 EUV brightenings (12.4 %) occurred co-spatial with Strong Bipolar configurations and 967 EUV brightenings (19.1 %) occurred in Weak Field regions. Fewer than 10 % of EUV brightenings occurred co-spatial with Unipolar line-of-sight magnetic field no matter what threshold was used. Of the 627 Strong Bipolar EUV Brightenings, 54 were found to occur co-spatial with cancellation whilst 57 occurred co-spatial with emergence. EUV brightenings preferentially occur co-spatial with the strong line-of-sight magnetic field in the photospheric network. They do not, though, predominantly occur co-spatial with (cancelling) bi-poles., Comment: 14 pages, 8 figures, accepted in A&A

Nontrivial spectral properties of non-Hermitian systems can give rise to intriguing effects that lack counterparts in Hermitian systems. For instance, when dynamically varying system parameters along a path enclosing an exceptional point (EP), chiral mode conversion occurs. A recent study [Phys. Rev. Lett. 133, 113802 (2024)] demonstrates the achievability of pure adiabatic state transfer by specifically selecting a trajectory in the system parameter space where the corresponding evolution operator exhibits a real spectrum while winding around an EP. However, the intended adiabatic state transfer becomes fragile when taking into account the effect of the nonadiabatic transition. In this work, we propose a scheme for achieving robust and rapid adiabatic state transfer in time-modulated two-level non-Hermitian systems by appropriately modulating system Hamiltonian and time-evolution trajectory. Numerical simulations confirm that complete adiabatic transfer can always be achieved even under nonadiabatic conditions after one period for different initialized adiabatic states, and the scheme remains insensitive to moderate fluctuations in control parameters. Therefore, this scheme offers alternative approaches for quantum-state engineering in non-Hermitian systems., Comment: 7 pages, 6 figures

Blockchain interoperability protocols enable cross-chain asset transfers or data retrievals between isolated chains, which are considered as the core infrastructure for Web 3.0 applications such as decentralized finance protocols. However, existing protocols either face severe scalability issues due to high on-chain and off-chain costs, or suffer from trust concerns because of centralized designs. In this paper, we propose \texttt{MAP}, a trustless blockchain interoperability protocol that relays cross-chain transactions across heterogeneous chains with high scalability. First, within \texttt{MAP}, we develop a novel \textit{cross-chain relay} technique, which integrates a unified relay chain architecture and on-chain light clients of different source chains, allowing the retrieval and verification of diverse cross-chain transactions. Furthermore, we reduce cross-chain verification costs by incorporating an optimized zk-based light client scheme that adaptively decouples signature verification overheads from inefficient smart contract execution and offloads them to off-chain provers. For experiments, we conducted the first large-scale evaluation on existing interoperability protocols. With \texttt{MAP}, the required number of on-chain light clients is reduced from $O(N^2)$ to $O(N)$, with around 35\% reduction in on-chain costs and 25\% reduction for off-chain costs when verifying cross-chain transactions. To demonstrate the effectiveness, we deployed \texttt{MAP} in the real world. By 2024, we have supported over six popular public chains, 50 cross-chain applications and relayed over 200K cross-chain transactions worth over 640 million USD. Based on rich practical experiences, we constructed the first real-world cross-chain dataset to further advance blockchain interoperability research.