Searcharxiv⌕ Search

arXiv subjects

Zihao Wang

Publications and source records attributed to Zihao Wang.

At least 199 records · Page 11Linked to original sources

UQABench: Evaluating User Embedding for Prompting LLMs in Personalized Question Answering

Large language models (LLMs) achieve remarkable success in natural language processing (NLP). In practical scenarios like recommendations, as users increasingly seek personalized experiences, it becomes crucial to incorporate user interaction history into the context of LLMs to enhance personalization. However, from a practical utility perspective, user interactions' extensive length and noise present challenges when used directly as text prompts. A promising solution is to compress and distill interactions into compact embeddings, serving as soft prompts to assist LLMs in generating personalized responses. Although this approach brings efficiency, a critical concern emerges: Can user embeddings adequately capture valuable information and prompt LLMs? To address this concern, we propose \name, a benchmark designed to evaluate the effectiveness of user embeddings in prompting LLMs for personalization. We establish a fair and standardized evaluation process, encompassing pre-training, fine-tuning, and evaluation stages. To thoroughly evaluate user embeddings, we design three dimensions of tasks: sequence understanding, action prediction, and interest perception. These evaluation tasks cover the industry's demands in traditional recommendation tasks, such as improving prediction accuracy, and its aspirations for LLM-based methods, such as accurately understanding user interests and enhancing the user experience. We conduct extensive experiments on various state-of-the-art methods for modeling user embeddings. Additionally, we reveal the scaling laws of leveraging user embeddings to prompt LLMs. The benchmark is available online.

cs.IR↗

TransNet: Transfer Knowledge for Few-shot Knowledge Graph Completion

Knowledge graphs (KGs) are ubiquitous and widely used in various applications. However, most real-world knowledge graphs are incomplete, which significantly degrades their performance on downstream tasks. Additionally, the relationships in real-world knowledge graphs often follow a long-tail distribution, meaning that most relations are represented by only a few training triplets. To address these challenges, few-shot learning has been introduced. Few-shot KG completion aims to make accurate predictions for triplets involving novel relations when only a limited number of training triplets are available. Although many methods have been proposed, they typically learn each relation individually, overlooking the correlations between different tasks and the relevant information in previously trained tasks. In this paper, we propose a transfer learning-based few-shot KG completion method (TransNet). By learning the relationships between different tasks, TransNet effectively transfers knowledge from similar tasks to improve the current task's performance. Furthermore, by employing meta-learning, TransNet can generalize effectively to new, unseen relations. Extensive experiments on benchmark datasets demonstrate the superiority of TransNet over state-of-the-art methods. Code can be found at https://github.com/lihuiliullh/TransNet/tree/main

cs.AI↗

Hybrid Physics-ML Modeling for Marine Vehicle Maneuvering Motions in the Presence of Environmental Disturbances

A hybrid physics-machine learning modeling framework is proposed for the surface vehicles' maneuvering motions to address the modeling capability and stability in the presence of environmental disturbances. From a deep learning perspective, the framework is based on a variant version of residual networks with additional feature extraction. Initially, an imperfect physical model is derived and identified to capture the fundamental hydrodynamic characteristics of marine vehicles. This model is then integrated with a feedforward network through a residual block. Additionally, feature extraction from trigonometric transformations is employed in the machine learning component to account for the periodic influence of currents and waves. The proposed method is evaluated using real navigational data from the 'JH7500' unmanned surface vehicle. The results demonstrate the robust generalizability and accurate long-term prediction capabilities of the nonlinear dynamic model in specific environmental conditions. This approach has the potential to be extended and applied to develop a comprehensive high-fidelity simulator.

cs.RO↗

A Linear Complexity Algorithm for Optimal Transport Problem with Log-type Cost

In [Q. Liao et al., Commun. Math. Sci., 20(2022)], a linear-time Sinkhorn algorithm is developed based on dynamic programming, which significantly reduces the computational complexity involved in solving optimal transport problems. However, this algorithm is specifically designed for the Wasserstein-1 metric. We are curious whether the preceding dynamic programming framework can be extended to tackle optimal transport problems with different transport costs. Notably, two special kinds of optimal transport problems, the Sinkhorn ranking and the far-field reflector and refractor problems, are closely associated with the log-type transport costs. Interestingly, by employing series rearrangement and dynamic programming techniques, it is feasible to perform the matrix-vector multiplication within the Sinkhorn iteration in linear time for this type of cost. This paper provides a detailed exposition of its implementation and applications, with numerical simulations demonstrating the effectiveness and efficiency of our methods.

