Searcharxiv⌕ Search

arXiv subjects

Yan Wu

Publications and source records attributed to Yan Wu.

At least 37 records · Page 2Linked to original sources

Universal and Parameter-free Gradient Sliding for Composite Optimization

We propose a Parameter-Free Universal Gradient Sliding (PFUGS) algorithm for computing an approximate solution to the convex composite optimization $\min_{x\in X} \{f(x) + g(x)\}$, where $f$ has $(M_ν,ν)$-Hölder continuous subgradient and $g$ has $L$-Lipschitz continuous gradient. PFUGS computes an $\varepsilon$-approximate solution with $\mathcal{O}((M_ν/\varepsilon)^{{2}/{(1+3ν)}})$ evaluations of (sub)gradients of $f$ and $\mathcal{O}((L/\varepsilon)^{1/2})$ evaluations of gradients of $g$, without prior knowledge of problem constants. To the best of our knowledge, PFUGS is the first gradient sliding algorithm for problems involving two functions whose distinct problem constants are both unknown a priori.

math.OC↗

PRiMeFlow: Capturing Complex Expression Heterogeneity in Perturbation Response Modelling

Predicting the effects of perturbations in-silico on cell state can identify drivers of cell behavior at scale and accelerate drug discovery. However, modeling challenges remain due to the inherent heterogeneity of single cell gene expression and the complex, latent gene dependencies. Here, we present PRiMeFlow, an end-to-end flow matching based approach to directly model the effects of genetic and small molecule perturbations in the gene expression space. The distribution-fitting approach taken by PRiMeFlow enables it to accurately approximate the empirical distribution of single-cell gene expression, which we demonstrate through extensive benchmarking inside PerturBench. Through ablation studies, we also validate important model design choices such as operating in gene expression space and parameterizing the velocity field with a U-Net architecture. Finally, by scaling PRiMeFlow to a broad perturbation data atlas spanning multiple datasets and employing a carefully designed pretraining-finetuning strategy, we demonstrate its outstanding performance on the H1 human embryonic stem cells from the ARC Virtual Cell Challenge benchmark.

cs.LG↗

Semantic-Contact Fields for Category-Level Generalizable Tactile Tool Manipulation

Generalizing tool manipulation requires both semantic planning and precise physical control. Modern generalist robot policies, such as Vision-Language-Action (VLA) models, often lack the physical grounding required for contact-rich tool manipulation. Conversely, existing contact-aware policies that leverage tactile or haptic sensing are typically instance-specific and fail to generalize across diverse tool geometries. Bridging this gap requires learning representations that are both semantically transferable and physically grounded, yet a fundamental barrier remains: diverse real-world tactile data are prohibitive to collect at scale, while direct zero-shot sim-to-real transfer is challenging due to the complex nonlinear deformation of soft tactile sensors. To address this, we propose Semantic-Contact Fields (SCFields), a unified 3D representation that fuses visual semantics with dense extrinsic contact estimates, including contact probability and force. SCFields is learned through a two-stage Sim-to-Real Contact Learning Pipeline: we first pre-train on large-scale simulation to learn geometry-aware contact priors, then fine-tune on a small set of real data pseudo-labeled via geometric heuristics and force optimization to align real tactile signals. The resulting force-aware representation serves as the dense observation input to a diffusion policy, enabling physical generalization to unseen tool instances. Experiments on scraping, crayon drawing, and peeling demonstrate robust category-level generalization, significantly outperforming vision-only and raw-tactile baselines. Project page: https://kevinskwk.github.io/SCFields/.

cs.RO↗

Turbo Receiver Design for Differentially Encoded PSK in Bursty Impulsive Noise Channels

