Searcharxiv⌕ Search

arXiv subjects

Zhihan Zhu

Publications and source records attributed to Zhihan Zhu.

17 recordsLinked to original sources
arXiv2026

HyGRAIL: Cost-Aware and Evidence-Grounded Scientific Hypothesis Discovery over Knowledge Graphs

Scientific knowledge graphs organize entities and relations extracted from scientific literature, but they remain inherently incomplete. Missing typed links in such graphs can therefore represent plausible scientific hypotheses, such as unexplored associations between materials and applications. However, scientific hypothesis discovery is challenging because true discoveries are extremely sparse among typed candidate pairs: graph neural networks (GNNs) are efficient but unreliable for ambiguous cases, while large language models (LLMs) are knowledgeable but too costly to apply exhaustively and are not naturally grounded in graph structures. We propose HyGRAIL, a cost-aware and evidence-grounded framework that combines heterogeneous GNN triage with LLM-based hypothesis review. HyGRAIL first uses a GNN to score candidate hypotheses and identify a validation-calibrated ambiguous region, routing only graph-uncertain cases to LLM review. For each routed hypothesis, HyGRAIL retrieves node-level associations and multi-hop relational paths from the knowledge graph (KG), then converts this structured evidence into natural language through template-based or LLM-based naturalization. An LLM review agent finally judges each hard hypothesis using the naturalized evidence and validation-selected decision criteria. On MatKG, HyGRAIL achieves the best F1 score of 0.429, improving over the strongest prior baseline by 0.242 F1 points and over the GNN-only baseline by 0.322. Meanwhile, GNN triage reduces the LLM call rate by 54.36% on average. Ablation studies further show that retrieved graph evidence is crucial for reliable hypothesis verification and that compact, two-sided evidence is more effective than simply increasing retrieval quantity.

cs.CL↗
arXiv2026

SPP-SBL: Space-Power Prior Sparse Bayesian Learning for Block Sparse Recovery

The recovery of block-sparse signals with unknown structural patterns remains a fundamental challenge in structured sparse signal reconstruction. By proposing a variance transformation framework, this paper unifies existing pattern-based block sparse Bayesian learning methods, and introduces a novel space power prior based on undirected graph models to adaptively capture the unknown patterns of block-sparse signals. By combining the EM algorithm with high-order equation root-solving, we develop a new structured sparse Bayesian learning method, SPP-SBL, which effectively addresses the open problem of space coupling parameter estimation in pattern-based methods. We further demonstrate that learning the relative values of space coupling parameters is key to capturing unknown block-sparse patterns and improving recovery accuracy. Experiments validate that SPP-SBL successfully recovers various challenging structured sparse signals (e.g., chain-structured signals and multi-pattern sparse signals) and real-world multi-modal structured sparse signals (images, audio), showing significant advantages in recovery accuracy across multiple metrics.

math.OC↗
arXiv2026

Latent Bias Alignment for High-Fidelity Diffusion Inversion in Real-World Image Reconstruction and Manipulation

Recent research has shown that text-to-image diffusion models are capable of generating high-quality images guided by text prompts. But can they be used to generate or approximate real-world images from the seed noise? This is known as the diffusion inversion problem, which serves as a fundamental building block for bridging diffusion models and real-world scenarios. However, existing diffusion inversion methods often suffer from low reconstruction quality or weak robustness. Two major challenges need to be carefully addressed: (1) the misalignment between the inversion and generation trajectories during the diffusion process, and (2) the mismatch between the diffusion inversion process and the VQ autoencoder (VQAE) reconstruction. To address these challenges, we introduce a latent bias vector at each inversion step, which is learned to reduce the misalignment between inversion and generation trajectories. We refer to this strategy as Latent Bias Optimization (LBO). Furthermore, we perform an approximate joint optimization of the diffusion inversion and VQAE reconstruction processes by learning to adjust the image latent representation, which serves as the connecting interface between them. We refer to this technique as Image Latent Boosting (ILB). Extensive experimental results demonstrate that the proposed method significantly improves the image reconstruction quality of the diffusion model, as well as the performance of downstream tasks, including image editing and rare concept generation.

