arXiv subjects

Yue Wu

Publications and source records attributed to Yue Wu.

At least 181 records · Page 10Linked to original sources

arXiv2025

Explicit positivity preserving numerical method for linear stochastic volatility models driven by $α$-stable process

In this paper, we introduce a linear stochastic volatility model driven by $α$-stable processes, which admits a unique positive solution. To preserve positivity, we modify the classical forward Euler-Maruyama scheme and analyze its numerical properties. The scheme achieves a strong convergence order of $1/α$. Numerical simulations are presented at the end to verify theoretical results.

math.PR↗

arXiv2025

Projected Langevin Monte Carlo algorithms in non-convex and super-linear setting

It is of significant interest in many applications to sample from a high-dimensional target distribution $π$ with the density $π(\text{d} x) \propto e^{-U(x)} (\text{d} x) $, based on the temporal discretization of the Langevin stochastic differential equations (SDEs). In this paper, we propose an explicit projected Langevin Monte Carlo (PLMC) algorithm with non-convex potential $U$ and super-linear gradient of $U$ and investigate the non-asymptotic analysis of its sampling error in total variation distance. Equipped with time-independent regularity estimates for the associated Kolmogorov equation, we derive the non-asymptotic bounds on the total variation distance between the target distribution of the Langevin SDEs and the law induced by the PLMC scheme with order $\mathcal{O}(d^{\max\{3γ/2 , 2γ-1 \}} h |\ln h|)$, where $d$ is the dimension of the target distribution and $γ\geq 1$ characterizes the growth of the gradient of $U$. In addition, if the gradient of $U$ is globally Lipschitz continuous, an improved convergence order of $\mathcal{O}(d^{3/2} h)$ for the classical Langevin Monte Carlo (LMC) scheme is derived with a refinement of the proof based on Malliavin calculus techniques. To achieve a given precision $ε$, the smallest number of iterations of the PLMC algorithm is proved to be of order ${\mathcal{O}}\big(\tfrac{d^{\max\{3γ/2 , 2γ-1 \}}}ε \ \cdot \ln (\tfrac{d}ε) \cdot \ln (\tfrac{1}ε) \big)$. In particular, the classical Langevin Monte Carlo (LMC) scheme with the non-convex potential $U$ and the globally Lipschitz gradient of $U$ can be guaranteed by order ${\mathcal{O}}\big(\tfrac{d^{3/2}}ε \cdot \ln (\tfrac{1}ε) \big)$. Numerical experiments are provided to confirm the theoretical findings.

math.NA↗

arXiv2025

Randomised Euler-Maruyama method for SDEs with Hölder continuous drift coefficient

In this paper, we examine the performance of randomised Euler-Maruyama (EM) method for additive time-inhomogeneous SDEs with an irregular drift. In particular, the drift is assumed to be $α$-Hölder continuous in time and bounded $β$-Hölder continuous in space with $α,β\in (0,1]$. The strong order of convergence of the randomised EM in $L^p$-norm is shown to be $1/2+(α\wedge (β/2))-ε$ for an arbitrary $ε\in (0,1/2)$, higher than the one of standard EM, which is $α\wedge (1/2+β/2-ε)$. The proofs highly rely on the stochastic sewing lemma, where we also provide an alternative proof when handling time irregularity for a comparison.

math.PR↗

arXiv2025

T2V-CompBench: A Comprehensive Benchmark for Compositional Text-to-video Generation

Text-to-video (T2V) generative models have advanced significantly, yet their ability to compose different objects, attributes, actions, and motions into a video remains unexplored. Previous text-to-video benchmarks also neglect this important ability for evaluation. In this work, we conduct the first systematic study on compositional text-to-video generation. We propose T2V-CompBench, the first benchmark tailored for compositional text-to-video generation. T2V-CompBench encompasses diverse aspects of compositionality, including consistent attribute binding, dynamic attribute binding, spatial relationships, motion binding, action binding, object interactions, and generative numeracy. We further carefully design evaluation metrics of multimodal large language model (MLLM)-based, detection-based, and tracking-based metrics, which can better reflect the compositional text-to-video generation quality of seven proposed categories with 1400 text prompts. The effectiveness of the proposed metrics is verified by correlation with human evaluations. We also benchmark various text-to-video generative models and conduct in-depth analysis across different models and various compositional categories. We find that compositional text-to-video generation is highly challenging for current models, and we hope our attempt could shed light on future research in this direction.

