Search

The V-based kagome superconductors $A$V$_3$Sb$_5$ ($A$ = K, Rb, and Cs) host charge density wave (CDW) and a topological nontrivial band structure, thereby provide a great platform to study the interplay of superconductivity (SC), CDW, frustration, and topology. Here, we report ultralow-temperature thermal conductivity measurements on CsV$_3$Sb$_5$ and Ta-doped Cs(V$_{0.86}$Ta$_{0.14}$)$_3$Sb$_5$ and scanning tunneling microscopy (STM) measurements on CsV$_3$Sb$_5$. The finite residual linear term of thermal conductivity at zero magnetic field suggests the existence of a residual density of states (DOS) in the superconducting state of CsV$_3$Sb$_5$. This is supported by the observation of non-zero conductance at zero bias in STM spectrum at an electronic temperature of 90 mK. However, in Cs(V$_{0.86}$Ta$_{0.14}$)$_3$Sb$_5$, which does not have CDW order, there is no evidence for residual DOS. These results show the importance of CDW order for the residual DOS, and a nodal $s$-wave gap or residual Fermi arc may be the origin of the residual DOS in such an unusual multiband kagome superconductor, CsV$_3$Sb$_5$., Comment: A small part of the contents overlaps with arXiv:2102.08356

Despite the rise of recent neural networks in machine translation, those networks do not work well if the training data is insufficient. In this paper, we proposed an approach for machine translation in low-resource languages such as Vietnamese-Chinese. Our proposed method leveraged the power of the multilingual pre-trained language model (mBART) and both Vietnamese and Chinese monolingual corpus. Firstly, we built an early bird machine translation model using the bilingual training dataset. Secondly, we used TF-IDF technique to select sentences from the monolingual corpus which are the most related to domains of the parallel dataset. Finally, the first model was used to synthesize the augmented training data from the selected monolingual corpus for the translation model. Our proposed scheme showed that it outperformed 8% compared to the transformer model. The augmented dataset also pushed the model performance., Comment: Technical report of VLSP 2022 NMT; The first two authors contributed equally to this work

Large language models (LLMs) such as OpenAI's o1 have demonstrated remarkable abilities in complex reasoning tasks by scaling test-time compute and exhibiting human-like deep thinking. However, we identify a phenomenon we term underthinking, where o1-like LLMs frequently switch between different reasoning thoughts without sufficiently exploring promising paths to reach a correct solution. This behavior leads to inadequate depth of reasoning and decreased performance, particularly on challenging mathematical problems. To systematically analyze this issue, we conduct experiments on three challenging test sets and two representative open-source o1-like models, revealing that frequent thought switching correlates with incorrect responses. We introduce a novel metric to quantify underthinking by measuring token efficiency in incorrect answers. To address underthinking, we propose a decoding strategy with thought switching penalty TIP that discourages premature transitions between thoughts, encouraging deeper exploration of each reasoning path. Experimental results demonstrate that our approach improves accuracy across challenging datasets without requiring model fine-tuning. Our findings contribute to understanding reasoning inefficiencies in o1-like LLMs and offer a practical solution to enhance their problem-solving capabilities.

Retrieval-augmented generation (RAG) enhances large language models (LLMs) by integrating external knowledge retrieved from a knowledge base. However, its effectiveness is fundamentally constrained by the reliability of both the retriever and the knowledge base. In real-world scenarios, imperfections in these components often lead to the retrieval of noisy, irrelevant, or misleading counterfactual information, ultimately undermining the trustworthiness of RAG systems. To address this challenge, we propose Robust Fine-Tuning (RbFT), a method designed to enhance the resilience of LLMs against retrieval defects through two targeted fine-tuning tasks. Experimental results demonstrate that RbFT significantly improves the robustness of RAG systems across diverse retrieval conditions, surpassing existing methods while maintaining high inference efficiency and compatibility with other robustness techniques.

We present an interactive and explainable automated coaching assistant called CueTip for a variant of pool/billiards. CueTip's novelty lies in its combination of three features: a natural-language interface, an ability to perform contextual, physics-aware reasoning, and that its explanations are rooted in a set of predetermined guidelines developed by domain experts. We instrument a physics simulator so that it generates event traces in natural language alongside traditional state traces. Event traces lend themselves to interpretation by language models, which serve as the interface to our assistant. We design and train a neural adaptor that decouples tactical choices made by CueTip from its interactivity and explainability allowing it to be reconfigured to mimic any pool playing agent. Our experiments show that CueTip enables contextual query-based assistance and explanations while maintaining the strength of the agent in terms of win rate (improving it in some situations). The explanations generated by CueTip are physically-aware and grounded in the expert rules and are therefore more reliable.

We report the spectroscopic identification of three brown dwarf candidates -- o005_s41280, o006_s00089, and o006_s35616 -- discovered in the RUBIES using James Webb Space Telescope (JWST) Near-Infrared Spectrograph (NIRSpec) PRISM/CLEAR spectroscopy. We fit these sources with multiple substellar atmosphere models and present the atmospheric parameters, including effective temperature ($T_\mathrm{eff}$), surface gravity, and other derived properties. The results suggest that o005_s41280 and o006_s35616, with $T_\mathrm{eff}$ in the ranges of 2100--2300 K and 1800--2000 K, are likely L dwarfs, while o006_s00089, with $T_\mathrm{eff} < 1000$ K, is consistent with a late T dwarf classification. The best-fit model spectra provide a reasonable match to the observed spectra. However, distinct residuals exist in the $Y$, $J$, and $H$ bands for the two L dwarf candidates, particularly for o006_s35616. Incorporating the extinction parameter into the fitting process can significantly reduce these residuals. The distance estimates indicate that these candidates are about 2 kpc away. The analysis of the color-color diagram using multiple JWST NIRcam photometry suggests that cooler T dwarfs, such as o006_s00089, overlap with little red dots (LRDs), while hotter L dwarfs, like o005_s41280 and o006_s35616, tend to contaminate the high-redshift galaxy cluster. These findings suggest a brown dwarf contamination rate of approximately 0.1% in extragalactic deep field surveys, with L dwarfs being more frequently detected than cooler T and Y dwarfs., Comment: 17 pages, 8 figures, accepted for publication in ApJ