math.OC↗

ROCKET-1: Mastering Open-World Interaction with Visual-Temporal Context Prompting

Vision-language models (VLMs) have excelled in multimodal tasks, but adapting them to embodied decision-making in open-world environments presents challenges. One critical issue is bridging the gap between discrete entities in low-level observations and the abstract concepts required for effective planning. A common solution is building hierarchical agents, where VLMs serve as high-level reasoners that break down tasks into executable sub-tasks, typically specified using language. However, language suffers from the inability to communicate detailed spatial information. We propose visual-temporal context prompting, a novel communication protocol between VLMs and policy models. This protocol leverages object segmentation from past observations to guide policy-environment interactions. Using this approach, we train ROCKET-1, a low-level policy that predicts actions based on concatenated visual observations and segmentation masks, supported by real-time object tracking from SAM-2. Our method unlocks the potential of VLMs, enabling them to tackle complex tasks that demand spatial reasoning. Experiments in Minecraft show that our approach enables agents to achieve previously unattainable tasks, with a $\mathbf{76}\%$ absolute improvement in open-world interaction performance. Codes and demos are now available on the project page: https://craftjarvis.github.io/ROCKET-1.

cs.CV↗

Anomalous Meets Topological Hall Effect in Cr2Ge2Te6 Heterostructures

Introducing topologically protected skyrmions in graphene holds significant importance for developing high-speed, low-energy spintronic devices. Here, we present a centrosymmetric ferromagnetic graphene/trilayer Cr2Ge2Te6/graphene heterostructure, demonstrating the anomalous and topological Hall effect due to the magnetic proximity effect. Through gate voltage control, we effectively tune the emergence and size of skyrmions. Micromagnetic simulations reveal the formation of skyrmions and antiskyrmions, which respond differently to external magnetic fields, leading to oscillations in the topological Hall signal. Our findings provide a novel pathway for the formation and manipulation of skyrmions in centrosymmetric two-dimensional magnetic systems, offering significant insights for developing topological spintronics.

cond-mat.mes-hall↗

LightGen: Efficient Image Generation through Knowledge Distillation and Direct Preference Optimization

Recent advances in text-to-image generation have primarily relied on extensive datasets and parameter-heavy architectures. These requirements severely limit accessibility for researchers and practitioners who lack substantial computational resources. In this paper, we introduce \model, an efficient training paradigm for image generation models that uses knowledge distillation (KD) and Direct Preference Optimization (DPO). Drawing inspiration from the success of data KD techniques widely adopted in Multi-Modal Large Language Models (MLLMs), LightGen distills knowledge from state-of-the-art (SOTA) text-to-image models into a compact Masked Autoregressive (MAR) architecture with only $0.7B$ parameters. Using a compact synthetic dataset of just $2M$ high-quality images generated from varied captions, we demonstrate that data diversity significantly outweighs data volume in determining model performance. This strategy dramatically reduces computational demands and reduces pre-training time from potentially thousands of GPU-days to merely 88 GPU-days. Furthermore, to address the inherent shortcomings of synthetic data, particularly poor high-frequency details and spatial inaccuracies, we integrate the DPO technique that refines image fidelity and positional accuracy. Comprehensive experiments confirm that LightGen achieves image generation quality comparable to SOTA models while significantly reducing computational resources and expanding accessibility for resource-constrained environments. Code is available at https://github.com/XianfengWu01/LightGen

cs.CV↗

The THESAN-ZOOM project: Star-formation efficiencies in high-redshift galaxies

