arXiv subjects

Yuhao Liu

Publications and source records attributed to Yuhao Liu.

At least 73 records · Page 4Linked to original sources

arXiv2025

A Memory-Augmented LLM-Driven Method for Autonomous Merging of 3D Printing Work Orders

With the rapid development of 3D printing, the demand for personalized and customized production on the manufacturing line is steadily increasing. Efficient merging of printing workpieces can significantly enhance the processing efficiency of the production line. Addressing the challenge, a Large Language Model (LLM)-driven method is established in this paper for the autonomous merging of 3D printing work orders, integrated with a memory-augmented learning strategy. In industrial scenarios, both device and order features are modeled into LLM-readable natural language prompt templates, and develop an order-device matching tool along with a merging interference checking module. By incorporating a self-memory learning strategy, an intelligent agent for autonomous order merging is constructed, resulting in improved accuracy and precision in order allocation. The proposed method effectively leverages the strengths of LLMs in industrial applications while reducing hallucination.

cs.AI↗

arXiv2025

Stochastic Volatility Model with Sticky Drawdown and Drawup Processes: A Deep Learning Approach

We propose a new financial model, the stochastic volatility model with sticky drawdown and drawup processes (SVSDU model), which enables us to capture the features of winning and losing streaks that are common across financial markets but can not be captured simultaneously by the existing financial models. Moreover, the SVSDU model retains the advantages of the stochastic volatility models. Since there are not closed-form option pricing formulas under the SVSDU model and the existing simulation methods for the sticky diffusion processes are really time-consuming, we develop a deep neural network to solve the corresponding high-dimensional parametric partial differential equation (PDE), where the solution to the PDE is the pricing function of a European option according to the Feynman-Kac Theorem, and validate the accuracy and efficiency of our deep learning approach. We also propose a novel calibration framework for our model, and demonstrate the calibration performances of our models on both simulated data and historical data. The calibration results on SPX option data show that the SVSDU model is a good representation of the asset value dynamic, and both winning and losing streaks are accounted for in option values. Our model opens new horizons for modeling and predicting the dynamics of asset prices in financial markets.

q-fin.MF↗

arXiv2025

Pricing American Parisian Options under General Time-Inhomogeneous Markov Models

This paper develops general approaches for pricing various types of American-style Parisian options (down-in/-out, perpetual/finite-maturity) with general payoff functions based on continuous-time Markov chain (CTMC) approximation under general 1D time-inhomogeneous Markov models. For the down-in types, by conditioning on the Parisian stopping time, we reduce the pricing problem to that of a series of vanilla American options with different maturities and their prices integrated with the distribution function of the Parisian stopping time yield the American Parisian down-in option price. This facilitates an efficient application of CTMC approximation to obtain the approximate option price by calculating the required quantities. For the perpetual down-in cases under time-homogeneous models, significant computational cost can be reduced. The down-out cases are more complicated, for which we use the state augmentation approach to record the excursion duration and then the approximate option price is obtained by solving a series of variational inequalities recursively with the Lemke's pivoting method. We show the convergence of CTMC approximation for all the types of American Parisian options under general time-inhomogeneous Markov models, and the accuracy and efficiency of our algorithms are confirmed with extensive numerical experiments.

q-fin.CP↗

arXiv2025

Three Magnetization Peaks in HgBa$_2$Ca$_2$Cu$_3$O$_8$ Single Crystals

By measuring magnetization hysteresis loops of the superconducting HgBa$_2$Ca$_2$Cu$_3$O$_8$ single crystals ($T_{\rm c}$ = 133 K), we observed three magnetization peaks in a wide temperature region. This is in contrast to the previous observation that there are only two magnetization peaks in many superconductors. Detailed analysis finds that the second peak here evolves from a kinky structure at low temperatures and gets enhanced at high temperatures; the third peak evolves from a general broad peak at low temperatures and evolves into a sharp peak and even a step-like one at high temperatures. We propose a general phase diagram to interpret these peaks, the second peak is corresponding to the order-disorder transition, while the third peak is associated with the elastic-plastic crossover. Our work unifies the understanding of different "second peak" structures in different systems and thus sheds new light in understanding the vortex dynamics in type-II superconductors.

cond-mat.supr-con↗

arXiv2024

Boosting Weakly-Supervised Referring Image Segmentation via Progressive Comprehension