This paper explores opportunities and challenges for data-driven advocacy to support home care workers, an often overlooked group of low-wage, frontline health workers. First, we investigate what data to collect and how to collect it in ways that preserve privacy and avoid burdening workers. Second, we examine how workers and advocates could use collected data to strengthen individual and collective advocacy efforts. Our qualitative study with 11 workers and 15 advocates highlights tensions between workers' desires for individual and immediate benefits and advocates' preferences to prioritize more collective and long-term benefits. We also uncover discrepancies between participants' expectations for how data might transform advocacy and their on-the-ground experiences collecting and using real data. Finally, we discuss future directions for data-driven worker advocacy, including combining different kinds of data to ameliorate challenges, leveraging advocates as data stewards, and accounting for workers' and organizations' heterogeneous goals., Comment: Accepted to CHI 2025

Large-scale text-to-image (T2I) diffusion models have achieved remarkable generative performance about various concepts. With the limitation of privacy and safety in practice, the generative capability concerning NSFW (Not Safe For Work) concepts is undesirable, e.g., producing sexually explicit photos, and licensed images. The concept erasure task for T2I diffusion models has attracted considerable attention and requires an effective and efficient method. To achieve this goal, we propose a CE-SDWV framework, which removes the target concepts (e.g., NSFW concepts) of T2I diffusion models in the text semantic space by only adjusting the text condition tokens and does not need to re-train the original T2I diffusion model's weights. Specifically, our framework first builds a target concept-related word vocabulary to enhance the representation of the target concepts within the text semantic space, and then utilizes an adaptive semantic component suppression strategy to ablate the target concept-related semantic information in the text condition tokens. To further adapt the above text condition tokens to the original image semantic space, we propose an end-to-end gradient-orthogonal token optimization strategy. Extensive experiments on I2P and UnlearnCanvas benchmarks demonstrate the effectiveness and efficiency of our method., Comment: 24 pages, 15 figures

The Josephson effect is a macroscopic quantum tunneling phenomenon in a system with superfluid property, when it is split into two parts by a barrier. Here, we examine the Josephson effect in a driven-dissipative supersolid realized by coupling Bose-Einstein condensates to an optical ring cavity. We show that the spontaneous breaking of spatial translation symmetry in supersolid makes the location of the splitting barrier have a significant influence on the Josephson effect. Remarkably, for the same splitting barrier, depending on its location, two different types of DC Josephson currents are found in the supersolid phase (compared to only one type found in the superfluid phase). Thus, we term it a bi-Josephson effect. We examine the Josephson relationships and critical Josephson currents in detail, revealing that the emergence of supersolid order affects these two types of DC Josephson currents differently -- one is enhanced, while the other is suppressed. The findings of this work unveil unique Josephson physics in the supersolid phase, and show new opportunities to build novel Josephson devices with supersolids.

We introduce Qwen2.5-1M, a series of models that extend the context length to 1 million tokens. Compared to the previous 128K version, the Qwen2.5-1M series have significantly enhanced long-context capabilities through long-context pre-training and post-training. Key techniques such as long data synthesis, progressive pre-training, and multi-stage supervised fine-tuning are employed to effectively enhance long-context performance while reducing training costs. To promote the use of long-context models among a broader user base, we present and open-source our inference framework. This framework includes a length extrapolation method that can expand the model context lengths by at least four times, or even more, without additional training. To reduce inference costs, we implement a sparse attention method along with chunked prefill optimization for deployment scenarios and a sparsity refinement method to improve precision. Additionally, we detail our optimizations in the inference engine, including kernel optimization, pipeline parallelism, and scheduling optimization, which significantly enhance overall inference performance. By leveraging our inference framework, the Qwen2.5-1M models achieve a remarkable 3x to 7x prefill speedup in scenarios with 1 million tokens of context. This framework provides an efficient and powerful solution for developing applications that require long-context processing using open-source models. The Qwen2.5-1M series currently includes the open-source models Qwen2.5-7B-Instruct-1M and Qwen2.5-14B-Instruct-1M, as well as the API-accessed model Qwen2.5-Turbo. Evaluations show that Qwen2.5-1M models have been greatly improved in long-context tasks without compromising performance in short-context scenarios. Specifically, the Qwen2.5-14B-Instruct-1M model significantly outperforms GPT-4o-mini in long-context tasks and supports contexts eight times longer.

Perception is crucial for autonomous driving, but single-agent perception is often constrained by sensors' physical limitations, leading to degraded performance under severe occlusion, adverse weather conditions, and when detecting distant objects. Multi-agent collaborative perception offers a solution, yet challenges arise when integrating heterogeneous agents with varying model architectures. To address these challenges, we propose STAMP, a scalable task- and model-agnostic, collaborative perception pipeline for heterogeneous agents. STAMP utilizes lightweight adapter-reverter pairs to transform Bird's Eye View (BEV) features between agent-specific and shared protocol domains, enabling efficient feature sharing and fusion. This approach minimizes computational overhead, enhances scalability, and preserves model security. Experiments on simulated and real-world datasets demonstrate STAMP's comparable or superior accuracy to state-of-the-art models with significantly reduced computational costs. As a first-of-its-kind task- and model-agnostic framework, STAMP aims to advance research in scalable and secure mobility systems towards Level 5 autonomy. Our project page is at https://xiangbogaobarry.github.io/STAMP and the code is available at https://github.com/taco-group/STAMP., Comment: Paper is accepted by ICLR 2025

We present GreenAuto, an end-to-end automated platform designed for sustainable AI model exploration, generation, deployment, and evaluation. GreenAuto employs a Pareto front-based search method within an expanded neural architecture search (NAS) space, guided by gradient descent to optimize model exploration. Pre-trained kernel-level energy predictors estimate energy consumption across all models, providing a global view that directs the search toward more sustainable solutions. By automating performance measurements and iteratively refining the search process, GreenAuto demonstrates the efficient identification of sustainable AI models without the need for human intervention.

This paper introduces the open-source dataset WanJuanSiLu, designed to provide high-quality training corpora for low-resource languages, thereby advancing the research and development of multilingual models. To achieve this, we have developed a systematic data processing framework tailored for low-resource languages. This framework encompasses key stages such as data extraction, corpus cleaning, content deduplication, security filtering, quality evaluation, and theme classification. Through the implementation of this framework, we have significantly improved both the quality and security of the dataset, while maintaining its linguistic diversity. As of now, data for all five languages have been fully open-sourced. The dataset can be accessed at https://opendatalab.com/applyMultilingualCorpus, and GitHub repository is available at https://github.com/opendatalab/WanJuan3.0