Recent JWST observations hint at unexpectedly intense cosmic star-formation in the early Universe, often attributed to enhanced star-formation efficiencies (SFEs). Here, we analyze the SFE in THESAN-ZOOM, a novel zoom-in radiation-hydrodynamic simulation campaign of high-redshift ($z \gtrsim 3$) galaxies employing a state-of-the-art galaxy formation model resolving the multiphase interstellar medium (ISM). The halo-scale SFE ($ε^{\ast}_{\rm halo}$) - the fraction of baryons accreted by a halo that are converted to stars - follows a double power-law dependence on halo mass, with a mild redshift evolution above $M_{\rm halo} \gtrsim 10^{9.5}\,{\rm M}_{\odot}$. The power-law slope is roughly $1/3$ at large halo masses, consistent with expectations when gas outflows are momentum-driven. At lower masses, the slope is roughly $2/3$ and is more aligned with the energy-driven outflow scenario. $ε^{\ast}_{\rm halo}$ is a factor of $2-3$ larger than commonly assumed in empirical galaxy-formation models at $M_{\rm halo} \lesssim 10^{11}\,{\rm M}_{\odot}$. On galactic (kpc) scales, the Kennicutt-Schmidt (KS) relation of neutral gas is universal in THESAN-ZOOM, following $Σ_{\rm SFR} \propto Σ_{\rm gas}^2$, indicative of a turbulent energy balance in the ISM maintained by stellar feedback. The rise of $ε^{\ast}_{\rm halo}$ with halo mass can be traced primarily to increasing gas surface densities in massive galaxies, while the underlying KS relation and neutral, star-forming gas fraction remain unchanged. Although the increase in $ε^{\ast}_{\rm halo}$ with redshift is relatively modest, it is sufficient to explain the large observed number density of UV-bright galaxies at $z \gtrsim 12$. However, reproducing the brightest sources at $M_{\rm UV} \lesssim -21$ may require extrapolating the SFE beyond the halo mass range directly covered by THESAN-ZOOM.

astro-ph.GA↗

Does Editing Provide Evidence for Localization?

A basic aspiration for interpretability research in large language models is to "localize" semantically meaningful behaviors to particular components within the LLM. There are various heuristics for finding candidate locations within the LLM. Once a candidate localization is found, it can be assessed by editing the internal representations at the corresponding localization and checking whether this induces model behavior that is consistent with the semantic interpretation of the localization. The question we address here is: how strong is the evidence provided by such edits? To evaluate the localization claim, we want to assess the effect of the optimal intervention at a particular location. The key new technical tool is a way of adapting LLM alignment techniques to find such optimal localized edits. With this tool in hand, we give an example where the edit-based evidence for localization appears strong, but where localization clearly fails. Indeed, we find that optimal edits at random localizations can be as effective as aligning the full model. In aggregate, our results suggest that merely observing that localized edits induce targeted changes in behavior provides little to no evidence that these locations actually encode the target behavior.

cs.LG↗

LIR-LIVO: A Lightweight,Robust LiDAR/Vision/Inertial Odometry with Illumination-Resilient Deep Features

In this paper, we propose LIR-LIVO, a lightweight and robust LiDAR-inertial-visual odometry system designed for challenging illumination and degraded environments. The proposed method leverages deep learning-based illumination-resilient features and LiDAR-Inertial-Visual Odometry (LIVO). By incorporating advanced techniques such as uniform depth distribution of features enabled by depth association with LiDAR point clouds and adaptive feature matching utilizing Superpoint and LightGlue, LIR-LIVO achieves state-of-the-art (SOTA) accuracy and robustness with low computational cost. Experiments are conducted on benchmark datasets, including NTU-VIRAL, Hilti'22, and R3LIVE-Dataset. The corresponding results demonstrate that our proposed method outperforms other SOTA methods on both standard and challenging datasets. Particularly, the proposed method demonstrates robust pose estimation under poor ambient lighting conditions in the Hilti'22 dataset. The code of this work is publicly accessible on GitHub to facilitate advancements in the robotics community.

cs.RO↗

Identification of metastable lattice distortion free charge density wave at photoinduced interface via TRARPES

The interplay between different degrees of freedom governs the emergence of correlated electronic states in quantum materials, with charge density waves (CDW) often coexisting with other exotic phases. Under thermal equilibrium, traditional CDW states are consequentially accompanied by structural phase transitions. In contrast, ultrafast photoexcitation allows access to exotic states where a single degree of freedom dominates in the time domain, enabling the study of underlying physics without interference. Here, we report the realization of a long-lived metastable CDW state without lattice distortion at the photoinduced interfaces in GdTe3 using time- and angle-resolved photoemission spectroscopy. After optical excitation above the CDW melting threshold, we identified emerged metastable interfaces through inverting the CDW-coupled lattice distortions, with lifetimes on the order of 10 picoseconds. These photoinduced interfaces represent a novel CDW state lacking the usual amplitude mode and lattice distortions, allowing quantification of the dominant role of electronic instabilities in CDW order. This work provides a new approach to disentangling electronic instabilities from electron-phonon coupling using a nonequilibrium method.

