arXiv subjects

Yao Wang

Publications and source records attributed to Yao Wang.

At least 73 records · Page 4Linked to original sources

arXiv2026

Simulating Non-Markovian Open Quantum Dynamics with Neural Quantum States

Reducing computational scaling for simulating non-Markovian dissipative dynamics using artificial neural networks is both a major focus and formidable challenge in open quantum systems. To enable neural quantum states (NQSs), we encode environmental memory in dissipatons (quasiparticles with characteristic lifetimes), yielding the dissipaton-embedded quantum master equation (DQME). The resulting NQS-DQME framework achieves compact representation of many-body correlations and non-Markovian memory. Benchmarking against numerically exact hierarchical equations of motion confirms NQS-DQME maintains comparable accuracy while enhancing scalability and interpretability. This methodology opens new paths to explore non-Markovian open quantum dynamics in previously intractable systems.

quant-ph↗

arXiv2026

Optimal Mediation Mechanism in Bilateral Trade

We study the problem of designing revenue-maximizing mechanisms for a selfish mediator who facilitates trade between a buyer and a seller. We consider a setting where the mediator does not have information advantage and the buyer's valuation is interdependent with the seller's private information. The mechanism may involve multi-round negotiations and flexible fee structures. We show that the mediator can restrict attention to a class of joint menu-selection mechanisms, where each mechanism can be represented as a two-dimensional menu. Each party privately selects an option from their own dimension and the two options together determine the menu entry. The mediator then recommends both parties whether to trade based on the jointly selected menu entry. We then establish an impossibility trilemma: no mechanism can simultaneously satisfy incentive compatibility, obedience, and informativeness. Motivated by this result, we characterize the optimal mechanisms under two relaxation conditions. First, when the seller's cost is constant, the optimal mechanism exhibits a threshold structure: trade occurs whenever the quality of the item exceeds a threshold that is decreasing in the buyer's type. Consequently, low-typed buyers receive more information, which in turn gives the mediator more power to charge from them. Second, when the mediator has veto power, the optimal mechanism also takes a threshold form, but in the opposite direction: trade occurs only if the quality falls below a threshold that is increasing in the buyer's type. As a result, items with lower qualities are more likely to be traded and the corresponding sellers benefit more, which discourages sellers of high qualities from participating and gives rise to a ``lemons market'' effect.

cs.GT↗

arXiv2026

Lightweight Transformer for EEG Classification via Balanced Signed Graph Algorithm Unrolling

Samples of brain signals collected by EEG sensors have inherent anti-correlations that are well modeled by negative edges in a finite graph. To differentiate epilepsy patients from healthy subjects using collected EEG signals, we build lightweight and interpretable transformer-like neural nets by unrolling a spectral denoising algorithm for signals on a balanced signed graph -- graph with no cycles of odd number of negative edges. A balanced signed graph has well-defined frequencies that map to a corresponding positive graph via similarity transform of the graph Laplacian matrices. We implement an ideal low-pass filter efficiently on the mapped positive graph via Lanczos approximation, where the optimal cutoff frequency is learned from data. Given that two balanced signed graph denoisers learn posterior probabilities of two different signal classes during training, we evaluate their reconstruction errors for binary classification of EEG signals. Experiments show that our method achieves classification performance comparable to representative deep learning schemes, while employing dramatically fewer parameters.

cs.LG↗

arXiv2026

The power of small initialization in noisy low-tubal-rank tensor recovery