cs.CV↗

arXiv2025

Order-one explicit approximations of random periodic solutions of semi-linear SDEs with multiplicative noise

This paper is devoted to order-one explicit approximations of random periodic solutions to multiplicative noise driven stochastic differential equations (SDEs) with non-globally Lipschitz coefficients. The existence of the random periodic solution is demonstrated as the limit of the pull-back of the discretized SDE. A novel approach is introduced to analyze mean-square error bounds of the proposed scheme that does not depend on a prior high-order moment bounds of the numerical approximations. Under mild assumptions, the proposed scheme is proved to achieve an expected order-one mean square convergence in the infinite time horizon. Numerical examples are finally provided to verify the theoretical results.

math.PR↗

arXiv2024

Energy stable neural network for gradient flow equations

We propose an energy stable network (EStable-Net) for solving gradient flow equations. The EStable-Net enables decreasing of a discrete energy along the neural network, which is consistent with the property of the gradient flow equation. The architecture of the neural network EStable-Net is based on the block network structure (Autoflow) in which output of each block can be interpreted as an intermediate state of the evolution process of the equation, and the energy stable property is incorporated in each block, which is easily generalized to include other physical and/or numerical properties. Our EStable-Net is a supervised learning network approach for solving evolution equations which does not depend on the convergence of time step goes to 0, and can be applied generally even when only data is available but the equation is unknown. We also propose a training strategy for supervised learning that employs data of the evolution stages with different nature. The EStable-Net is validated by numerical experimental results based on the Allen-Cahn equation and the Cahn-Hilliard equation in two dimensions.

cs.LG↗

arXiv2024

OCTCube-M: A 3D multimodal optical coherence tomography foundation model for retinal and systemic diseases with cross-cohort and cross-device validation

We present OCTCube-M, a 3D OCT-based multi-modal foundation model for jointly analyzing OCT and en face images. OCTCube-M first developed OCTCube, a 3D foundation model pre-trained on 26,685 3D OCT volumes encompassing 1.62 million 2D OCT images. It then exploits a novel multi-modal contrastive learning framework COEP to integrate other retinal imaging modalities, such as fundus autofluorescence and infrared retinal imaging, into OCTCube, efficiently extending it into multi-modal foundation models. OCTCube achieves best performance on predicting 8 retinal diseases, demonstrating strong generalizability on cross-cohort, cross-device and cross-modality prediction. OCTCube can also predict cross-organ nodule malignancy (CT) and low cardiac ejection fraction as well as systemic diseases, such as diabetes and hypertension, revealing its wide applicability beyond retinal diseases. We further develop OCTCube-IR using COEP with 26,685 OCT and IR image pairs. OCTCube-IR can accurately retrieve between OCT and IR images, allowing joint analysis between 3D and 2D retinal imaging modalities. Finally, we trained a tri-modal foundation model OCTCube-EF from 4 million 2D OCT images and 400K en face retinal images. OCTCube-EF attains the best performance on predicting the growth rate of geographic atrophy (GA) across datasets collected from 6 multi-center global trials conducted in 23 countries. This improvement is statistically equivalent to running a clinical trial with more than double the size of the original study. Our analysis based on another retrospective case study reveals OCTCube-EF's ability to avoid false positive Phase-III results according to its accurate treatment effect estimation on the Phase-II results. In sum, OCTCube-M is a 3D multi-modal foundation model framework that integrates OCT and other retinal imaging modalities revealing substantial diagnostic and prognostic benefits.

eess.IV↗

arXiv2024

Semantically Grounded QFormer for Efficient Vision Language Understanding