It has been recognized that the impulsive noise (IN) generated by power devices poses significant challenges to wireless receivers. In this paper, we comprehensively assess the achievable information rate (AIR) for the well-established Markov-Middleton IN model with a phase-shift keying (PSK) input sequence across various channel conditions, including matched and mismatched decoding scenarios. Upon determining information-theoretic bounds, we propose an optimal turbo-differentially encoded (DE)-PSK-IN receiver design based on a commonly used commercial transmission setup consisting of a convolutional encoder, bit-level interleaver, and a DE-PSK symbol mapper. We show that by incorporating the differential decoder into the maximum a-posteriori-based (MAP) IN detector, we can significantly enhance the receiver performance with a 4.5 dB gain compared to the conventional MAP-based turbo-PSK-IN receiver and a gap of around 1 dB to the theoretical bounds. We also propose a suboptimal separate receiver design that can be implemented with half the complexity of the joint design and near-optimal performance. We have evaluated the performance of the proposed receiver designs through extensive simulations, demonstrating their effectiveness in real-world scenarios with limited interleaver depth and mismatched state implementation.

cs.IT↗

A Note on the Gradient-Evaluation Sequence in Accelerated Gradient Methods

Nesterov's accelerated gradient descent method (AGD) is a seminal deterministic first-order method known to achieve the optimal order of iteration complexity for solving convex smooth optimization problems. Two distinct sequences of iterates are included in the description of AGD: gradient evaluations are performed at one sequence, while approximate solutions are selected from the other. The iteration complexity on minimizing objective function value has been well-studied in the literature, but such analysis is almost always performed only at the approximate solution sequence. To the best of our knowledge, for projection-based AGD that solves problems with feasible sets, it is still an open research question whether the gradient evaluation sequence (when treated as approximate solutions) could also achieve the same optimal order of iteration complexity. It is also unknown whether such results still hold in the non-Euclidean setting. Motivated by computer-aided algorithm analysis, we provide positive results that answer the open problems affirmatively. Specifically, for (possibly constrained) problem $f^*:=\min_{x\in X}f(x)$ where $f$ is convex and $L$-smooth and $X$ is closed, convex and projection friendly, we prove that the gradient-evaluation sequence $\{\underline{x}_k\}$ in AGD satisfies that $f(\underline{x}_k) - f^*\le \mathcal O(L/k^2)$.

math.OC↗

MachaGrasp: Morphology-Aware Cross-Embodiment Dexterous Hand Articulation Generation for Grasping

Dexterous grasping with multi-fingered hands remains challenging due to high-dimensional articulations and the cost of optimization-based pipelines. Existing end-to-end methods require training on large-scale datasets for specific hands, limiting their ability to generalize across different embodiments. We propose MachaGrasp, an eigengrasp-based, end-to-end framework for cross-embodiment grasp generation. From a hand's morphology description, we derive a morphology embedding and an eigengrasp set. Conditioned on these, together with the object point cloud and wrist pose, an amplitude predictor regresses articulation coefficients in a low-dimensional space, which are decoded into full joint articulations. Articulation learning is supervised with a Kinematic-Aware Articulation Loss (KAL) that emphasizes fingertip-relevant motions and injects morphology-specific structure. In simulation on unseen objects across three dexterous hands, MachaGrasp attains a 91.9% average grasp success rate with less than 0.4 seconds inference per grasp. With few-shot adaptation to an unseen hand, it achieves 85.6% success on unseen objects in simulation, and real-world experiments on this few-shot-generalized hand achieve an 87% success rate. The code and additional materials are available on our project website https://connor-zh.github.io/MachaGrasp.

cs.RO↗

EByFTVeS: Efficient Byzantine Fault Tolerant-based Verifiable Secret-sharing in Distributed Privacy-preserving Machine Learning

Verifiable Secret Sharing (VSS) has been widespread in Distributed Privacy-preserving Machine Learning (DPML), because invalid shares from malicious dealers or participants can be recognized by verifying the commitment of the received shares for honest participants. However, the consistency and the computation and communitation burden of the VSS-based DPML schemes are still two serious challenges. Although Byzantine Fault Tolerance (BFT) system has been brought to guarantee the consistency and improve the efficiency of the existing VSS-based DPML schemes recently, we explore an Adaptive Share Delay Provision (ASDP) strategy, and launch an ASDP-based Customized Model Poisoning Attack (ACuMPA) for certain participants in this paper. We theoretically analyzed why the ASDP strategy and the ACuMPA algorithm works to the existing schemes. Next, we propose an [E]fficient [By]zantine [F]ault [T]olerant-based [Ve]rifiable [S]ecret-sharing (EByFTVeS) scheme. Finally, the validity, liveness, consistency and privacy of the EByFTVeS scheme are theoretically analyzed, while the efficiency of the EByFTVeS scheme outperforms that of the-state-of-art VSS scheme according to comparative experiment results.