We study the problem of recovering a low-tubal-rank tensor $\mathcal{X}\_\star\in \mathbb{R}^{n \times n \times k}$ from noisy linear measurements under the t-product framework. A widely adopted strategy involves factorizing the optimization variable as $\mathcal{U} * \mathcal{U}^\top$, where $\mathcal{U} \in \mathbb{R}^{n \times R \times k}$, followed by applying factorized gradient descent (FGD) to solve the resulting optimization problem. Since the tubal-rank $r$ of the underlying tensor $\mathcal{X}_\star$ is typically unknown, this method often assumes $r < R \le n$, a regime known as over-parameterization. However, when the measurements are corrupted by some dense noise (e.g., Gaussian noise), FGD with the commonly used spectral initialization yields a recovery error that grows linearly with the over-estimated tubal-rank $R$. To address this issue, we show that using a small initialization enables FGD to achieve a nearly minimax optimal recovery error, even when the tubal-rank $R$ is significantly overestimated. Using a four-stage analytic framework, we analyze this phenomenon and establish the sharpest known error bound to date, which is independent of the overestimated tubal-rank $R$. Furthermore, we provide a theoretical guarantee showing that an easy-to-use early stopping strategy can achieve the best known result in practice. All these theoretical findings are validated through a series of simulations and real-data experiments.

cs.LG↗

arXiv2026

Quantum-Inspired Weight-Constrained Neural Network: Reducing Variable Numbers by 100x Compared to Standard Neural Networks

Although quantum machine learning has shown great promise, the practical application of quantum computers remains constrained in the noisy intermediate-scale quantum era. To take advantage of quantum machine learning, we investigate the underlying mathematical principles of these quantum models and find that the quantum neural network with amplitude encoding is equivalent to a weight-constrained neural network. Motived by this discovery, we develop a classical weight-constrained neural network. We find that this approach can reduce the number of variables in a classical neural network by a factor of 135 while preserving its accuracy. In addition, we develop a dropout method to enhance the robustness of quantum machine learning models, which are highly susceptible to adversarial attacks. This technique can also be applied to improve the adversarial robustness of the classical weight-constrained neural network, which is essential for industry applications, such as self-driving vehicles. Our work offers a novel approach to reduce the complexity of large classical neural networks, addressing a critical challenge in machine learning.

quant-ph↗

arXiv2026

Projection-Based Memory Kernel Coupling Theory for Quantum Dynamics: A Stable Framework for Non-Markovian Simulations

We present a projection-based, stability-preserving methodology for computing time correlation functions in open quantum systems governed by generalized quantum master equations with non-Markovian effects. Building upon the memory kernel coupling theory framework, our approach transforms the memory kernel hierarchy into a system of coupled linear differential equations through Mori-Zwanzig projection, followed by spectral projection onto stable eigenmodes to ensure numerical stability. By systematically eliminating unstable modes while preserving the physically relevant dynamics, our method guaranties long-time convergence without introducing artificial damping or ad hoc modifications. The theoretical framework maintains mathematical rigor through orthogonal projection operators and spectral decomposition. Benchmark calculations on the spin-boson model show excellent agreement with exact hierarchical equations of motion results while achieving significant computational efficiency. This approach provides a versatile and reliable framework for simulating non-Markovian dynamics in complex systems.

quant-ph↗

arXiv2026

Noisy MRI Reconstruction via MAP Estimation with an Implicit Deep-Denoiser Prior

Accelerating magnetic resonance imaging (MRI) remains challenging, particularly under realistic acquisition noise. While diffusion models have recently shown promise for reconstructing undersampled MRI data, many approaches lack an explicit link to the underlying MRI physics, and their parameters are sensitive to measurement noise, limiting their reliability in practice. We introduce Implicit-MAP (ImMAP), a diffusion-based reconstruction framework that integrates the acquisition noise model directly into a maximum a posteriori (MAP) formulation. Specifically, we build on the stochastic ascent method of Kadkhodaie et al. and generalize it to handle MRI encoding operators and realistic measurement noise. Across both simulated and real noisy datasets, ImMAP consistently outperforms state-of-the-art deep learning (LPDSNet) and diffusion-based (DDS) methods. By clarifying the practical behavior and limitations of diffusion models under realistic noise conditions, ImMAP establishes a more reliable and interpretable

eess.IV↗

arXiv2026

SurfelSoup: Learned Point Cloud Geometry Compression With a Probablistic SurfelTree Representation