Driving World Models (DWMs) have become essential for autonomous driving by enabling future scene prediction. However, existing DWMs are limited to scene generation and fail to incorporate scene understanding, which involves interpreting and reasoning about the driving environment. In this paper, we present a unified Driving World Model named HERMES. We seamlessly integrate 3D scene understanding and future scene evolution (generation) through a unified framework in driving scenarios. Specifically, HERMES leverages a Bird's-Eye View (BEV) representation to consolidate multi-view spatial information while preserving geometric relationships and interactions. We also introduce world queries, which incorporate world knowledge into BEV features via causal attention in the Large Language Model (LLM), enabling contextual enrichment for understanding and generation tasks. We conduct comprehensive studies on nuScenes and OmniDrive-nuScenes datasets to validate the effectiveness of our method. HERMES achieves state-of-the-art performance, reducing generation error by 32.4% and improving understanding metrics such as CIDEr by 8.0%. The model and code will be publicly released at https://github.com/LMD0311/HERMES., Comment: Work in progress. The code will be available at https://github.com/LMD0311/HERMES

Continual learning requires machine learning models to continuously acquire new knowledge in dynamic environments while avoiding the forgetting of previous knowledge. Prompt-based continual learning methods effectively address the issue of catastrophic forgetting through prompt expansion and selection. However, existing approaches often suffer from low accuracy in prompt selection, which can result in the model receiving biased knowledge and making biased predictions. To address this issue, we propose the Multiple Queries with Multiple Keys (MQMK) prompt matching paradigm for precise prompt selection. The goal of MQMK is to select the prompts whose training data distribution most closely matches that of the test sample. Specifically, Multiple Queries enable precise breadth search by introducing task-specific knowledge, while Multiple Keys perform deep search by representing the feature distribution of training samples at a fine-grained level. Experiments show that MQMK enhances the prompt matching rate by over 30% in challenging scenarios and achieves state-of-the-art performance on three widely adopted continual learning benchmarks. Once this paper is accepted, we will release the code.

Multimodal Large Language Models (MLLMs) have shown significant advancements, providing a promising future for embodied agents. Existing benchmarks for evaluating MLLMs primarily utilize static images or videos, limiting assessments to non-interactive scenarios. Meanwhile, existing embodied AI benchmarks are task-specific and not diverse enough, which do not adequately evaluate the embodied capabilities of MLLMs. To address this, we propose EmbodiedEval, a comprehensive and interactive evaluation benchmark for MLLMs with embodied tasks. EmbodiedEval features 328 distinct tasks within 125 varied 3D scenes, each of which is rigorously selected and annotated. It covers a broad spectrum of existing embodied AI tasks with significantly enhanced diversity, all within a unified simulation and evaluation framework tailored for MLLMs. The tasks are organized into five categories: navigation, object interaction, social interaction, attribute question answering, and spatial question answering to assess different capabilities of the agents. We evaluated the state-of-the-art MLLMs on EmbodiedEval and found that they have a significant shortfall compared to human level on embodied tasks. Our analysis demonstrates the limitations of existing MLLMs in embodied capabilities, providing insights for their future development. We open-source all evaluation data and simulation framework at https://github.com/thunlp/EmbodiedEval.

Deep high-dispersion spectroscopy of Galactic photoionized gaseous nebulae, mainly planetary nebulae and HII regions, has revealed numerous emission lines. As a key step of spectral analysis, identification of emission lines hitherto has mostly been done manually, which is a tedious task, given that each line needs to be carefully checked against huge volumes of atomic transition/spectroscopic database to reach a reliable assignment of identity. Using Python, we have developed a line-identification code PyEMILI, which is a significant improvement over the Fortran-based package EMILI introduced ~20 years ago. In our new code PyEMILI, the major shortcomings in EMILI's line-identification technique have been amended. Moreover, the atomic transition database utilized by PyEMILI was adopted from Atomic Line List v3.00b4 but greatly supplemented with theoretical transition data from the literature. The effective recombination coefficients of the CII, OII, NII and NeII nebular lines are collected from the literature to form a subset of the atomic transition database to aid identification of faint optical recombination lines in the spectra of PNe and HII regions. PyEMILI is tested using the deep, high-dispersion spectra of two Galactic PNe, Hf2-2 and IC418, and gives better results of line identification than EMILI does. We also ran PyEMILI on the optical spectrum of a late-type [WC11] star UVQS J060819.93-715737.4 recently discovered in the Large Magellanic Cloud, and our results agree well with the previous manual identifications. The new identifier PyEMILI is applicable to not only emission-line nebulae but also emission stars, such as Wolf-Rayet stars., Comment: Accepted for publication in ApJS; 34 pages including 2 figures and 10 tables. The PyEMILI code as well as the atomic transition database has been publicly available on GitHub, Zenodo and PyPI. This paper describes the PyEMILI code in thorough details (the criteria, methodology and technology developed for line identification), and provides an overview of emission line formation

We consider the constrained sampling problem where the goal is to sample from a target distribution on a constrained domain. We propose skew-reflected non-reversible Langevin dynamics (SRNLD), a continuous-time stochastic differential equation with skew-reflected boundary. We obtain non-asymptotic convergence rate of SRNLD to the target distribution in both total variation and 1-Wasserstein distances. By breaking reversibility, we show that the convergence is faster than the special case of the reversible dynamics. Based on the discretization of SRNLD, we propose skew-reflected non-reversible Langevin Monte Carlo (SRNLMC), and obtain non-asymptotic discretization error from SRNLD, and convergence guarantees to the target distribution in 1-Wasserstein distance. We show better performance guarantees than the projected Langevin Monte Carlo in the literature that is based on the reversible dynamics. Numerical experiments are provided for both synthetic and real datasets to show efficiency of the proposed algorithms., Comment: 30 pages, 9 figures

