arXiv subjects

Wei Wu

Publications and source records attributed to Wei Wu.

At least 199 records · Page 11Linked to original sources

arXiv2025

Molecule-dynamic-based Aging Clock and Aging Roadmap Forecast with Sundial

Addressing the unavoidable bias inherent in supervised aging clocks, we introduce Sundial, a novel framework that models molecular dynamics through a diffusion field, capturing both the population-level aging process and the individual-level relative aging order. Sundial enables unbiasedestimation of biological age and the forecast of aging roadmap. Fasteraging individuals from Sundial exhibit a higher disease risk compared to those identified from supervised aging clocks. This framework opens new avenues for exploring key topics, including age- and sex-specific aging dynamics and faster yet healthy aging paths.

q-bio.QM↗

arXiv2025

Unconventional Coherence Peak in Cuprate Superconductors

The Hebel-Slichter coherence peak, observed in the spin-lattice relaxation rate $1/T_1$ just below the critical temperature $T_{\rm c}$, serves as a crucial experimental validation of the Bardeen-Cooper-Schrieffer pairing symmetry in conventional superconductors. However, no coherence peak in $1/T_1$ has been observed in unconventional superconductors like cuprates. In this study, an unconventional coherence peak is identified for the first time using nuclear quadrupole resonance on YBa$_2$Cu$_4$O$_8$, pointing to a distinctive pairing symmetry. The spin-lattice relaxation rate in nuclear quadrupole resonance and nuclear magnetic resonance with nuclear spin $I>1/2$ comprises the magnetic relaxation rate $1/T_{1}^{\rm mag}$, which probes magnetic fluctuations, and the quadrupole relaxation rate $1/T_{1}^{\rm quad}$, which probes charge fluctuations. By utilizing $^{63}$Cu and $^{65}$Cu isotopes, we successfully distinguish $1/T_{1}^{\rm mag}$ and $1/T_{1 }^{\rm quad}$ of YBa$_2$Cu$_4$O$_8$ and reveal the presence of the coherence peak in $1/T_{1 }^{\rm quad}$ but not in $1/T_{1}^{\rm mag}$, in contrast to conventional superconductors. Our finding demonstrates that unconventional superconductors do not exhibit a coherence peak in $1/T_{1}$ when the relaxation is due to fluctuations of the hyperfine field. Conversely, a coherence peak is expected when the relaxation is caused by electric field gradient fluctuations, due to the different coherence factors between charge and magnetic fluctuations. Our successful measurements of $1/T_{1}$ for the chains of YBa$_2$Cu$_4$O$_8$ suggest that, should the conditions for predominant quadrupole relaxation be satisfied, this phenomenon could provide a novel approach to exploring the unconventional nature of the pairing mechanism in other superconductors.

cond-mat.supr-con↗

arXiv2024

ProtCLIP: Function-Informed Protein Multi-Modal Learning

Multi-modality pre-training paradigm that aligns protein sequences and biological descriptions has learned general protein representations and achieved promising performance in various downstream applications. However, these works were still unable to replicate the extraordinary success of language-supervised visual foundation models due to the ineffective usage of aligned protein-text paired data and the lack of an effective function-informed pre-training paradigm. To address these issues, this paper curates a large-scale protein-text paired dataset called ProtAnno with a property-driven sampling strategy, and introduces a novel function-informed protein pre-training paradigm. Specifically, the sampling strategy determines selecting probability based on the sample confidence and property coverage, balancing the data quality and data quantity in face of large-scale noisy data. Furthermore, motivated by significance of the protein specific functional mechanism, the proposed paradigm explicitly model protein static and dynamic functional segments by two segment-wise pre-training objectives, injecting fine-grained information in a function-informed manner. Leveraging all these innovations, we develop ProtCLIP, a multi-modality foundation model that comprehensively represents function-aware protein embeddings. On 22 different protein benchmarks within 5 types, including protein functionality classification, mutation effect prediction, cross-modal transformation, semantic similarity inference and protein-protein interaction prediction, our ProtCLIP consistently achieves SOTA performance, with remarkable improvements of 75% on average in five cross-modal transformation benchmarks, 59.9% in GO-CC and 39.7% in GO-BP protein function prediction. The experimental results verify the extraordinary potential of ProtCLIP serving as the protein multi-modality foundation model.

cs.LG↗

arXiv2024