This paper explores the weakly-supervised referring image segmentation (WRIS) problem, and focuses on a challenging setup where target localization is learned directly from image-text pairs. We note that the input text description typically already contains detailed information on how to localize the target object, and we also observe that humans often follow a step-by-step comprehension process (\ie, progressively utilizing target-related attributes and relations as cues) to identify the target object. Hence, we propose a novel Progressive Comprehension Network (PCNet) to leverage target-related textual cues from the input description for progressively localizing the target object. Specifically, we first use a Large Language Model (LLM) to decompose the input text description into short phrases. These short phrases are taken as target-related cues and fed into a Conditional Referring Module (CRM) in multiple stages, to allow updating the referring text embedding and enhance the response map for target localization in a multi-stage manner. Based on the CRM, we then propose a Region-aware Shrinking (RaS) loss to constrain the visual localization to be conducted progressively in a coarse-to-fine manner across different stages. Finally, we introduce an Instance-aware Disambiguation (IaD) loss to suppress instance localization ambiguity by differentiating overlapping response maps generated by different referring texts on the same image. Extensive experiments show that our method outperforms SOTA methods on three common benchmarks.

cs.CV↗

arXiv2024

HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping

This paper introduces the Hamiltonian-Adaptive Ternary Tree (HATT) framework to compile optimized Fermion-to-qubit mapping for specific Fermionic Hamiltonians. In the simulation of Fermionic quantum systems, efficient Fermion-to-qubit mapping plays a critical role in transforming the Fermionic system into a qubit system. HATT utilizes ternary tree mapping and a bottom-up construction procedure to generate Hamiltonian aware Fermion-to-qubit mapping to reduce the Pauli weight of the qubit Hamiltonian, resulting in lower quantum simulation circuit overhead. Additionally, our optimizations retain the important vacuum state preservation property in our Fermion-to-qubit mapping and reduce the complexity of our algorithm from $O(N^4)$ to $O(N^3)$. Evaluations and simulations of various Fermionic systems demonstrate $5\sim20\%$ reduction in Pauli weight, gate count, and circuit depth, alongside excellent scalability to larger systems. Experiments on the Ionq quantum computer also show the advantages of our approach in noise resistance in quantum simulations.

quant-ph↗

arXiv2024

Scalable Random Feature Latent Variable Models

Random feature latent variable models (RFLVMs) represent the state-of-the-art in latent variable models, capable of handling non-Gaussian likelihoods and effectively uncovering patterns in high-dimensional data. However, their heavy reliance on Monte Carlo sampling results in scalability issues which makes it difficult to use these models for datasets with a massive number of observations. To scale up RFLVMs, we turn to the optimization-based variational Bayesian inference (VBI) algorithm which is known for its scalability compared to sampling-based methods. However, implementing VBI for RFLVMs poses challenges, such as the lack of explicit probability distribution functions (PDFs) for the Dirichlet process (DP) in the kernel learning component, and the incompatibility of existing VBI algorithms with RFLVMs. To address these issues, we introduce a stick-breaking construction for DP to obtain an explicit PDF and a novel VBI algorithm called ``block coordinate descent variational inference" (BCD-VI). This enables the development of a scalable version of RFLVMs, or in short, SRFLVM. Our proposed method shows scalability, computational efficiency, superior performance in generating informative latent representations and the ability of imputing missing data across various real-world datasets, outperforming state-of-the-art competitors.

cs.LG↗

arXiv2024

Fast Virtual Gate Extraction For Silicon Quantum Dot Devices

Silicon quantum dot devices stand as promising candidates for large-scale quantum computing due to their extended coherence times, compact size, and recent experimental demonstrations of sizable qubit arrays. Despite the great potential, controlling these arrays remains a significant challenge. This paper introduces a new virtual gate extraction method to quickly establish orthogonal control on the potentials for individual quantum dots. Leveraging insights from the device physics, the proposed approach significantly reduces the experimental overhead by focusing on crucial regions around charge state transition. Furthermore, by employing an efficient voltage sweeping method, we can efficiently pinpoint these charge state transition lines and filter out erroneous points. Experimental evaluation using real quantum dot chip datasets demonstrates a substantial 5.84x to 19.34x speedup over conventional methods, thereby showcasing promising prospects for accelerating the scaling of silicon spin qubit devices.

cond-mat.mes-hall↗

arXiv2024

The Error Probability of Spatially Coupled Sparse Regression Codes over Memoryless Channels

Sparse Regression Codes (SPARCs) are capacity-achieving codes introduced for communication over the Additive White Gaussian Noise (AWGN) channels and were later extended to general memoryless channels. In particular it was shown via threshold saturation that Spatially Coupled Sparse Regression Codes (SC-SPARCs) are capacity-achieving over general memoryless channels when using an Approximate Message Passing decoder (AMP). This paper, for the first time rigorously, analyzes the non-asymptotic performance of the Generalized Approximate Message Passing (GAMP) decoder of SC-SPARCs over memoryless channels, and proves exponential decaying error probability with respect to the code length.

cs.IT↗

arXiv2024

Moisture Diffusion in Multi-Layered Materials: The Role of Layer Stacking and Composition