General purpose Vision Language Models (VLMs) have received tremendous interest in recent years, owing to their ability to learn rich vision-language correlations as well as their broad zero-shot competencies. One immensely popular line of work utilizes frozen unimodal models, by bridging vision representations to language using a trainable module called the QFormer. However, this method relies heavily on large-scale multimodal pretraining with huge computational overheads. To that end, we propose a more efficient framework for QFormer-based vision-language alignment. Our key idea relies on the observation that QFormer latents correspond more strongly to the frozen LLM's intermediate latent space. Consequently, instead of using QFormer latents as inputs to the LLM, we alter the framework by using the latents to directly condition the LLM latent space for image-to-text generation. We demonstrate the effectiveness of our approach against existing baselines in improving the efficiency of vision-language pretraining.

cs.CV↗

arXiv2024

Phi-4 Technical Report

We present phi-4, a 14-billion parameter language model developed with a training recipe that is centrally focused on data quality. Unlike most language models, where pre-training is based primarily on organic data sources such as web content or code, phi-4 strategically incorporates synthetic data throughout the training process. While previous models in the Phi family largely distill the capabilities of a teacher model (specifically GPT-4), phi-4 substantially surpasses its teacher model on STEM-focused QA capabilities, giving evidence that our data-generation and post-training techniques go beyond distillation. Despite minimal changes to the phi-3 architecture, phi-4 achieves strong performance relative to its size -- especially on reasoning-focused benchmarks -- due to improved data, training curriculum, and innovations in the post-training scheme.

cs.CL↗

arXiv2024

LINKs: Large Language Model Integrated Management for 6G Empowered Digital Twin NetworKs

In the rapidly evolving landscape of digital twins (DT) and 6G networks, the integration of large language models (LLMs) presents a novel approach to network management. This paper explores the application of LLMs in managing 6G-empowered DT networks, with a focus on optimizing data retrieval and communication efficiency in smart city scenarios. The proposed framework leverages LLMs for intelligent DT problem analysis and radio resource management (RRM) in fully autonomous way without any manual intervention. Our proposed framework -- LINKs, builds up a lazy loading strategy which can minimize transmission delay by selectively retrieving the relevant data. Based on the data retrieval plan, LLMs transform the retrieval task into an numerical optimization problem and utilizing solvers to build an optimal RRM, ensuring efficient communication across the network. Simulation results demonstrate the performance improvements in data planning and network management, highlighting the potential of LLMs to enhance the integration of DT and 6G technologies.

cs.NI↗

arXiv2024

The random periodic solutions for McKean-Vlasov stochastic differential equations

In this paper, we study well-posedness of random periodic solutions of stochastic differential equations (SDEs) of McKean-Vlasov type driven by a two-sided Brownian motion, where the random periodic behaviour is characterised by the equations' long-time behaviour. Given the well-known connection between McKean-Vlasov SDEs and interacting particle systems, we show propagation of chaos and that the key properties of the interacting particle systems recover those of the McKean-Vlasov SDEs in the particle limit. All results in the present work are shown under two settings: fully and partially dissipative case. Each setting has its challenges and limitations. For instance, weakening full dissipativity to partial dissipativity demands stronger structural assumptions on the equations' dynamics and yields random periodic behaviour in the weak sense instead of pathwise sense (as in the full dissipativity case). The proof mechanisms are close but fundamentally different.

math.PR↗

arXiv2024

Electrical contact with dielectric breakdown of interfacial gap

Electrical contact is fundamental to almost every aspect of modern industry, including the fast-growing electric vehicle industry. In metallic contacts in atmospheric conditions, most of the electrical current passes via the micro-junctions formed between two electrodes. The classic electrical contact theory predicts an infinite current density at the circular contact periphery. In the present work, we explore the influence of the dielectric breakdown of air outside the contact area on the electrical contact interface. Incorporating the discharging boundary condition governed by the modified Paschen law, we develop the numerical model as well as two sets of closed-form solutions for low applied voltage cases where two electrodes are in solid-solid contact and complete separation, respectively. For Hertzian contact, the present work theoretically proves that the ignorance of discharge can lead to a singular current density at the contact periphery and an overestimation of the electrical contact resistance. The current density monotonically increases along the radial direction to a finite value at the contact area periphery, followed by a monotonic drop within the discharge zone. The present study serves as a foundation for the modeling of discharging rough surface electrical contact and sheds light on the machine element surface damages caused by the electrical discharge machining.