The Electron-Ion Collider (EIC) is an upcoming accelerator facility aimed at exploring the properties of quarks and gluons in nucleons and nuclei, shedding light on their structure and dynamics. The inaugural experimental apparatus, ePIC (electron-Proton and Ion Collider), is designed as a general purpose detector to address the NAS/NSAC physics program at the EIC. The wider EIC community is strongly supporting a second interaction region and associated second detector to enhance the full science program. In this study, we evaluate how the second interaction region and detector can be complementary to ePIC. The pre-conceptual layout of an interaction region for the second detector offers a secondary focus that provides better forward detector acceptance at scattering angles near $\theta \sim 0$~mrad, which can specifically enhance the exclusive, tagging, and diffractive physics program. This article presents an analysis of a tagging program using the second interaction region layout with incoherent diffractive vector meson production. The potential for the second interaction region to provide improved vetoing capabilities for incoherent events to elucidate the coherent diffractive cross-section is evaluated. The capability to access the coherent diffractive cross-section is of prime importance for studying the spatial imaging of nucleons and nuclei., Comment: 9 pages, 6 figures, 4 tables

The antiferromagnetic Ising model on a triangular lattice (AFIT) exemplifies the most classical frustration system, arising from its triangular geometry that prevents all interactions from being simultaneously satisfied. Understanding geometric frustration in AFIT is crucial for advancing our knowledge of materials science and complex phases of matter. Here, we present a simple platform to study AFIT by arranging cylindrical magnets in vertical cavities of a triangular lattice, where magnets can slide along the cavity axis and stabilize either at the bottom or at the top of the cavity, analogous to the bistability of the Ising spin. The strong interactions of the magnets and the unique growing process allow the frustrated behavior and its ground state configurations to be directly observed. Notably, we observe a curved stripe phase, which is exotic to the Ising model. An effective thermalization process is developed to minimize the interaction energy, facilitating the evolution of various magnetic states, thereby visually realizing the ground state antiferromagnetic Ising model. Theoretical simulations and machine learning are performed concurrently to reveal the ground state and its evolution under effective thermal fluctuations, which are remarkably consistent with experimental results. Our system provides a unique platform to study frustrated systems and pave the way for future explorations in complex geometries., Comment: 4 figures

Testing ultra-large microservices-based FinTech systems presents significant challenges, including restricted access to production environments, complex dependencies, and stringent security constraints. We propose SandBoxFuzz, a scalable grey-box fuzzing technique that addresses these limitations by leveraging aspect-oriented programming and runtime reflection to enable dynamic specification mining, generating targeted inputs for constrained environments. SandBoxFuzz also introduces a log-based coverage mechanism, seamlessly integrated into the build pipeline, eliminating the need for runtime coverage agents that are often infeasible in industrial settings. SandBoxFuzz has been successfully deployed to Ant Group's production line and, compared to an initial solution built on a state-of-the-art fuzzing framework, it demonstrates superior performance in their microservices software. SandBoxFuzz achieves a 7.5% increase in branch coverage, identifies 1,850 additional exceptions, and reduces setup time from hours to minutes, highlighting its effectiveness and practical utility in a real-world industrial environment. By open-sourcing SandBoxFuzz, we provide a practical and effective tool for researchers and practitioners to test large-scale microservices systems.

This paper investigates an adaptive sliding-mode control for an integrated UAV autopilot and guidance system. First, a two-dimensional mathematical model of the system is derived by considering the incorporated lateral dynamics and relative kinematics of the UAV and its potential target of attack. Then, a sliding surface is derived utilizing the zero-effort miss distance. An adaptive twisting sliding mode (ATSMC) algorithm is applied to the integrated system. Simulation and comparisons have been accomplished. The results show our proposed design performs well in interception precision, even with high nonlinearity, uncertainties, disturbances, and abrupt changes in the target's movement, thanks to the adaptation strategy., Comment: in Proceedings of the 2025 International Conference on Energy, Infrastructure and Environmental Research (EIER2025)

We employ the SU(n)_k Wess-Zumino-Witten (WZW) model in conformal field theory to construct lattice wave functions in both one and two dimensions. It is unveiled that these wave functions can be reinterpreted as parton states, which enables efficient conversion to matrix product states such that many physical properties can be evaluated directly. In one dimension, these wave functions describe critical spin chains whose universality classes are in one-to-one correspondence with the WZW models used in the construction. In two dimensions, our constructions yield model wave functions for chiral spin liquids, and we show how to find all topological sectors of them in a systematic way. Using the null vectors of Kac-Moody algebras, parent Hamiltonians of the SU(3)_k series are derived. The SU(3)_k chiral spin liquids are lattice analogs of non-Abelian spin-singlet fractional quantum Hall states, and the k = 2 member hosts Fibonacci anyons., Comment: 14 pages, 6 figures

Online medical consultation (OMC) restricts doctors to gathering patient information solely through inquiries, making the already complex sequential decision-making process of diagnosis even more challenging. Recently, the rapid advancement of large language models has demonstrated a significant potential to transform OMC. However, most studies have primarily focused on improving diagnostic accuracy under conditions of relatively sufficient information, while paying limited attention to the "inquiry" phase of the consultation process. This lack of focus has left the relationship between "inquiry" and "diagnosis" insufficiently explored. In this paper, we first extract real patient interaction strategies from authentic doctor-patient conversations and use these strategies to guide the training of a patient simulator that closely mirrors real-world behavior. By inputting medical records into our patient simulator to simulate patient responses, we conduct extensive experiments to explore the relationship between "inquiry" and "diagnosis" in the consultation process. Experimental results demonstrate that inquiry and diagnosis adhere to the Liebig's law: poor inquiry quality limits the effectiveness of diagnosis, regardless of diagnostic capability, and vice versa. Furthermore, the experiments reveal significant differences in the inquiry performance of various models. To investigate this phenomenon, we categorize the inquiry process into four types: (1) chief complaint inquiry; (2) specification of known symptoms; (3) inquiry about accompanying symptoms; and (4) gathering family or medical history. We analyze the distribution of inquiries across the four types for different models to explore the reasons behind their significant performance differences. We plan to open-source the weights and related code of our patient simulator at https://github.com/LIO-H-ZEN/PatientSimulator.