Multi-layered materials are everywhere, from fiber-reinforced polymer composites (FRPCs) to plywood sheets to layered rocks. When in service, these materials are often exposed to long-term environmental factors, like moisture, temperature, salinity, etc. Moisture, in particular, is known to cause significant degradation of materials like polymers, often resulting in loss of material durability. Hence, it is critical to determine the total diffusion coefficient of multi-layered materials given the coefficients of individual layers. However, the relationship between a multi-layered material's total diffusion coefficient and the individual layers' diffusion coefficients is not well established. Existing parallel and series models to determine the total diffusion coefficient do not account for the order of layer stacking. In this paper, we introduce three parameters influencing the diffusion behavior of multi-layered materials: the ratio of diffusion coefficients of individual layers, the volume fraction of individual layers, and the stacking order of individual layers. Computational models are developed within a finite element method framework to conduct parametric analysis considering the proposed parameters. We propose a new model to calculate the total diffusion coefficient of multi-layered materials more accurately than current models. We verify this parametric study by performing moisture immersion experiments on multi-layered materials. Finally, we propose a methodology for designing and optimizing the cross-section of multi-layered materials considering long-term moisture resistance. This study gives new insights into the diffusion behavior of multi-layered materials, focusing on polymer composites.

physics.app-ph↗

arXiv2024

ISLAND: Interpolating Land Surface Temperature using land cover

Cloud occlusion is a common problem in the field of remote sensing, particularly for retrieving Land Surface Temperature (LST). Remote sensing thermal instruments onboard operational satellites are supposed to enable frequent and high-resolution observations over land; unfortunately, clouds adversely affect thermal signals by blocking outgoing longwave radiation emission from the Earth's surface, interfering with the retrieved ground emission temperature. Such cloud contamination severely reduces the set of serviceable LST images for downstream applications, making it impractical to perform intricate time-series analysis of LST. In this paper, we introduce a novel method to remove cloud occlusions from Landsat 8 LST images. We call our method ISLAND, an acronym for Interpolating Land Surface Temperature using land cover. Our approach uses LST images from Landsat 8 (at 30 m resolution with 16-day revisit cycles) and the NLCD land cover dataset. Inspired by Tobler's first law of Geography, ISLAND predicts occluded LST through a set of spatio-temporal filters that perform distance-weighted spatio-temporal interpolation. A critical feature of ISLAND is that the filters are land cover-class aware, making it particularly advantageous in complex urban settings with heterogeneous land cover types and distributions. Through qualitative and quantitative analysis, we show that ISLAND achieves robust reconstruction performance across a variety of cloud occlusion and surface land cover conditions, and with a high spatio-temporal resolution. We provide a public dataset of 20 U.S. cities with pre-computed ISLAND LST outputs. Using several case studies, we demonstrate that ISLAND opens the door to a multitude of high-impact urban and environmental applications across the continental United States.

eess.IV↗

arXiv2024

MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation

Quantum simulation, fundamental in quantum algorithm design, extends far beyond its foundational roots, powering diverse quantum computing applications. However, optimizing the compilation of quantum Hamiltonian simulation poses significant challenges. Existing approaches fall short in reconciling deterministic and randomized compilation, lack appropriate intermediate representations, and struggle to guarantee correctness. Addressing these challenges, we present MarQSim, a novel compilation framework. MarQSim leverages a Markov chain-based approach, encapsulated in the Hamiltonian Term Transition Graph, adeptly reconciling deterministic and randomized compilation benefits. We rigorously prove its algorithmic efficiency and correctness criteria. Furthermore, we formulate a Min-Cost Flow model that can tune transition matrices to enforce correctness while accommodating various optimization objectives. Experimental results demonstrate MarQSim's superiority in generating more efficient quantum circuits for simulating various quantum Hamiltonians while maintaining precision.

quant-ph↗

arXiv2024

Diff-Plugin: Revitalizing Details for Diffusion-based Low-level Tasks

Diffusion models trained on large-scale datasets have achieved remarkable progress in image synthesis. However, due to the randomness in the diffusion process, they often struggle with handling diverse low-level tasks that require details preservation. To overcome this limitation, we present a new Diff-Plugin framework to enable a single pre-trained diffusion model to generate high-fidelity results across a variety of low-level tasks. Specifically, we first propose a lightweight Task-Plugin module with a dual branch design to provide task-specific priors, guiding the diffusion process in preserving image content. We then propose a Plugin-Selector that can automatically select different Task-Plugins based on the text instruction, allowing users to edit images by indicating multiple low-level tasks with natural language. We conduct extensive experiments on 8 low-level vision tasks. The results demonstrate the superiority of Diff-Plugin over existing methods, particularly in real-world scenarios. Our ablations further validate that Diff-Plugin is stable, schedulable, and supports robust training across different dataset sizes.

cs.CV↗

arXiv2024

A phase-field fracture model in thermo-poro-elastic media with micromechanical strain energy degradation