Revealing Physical Mechanisms of Pattern Formation and Switching in Ecosystems via Nonequilibrium Landscape and Flux

Spatial patterns are widely observed in numerous nonequilibrium natural systems, often undergoing complex transitions and bifurcations, thereby exhibiting significant importance in many physical and biological systems such as embryonic development, ecosystem desertification, and turbulence. However, how spatial pattern formation emerges and how the spatial pattern switches are not fully understood. Here, we developed a landscape-flux field theory via the spatial mode expansion method to uncover the underlying physical mechanism of the pattern formation and switching. We identified the landscape and flux field as the driving force for spatial dynamics and applied this theory to the critical transitions between spatial vegetation patterns in semi-arid ecosystems, revealing that the nonequilibrium flux drives the switchings of spatial patterns. We uncovered how the pattern switching emerges through the optimal pathways and how fast this occurs via the speed of pattern switching. Furthermore, both the averaged flux and the entropy production rate exhibit peaks near pattern switching boundaries, revealing dynamical and thermodynamical origins for pattern transitions, and further offering early warning signals for anticipating spatial pattern switching. Our work thus reveals physical mechanisms on spatial pattern-switching in semi-arid ecosystems and, more generally, introduces a useful approach for quantifying spatial pattern switching in nonequilibrium systems, which further offers practical applications such as early warning signals for critical transitions of spatial patterns.

physics.bio-ph↗

arXiv2024

Physical Informed Driving World Model

Autonomous driving requires robust perception models trained on high-quality, large-scale multi-view driving videos for tasks like 3D object detection, segmentation and trajectory prediction. While world models provide a cost-effective solution for generating realistic driving videos, challenges remain in ensuring these videos adhere to fundamental physical principles, such as relative and absolute motion, spatial relationship like occlusion and spatial consistency, and temporal consistency. To address these, we propose DrivePhysica, an innovative model designed to generate realistic multi-view driving videos that accurately adhere to essential physical principles through three key advancements: (1) a Coordinate System Aligner module that integrates relative and absolute motion features to enhance motion interpretation, (2) an Instance Flow Guidance module that ensures precise temporal consistency via efficient 3D flow extraction, and (3) a Box Coordinate Guidance module that improves spatial relationship understanding and accurately resolves occlusion hierarchies. Grounded in physical principles, we achieve state-of-the-art performance in driving video generation quality (3.96 FID and 38.06 FVD on the Nuscenes dataset) and downstream perception tasks. Our project homepage: https://metadrivescape.github.io/papers_project/DrivePhysica/page.html

cs.CV↗

arXiv2024

Flash Communication: Reducing Tensor Parallelization Bottleneck for Fast Large Language Model Inference

The ever-increasing sizes of large language models necessitate distributed solutions for fast inference that exploit multi-dimensional parallelism, where computational loads are split across various accelerators such as GPU clusters. However, this approach often introduces significant communication overhead, especially on devices with limited bandwidth. In this paper, we introduce Flash Communication, a novel low-bit compression technique designed to alleviate the tensor-parallelism communication bottleneck during inference. Our method substantially boosts intra-node communication speed by more than 3x and reduces the time-to-first-token by 2x, with nearly no sacrifice in model accuracy. Extensive experiments on various up-to-date LLMs demonstrate the effectiveness of our approach.

cs.AI↗

arXiv2024

InfinityDrive: Breaking Time Limits in Driving World Models

Autonomous driving systems struggle with complex scenarios due to limited access to diverse, extensive, and out-of-distribution driving data which are critical for safe navigation. World models offer a promising solution to this challenge; however, current driving world models are constrained by short time windows and limited scenario diversity. To bridge this gap, we introduce InfinityDrive, the first driving world model with exceptional generalization capabilities, delivering state-of-the-art performance in high fidelity, consistency, and diversity with minute-scale video generation. InfinityDrive introduces an efficient spatio-temporal co-modeling module paired with an extended temporal training strategy, enabling high-resolution (576$\times$1024) video generation with consistent spatial and temporal coherence. By incorporating memory injection and retention mechanisms alongside an adaptive memory curve loss to minimize cumulative errors, achieving consistent video generation lasting over 1500 frames (more than 2 minutes). Comprehensive experiments in multiple datasets validate InfinityDrive's ability to generate complex and varied scenarios, highlighting its potential as a next-generation driving world model built for the evolving demands of autonomous driving. Our project homepage: https://metadrivescape.github.io/papers_project/InfinityDrive/page.html