To address the singularity problem in black hole physics, Penrose proposed the cosmic censorship conjecture . However, whether this conjecture holds in different types of black holes, especially for the Strong Cosmic Censorship Conjecture (SCCC), remains an issue worth further exploration. This study investigates the Yang-Mills field modified RN black hole, which provides new possibilities for exploring the Strong Cosmic Censorship Conjecture due to its unique nonlinear dynamical properties. In this work, the perturbation equations of two scalar fields for the Yang-Mills field modified RN black hole are derived. By combining the WKB method and the Prony method, the quasi-normal modes frequencies of the perturbations are analyzed. Additionally, constraints on the charge-to-mass ratio of the charged and massive scalar field are obtained using the Weak Gravity Conjecture (WGC), and it is shown that the Yang-Mills field modified RN black hole satisfies the SCCC conditions in the extreme state. The study reveals that the Yang-Mills field charge $q_{YM}$ significantly affects the damping effect and gravitational blueshift effect of the perturbations, causing the RN black hole in the extreme state to transition from violating the SCCC to satisfying it. Furthermore, when the charge-to-mass ratio $q/m$ of the charged and massive scalar field satisfies the WGC condition, the scalar field perturbations destabilize the Cauchy horizon of the Yang-Mills field modified RN black hole in the extreme state, thus confirming the applicability of the SCCC under extreme conditions. This study highlights the key role of nonlinear fields in singularity theory and gravitational dynamics, providing important support for the completeness of general relativity and offering new insights into the theoretical research of black holes in extreme states.

Transition metal dichalcogenides are a family of quasi-two-dimensional materials that display a high technological potential due to their wide range of electronic ground states, e.g., from superconducting to semiconducting, depending on the chemical composition, crystal structure, or electrostatic doping. Here, we unveil that by tuning a single parameter, the hydrostatic pressure P, a cascade of electronic phase transitions can be induced in the few-layer transition metal dichalcogenide 1T'-WS2, including superconducting, topological, and anomalous Hall effect phases. Specifically, as P increases, we observe a dual phase transition: the suppression of superconductivity with the concomitant emergence of an anomalous Hall effect at P=1.15 GPa. Remarkably, upon further increasing the pressure above 1.6 GPa, we uncover a reentrant superconducting state that emerges out of a state still exhibiting an anomalous Hall effect. This superconducting state shows a marked increase in superconducting anisotropy with respect to the phase observed at ambient pressure, suggesting a different superconducting state with a distinct pairing symmetry. Via first-principles calculations, we demonstrate that the system concomitantly transitions into a strong topological phase with markedly different band orbital characters and Fermi surfaces contributing to the superconductivity. These findings position 1T'-WS2 as a unique, tunable superconductor, wherein superconductivity, anomalous transport, and band features can be tuned through the application of moderate pressures.

We investigate the molecular environment of the supernova remnant (SNR) Kesteven 67 (G18.8+0.3) using observations in $^{12}$CO, $^{13}$CO, HCO$^+$,and HCN lines and possible associated $\gamma$-ray emission using 16-yr Fermi-LAT observation. We find that the SNR is closely surrounded by a molecular belt in the southeastern boundary, with the both recessed in the band-like molecular gas structure along the Galactic plane. The asymmetric molecular line profiles are widely present in the surrounding gas around local-standard-of-rest velocity +20 km s$^{-1}$. The secondary components centered at $\sim$+16km s$^{-1}$ in the belt and $\sim$+26 km s$^{-1}$ in the northern clump can be ascribed to the motion of a wind-blown molecular shell. This explanation is supported by the position-velocity diagram along a line cutting across the remnant, which shows an arc-like pattern, suggesting an expanding gas structure. With the simulation of chemical effects of shock propagation, the abundance ratios $N$(HCO$^+$)/$N$($^{12}$CO) $\sim2.6\times 10^{-5}$--$3.6\times 10^{-4}$ obtained in the belt can be more naturally interpreted by the wind-driven bubble shock than by the SNR shock. The belt and northern clump are very likely to be parts of an incomplete molecular shell of bubble driven by O-type progenitor star's wind. The analysis of 0.2--500 GeV $\gamma$-ray emission uncovers a possible point source (`Source~A') about 6.5$\sigma$ located in the north of the SNR, which essentially corresponds to northern molecular clump. Our spectral fit of the emission indicates that a hadronic origin is favored by the measured Galactic number ratio between CR electrons and protons $\sim0.01$., Comment: 14 pages, 10 figures, accepted by MNRAS

In this paper, we consider the Neumann problem for a class of Hessian quotient equations involving a gradient term on the right-hand side in Euclidean space. More precisely, we derive the interior gradient estimates for the $(\Lambda, k)$-convex solution of Hessian quotient equation $\frac{\sigma_k(\Lambda(D^2 u))}{\sigma_l(\Lambda(D^2 u))}=\psi(x,u,D u)$ with $0\leq l

The rapid progress in deep generative models has led to the creation of incredibly realistic synthetic images that are becoming increasingly difficult to distinguish from real-world data. The widespread use of Variational Models, Diffusion Models, and Generative Adversarial Networks has made it easier to generate convincing fake images and videos, which poses significant challenges for detecting and mitigating the spread of misinformation. As a result, developing effective methods for detecting AI-generated fakes has become a pressing concern. In our research, we propose HFMF, a comprehensive two-stage deepfake detection framework that leverages both hierarchical cross-modal feature fusion and multi-stream feature extraction to enhance detection performance against imagery produced by state-of-the-art generative AI models. The first component of our approach integrates vision Transformers and convolutional nets through a hierarchical feature fusion mechanism. The second component of our framework combines object-level information and a fine-tuned convolutional net model. We then fuse the outputs from both components via an ensemble deep neural net, enabling robust classification performances. We demonstrate that our architecture achieves superior performance across diverse dataset benchmarks while maintaining calibration and interoperability., Comment: This work is accepted to WACV 2025 Workshop on AI for Multimedia Forensics & Disinformation Detection. Code is available at: https://github.com/taco-group/HFMF

Nuclear excitation by electron capture (NEEC) is an important nuclear excitation mechanism which still lacks conclusive experimental verification. This is primarily attributed to strong background x-/$\gamma$-ray noise and competing nuclear excitation processes which would overshadow the signals in various environments that NEEC takes place. Here, we propose an experimental approach to observe the NEEC process within a background-free environment. Through collisions with a highly-compressed mono-energetic electron beam in an electron beam ion trap, nuclei may get excited to a long-lived isomeric state via the NEEC process. Subsequently, ions can be extracted and Penning-trap mass spectrometry employed to unambiguously detect the isomer. Our study focuses on the promising candidate $^{189}\mathrm{Os}$, demonstrating measurable detection rates of the NEEC process and discussing the feasibility of the proposed approach. This new approach for observing the NEEC process may be realized in the near future.