This work extends the hydro-mechanical phase-field fracture model to non-isothermal conditions with micromechanics based poroelasticity, which degrades Biot's coefficient not only with the phase-field variable (damage) but also with the energy decomposition scheme. Furthermore, we propose a new approach to update porosity solely determined by the strain change rather than damage evolution as in the existing models. As such, these poroelastic behaviors of Biot's coefficient and the porosity dictate Biot's modulus and the thermal expansion coefficient. For numerical implementation, we employ an isotropic diffusion method to stabilize the advection-dominated heat flux and adapt the fixed stress split method to account for the thermal stress. We verify our model against a series of analytical solutions such as Terzaghi's consolidation, thermal consolidation, and the plane strain hydraulic fracture propagation, known as the KGD fracture. Finally, numerical experiments demonstrate the effectiveness of the stabilization method and intricate thermo-hydro-mechanical interactions during hydraulic fracturing with and without a pre-existing weak interface.

math.NA↗

arXiv2024

NeRT: Implicit Neural Representations for General Unsupervised Turbulence Mitigation

The atmospheric and water turbulence mitigation problems have emerged as challenging inverse problems in computer vision and optics communities over the years. However, current methods either rely heavily on the quality of the training dataset or fail to generalize over various scenarios, such as static scenes, dynamic scenes, and text reconstructions. We propose a general implicit neural representation for unsupervised atmospheric and water turbulence mitigation (NeRT). NeRT leverages the implicit neural representations and the physically correct tilt-then-blur turbulence model to reconstruct the clean, undistorted image, given only dozens of distorted input images. Moreover, we show that NeRT outperforms the state-of-the-art through various qualitative and quantitative evaluations of atmospheric and water turbulence datasets. Furthermore, we demonstrate the ability of NeRT to eliminate uncontrolled turbulence from real-world environments. Lastly, we incorporate NeRT into continuously captured video sequences and demonstrate $48 \times$ speedup.

cs.CV↗

arXiv2024

Decentralizing Coherent Joint Transmission Precoding via Fast ADMM with Deterministic Equivalents

Inter-cell interference (ICI) suppression is critical for multi-cell multi-user networks. In this paper, we investigate advanced precoding techniques for coordinated multi-point (CoMP) with downlink coherent joint transmission, an effective approach for ICI suppression. Different from the centralized precoding schemes that require frequent information exchange among the cooperating base stations, we propose a decentralized scheme to minimize the total power consumption. In particular, based on the covariance matrices of global channel state information, we estimate the ICI bounds via the deterministic equivalents and decouple the original design problem into sub-problems, each of which can be solved in a decentralized manner. To solve the sub-problems at each base station, we develop a low-complexity solver based on the alternating direction method of multipliers (ADMM) in conjunction with the convex-concave procedure (CCCP). Simulation results demonstrate the effectiveness of our proposed decentralized precoding scheme, which achieves performance similar to the optimal centralized precoding scheme. Besides, our proposed ADMM solver can substantially reduce the computational complexity, while maintaining outstanding performance.

eess.SP↗

arXiv2024

Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding

This paper introduces Fermihedral, a compiler framework focusing on discovering the optimal Fermion-to-qubit encoding for targeted Fermionic Hamiltonians. Fermion-to-qubit encoding is a crucial step in harnessing quantum computing for efficient simulation of Fermionic quantum systems. Utilizing Pauli algebra, Fermihedral redefines complex constraints and objectives of Fermion-to-qubit encoding into a Boolean Satisfiability problem which can then be solved with high-performance solvers. To accommodate larger-scale scenarios, this paper proposed two new strategies that yield approximate optimal solutions mitigating the overhead from the exponentially large number of clauses. Evaluation across diverse Fermionic systems highlights the superiority of Fermihedral, showcasing substantial reductions in implementation costs, gate counts, and circuit depth in the compiled circuits. Real-system experiments on IonQ's device affirm its effectiveness, notably enhancing simulation accuracy.

quant-ph↗

arXiv2024

Sequential Estimation of Gaussian Process-based Deep State-Space Models

We consider the problem of sequential estimation of the unknowns of state-space and deep state-space models that include estimation of functions and latent processes of the models. The proposed approach relies on Gaussian and deep Gaussian processes that are implemented via random feature-based Gaussian processes. In these models, we have two sets of unknowns, highly nonlinear unknowns (the values of the latent processes) and conditionally linear unknowns (the constant parameters of the random feature-based Gaussian processes). We present a method based on particle filtering where the parameters of the random feature-based Gaussian processes are integrated out in obtaining the predictive density of the states and do not need particles. We also propose an ensemble version of the method, with each member of the ensemble having its own set of features. With several experiments, we show that the method can track the latent processes up to a scale and rotation.

cs.LG↗