cs.CR↗

Model-free Analysis of Scattering and Imaging Data with Escort-Weighted Shannon Entropy and Divergence Matrices

We demonstrate a model-free data analysis framework that leverages escort-weighted Shannon Entropy and several divergence matrices to detect phase transitions in scattering and imaging datasets. By establishing a connection between physical entropy and informational entropy, this approach provides a sensitive method for identifying phase transitions without an explicit physical model or order parameter. We further show that pairwise divergence matrices, including Kullback-Leibler divergence, Jeffrey Divergence, Jensen-Shannon Divergence and antisymmetric Kullback-Leibler divergence, provide more comprehensive measures of statistical changes than scalar entropy alone. Our approach successfully detects the onset of both long- and short-range order in neutron and X-ray scattering data, as well as a non-trivial phase transition in magnetic skyrmion lattices observed through Lorentz-transition electron microscopy. These results establish a framework for automated, model-free analysis of experimental data with broad applications in materials science and condensed matter physics.

cond-mat.mtrl-sci↗

Noise Reduction for Pufferfish Privacy: A Practical Noise Calibration Method

This paper introduces a relaxed noise calibration method to enhance data utility while attaining pufferfish privacy. This work builds on the existing $1$-Wasserstein (Kantorovich) mechanism by alleviating the existing overly strict condition that leads to excessive noise, and proposes a practical mechanism design algorithm as a general solution. We prove that a strict noise reduction by our approach always exists compared to $1$-Wasserstein mechanism for all privacy budgets $ε$ and prior beliefs, and the noise reduction (also represents improvement on data utility) gains increase significantly for low privacy budget situations--which are commonly seen in real-world deployments. We also analyze the variation and optimality of the noise reduction with different prior distributions. Moreover, all the properties of the noise reduction still exist in the worst-case $1$-Wasserstein mechanism we introduced, when the additive noise is largest. We further show that the worst-case $1$-Wasserstein mechanism is equivalent to the $\ell_1$-sensitivity method. Experimental results on three real-world datasets demonstrate $47\%$ to $87\%$ improvement in data utility.

cs.CR↗

Investigating jet induced identified hadron productions from the relative transverse activity classifier in pp collision at LHC

In this work, we systematically investigate the jet associated identified hadron productions of pions, kaons, and protons based on the event topological separation method in proton proton (pp) collisions at $\sqrt{s}=13$ TeV employing the AMPT model with PYTHIA8 initial conditions. Enabling relative transverse event activity classifier $R_T$, we analyze the transverse momentum ($p_T$) spectra and particle ratios in the jet aligned toward region and the underlying event (UE) contributions sensitive transverse region varying with $R_T$. The results indicate that the AMPT model, incorporating both partonic and hadronic final-state interactions, provides a satisfactory description to the experimental data of the $p_T$ differential yields, particle ratios and average transverse momentum of identified particles in both the toward and transverse regions across different event activity classes. By subtracting the UE contribution from the toward region using the transverse region hadron yield, we introduce the in-jet hadron productions to analyze the modifications to jet itself. We find that the in-jet baryon to meson ratios reveal a sensitive dependence on $R_T$ driven by final state interactions, leading to a unique crossing pattern at intermediate $p_T$. This behavior can be regarded as a novel signature for probing jet medium interactions and energy loss effects in small collision systems.

hep-ph↗

Phase-Aware Code-Aided EM Algorithm for Blind Channel Estimation in PSK-Modulated OFDM