cs.CV↗

arXiv2024

Low-temperature Quantum Metrology Enhanced by Strong Couplings

Equilibrium probes have been widely used in various noisy quantum metrology schemes. However, such an equilibrium-probe-based metrology scenario severely suffers from the low-temperature-error divergence problem in the weak-coupling regime. To circumvent this limit, we propose a strategy to eliminate the error-divergence problem by utilizing the strong coupling effects, which can be captured by the reaction-coordinate mapping. The strong couplings induce a noncanonical equilibrium state and greatly enhance the metrology performance. It is found that our metrology precision behaves as a polynomial-type scaling relation, which suggests the reduction of temperature can be used as a resource to improve the metrology performance. Our result is sharply contrary to that of the weakcoupling case, in which the metrology precision exponentially decays as the temperature decreases. Paving a way to realize a high-precision noisy quantum metrology at low temperatures, our result reveals the importance of the non-Markovianity in quantum technologies.

quant-ph↗

arXiv2024

Steering Large Text-to-Image Model for Abstract Art Synthesis: Preference-based Prompt Optimization and Visualization

With the advancement of neural generative capabilities, the art community has increasingly embraced GenAI (Generative Artificial Intelligence), particularly large text-to-image models, for producing aesthetically compelling results. However, the process often lacks determinism and requires a tedious trial-and-error process as users often struggle to devise effective prompts to achieve their desired outcomes. This paper introduces a prompting-free generative approach that applies a genetic algorithm and real-time iterative human feedback to optimize prompt generation, enabling the creation of user-preferred abstract art through a customized Artist Model. The proposed two-part approach begins with constructing an Artist Model capable of deterministically generating abstract art in specific styles, e.g., Kandinsky's Bauhaus style. The second phase integrates real-time user feedback to optimize the prompt generation and obtains an Optimized Prompting Model, which adapts to user preferences and generates prompts automatically. When combined with the Artist Model, this approach allows users to create abstract art tailored to their personal preferences and artistic style.

cs.HC↗

arXiv2024

Observation of quantum strong Mpemba effect

An ancient and counterintuitive phenomenon know as the Mpemba effect (water can cool faster when initially heated up) showcases the critical role of initial conditions in relaxation processes. How to realize and utilize this effect for speeding up relaxation is an important but challenging task in purely quantum system till now. Here, we report the first experiment, as far as we know,about the strong Mpemba effect in a single trapped ion system in which an exponentially expedited relaxation in time is observed by preparing an optimal initial state with no excitation of the slowest decaying mode. Also, we find that the condition of realizing such effect coincides with the Liouvillian exceptional point, featuring the coalescence of both the eigenvalues and the eigenmodes of the system. Our work provides an efficient strategy to exponentially accelerate relaxations of quantum system to their stationary state, and suggests a link unexplored yet between the Mpemba effect and the non-Hermitian physics. It could open up the door to engineer a wide range of dissipative quantum systems by utilizing the anomalous Mpemba effect, for applications in quantum simulation and quantum information processing.

quant-ph↗

arXiv2024

LoTLIP: Improving Language-Image Pre-training for Long Text Understanding

Understanding long text is of great demands in practice but beyond the reach of most language-image pre-training (LIP) models. In this work, we empirically confirm that the key reason causing such an issue is that the training images are usually paired with short captions, leaving certain tokens easily overshadowed by salient tokens. Towards this problem, our initial attempt is to relabel the data with long captions, however, directly learning with which may lead to performance degradation in understanding short text (e.g., in the image classification task). Then, after incorporating corner tokens to aggregate diverse textual information, we manage to help the model catch up to its original level of short text understanding yet greatly enhance its capability of long text understanding. We further look into whether the model can continuously benefit from longer captions and notice a clear trade-off between the performance and the efficiency. Finally, we validate the effectiveness of our approach using a self-constructed large-scale dataset, which consists of 100M long caption oriented text-image pairs. Our method demonstrates superior performance in long-text-image retrieval tasks. The project page is available at https://wuw2019.github.io/lot-lip.

cs.CV↗

arXiv2024

IRS-Enhanced Secure Semantic Communication Networks: Cross-Layer and Context-Awared Resource Allocation