cs.CV↗
arXiv2026

Subgradient Gliding Method for Nonsmooth Convex Optimization

We identify and analyze a fundamental limitation of the classical projected subgradient method in nonsmooth convex optimization: the inevitable failure caused by the absence of valid subgradients at boundary points. We show that, under standard step sizes for both convex and strongly convex objectives, the method can fail after a single iteration with probability arbitrarily close to one, even on simple problem instances. To overcome this limitation, we propose a novel alternative termed the \textit{subgradient gliding method}, which remains well defined without boundary subgradients and avoids premature termination. Beyond resolving this foundational issue, the proposed framework encompasses the classical projected subgradient method as a special case and substantially enlarges its admissible step-size design space, providing greater flexibility for algorithmic design. We establish optimal ergodic convergence rates, $\mathcal{O}(1/\sqrt{t})$ for convex problems and $\mathcal{O}(1/t)$ for strongly convex problems, and further extend the framework to stochastic settings. Notably, our analysis does not rely on global Lipschitz continuity of the objective function, requiring only mild control on subgradient growth. Numerical experiments demonstrate that, in scenarios where the classical projected subgradient method fails completely, the proposed method converges reliably with a $100\%$ success rate and achieves orders-of-magnitude improvements in accuracy and convergence speed. These results substantially expand the scope of subgradient-based optimization methods to non-Lipschitz nonsmooth convex problems.

math.OC↗
arXiv2025

From Generality to Specificity: Prior-Driven Optimal Sparse Transformation in Compressed Sensing

This paper introduces a new paradigm for sparse transformation: the Prior-to-Posterior Sparse Transform (POST) framework, designed to overcome long-standing limitation on generalization and specificity in classical sparse transforms for compressed sensing. POST systematically unifies the generalization capacity of any existing transform domains with the specificity of reference knowledge, enabling flexible adaptation to diverse signal characteristics. Within this framework, we derive an explicit sparse transform domain termed HOT, which adaptively handles both real and complex-valued signals. We theoretically establish HOT's sparse representation properties under single and multiple reference settings, demonstrating its ability to preserve generalization while enhancing specificity even under weak reference information. Extensive experiments confirm that HOT delivers substantial meta-gains across audio sensing, 5G channel estimation, and image compression tasks, consistently boosting multiple compressed sensing algorithms under diverse multimodal settings with negligible computational overhead.

math.OC↗
arXiv2025

Generative Semantic Coding for Ultra-Low Bitrate Visual Communication and Analysis

We consider the problem of ultra-low bit rate visual communication for remote vision analysis, human interactions and control in challenging scenarios with very low communication bandwidth, such as deep space exploration, battlefield intelligence, and robot navigation in complex environments. In this paper, we ask the following important question: can we accurately reconstruct the visual scene using only a very small portion of the bit rate in existing coding methods while not sacrificing the accuracy of vision analysis and performance of human interactions? Existing text-to-image generation models offer a new approach for ultra-low bitrate image description. However, they can only achieve a semantic-level approximation of the visual scene, which is far insufficient for the purpose of visual communication and remote vision analysis and human interactions. To address this important issue, we propose to seamlessly integrate image generation with deep image compression, using joint text and coding latent to guide the rectified flow models for precise generation of the visual scene. The semantic text description and coding latent are both encoded and transmitted to the decoder at a very small bit rate. Experimental results demonstrate that our method can achieve the same image reconstruction quality and vision analysis accuracy as existing methods while using much less bandwidth. The code will be released upon paper acceptance.

cs.CV↗
arXiv2025

Runge-Kutta Approximation and Decoupled Attention for Rectified Flow Inversion and Semantic Editing