This paper presents a fully blind phase-aware expectation-maximization (EM) algorithm for OFDM systems with the phase-shift keying (PSK) modulation. We address the well-known local maximum problem of the EM algorithm for blind channel estimation. This is primarily caused by the unknown phase ambiguity in the channel estimates, which conventional blind EM estimators cannot resolve. To overcome this limitation, we propose to exploit the extrinsic information from the decoder as model evidence metrics. A finite set of candidate models is generated based on the inherent symmetries of PSK modulation, and the decoder selects the most likely candidate model. Simulation results demonstrate that, when combined with a simple convolutional code, the phase-aware EM algorithm reliably resolves phase ambiguity during the initialization stage and reduces the local convergence rate from 80% to nearly 0% in frequency-selective channels with a constant phase ambiguity. The algorithm is invoked only once after the EM initialization stage, resulting in negligible additional complexity during subsequent turbo iterations.

eess.SP↗

Blind Turbo Demodulation for Differentially Encoded OFDM with 2D Trellis Decomposition

Digital Audio Broadcasting (DAB)-like systems employ differentially encoded (DE) phase-shift keying (PSK) for transmission. While turbo-DE-PSK receivers offer substantial performance gains through iterative decoding by making the DE-PSK an inner code, they rely on accurate channel estimation without pilots, which is a key challenge in DAB-like scenarios. This paper develops a fully blind turbo-DE-PSK scheme that jointly estimates channel phase, channel gain, and noise variance directly from the received signal. The design leverages a two-dimensional (2D) trellis decomposition for blind phase estimation, complemented by power-based estimators for channel gain and noise variance. We provide a comprehensive system assessment across practical system parameters, including inner code length, phase quantization, and 2D block size. Simulation results show that the blind 2D turbo demodulator approaches the performance of receivers with perfect channel knowledge and remains robust under realistic transmission conditions.

eess.SP↗

Decentralized Disturbance Rejection Control of Triangularly Coupled Loop Thermosyphon System

In this paper, we investigate the stability of a triangularly coupled triple loop thermosyphon system with momentum and heat exchange at the coupling point as well as the existence of disturbances. The controller consists of a single, local state feedback. From the stability analysis, we obtain explicit bounds on the feedback gains, which depend on the Rayleigh numbers and the momentum coupling parameter, but independent of the thermal coupling parameter. The existence of the stability bounds allows us to design decentralized adaptive controllers to automatically search for the feasible gains when the system parameters are unknown. In the case of existing disturbances in the system, we approximate the disturbances via an extended state observer for the purpose of disturbance rejection. Numerical results are given to demonstrate the performance of the proposed decentralized disturbance rejection controller design.

math.OC↗

Physics-Aware Initialization Refinement in Code-Aided EM for Blind Channel Estimation

This paper addresses the well-known local maximum problem of the expectation-maximization (EM) algorithm in blind intersymbol interference (ISI) channel estimation. This problem primarily results from phase and shift ambiguity during initialization, which blind estimation is inherently unable to distinguish. We propose an effective initialization refinement algorithm that utilizes the decoder output as a model selection metric, incorporating a technique to detect phase and shift ambiguity. Our results show that the proposed algorithm significantly reduces the number of local maximum cases to nearly one-third for a 3-tap ISI channel under highly uncertain initial conditions. The improvement becomes more pronounced as initial errors increase and the channel memory grows. When used in a turbo equalizer, the proposed algorithm is required only in the first turbo iteration, which limits any complexity increase with subsequent iterations.

eess.SP↗

PerturBench: Benchmarking Machine Learning Models for Cellular Perturbation Analysis

We introduce a comprehensive framework for modeling single cell transcriptomic responses to perturbations, aimed at standardizing benchmarking in this rapidly evolving field. Our approach includes a modular and user-friendly model development and evaluation platform, a collection of diverse perturbational datasets, and a set of metrics designed to fairly compare models and dissect their performance. Through extensive evaluation of both published and baseline models across diverse datasets, we highlight the limitations of widely used models, such as mode collapse. We also demonstrate the importance of rank metrics which complement traditional model fit measures, such as RMSE, for validating model effectiveness. Notably, our results show that while no single model architecture clearly outperforms others, simpler architectures are generally competitive and scale well with larger datasets. Overall, this benchmarking exercise sets new standards for model evaluation, supports robust model development, and furthers the use of these models to simulate genetic and chemical screens for therapeutic discovery.