This paper presents SurfelSoup, an end-to-end learned surface-based framework for point cloud geometry compression, with surface-structured primitives for representation. It proposes a probabilistic surface representation, pSurfel, which models local point occupancies using a bounded generalized Gaussian distribution. In addition, the pSurfels are organized into an octree-like hierarchy, pSurfelTree, with a Tree Decision module that adaptively terminates the tree subdivision for rate-distortion optimal Surfel granularity selection. This formulation avoids redundant point-wise compression in smooth regions and produces compact yet smooth surface reconstructions. Experimental results under the MPEG common test condition show consistent gain on geometry compression over voxel-based baselines and MPEG standard G-PCC-GesTM-TriSoup, while providing visually superior reconstructions with smooth and coherent surface structures.

eess.IV↗

arXiv2026

Exploring the Use of VLMs for Navigation Assistance for People with Blindness and Low Vision

This paper investigates the potential of vision-language models (VLMs) to assist people with blindness and low vision (pBLV) in navigation tasks. We evaluate state-of-the-art closed-source models, including GPT-4V, GPT-4o, Gemini-1.5-Pro, and Claude-3.5-Sonnet, alongside open-source models, such as Llava-v1.6-mistral and Llava-onevision-qwen, to analyze their capabilities in foundational visual skills: counting ambient obstacles, relative spatial reasoning, and common-sense wayfinding-pertinent scene understanding. We further assess their performance in navigation scenarios, using pBLV-specific prompts designed to simulate real-world assistance tasks. Our findings reveal notable performance disparities between these models: GPT-4o consistently outperforms others across all tasks, particularly in spatial reasoning and scene understanding. In contrast, open-source models struggle with nuanced reasoning and adaptability in complex environments. Common challenges include difficulties in accurately counting objects in cluttered settings, biases in spatial reasoning, and a tendency to prioritize object details over spatial feedback, limiting their usability for pBLV in navigation tasks. Despite these limitations, VLMs show promise for wayfinding assistance when better aligned with human feedback and equipped with improved spatial reasoning. This research provides actionable insights into the strengths and limitations of current VLMs, guiding developers on effectively integrating VLMs into assistive technologies while addressing key limitations for enhanced usability.

cs.CV↗

arXiv2026

Unsupervised Deformable Image Registration with Local-Global Attention and Image Decomposition

Deformable image registration is a critical technology in medical image analysis, with broad applications in clinical practice such as disease diagnosis, multi-modal fusion, and surgical navigation. Traditional methods often rely on iterative optimization, which is computationally intensive and lacks generalizability. Recent advances in deep learning have introduced attention-based mechanisms that improve feature alignment, yet accurately registering regions with high anatomical variability remains challenging. In this study, we proposed a novel unsupervised deformable image registration framework, LGANet++, which employs a novel local-global attention mechanism integrated with a unique technique for feature interaction and fusion to enhance registration accuracy, robustness, and generalizability. We evaluated our approach using five publicly available datasets, representing three distinct registration scenarios: cross-patient, cross-time, and cross-modal CT-MR registration. The results demonstrated that our approach consistently outperforms several state-of-the-art registration methods, improving registration accuracy by 1.39% in cross-patient registration, 0.71% in cross-time registration, and 6.12% in cross-modal CT-MR registration tasks. These results underscore the potential of LGANet++ to support clinical workflows requiring reliable and efficient image registration. The source code is available at https://github.com/huangzyong/LGANet-Registration.

eess.IV↗

arXiv2026

ChartOptimiser: Task-driven Optimisation of Chart Designs

Automated chart design has seen significant advancements with the emergence of Large-Language Models (LLMs), which offer a practical solution for generating charts. However, LLMs frequently introduce possibly critical design failures, such as data manipulation and confabulation. While expert users can potentially mitigate these issues through iterative prompt engineering, this process requires substantial design knowledge and significant effort, remaining a massive barrier for the general public. In this paper, we present ChartOptimiser, an automated method for generating chart designs with fidelity, efficiency, and effectiveness. Given the inter-dependencies between individual design parameters, ChartOptimiser employs Bayesian optimisation to effectively search the chart design space for a novel objective function grounded in four perceptual metrics. Our empirical evaluations in bar and pie charts demonstrate that ChartOptimiser eliminates iterative design loops, providing non-expert users with high-quality charts that outperform LLM-generated designs in chart clarity, task-solving ease, and visual aesthetics.