Rectified flow (RF) models have recently demonstrated superior generative performance compared to DDIM-based diffusion models. However, in real-world applications, they suffer from two major challenges: (1) low inversion accuracy that hinders the consistency with the source image, and (2) entangled multimodal attention in diffusion transformers, which hinders precise attention control. To address the first challenge, we propose an efficient high-order inversion method for rectified flow models based on the Runge-Kutta solver of differential equations. To tackle the second challenge, we introduce Decoupled Diffusion Transformer Attention (DDTA), a novel mechanism that disentangles text and image attention inside the multimodal diffusion transformers, enabling more precise semantic control. Extensive experiments on image reconstruction and text-guided editing tasks demonstrate that our method achieves state-of-the-art performance in terms of fidelity and editability. Code is available at https://github.com/wmchen/RKSovler_DDTA.

cs.CV↗
arXiv2025

Lipschitz-free Projected Subgradient Method with Time-varying Step-size

We introduce a novel family of time-varying step-sizes for the classical projected subgradient method, offering optimal ergodic convergence. Importantly, this approach does not depend on the Lipschitz assumption of the objective function, thereby broadening the convergence result of projected subgradient method to non-Lipschitz case.

math.OC↗
arXiv2025

Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination

This paper introduces two novel criteria: one for feature selection and another for feature elimination in the context of best subset selection, which is a benchmark problem in statistics and machine learning. From the perspective of optimization, we revisit the classical selection and elimination criteria in traditional best subset selection algorithms, revealing that these classical criteria capture only partial variations of the objective function after the entry or exit of features. By formulating and solving optimization subproblems for feature entry and exit exactly, new selection and elimination criteria are proposed, proved as the optimal decisions for the current entry-and-exit process compared to classical criteria. Replacing the classical selection and elimination criteria with the proposed ones generates a series of enhanced best subset selection algorithms. These generated algorithms not only preserve the theoretical properties of the original algorithms but also achieve significant meta-gains without increasing computational cost across various scenarios and evaluation metrics on multiple tasks such as compressed sensing and sparse regression.

math.OC↗
arXiv2025

Optical skyrmion lattices accelerating in free space

Generation and propagation of optical skyrmions provide a versatile plalform for topologically nontrivial optical informatics and light-matter interactions, but their acceleration along curved trajectories is to be studied. In this study, we experimentally demonstrate the first accelerating skyrmion lattices conveyed by Airy structured light, characterized by topologically stable skyrmion textures with self-acceleration along parabolic trajectories. We show that the skyrmion unit cell can maintain a Skyrme number $|N_\text{sk}|>0.9$ within a propagation range of $\pm1.22\ z_R$ upon parabolic acceleration. Notably, the meron structure remains $|N_\text{sk}|$ stable within $0.5\pm0.02$ over a significantly extended range of $\pm3.06\ z_R$. Our work provides a new potential carrier for topologically robust information distribution, particle sorting and manipulation.

physics.optics↗
arXiv2024

Photonic torons, topological phase transition and tunable spin monopoles

Creation and control of topological complex excitations play crucial roles in both fundamental physics and modern information science. Torons are a sophisticated class of 3D chiral polar topological structures with both skyrmionic quasiparticle textures and monopole point defects, so far only observed in liquid crystal nonpolar models. Here, we experimentally construct torons with the photonic spin of vector structured light and demonstrate the topological phase transitions among diverse topological states: torons, hopfions, skyrmioniums and monopole pairs. We can also continually tune the toron's chirality and the helical spin textures of emerging monopole pairs. The birth of photonic torons and tunable monopoles opens a flexible platform for studying nontrivial light-matter interaction and topological informatics.

physics.optics↗
arXiv2024

Spintwistronics: Photonic bilayer topological lattices tuning extreme spin-orbit interactions

Twistronics, the manipulation of Moiré superlattices via the twisting of two layers of two-dimensional (2D) materials to control diverse and nontrivial properties, has recently revolutionized the condensed matter and materials physics. Here, we introduce the principles of twistronics to spin photonics, coining this emerging field spintwistronics. In spintwistronics, instead of 2D materials, the two layers consist of photonic topological spin lattices on a surface plasmonic polariton (SPP) platform. Each 2D SPP wave supports the construction of topological lattices formed by photonic spins with stable skyrmion topology governed by rotational symmetry. By introducing spintwistronics into plasmonics, we demonstrate theoretically and experimentally that two layers of photonic spin lattices can produce Moiré spin superlattices at specific magic angles. These superlattices, modulated periodically by the quantum number of total angular momentum, exhibit novel properties-including new quasiparticle topologies, multiple fractal patterns, extremely slow-light control, and more-that cannot be achieved in conventional plasmonic systems. As a result, they open up multiple degrees of freedom for practical applications in quantum information, optical data storage and chiral light-matter interactions.