cs.LG↗

Large Anomalous and Topological Hall Effect and Nernst Effect in a Dirac Kagome Magnet Fe3Ge

The search for kagome magnets with unconventional magnetic and electronic properties has gained significant attention in recent years. We report the magnetic, electronic, and thermoelectric properties of Fe3Ge single crystals, where the Fe atoms form a slightly distorted kagome lattice. Fe3Ge exhibits a large anomalous Hall effect and anomalous Nernst effect. The anomalous transverse thermoelectric conductivity reaches about 4.6 A m^-1 K^-1, exceeding values reported for conventional ferromagnets and most topological ferromagnets. First-principles calculations indicate that these transport responses are primarily governed by intrinsic mechanisms, highlighting the dominant role of Berry curvature arising from massive Dirac gaps in momentum space. In addition, we observe a topological Hall resistivity of about 0.9 microOhm cm and a topological Nernst coefficient of 1.2 microvolt K^-1, which are attributed to the Berry phase associated with field-induced scalar spin chirality. These findings demonstrate the combined influence of Berry phases in both momentum and real space, establishing Fe3Ge as a promising candidate for room-temperature transverse thermoelectric applications.

cond-mat.mtrl-sci↗

LDRFusion: A LiDAR-Dominant multimodal refinement framework for 3D object detection

Existing LiDAR-Camera fusion methods have achieved strong results in 3D object detection. To address the sparsity of point clouds, previous approaches typically construct spatial pseudo point clouds via depth completion as auxiliary input and adopts a proposal-refinement framework to generate detection results. However, introducing pseudo points inevitably brings noise, potentially resulting in inaccurate predictions. Considering the differing roles and reliability levels of each modality, we propose LDRFusion, a novel Lidar-dominant two-stage refinement framework for multi-sensor fusion. The first stage soley relies on LiDAR to produce accurately localized proposals, followed by a second stage where pseudo point clouds are incorporated to detect challenging instances. The instance-level results from both stages are subsequently merged. To further enhance the representation of local structures in pseudo point clouds, we present a hierarchical pseudo point residual encoding module, which encodes neighborhood sets using both feature and positional residuals. Experiments on the KITTI dataset demonstrate that our framework consistently achieves strong performance across multiple categories and difficulty levels.

cs.CV↗

Scale-Disentangled spatiotemporal Modeling for Long-term Traffic Emission Forecasting

Long-term traffic emission forecasting is crucial for the comprehensive management of urban air pollution. Traditional forecasting methods typically construct spatiotemporal graph models by mining spatiotemporal dependencies to predict emissions. However, due to the multi-scale entanglement of traffic emissions across time and space, these spatiotemporal graph modeling method tend to suffer from cascading error amplification during long-term inference. To address this issue, we propose a Scale-Disentangled Spatio-Temporal Modeling (SDSTM) framework for long-term traffic emission forecasting. It leverages the predictability differences across multiple scales to decompose and fuse features at different scales, while constraining them to remain independent yet complementary. Specifically, the model first introduces a dual-stream feature decomposition strategy based on the Koopman lifting operator. It lifts the scale-coupled spatiotemporal dynamical system into an infinite-dimensional linear space via Koopman operator, and delineates the predictability boundary using gated wavelet decomposition. Then a novel fusion mechanism is constructed, incorporating a dual-stream independence constraint based on cross-term loss to dynamically refine the dual-stream prediction results, suppress mutual interference, and enhance the accuracy of long-term traffic emission prediction. Extensive experiments conducted on a road-level traffic emission dataset within Xi'an's Second Ring Road demonstrate that the proposed model achieves state-of-the-art performance.

cs.LG↗