cond-mat.soft↗

arXiv2024

A projected Euler Method for Random Periodic Solutions of Semi-linear SDEs with non-globally Lipschitz coefficients

The present work introduces and investigates an explicit time discretization scheme, called the projected Euler method,to numerically approximate random periodic solutions of semi-linear SDEs under non-globally Lipschitz conditions. The existence of the random periodic solution is demonstrated as the limit of the pull-back of the discretized SDE. Without relying on a priori high-order moment bounds of the numerical approximations, the mean square convergence rate of the approximation scheme is proved to be order $0.5$ for SDEs with multiplicative noise and order $1$ for SDEs with additive noise. Numerical examples are also provided to validate our theoretical findings.

math.NA↗

arXiv2024

Delving into the Reversal Curse: How Far Can Large Language Models Generalize?

While large language models (LLMs) showcase unprecedented capabilities, they also exhibit certain inherent limitations when facing seemingly trivial tasks. A prime example is the recently debated "reversal curse", which surfaces when models, having been trained on the fact "A is B", struggle to generalize this knowledge to infer that "B is A". In this paper, we examine the manifestation of the reversal curse across various tasks and delve into both the generalization abilities and the problem-solving mechanisms of LLMs. This investigation leads to a series of significant insights: (1) LLMs are able to generalize to "B is A" when both A and B are presented in the context as in the case of a multiple-choice question. (2) This generalization ability is highly correlated to the structure of the fact "A is B" in the training documents. For example, this generalization only applies to biographies structured in "[Name] is [Description]" but not to "[Description] is [Name]". (3) We propose and verify the hypothesis that LLMs possess an inherent bias in fact recalling during knowledge application, which explains and underscores the importance of the document structure to successful learning. (4) The negative impact of this bias on the downstream performance of LLMs can hardly be mitigated through training alone. These findings offer a novel perspective on interpreting LLMs' generalization through their intrinsic mechanisms and provide insights for developing more effective learning methods. Our code and data are available at https://github.com/alibaba/thinking_bias.git.

cs.CL↗

arXiv2024

Distribution of plastics of various sizes and densities in the global ocean from a 3D Eulerian model

We develop a 3D Eulerian model to study the transport and distribution of microplastics in the global ocean. Among other benefits that will be discussed in the paper, one unique feature of our model is that it takes into consideration the effect of properties of particles (size and density, the former for the first time) to their vertical terminal velocity. With ocean current velocity taken from ECCOv4r4, a dataset generated from a data-assimilated MITgcm reanalysis, our model is integrated for 26 years for particles of different properties with their stationary patterns studied. We find that only low-density particles with sufficient size (e.g. density $900kg/m^3$ with size $\gtrsim 10 μm$) aggregate in the five subtropical gyres observed in previous studies. In contrast, particles of smaller size ($\sim 1 μm$), irrespective of their density, behave like neutrally buoyant particles with a weaker pattern on the surface and a deeper penetration into depth (up to about 1km deep). In addition, we observe seasonal variations of floating particle concentration on the ocean surface, which reasonably agree with the satellite observation by Cyclone Global Navigation Satellite System (CYGNSS) in terms of the phase of the variation. We find that the seasonal variation of the surface particle concentration correlates well with the variation of the mixing layer (ML) depth globally, due to an almost uniform vertical distribution of particles in the ML with total amount of particles conserved.

physics.ao-ph↗

arXiv2024

Hybrid Precoding with Per-Beam Timing Advance for Asynchronous Cell-free mmWave Massive MIMO-OFDM Systems