Learning-task oriented semantic communication is pivotal in optimizing transmission efficiency by extracting and conveying essential semantics tailored to specific tasks, such as image reconstruction and classification. Nevertheless, the challenge of eavesdropping poses a formidable threat to semantic privacy due to the open nature of wireless communications. In this paper, intelligent reflective surface (IRS)-enhanced secure semantic communication (IRS-SSC) is proposed to guarantee the physical layer security from a task-oriented semantic perspective. Specifically, a multi-layer codebook is exploited to discretize continuous semantic features and describe semantics with different numbers of bits, thereby meeting the need for hierarchical semantic representation and further enhancing the transmission efficiency. Novel semantic security metrics, i.e., secure semantic rate (S-SR) and secure semantic spectrum efficiency (S-SSE), are defined to map the task-oriented security requirements at the application layer into the physical layer. To achieve artificial intelligence (AI)-native secure communication, we propose a noise disturbance enhanced hybrid deep reinforcement learning (NdeHDRL)-based resource allocation scheme. This scheme dynamically maximizes the S-SSE by jointly optimizing the bits for semantic representations, reflective coefficients of the IRS, and the subchannel assignment. Moreover, we propose a novel semantic context awared state space (SCA-SS) to fusion the high-dimensional semantic space and the observable system state space, which enables the agent to perceive semantic context and solves the dimensional catastrophe problem. Simulation results demonstrate the efficiency of our proposed schemes in both enhancing the security performance and the S-SSE compared to several benchmark schemes.

cs.IT↗

arXiv2024

Bridge-IF: Learning Inverse Protein Folding with Markov Bridges

Inverse protein folding is a fundamental task in computational protein design, which aims to design protein sequences that fold into the desired backbone structures. While the development of machine learning algorithms for this task has seen significant success, the prevailing approaches, which predominantly employ a discriminative formulation, frequently encounter the error accumulation issue and often fail to capture the extensive variety of plausible sequences. To fill these gaps, we propose Bridge-IF, a generative diffusion bridge model for inverse folding, which is designed to learn the probabilistic dependency between the distributions of backbone structures and protein sequences. Specifically, we harness an expressive structure encoder to propose a discrete, informative prior derived from structures, and establish a Markov bridge to connect this prior with native sequences. During the inference stage, Bridge-IF progressively refines the prior sequence, culminating in a more plausible design. Moreover, we introduce a reparameterization perspective on Markov bridge models, from which we derive a simplified loss function that facilitates more effective training. We also modulate protein language models (PLMs) with structural conditions to precisely approximate the Markov bridge process, thereby significantly enhancing generation performance while maintaining parameter-efficient training. Extensive experiments on well-established benchmarks demonstrate that Bridge-IF predominantly surpasses existing baselines in sequence recovery and excels in the design of plausible proteins with high foldability. The code is available at https://github.com/violet-sto/Bridge-IF.

cs.LG↗

arXiv2024

SMART: Scalable Multi-agent Real-time Motion Generation via Next-token Prediction

Data-driven autonomous driving motion generation tasks are frequently impacted by the limitations of dataset size and the domain gap between datasets, which precludes their extensive application in real-world scenarios. To address this issue, we introduce SMART, a novel autonomous driving motion generation paradigm that models vectorized map and agent trajectory data into discrete sequence tokens. These tokens are then processed through a decoder-only transformer architecture to train for the next token prediction task across spatial-temporal series. This GPT-style method allows the model to learn the motion distribution in real driving scenarios. SMART achieves state-of-the-art performance across most of the metrics on the generative Sim Agents challenge, ranking 1st on the leaderboards of Waymo Open Motion Dataset (WOMD), demonstrating remarkable inference speed. Moreover, SMART represents the generative model in the autonomous driving motion domain, exhibiting zero-shot generalization capabilities: Using only the NuPlan dataset for training and WOMD for validation, SMART achieved a competitive score of 0.72 on the Sim Agents challenge. Lastly, we have collected over 1 billion motion tokens from multiple datasets, validating the model's scalability. These results suggest that SMART has initially emulated two important properties: scalability and zero-shot generalization, and preliminarily meets the needs of large-scale real-time simulation applications. We have released all the code to promote the exploration of models for motion generation in the autonomous driving field. The source code is available at https://github.com/rainmaker22/SMART.

cs.RO↗

arXiv2024

Enhancing binary classification: A new stacking method via leveraging computational geometry