physics.optics↗
arXiv2024

Block Sparse Bayesian Learning: A Diversified Scheme

This paper introduces a novel prior called Diversified Block Sparse Prior to characterize the widespread block sparsity phenomenon in real-world data. By allowing diversification on intra-block variance and inter-block correlation matrices, we effectively address the sensitivity issue of existing block sparse learning methods to pre-defined block information, which enables adaptive block estimation while mitigating the risk of overfitting. Based on this, a diversified block sparse Bayesian learning method (DivSBL) is proposed, utilizing EM algorithm and dual ascent method for hyperparameter estimation. Moreover, we establish the global and local optimality theory of our model. Experiments validate the advantages of DivSBL over existing algorithms.

cs.LG↗
arXiv2022

Topological Transformation and Free-Space Transport of Photonic Hopfions

Structured light fields embody strong spatial variations of polarisation, phase and amplitude. Understanding, characterization and exploitation of such fields can be achieved through their topological properties. Three-dimensional (3D) topological solitons, such as hopfions, are 3D localized continuous field configurations with nontrivial particle-like structures, that exhibit a host of important topologically protected properties. Here, we propose and demonstrate photonic counterparts of hopfions with exact characteristics of Hopf fibration, Hopf index, and Hopf mapping from real-space vector beams to homotopic hyperspheres representing polarisation states. We experimentally generate photonic hopfions with on-demand high-order Hopf indices and independently controlled topological textures, including Néel-, Bloch-, and anti-skyrmionic types. We also demonstrate a robust free-space transport of photonic hopfions, thus, showing potential of hopfions for developing optical topological informatics and communications.

physics.optics↗
arXiv2016

Observation of reversible orbital angular momentum transfer based on photon-phonon coupling

Orbital angular momentum (OAM) has gained great interest due to its most attractive feature of high dimensionality, and several ground-breaking demonstrations in communication based on OAM multiplexing have been carried out. Accordingly, a rapid data-density growth from OAM multiplexing has posed a great challenge to the signal-processing layer. Meanwhile, in another area, optical signal-processing circuit based on photon-phonon conversion has received considerable attention and made rapid progress. Here, with an aim of finding the intersection between OAM multiplexing and photon-phonon conversion, we report on the observation of reversible OAM photon-phonon conversion. A specific OAM state can be flexibly and controllably interconverted between photonic and phononic domains via Brillouin photon-phonon coupling within the decay time of acoustic signal, in which OAM and spin angular momentum are independently conserved. Our result demonstrates the controllable OAM transfer between photons and phonons, shows the potential of using OAM multiplexing to extend the capacity of photon-phonon conversion based signal-processing scheme, and may trigger the development of OAM-multiplexed photon-phonon circuit.

physics.optics↗
arXiv2015

Parametric amplification of orbital angular momentum beams based on light-acoustic interaction

A high fidelity amplification of beams carrying orbital angular momentum (OAM) is very crucial for OAM multiplexing and other OAM-based applications. Here, we report the first study of stimulated Brillouin amplification (SBA) for OAM beams, the energy conversion efficiency of photon-phonon coupling and the phase structure of amplified signals are investigated in collinear and noncollinear frame systems, respectively. Our results demonstrate that the OAM signals can be efficiently amplified without obvious noise introduced, and the modes of output signal are independent of the pump modes or the geometrical frames. Meanwhile, an OAM state depending on the optical modes and the geometrical frames is loaded into phonons by coherent light-acoustic interaction, which reveals more fundamental significance and a great application potential in OAM-multiplexing.

physics.optics↗