cond-mat.str-el↗

Encrypted Large Model Inference: The Equivariant Encryption Paradigm

Large scale deep learning model, such as modern language models and diffusion architectures, have revolutionized applications ranging from natural language processing to computer vision. However, their deployment in distributed or decentralized environments raises significant privacy concerns, as sensitive data may be exposed during inference. Traditional techniques like secure multi-party computation, homomorphic encryption, and differential privacy offer partial remedies but often incur substantial computational overhead, latency penalties, or limited compatibility with non-linear network operations. In this work, we introduce Equivariant Encryption (EE), a novel paradigm designed to enable secure, "blind" inference on encrypted data with near zero performance overhead. Unlike fully homomorphic approaches that encrypt the entire computational graph, EE selectively obfuscates critical internal representations within neural network layers while preserving the exact functionality of both linear and a prescribed set of non-linear operations. This targeted encryption ensures that raw inputs, intermediate activations, and outputs remain confidential, even when processed on untrusted infrastructure. We detail the theoretical foundations of EE, compare its performance and integration complexity against conventional privacy preserving techniques, and demonstrate its applicability across a range of architectures, from convolutional networks to large language models. Furthermore, our work provides a comprehensive threat analysis, outlining potential attack vectors and baseline strategies, and benchmarks EE against standard inference pipelines in decentralized settings. The results confirm that EE maintains high fidelity and throughput, effectively bridging the gap between robust data confidentiality and the stringent efficiency requirements of modern, large scale model inference.

cs.CR↗

Top Ten Challenges Towards Agentic Neural Graph Databases

Graph databases (GDBs) like Neo4j and TigerGraph excel at handling interconnected data but lack advanced inference capabilities. Neural Graph Databases (NGDBs) address this by integrating Graph Neural Networks (GNNs) for predictive analysis and reasoning over incomplete or noisy data. However, NGDBs rely on predefined queries and lack autonomy and adaptability. This paper introduces Agentic Neural Graph Databases (Agentic NGDBs), which extend NGDBs with three core functionalities: autonomous query construction, neural query execution, and continuous learning. We identify ten key challenges in realizing Agentic NGDBs: semantic unit representation, abductive reasoning, scalable query execution, and integration with foundation models like large language models (LLMs). By addressing these challenges, Agentic NGDBs can enable intelligent, self-improving systems for modern data-driven applications, paving the way for adaptable and autonomous data management solutions.

cs.AI↗

Automatic Calibration of Mesoscopic Traffic Simulation Using Vehicle Trajectory Data

Traffic simulation models have long been popular in modern traffic planning and operation applications. Efficient calibration of simulation models is usually a crucial step in a simulation study. However, traditional calibration procedures are often resource-intensive and time-consuming, limiting the broader adoption of simulation models. In this study, a vehicle trajectory-based automatic calibration framework for mesoscopic traffic simulation is proposed. The framework incorporates behavior models from both the demand and the supply sides of a traffic network. An optimization-based network flow estimation model is designed for demand and route choice calibration. Dimensionality reduction techniques are incorporated to define the zoning system and the path choice set. A stochastic approximation model is established for capacity and driving behavior parameter calibration. The applicability and performance of the calibration framework are demonstrated through a case study for the City of Birmingham network in Michigan.

math.OC↗

ByzSFL: Achieving Byzantine-Robust Secure Federated Learning with Zero-Knowledge Proofs

The advancement of AI models, especially those powered by deep learning, faces significant challenges in data-sensitive industries like healthcare and finance due to the distributed and private nature of data. Federated Learning (FL) and Secure Federated Learning (SFL) enable collaborative model training without data sharing, enhancing privacy by encrypting shared intermediate results. However, SFL currently lacks effective Byzantine robustness, a critical property that ensures model performance remains intact even when some participants act maliciously. Existing Byzantine-robust methods in FL are incompatible with SFL due to the inefficiency and limitations of encryption operations in handling complex aggregation calculations. This creates a significant gap in secure and robust model training. To address this gap, we propose ByzSFL, a novel SFL system that achieves Byzantine-robust secure aggregation with high efficiency. Our approach offloads aggregation weight calculations to individual parties and introduces a practical zero-knowledge proof (ZKP) protocol toolkit. This toolkit supports widely used operators for calculating aggregation weights, ensuring correct computations without compromising data privacy. Not only does this method maintain aggregation integrity, but it also significantly boosts computational efficiency, making ByzSFL approximately 100 times faster than existing solutions. Furthermore, our method aligns with open-source AI trends, enabling plaintext publication of the final model without additional information leakage, thereby enhancing the practicality and robustness of SFL in real-world applications.