cs.HC↗

arXiv2025

Hybrid Learning: A Novel Combination of Self-Supervised and Supervised Learning for Joint MRI Reconstruction and Denoising in Low-Field MRI

Deep learning has demonstrated strong potential for MRI reconstruction. However, conventional supervised learning requires high-quality, high-SNR references for network training, which are often difficult or impossible to obtain in different scenarios, particularly in low-field MRI. Self-supervised learning provides an alternative by removing the need for training references, but its reconstruction performance can degrade when the baseline SNR is low. To address these limitations, we propose hybrid learning, a two-stage training framework that integrates self-supervised and supervised learning for joint MRI reconstruction and denoising when only low-SNR training references are available. Hybrid learning is implemented in two sequential stages. In the first stage, self-supervised learning is applied to fully sampled low-SNR data to generate higher-quality pseudo-references. In the second stage, these pseudo-references are used as targets for supervised learning to reconstruct and denoise undersampled noisy data. The proposed technique was evaluated in multiple experiments involving simulated and real low-field MRI in the lung and brain at different field strengths. Hybrid learning consistently improved image quality over both standard self-supervised learning and supervised learning with noisy training references at different acceleration rates, noise levels, and field strengths, achieving higher SSIM and lower NMSE. The hybrid learning approach is effective for both Cartesian and non-Cartesian acquisitions. Hybrid learning provides an effective solution for training deep MRI reconstruction models in the absence of high-SNR references. By improving image quality in low-SNR settings, particularly for low-field MRI, it holds promise for broader clinical adoption of deep learning-based reconstruction methods.

eess.IV↗

arXiv2025

Light Control of Triplet Pairing in Correlated Electrons with Mixed-Sign Interactions

Spin-triplet superconductivity is a key platform for topological quantum computing, yet its experimental realization and control in solid-state materials remain a significant challenge. For this purpose, we propose an ultrafast optical strategy to manipulate spin-triplet superconductivity by leveraging $p$-wave pairing instabilities in the extended Hubbard model, a framework applicable to transition-metal oxides. Utilizing Floquet engineering, we demonstrate that transient flipping of the effective spin-exchange interaction can enhance $p$-wave pairing correlations under linearly polarized optical pulses. Furthermore, we reveal that this emergent spin-triplet pairing in strongly correlated systems can be selectively switched by an orthogonal optical pulse. This work provides a pathway for stabilizing and controlling spin-triplet superconductivity in correlated materials.

cond-mat.str-el↗

arXiv2025

Efficient Low-Tubal-Rank Tensor Estimation via Alternating Preconditioned Gradient Descent

The problem of low-tubal-rank tensor estimation is a fundamental task with wide applications across high-dimensional signal processing, machine learning, and image science. Traditional approaches tackle such a problem by performing tensor singular value decomposition, which is computationally expensive and becomes infeasible for large-scale tensors. Recent approaches address this issue by factorizing the tensor into two smaller factor tensors and solving the resulting problem using gradient descent. However, this kind of approach requires an accurate estimate of the tensor rank, and when the rank is overestimated, the convergence of gradient descent and its variants slows down significantly or even diverges. To address this problem, we propose an Alternating Preconditioned Gradient Descent (APGD) algorithm, which accelerates convergence in the over-parameterized setting by adding a preconditioning term to the original gradient and updating these two factors alternately. Based on certain geometric assumptions on the objective function, we establish linear convergence guarantees for more general low-tubal-rank tensor estimation problems. Then we further analyze the specific cases of low-tubal-rank tensor factorization and low-tubal-rank tensor recovery. Our theoretical results show that APGD achieves linear convergence even under over-parameterization, and the convergence rate is independent of the tensor condition number. Extensive simulations on synthetic data are carried out to validate our theoretical assertions.