Instruction tuning has proven effective in enhancing Large Language Models' (LLMs) performance on downstream tasks. However, real-world fine-tuning faces inherent conflicts between model providers' intellectual property protection, clients' data privacy requirements, and tuning costs. While recent approaches like split learning and offsite tuning demonstrate promising architectures for privacy-preserving fine-tuning, there is a gap in systematically addressing the multidimensional trade-offs required for diverse real-world deployments. We propose several indicative evaluation metrics to guide design trade-offs for privacy-preserving fine-tuning and a series of example designs, collectively named GuardedTuning; they result from novel combinations of system architectures with adapted privacy-enhancement methods and emerging computation techniques. Each design represents distinct trade-offs across model utility, privacy guarantees, and costs. Experimental results demonstrate that these designs protect against data reconstruction attacks while maintaining competitive fine-tuning performance., Comment: Accepted to WWW 2025

Deep Neural Networks (DNNs) have gained considerable traction in recent years due to the unparalleled results they gathered. However, the cost behind training such sophisticated models is resource intensive, resulting in many to consider DNNs to be intellectual property (IP) to model owners. In this era of cloud computing, high-performance DNNs are often deployed all over the internet so that people can access them publicly. As such, DNN watermarking schemes, especially backdoor-based watermarks, have been actively developed in recent years to preserve proprietary rights. Nonetheless, there lies much uncertainty on the robustness of existing backdoor watermark schemes, towards both adversarial attacks and unintended means such as fine-tuning neural network models. One reason for this is that no complete guarantee of robustness can be assured in the context of backdoor-based watermark. In this paper, we extensively evaluate the persistence of recent backdoor-based watermarks within neural networks in the scenario of fine-tuning, we propose/develop a novel data-driven idea to restore watermark after fine-tuning without exposing the trigger set. Our empirical results show that by solely introducing training data after fine-tuning, the watermark can be restored if model parameters do not shift dramatically during fine-tuning. Depending on the types of trigger samples used, trigger accuracy can be reinstated to up to 100%. Our study further explores how the restoration process works using loss landscape visualization, as well as the idea of introducing training data in fine-tuning stage to alleviate watermark vanishing., Comment: Preprint. Under Review

Dense suspensions exhibit significant viscosity changes under external deformation, a phenomenon known as shear thickening. Recent studies have identified a stress-induced transition from lubricated, unconstrained interactions to frictional contacts, which play a crucial role in shear thickening. This work investigates the rheological behavior and contact network evolution during continuous and discontinuous shear thickening (CST and DST) in two-dimensional simulations. We find that at low stress, during weak thickening, the frictional contact network is composed of quasilinear chains along the compression axis. With increasing stress, the contact network becomes more isotropic, and forms loop-like structures. We show that third-order loops within the frictional contact network are key to this behavior. Our findings revealed a strong correlation between the number of edges in the third-order loops and the viscosity of the suspension. Notably, this relationship remains independent of the packing fraction, applied stress, and interparticle friction, highlighting the fundamental role of the mesoscale network topology in governing macroscopic rheology., Comment: Supplementary Movies are available at this link: https://drive.google.com/file/d/1InMtQKIn_bRy60xEM2XtIjy_tQ-o1N-8/view?usp=sharing

Open-vocabulary panoptic segmentation has received significant attention due to its applicability in the real world. Despite claims of robust generalization, we find that the advancements of previous works are attributed mainly on trained categories, exposing a lack of generalization to novel classes. In this paper, we explore boosting existing models from a data-centric perspective. We propose DreamMask, which systematically explores how to generate training data in the open-vocabulary setting, and how to train the model with both real and synthetic data. For the first part, we propose an automatic data generation pipeline with off-the-shelf models. We propose crucial designs for vocabulary expansion, layout arrangement, data filtering, etc. Equipped with these techniques, our generated data could significantly outperform the manually collected web data. To train the model with generated data, a synthetic-real alignment loss is designed to bridge the representation gap, bringing noticeable improvements across multiple benchmarks. In general, DreamMask significantly simplifies the collection of large-scale training data, serving as a plug-and-play enhancement for existing methods. For instance, when trained on COCO and tested on ADE20K, the model equipped with DreamMask outperforms the previous state-of-the-art by a substantial margin of 2.1% mIoU., Comment: Project url: https://yuanpengtu.github.io/Dreammask-Page/

The advancement of machine learning and the availability of large-scale reaction datasets have accelerated the development of data-driven models for computer-aided synthesis planning (CASP) in the past decade. Here, we detail the newest version of ASKCOS, an open source software suite for synthesis planning that makes available several research advances in a freely available, practical tool. Four one-step retrosynthesis models form the basis of both interactive planning and automatic planning modes. Retrosynthetic planning is complemented by other modules for feasibility assessment and pathway evaluation, including reaction condition recommendation, reaction outcome prediction, and auxiliary capabilities such as solubility prediction and quantum mechanical descriptor prediction. ASKCOS has assisted hundreds of medicinal, synthetic, and process chemists in their day-to-day tasks, complementing expert decision making. It is our belief that CASP tools like ASKCOS are an important part of modern chemistry research, and that they offer ever-increasing utility and accessibility.

Despite significant advancements in video generation, inserting a given object into videos remains a challenging task. The difficulty lies in preserving the appearance details of the reference object and accurately modeling coherent motions at the same time. In this paper, we propose VideoAnydoor, a zero-shot video object insertion framework with high-fidelity detail preservation and precise motion control. Starting from a text-to-video model, we utilize an ID extractor to inject the global identity and leverage a box sequence to control the overall motion. To preserve the detailed appearance and meanwhile support fine-grained motion control, we design a pixel warper. It takes the reference image with arbitrary key-points and the corresponding key-point trajectories as inputs. It warps the pixel details according to the trajectories and fuses the warped features with the diffusion U-Net, thus improving detail preservation and supporting users in manipulating the motion trajectories. In addition, we propose a training strategy involving both videos and static images with a weighted loss to enhance insertion quality. VideoAnydoor demonstrates significant superiority over existing methods and naturally supports various downstream applications (e.g., talking head generation, video virtual try-on, multi-region editing) without task-specific fine-tuning., Comment: Project page: https://videoanydoor.github.io/