cs.CR↗

Enhancing Patient-Centric Communication: Leveraging LLMs to Simulate Patient Perspectives

Large Language Models (LLMs) have demonstrated impressive capabilities in role-playing scenarios, particularly in simulating domain-specific experts using tailored prompts. This ability enables LLMs to adopt the persona of individuals with specific backgrounds, offering a cost-effective and efficient alternative to traditional, resource-intensive user studies. By mimicking human behavior, LLMs can anticipate responses based on concrete demographic or professional profiles. In this paper, we evaluate the effectiveness of LLMs in simulating individuals with diverse backgrounds and analyze the consistency of these simulated behaviors compared to real-world outcomes. In particular, we explore the potential of LLMs to interpret and respond to discharge summaries provided to patients leaving the Intensive Care Unit (ICU). We evaluate and compare with human responses the comprehensibility of discharge summaries among individuals with varying educational backgrounds, using this analysis to assess the strengths and limitations of LLM-driven simulations. Notably, when LLMs are primed with educational background information, they deliver accurate and actionable medical guidance 88% of the time. However, when other information is provided, performance significantly drops, falling below random chance levels. This preliminary study shows the potential benefits and pitfalls of automatically generating patient-specific health information from diverse populations. While LLMs show promise in simulating health personas, our results highlight critical gaps that must be addressed before they can be reliably used in clinical settings. Our findings suggest that a straightforward query-response model could outperform a more tailored approach in delivering health information. This is a crucial first step in understanding how LLMs can be optimized for personalized health communication while maintaining accuracy.

cs.AI↗

Group Sparse-based Tensor CP Decomposition: Model, Algorithms, and Applications in Chemometrics

The CANDECOMP/PARAFAC (or Canonical polyadic, CP) decomposition of tensors has numerous applications in various fields, such as chemometrics, signal processing, machine learning, etc. Tensor CP decomposition assumes the knowledge of the exact CP rank, i.e., the total number of rank-one components of a tensor. However, accurately estimating the CP rank is very challenging. In this work, to address this issue, we prove that the CP rank can be exactly estimated by minimizing the group sparsity of any one of the factor matrices under the unit length constraints on the columns of the other factor matrices. Based on this result, we propose a CP decomposition model with group sparse regularization, which integrates the rank estimation and the tensor decomposition as an optimization problem, whose set of optimal solutions is proved to be nonempty. To solve the proposed model, we propose a double-loop block-coordinate proximal gradient descent algorithm with extrapolation and prove that each accumulation point of the sequence generated by the algorithm is a stationary point of the proposed model. Furthermore, we incorporate a rank reduction strategy into the algorithm to reduce the computational complexity. Finally, we apply the proposed model and algorithms to the component separation problem in chemometrics using real data. Numerical experiments demonstrate the robustness and effectiveness of the proposed methods.

math.NA↗

ACE: Anti-Editing Concept Erasure in Text-to-Image Models

Recent advance in text-to-image diffusion models have significantly facilitated the generation of high-quality images, but also raising concerns about the illegal creation of harmful content, such as copyrighted images. Existing concept erasure methods achieve superior results in preventing the production of erased concept from prompts, but typically perform poorly in preventing undesired editing. To address this issue, we propose an Anti-Editing Concept Erasure (ACE) method, which not only erases the target concept during generation but also filters out it during editing. Specifically, we propose to inject the erasure guidance into both conditional and the unconditional noise prediction, enabling the model to effectively prevent the creation of erasure concepts during both editing and generation. Furthermore, a stochastic correction guidance is introduced during training to address the erosion of unrelated concepts. We conducted erasure editing experiments with representative editing methods (i.e., LEDITS++ and MasaCtrl) to erase IP characters, and the results indicate that our ACE effectively filters out target concepts in both types of edits. Additional experiments on erasing explicit concepts and artistic styles further demonstrate that our ACE performs favorably against state-of-the-art methods. Our code will be publicly available at https://github.com/120L020904/ACE.

cs.CV↗