cs.LG↗

arXiv2025

Extended dissipaton theory for higher-order bath couplings and application to non-Condon spectroscopy with anharmonicity

In this work, we develop an extended dissipaton theory that generalizes the environmental couplings beyond the conventional linear and quadratic forms, enabling the treatment of arbitrary order of bath couplings. Applying this theoretical framework to the condensed-phase non-Condon spectroscopy, we demonstrate the interplay of anharmonicity, non-Condon and solvent effects on optical spectra. Precise simulations are carried out with high efficiency on linear absorption spectra involving the above mentioned correlated effects. We exhibit how an anharmonic potential modulates the vibronic feature, offering insights into the role of nonlinear environmental couplings in spectroscopic signatures and exemplifying the success of the extended dissipaton formalism as an exact and efficient method for higher-order bath couplings.

physics.chem-ph↗

arXiv2025

Evidence for Bose liquid from anomalous shot noise in nanojunctions of bad metal beta-Ta

We report anomalous shot noise in nanojunctions of beta-tantalum, a ``bad" metal whose electronic properties are inconsistent with the Fermi liquid theory. Fano factors cluster around even multiples of the values expected for Fermi liquids, suggesting that beta-Ta may host a correlated charge liquid of Cooper pair-like electron groups. Further evidence for correlations is provided by the effects of magnetic impurities, as well as reduced density of states near the Fermi level indicated by point contact spectroscopy and first principles calculations. Our results open new avenues for studies and applications of electron correlations.

cond-mat.mtrl-sci↗

arXiv2025

Fine-Grained Privacy Extraction from Retrieval-Augmented Generation Systems via Knowledge Asymmetry Exploitation

Retrieval-augmented generation (RAG) systems enhance large language models (LLMs) by integrating external knowledge bases, but this advancement introduces significant privacy risks. Existing privacy attacks on RAG systems can trigger data leakage but often fail to accurately isolate knowledge-base-derived sentences within mixed responses. They also lack robustness when applied across multiple domains. This paper addresses these challenges by presenting a novel black-box attack framework that exploits knowledge asymmetry between RAG and standard LLMs to achieve fine-grained privacy extraction across heterogeneous knowledge landscapes. We propose a chain-of-thought reasoning strategy that creates adaptive prompts to steer RAG systems away from sensitive content. Specifically, we first decompose adversarial queries to maximize information disparity and then apply a semantic relationship scoring to resolve lexical and syntactic ambiguities. We finally train a neural network on these feature scores to precisely identify sentences containing private information. Unlike prior work, our framework generalizes to unseen domains through iterative refinement without pre-defined knowledge. Experimental results show that we achieve over 91% privacy extraction rate in single-domain and 83% in multi-domain scenarios, reducing sensitive sentence exposure by over 65% in case studies. This work bridges the gap between attack and defense in RAG systems, enabling precise extraction of private information while providing a foundation for adaptive mitigation.

cs.CR↗

arXiv2025

Non-Rival Data as Rival Products: An Encapsulation-Forging Approach for Data Synthesis

The non-rival nature of data creates a dilemma for firms: sharing data unlocks value but risks eroding competitive advantage. Existing data synthesis methods often exacerbate this problem by creating data with symmetric utility, allowing any party to extract its value. This paper introduces the Encapsulation-Forging (EnFo) framework, a novel approach to generate rival synthetic data with asymmetric utility. EnFo operates in two stages: it first encapsulates predictive knowledge from the original data into a designated ``key'' model, and then forges a synthetic dataset by optimizing the data to intentionally overfit this key model. This process transforms non-rival data into a rival product, ensuring its value is accessible only to the intended model, thereby preventing unauthorized use and preserving the data owner's competitive edge. Our framework demonstrates remarkable sample efficiency, matching the original data's performance with a fraction of its size, while providing robust privacy protection and resistance to misuse. EnFo offers a practical solution for firms to collaborate strategically without compromising their core analytical advantage.

cs.LG↗