In this paper, we establish the modified concavity inequality for complex Hessian equations under the semi-convexity assumption inspired by Lu \cite{Lu23} and Zhang \cite{Z24} for real case. Then second order estimates for admissible solutions of complex Hessian equations on compact Hermitian manifolds with both sides of equations depending on gradient terms are obtained by taking advantage of the crucial inequality.

As large language models (LLMs) become increasingly integrated into critical applications, aligning their behavior with human values presents significant challenges. Current methods, such as Reinforcement Learning from Human Feedback (RLHF), often focus on a limited set of values and can be resource-intensive. Furthermore, the correlation between values has been largely overlooked and remains underutilized. Our framework addresses this limitation by mining a causal graph that elucidates the implicit relationships among various values within the LLMs. Leveraging the causal graph, we implement two lightweight mechanisms for value steering: prompt template steering and Sparse Autoencoder feature steering, and analyze the effects of altering one value dimension on others. Extensive experiments conducted on Gemma-2B-IT and Llama3-8B-IT demonstrate the effectiveness and controllability of our steering methods.

Knowledge Graphs (KGs) provide a structured representation of knowledge but often suffer from challenges of incompleteness. To address this, link prediction or knowledge graph completion (KGC) aims to infer missing new facts based on existing facts in KGs. Previous knowledge graph embedding models are limited in their ability to capture expressive features, especially when compared to deeper, multi-layer models. These approaches also assign a single static embedding to each entity and relation, disregarding the fact that entities and relations can exhibit different behaviors in varying graph contexts. Due to complex context over a fact triple of a KG, existing methods have to leverage complex non-linear context encoder, like transformer, to project entity and relation into low dimensional representations, resulting in high computation cost. To overcome these limitations, we propose Triple Receptance Perception (TRP) architecture to model sequential information, enabling the learning of dynamic context of entities and relations. Then we use tensor decomposition to calculate triple scores, providing robust relational decoding capabilities. This integration allows for more expressive representations. Experiments on benchmark datasets such as YAGO3-10, UMLS, FB15k, and FB13 in link prediction and triple classification tasks demonstrate that our method performs better than several state-of-the-art models, proving the effectiveness of the integration.

The remarkable performance of models like the OpenAI o1 can be attributed to their ability to emulate human-like long-time thinking during inference. These models employ extended chain-of-thought (CoT) processes, exploring multiple strategies to enhance problem-solving capabilities. However, a critical question remains: How to intelligently and efficiently scale computational resources during testing. This paper presents the first comprehensive study on the prevalent issue of overthinking in these models, where excessive computational resources are allocated for simple problems with minimal benefit. We introduce novel efficiency metrics from both outcome and process perspectives to evaluate the rational use of computational resources by o1-like models. Using a self-training paradigm, we propose strategies to mitigate overthinking, streamlining reasoning processes without compromising accuracy. Experimental results show that our approach successfully reduces computational overhead while preserving model performance across a range of testsets with varying difficulty levels, such as GSM8K, MATH500, GPQA, and AIME., Comment: Work in progress

With the rapid development of large language models (LLMs) and the growing demand for personalized content, recommendation systems have become critical in enhancing user experience and driving engagement. Collaborative filtering algorithms, being core to many recommendation systems, have garnered significant attention for their efficiency and interpretability. However, traditional collaborative filtering approaches face numerous challenges when integrated into large-scale LLM-based systems, including high computational costs, severe data sparsity, cold start problems, and lack of scalability. This paper investigates the optimization and scalability of collaborative filtering algorithms in large language models, addressing these limitations through advanced optimization strategies. Firstly, we analyze the fundamental principles of collaborative filtering algorithms and their limitations when applied in LLM-based contexts. Next, several optimization techniques such as matrix factorization, approximate nearest neighbor search, and parallel computing are proposed to enhance computational efficiency and model accuracy. Additionally, strategies such as distributed architecture and model compression are explored to facilitate dynamic updates and scalability in data-intensive environments.

To address this gap, we introduce Libra-Leaderboard, a comprehensive framework designed to rank LLMs through a balanced evaluation of performance and safety. Combining a dynamic leaderboard with an interactive LLM arena, Libra-Leaderboard encourages the joint optimization of capability and safety. Unlike traditional approaches that average performance and safety metrics, Libra-Leaderboard uses a distance-to-optimal-score method to calculate the overall rankings. This approach incentivizes models to achieve a balance rather than excelling in one dimension at the expense of some other ones. In the first release, Libra-Leaderboard evaluates 26 mainstream LLMs from 14 leading organizations, identifying critical safety challenges even in state-of-the-art models.

In this paper, we explore the foundational mechanisms of memorization and generalization in Large Language Models (LLMs), inspired by the functional specialization observed in the human brain. Our investigation serves as a case study leveraging specially designed datasets and experimental-scale LLMs to lay the groundwork for understanding these behaviors. Specifically, we aim to first enable LLMs to exhibit both memorization and generalization by training with the designed dataset, then (a) examine whether LLMs exhibit neuron-level spatial differentiation for memorization and generalization, (b) predict these behaviors using model internal representations, and (c) steer the behaviors through inference-time interventions. Our findings reveal that neuron-wise differentiation of memorization and generalization is observable in LLMs, and targeted interventions can successfully direct their behavior.

Retrieval-augmented generation systems rely on effective document retrieval capabilities. By design, conventional sparse or dense retrievers face challenges in multi-hop retrieval scenarios. In this paper, we present GeAR, which advances RAG performance through two key innovations: (i) graph expansion, which enhances any conventional base retriever, such as BM25, and (ii) an agent framework that incorporates graph expansion. Our evaluation demonstrates GeAR's superior retrieval performance on three multi-hop question answering datasets. Additionally, our system achieves state-of-the-art results with improvements exceeding 10% on the challenging MuSiQue dataset, while requiring fewer tokens and iterations compared to other multi-step retrieval systems.