Cell-free massive multiple-input-multiple-output (CF-mMIMO) is regarded as one of the promising technologies for next-generation wireless networks. However, due to its distributed architecture, geographically separated access points (APs) jointly serve a large number of user-equipments (UEs), there will inevitably be a discrepancies in the arrival time of transmitted signals. In this paper, we investigate millimeter-wave (mmWave) CF-mMIMO orthogonal frequency division multiplexing (OFDM) systems with asynchronous reception in a wide area coverage scenario, where asynchronous timing offsets may extend far beyond the cyclic prefix (CP) range. A comprehensive asynchronous beam-domain signal transmission model is presented for mmWave CF-mMIMO-OFDM systems in both downlink and uplink, incorporating phase offset, inter-carrier interference (ICI) and inter-symbol interference (ISI). To address the issue of asynchronous reception, we propose a novel per-beam timing advance (PBTA) hybrid precoding architecture and analyze the spectral efficiency (SE) in the beam domain for downlink and uplink asynchronous receptions. Both scalable centralized and distributed implementations are taken into account, and the asynchronous delay phase is utilized to design precoding/combining vectors. Furthermore, we formulate the sum rate maximization problem and develop two low-complexity joint beam selection and UE association algorithms considering the impact of asynchronous timing offset exceeding the CP range. Simulation results demonstrate that the performance will be severely limited by ICI and ISI, and our proposed PBTA hybrid precoding architecture effectively mitigates asynchronous interference compared to the nearest AAU/UE-based timing-advance scheme. Additionally, numerical results show that our proposed low-complexity joint beam selection and UE association algorithms achieve superior SE performance.

eess.SP↗

arXiv2024

Enhancing LLM's Cognition via Structurization

When reading long-form text, human cognition is complex and structurized. While large language models (LLMs) process input contexts through a causal and sequential perspective, this approach can potentially limit their ability to handle intricate and complex inputs effectively. To enhance LLM's cognition capability, this paper presents a novel concept of context structurization. Specifically, we transform the plain, unordered contextual sentences into well-ordered and hierarchically structurized elements. By doing so, LLMs can better grasp intricate and extended contexts through precise attention and information-seeking along the organized structures. Extensive evaluations are conducted across various model architectures and sizes (including a series of auto-regressive LLMs as well as BERT-like masking models) on a diverse set of NLP tasks (e.g., context-based question-answering, exhaustive hallucination evaluation, and passage-level dense retrieval). Empirical results show consistent and significant performance gains afforded by a single-round structurization. In particular, we boost the open-sourced LLaMA2-70B model to achieve comparable performance against GPT-3.5-Turbo as the hallucination evaluator. Besides, we show the feasibility of distilling advanced LLMs' language processing abilities to a smaller yet effective StruXGPT-7B to execute structurization, addressing the practicality of our approach. Code is available at https://github.com/alibaba/struxgpt.

cs.CL↗

arXiv2024

PrivacyMind: Large Language Models Can Be Contextual Privacy Protection Learners

The proliferation of Large Language Models (LLMs) has driven considerable interest in fine-tuning them with domain-specific data to create specialized language models. Nevertheless, such domain-specific fine-tuning data often contains contextually sensitive personally identifiable information (PII). Direct fine-tuning of LLMs on this data without privacy protection poses a risk of data leakage of sensitive PII during inference time. To address this challenge, we introduce Contextual Privacy Protection Language Models (PrivacyMind), a novel paradigm for fine-tuning LLMs that effectively injects domain-specific knowledge while safeguarding inference-time data privacy. Our work offers a theoretical analysis for model design and benchmarks various techniques such as corpus curation, penalty-based unlikelihood in training loss, instruction-based tuning, etc. Extensive experiments across diverse datasets and scenarios demonstrate the effectiveness of our approaches. In particular, instruction tuning with both positive and negative examples stands out as a promising method, effectively protecting private data while enhancing the model's knowledge. Our work underscores the potential for Large Language Models as robust contextual privacy protection learners. The complete code and data for the work can be found at https://github.com/Yijia-Xiao/PrivacyMind.

cs.CL↗