Stacking, a potent ensemble learning method, leverages a meta-model to harness the strengths of multiple base models, thereby enhancing prediction accuracy. Traditional stacking techniques typically utilize established learning models, such as logistic regression, as the meta-model. This paper introduces a novel approach that integrates computational geometry techniques, specifically solving the maximum weighted rectangle problem, to develop a new meta-model for binary classification. Our method is evaluated on multiple open datasets, with statistical analysis showing its stability and demonstrating improvements in accuracy compared to current state-of-the-art stacking methods with out-of-fold predictions. This new stacking method also boasts two significant advantages: enhanced interpretability and the elimination of hyperparameter tuning for the meta-model, thus increasing its practicality. These merits make our method highly applicable not only in stacking ensemble learning but also in various real-world applications, such as hospital health evaluation scoring and bank credit scoring systems, offering a fresh evaluation perspective.

cs.LG↗

arXiv2024

AMOR: A Recipe for Building Adaptable Modular Knowledge Agents Through Process Feedback

The notable success of large language models (LLMs) has sparked an upsurge in building language agents to complete various complex tasks. We present AMOR, an agent framework based on open-source LLMs, which reasons with external knowledge bases and adapts to specific domains through human supervision to the reasoning process. AMOR builds reasoning logic over a finite state machine (FSM) that solves problems through autonomous executions and transitions over disentangled modules. This allows humans to provide direct feedback to the individual modules, and thus naturally forms process supervision. Based on this reasoning and feedback framework, we develop AMOR through two-stage fine-tuning: warm-up and adaptation. The former fine-tunes the LLM with examples automatically constructed from various public datasets, enabling AMOR to generalize across different knowledge environments, while the latter tailors AMOR to specific domains using process feedback. Extensive experiments across multiple domains demonstrate the advantage of AMOR to strong baselines, thanks to its FSM-based reasoning and process feedback mechanism. The code and data are publicly available at \url{https://github.com/JianGuanTHU/AMOR}.

cs.CL↗

arXiv2024

A New Framework for Bayesian Function Registration

Function registration, also referred to as alignment, has been one of the fundamental problems in the field of functional data analysis. Classical registration methods such as the Fisher-Rao alignment focus on estimating optimal time warping function between functions. In recent studies, a model on time warping has attracted more attention, and it can be used as a prior term to combine with the classical method (as a likelihood term) in a Bayesian framework. The Bayesian approaches have been shown improvement over the classical methods. However, its prior model on time warping is often based a nonlinear approximation, which may introduce inaccuracy and inefficiency. To overcome these problems, we propose a new Bayesian approach by adopting a prior which provides a linear representation and various stochastic processes (Gaussian or non-Gaussian) can be effectively utilized on time warping. No linearization approximation is needed in the time warping computation, and the posterior can be obtained via a conventional Markov Chain Monte Carlo approach. We thoroughly investigate the impact of the prior on the performance of functional registration with multiple simulation examples, which demonstrate the superiority of the new framework over the previous methods. We finally utilize the new method in a real dataset and obtain desirable alignment result.

stat.ME↗

arXiv2024

2D-TPE: Two-Dimensional Positional Encoding Enhances Table Understanding for Large Language Models

Tables are ubiquitous across various domains for concisely representing structured information. Empowering large language models (LLMs) to reason over tabular data represents an actively explored direction. However, since typical LLMs only support one-dimensional~(1D) inputs, existing methods often flatten the two-dimensional~(2D) table structure into a sequence of tokens, which can severely disrupt the spatial relationships and result in an inevitable loss of vital contextual information. In this paper, we first empirically demonstrate the detrimental impact of such flattening operations on the performance of LLMs in capturing the spatial information of tables through two elaborate proxy tasks. Subsequently, we introduce a simple yet effective positional encoding method, termed ``2D-TPE'' (Two-Dimensional Table Positional Encoding), to address this challenge. 2D-TPE enables each attention head to dynamically select a permutation order of tokens within the context for attending to them, where each permutation represents a distinct traversal mode for the table, such as column-wise or row-wise traversal. 2D-TPE effectively mitigates the risk of losing essential spatial information while preserving computational efficiency, thus better preserving the table structure. Extensive experiments across five benchmarks demonstrate that 2D-TPE outperforms strong baselines, underscoring the importance of preserving the table structure for accurate table comprehension. Comprehensive analysis further reveals the substantially better scalability of 2D-TPE to large tables than baselines.

cs.CL↗