Recent Large Vision-Language Models (LVLMs) have shown promising reasoning capabilities on text-rich images from charts, tables, and documents. However, the abundant text within such images may increase the model's sensitivity to language. This raises the need to evaluate LVLM performance on cross-lingual text-rich visual inputs, where the language in the image differs from the language of the instructions. To address this, we introduce XT-VQA (Cross-Lingual Text-Rich Visual Question Answering), a benchmark designed to assess how LVLMs handle language inconsistency between image text and questions. XT-VQA integrates five existing text-rich VQA datasets and a newly collected dataset, XPaperQA, covering diverse scenarios that require faithful recognition and comprehension of visual information despite language inconsistency. Our evaluation of prominent LVLMs on XT-VQA reveals a significant drop in performance for cross-lingual scenarios, even for models with multilingual capabilities. A mutual information analysis suggests that this performance gap stems from cross-lingual questions failing to adequately activate relevant visual information. To mitigate this issue, we propose MVCL-MI (Maximization of Vision-Language Cross-Lingual Mutual Information), where a visual-text cross-lingual alignment is built by maximizing mutual information between the model's outputs and visual information. This is achieved by distilling knowledge from monolingual to cross-lingual settings through KL divergence minimization, where monolingual output logits serve as a teacher. Experimental results on the XT-VQA demonstrate that MVCL-MI effectively reduces the visual-text cross-lingual performance disparity while preserving the inherent capabilities of LVLMs, shedding new light on the potential practice for improving LVLMs. Codes are available at: https://github.com/Stardust-y/XTVQA.git

The in-image machine translation task involves translating text embedded within images, with the translated results presented in image format. While this task has numerous applications in various scenarios such as film poster translation and everyday scene image translation, existing methods frequently neglect the aspect of consistency throughout this process. We propose the need to uphold two types of consistency in this task: translation consistency and image generation consistency. The former entails incorporating image information during translation, while the latter involves maintaining consistency between the style of the text-image and the original image, ensuring background integrity. To address these consistency requirements, we introduce a novel two-stage framework named HCIIT (High-Consistency In-Image Translation) which involves text-image translation using a multimodal multilingual large language model in the first stage and image backfilling with a diffusion model in the second stage. Chain of thought learning is utilized in the first stage to enhance the model's ability to leverage image information during translation. Subsequently, a diffusion model trained for style-consistent text-image generation ensures uniformity in text style within images and preserves background details. A dataset comprising 400,000 style-consistent pseudo text-image pairs is curated for model training. Results obtained on both curated test sets and authentic image test sets validate the effectiveness of our framework in ensuring consistency and producing high-quality translated images.

Causal reasoning capabilities are essential for large language models (LLMs) in a wide range of applications, such as education and healthcare. But there is still a lack of benchmarks for a better understanding of such capabilities. Current LLM benchmarks are mainly based on conversational tasks, academic math tests, and coding tests. Such benchmarks evaluate LLMs in well-regularized settings, but they are limited in assessing the skills and abilities to solve real-world problems. In this work, we provide a benchmark, named by CARL-GT, which evaluates CAusal Reasoning capabilities of large Language models using Graphs and Tabular data. The benchmark has a diverse range of tasks for evaluating LLMs from causal graph reasoning, knowledge discovery, and decision-making aspects. In addition, effective zero-shot learning prompts are developed for the tasks. In our experiments, we leverage the benchmark for evaluating open-source LLMs and provide a detailed comparison of LLMs for causal reasoning abilities. We found that LLMs are still weak in casual reasoning, especially with tabular data to discover new insights. Furthermore, we investigate and discuss the relationships of different benchmark tasks by analyzing the performance of LLMs. The experimental results show that LLMs have different strength over different tasks and that their performance on tasks in different categories, i.e., causal graph reasoning, knowledge discovery, and decision-making, shows stronger correlation than tasks in the same category.

Person Re-identification (ReID) aims to retrieve the specific person across non-overlapping cameras, which greatly helps intelligent transportation systems. As we all know, Convolutional Neural Networks (CNNs) and Transformers have the unique strengths to extract local and global features, respectively. Considering this fact, we focus on the mutual fusion between them to learn more comprehensive representations for persons. In particular, we utilize the complementary integration of deep features from different model structures. We propose a novel fusion framework called FusionReID to unify the strengths of CNNs and Transformers for image-based person ReID. More specifically, we first deploy a Dual-branch Feature Extraction (DFE) to extract features through CNNs and Transformers from a single image. Moreover, we design a novel Dual-attention Mutual Fusion (DMF) to achieve sufficient feature fusions. The DMF comprises Local Refinement Units (LRU) and Heterogenous Transmission Modules (HTM). LRU utilizes depth-separable convolutions to align deep features in channel dimensions and spatial sizes. HTM consists of a Shared Encoding Unit (SEU) and two Mutual Fusion Units (MFU). Through the continuous stacking of HTM, deep features after LRU are repeatedly utilized to generate more discriminative features. Extensive experiments on three public ReID benchmarks demonstrate that our method can attain superior performances than most state-of-the-arts. The source code is available at https://github.com/924973292/FusionReID., Comment: Accepted by Trans. on ITS

Preference-based reinforcement learning (PbRL) provides a powerful paradigm to avoid meticulous reward engineering by learning rewards based on human preferences. However, real-time human feedback is hard to obtain in online tasks. Most work suppose there is a "scripted teacher" that utilizes privileged predefined reward to provide preference feedback. In this paper, we propose a RL Self-augmented Large Language Model Feedback (RL-SaLLM-F) technique that does not rely on privileged information for online PbRL. RL-SaLLM-F leverages the reflective and discriminative capabilities of LLM to generate self-augmented trajectories and provide preference labels for reward learning. First, we identify an failure issue in LLM-based preference discrimination, specifically "query ambiguity", in online PbRL. Then LLM is employed to provide preference labels and generate self-augmented imagined trajectories that better achieve the task goal, thereby enhancing the quality and efficiency of feedback. Additionally, a double-check mechanism is introduced to mitigate randomness in the preference labels, improving the reliability of LLM feedback. The experiment across multiple tasks in the MetaWorld benchmark demonstrates the specific contributions of each proposed module in RL-SaLLM-F, and shows that self-augmented LLM feedback can effectively replace the impractical "scripted teacher" feedback. In summary, RL-SaLLM-F introduces a new direction of feedback acquisition in online PbRL that does not rely on any online privileged information, offering an efficient and lightweight solution with LLM-driven feedback., Comment: 19 pages, The 24th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS25)