Researcher profile

Zhi Xu

Zhi Xu contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
19works
0followers
10topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

19 published item(s)

preprint2026arXiv

NoisyCausal: A Benchmark for Evaluating Causal Reasoning Under Structured Noise

Causal reasoning in natural language requires identifying relevant variables, understanding their interactions, and reasoning about effects and interventions, often under noisy or ambiguous conditions. While large language models (LLMs) exhibit strong general reasoning abilities, they struggle to disentangle correlation from causation, particularly when observations are partially incorrect or irrelevant information is present. In this work, we introduce NoisyCausal, a new benchmark designed to evaluate causal reasoning under structured noise. Each instance is generated from a ground-truth causal graph and contextualized with a natural language scenario by injecting controllable forms of noise, such as irrelevant distractors, value perturbations, confounding, and partial observability. Moreover, we propose a modular reasoning framework that combines LLMs with explicit causal structure to address these challenges. Our method prompts the LLM to extract variables, construct a causal graph from context, and then reformulates the reasoning task as a structured prompt grounded in this graph. Rather than relying on statistical patterns alone, the LLM is guided by symbolic structure, enabling more interpretable and robust inference. Experimental results show that our method significantly outperforms standard prompting and reasoning baselines on NoisyCausal. Furthermore, it generalizes well to external benchmarks such as Cladder without task-specific tuning. Our findings highlight the importance of combining causal abstractions with language-driven reasoning to achieve faithful and robust causal understanding in LLMs.

preprint2022arXiv

Calibration procedures for the CHASE/HIS science data

The Hα line is an important optical line in solar observations containing the information from the photosphere to the chromosphere. To study the mechanisms of solar eruptions and the plasma dynamics in the lower atmosphere, the Chinese Hα Solar Explorer (CHASE) was launched into a Sun-synchronous orbit on October 14, 2021. The scientific payload of the CHASE satellite is the Hα Imaging Spectrograph (HIS). The CHASE/HIS acquires, for the first time, seeing-free Hα spectroscopic observations with high spectral and temporal resolutions. It consists of two observational modes. The raster scanning mode provides full-Sun or region-of-interest spectra at Hα (6559.7-6565.9 Å) and Fe I (6567.8-6570.6 Å) wavebands. The continuum imaging mode obtains full-Sun photospheric images at around 6689 Å. In this paper, we present detailed calibration procedures for the CHASE/HIS science data, including the dark-field and flat-field correction, slit image curvature correction, wavelength and intensity calibration, and coordinate transformation. The higher-level data products can be directly used for scientific research.

preprint2022arXiv

Contributions of Shape, Texture, and Color in Visual Recognition

We investigate the contributions of three important features of the human visual system (HVS)~ -- ~shape, texture, and color ~ -- ~to object classification. We build a humanoid vision engine (HVE) that explicitly and separately computes shape, texture, and color features from images. The resulting feature vectors are then concatenated to support the final classification. We show that HVE can summarize and rank-order the contributions of the three features to object recognition. We use human experiments to confirm that both HVE and humans predominantly use some specific features to support the classification of specific classes (e.g., texture is the dominant feature to distinguish a zebra from other quadrupeds, both for humans and HVE). With the help of HVE, given any environment (dataset), we can summarize the most important features for the whole task (task-specific; e.g., color is the most important feature overall for classification with the CUB dataset), and for each class (class-specific; e.g., shape is the most important feature to recognize boats in the iLab-20M dataset). To demonstrate more usefulness of HVE, we use it to simulate the open-world zero-shot learning ability of humans with no attribute labeling. Finally, we show that HVE can also simulate human imagination ability with the combination of different features. We will open-source the HVE engine and corresponding datasets.

preprint2022arXiv

Encouraging Disentangled and Convex Representation with Controllable Interpolation Regularization

We focus on controllable disentangled representation learning (C-Dis-RL), where users can control the partition of the disentangled latent space to factorize dataset attributes (concepts) for downstream tasks. Two general problems remain under-explored in current methods: (1) They lack comprehensive disentanglement constraints, especially missing the minimization of mutual information between different attributes across latent and observation domains. (2) They lack convexity constraints, which is important for meaningfully manipulating specific attributes for downstream tasks. To encourage both comprehensive C-Dis-RL and convexity simultaneously, we propose a simple yet efficient method: Controllable Interpolation Regularization (CIR), which creates a positive loop where disentanglement and convexity can help each other. Specifically, we conduct controlled interpolation in latent space during training, and we reuse the encoder to help form a 'perfect disentanglement' regularization. In that case, (a) disentanglement loss implicitly enlarges the potential understandable distribution to encourage convexity; (b) convexity can in turn improve robust and precise disentanglement. CIR is a general module and we merge CIR with three different algorithms: ELEGANT, I2I-Dis, and GZS-Net to show the compatibility and effectiveness. Qualitative and quantitative experiments show improvement in C-Dis-RL and latent convexity by CIR. This further improves downstream tasks: controllable image synthesis, cross-modality image translation, and zero-shot synthesis.

preprint2022arXiv

Polytopic Planar Region Characterization of Rough Terrains for Legged Locomotion

This paper studies the problem of constructing polytopic representations of planar regions from depth camera readings. This problem is of great importance for terrain mapping in complicated environment and has great potentials in legged locomotion applications. To address the polytopic planar region characterization problem, we propose a two-stage solution scheme. At the first stage, the planar regions embedded within a sequence of depth images are extracted individually first and then merged to establish a terrain map containing only planar regions in a selected frame. To simplify the representations of the planar regions that are applicable to foothold planning for legged robots, we further approximate the extracted planar regions via low-dimensional polytopes at the second stage. With the polytopic representation, the proposed approach achieves a great balance between accuracy and simplicity. Experimental validations with RGB-D cameras are conducted to demonstrate the performance of the proposed scheme. The proposed scheme successfully characterizes the planar regions via polytopes with acceptable accuracy. More importantly, the run time of the overall perception scheme is less than 10ms (i.e., > 100Hz) throughout the tests, which strongly illustrates the advantages of our approach developed in this paper.

preprint2022arXiv

Translucency and negative temperature-dependence for the slip length of water on graphene

Carbonous materials, such as graphene and carbon nanotube, have attracted tremendous attention in the fields of nanofluidics due to the slip at the interface between solid and liquid. The dependence of slip length for water on the types of supporting substrates and thickness of carbonous layer, which is critical for applications such as sustainable cooling of electronic devices, remains unknown. In this paper, using colloidal probe atomic force microscope, we measured the slip length of water on graphene ls supported by hydrophilic and hydrophobic substrates, i.e., SiO2 and octadecyltrimethoxysilane (OTS). The ls on single-layer graphene supported by SiO2 is found to be 1.6~1.9 nm, and by OTS is 8.5~0.9 nm. With the thickness of few-layer graphene increases to 3~4 layers, both ls gradually converge to the value of graphite (4.3~3.5 nm). Such thickness dependence is termed slip length translucency. Further, ls is found to decrease by about 70% with the temperature increases from 300 K to 350 K for 2-layer graphene supported by SiO2. These observations are explained by analysis based on Green-Kubo relation and McLachlan theory. Our results provide the first set of reference values for the slip length of water on supported few-layer graphene. They can not only serve as a direct experimental reference for solid-liquid interaction, but also provide guideline for the design of nanofluidics-based devices, for example the thermo-mechanical nanofluidic devices.

preprint2021arXiv

Dynamics of Polar Skyrmion Bubbles under Electric Fields

Room-temperature polar skyrmion bubbles that are recently found in oxide superlattice, have received enormous interests for their potential applications in nanoelectronics due to the nanometer size, emergent chirality, and negative capacitance. For practical applications, the ability to controllably manipulate them by using external stimuli is prerequisite. Here, we study the dynamics of individual polar skyrmion bubbles at the nanoscale by using in situ biasing in a scanning transmission electron microscope. The reversible electric field-driven phase transition between topological and trivial polar states are demonstrated. We create, erase and monitor the shrinkage and expansion of individual polar skyrmions. We find that their transition behaviors are substantially different from that of magnetic analogue. The underlying mechanism is discussed by combing with the phase-field simulations. The controllable manipulation of nanoscale polar skyrmions allows us to tune the dielectric permittivity at atomic scale and detailed knowledge of their phase transition behaviors provides fundamentals for their applications in nanoelectronics.

preprint2020arXiv

Four-dimensional Vibrational Spectroscopy for Nanoscale Mapping of Phonon Dispersion in BN Nanotubes

Direct measurement of local phonon dispersion in individual nanostructures can greatly advance our understanding of their electrical, thermal, and mechanical properties. However, such experimental measurements require extremely high detection sensitivity and combined spatial, energy and momentum resolutions, thus has been elusive. Here, we develop a four-dimensional electron energy loss spectroscopy (4D-EELS) technique based a monochromated scanning transmission electron microscope (STEM), and present the position-dependent phonon dispersion measurement in individual boron nitride nanotubes (BNNTs). Our measurement shows that the unfolded phonon dispersion of multi-walled BNNTs is close to hexagonal-boron nitride (h-BN) crystals, suggesting that interlayer coupling and curved geometry have no substantial impacts on phonon dispersion. We also find that the acoustic phonons are extremely sensitive to momentum-dependent defect scattering, while optical phonons are much less susceptible. This work not only provides useful insights into vibrational properties of BNNTs, but also demonstrates huge prospects of the developed 4D-EELS technique in nanoscale phonon dispersion measurements.

preprint2020arXiv

Harnessing Structures for Value-Based Planning and Reinforcement Learning

Value-based methods constitute a fundamental methodology in planning and deep reinforcement learning (RL). In this paper, we propose to exploit the underlying structures of the state-action value function, i.e., Q function, for both planning and deep RL. In particular, if the underlying system dynamics lead to some global structures of the Q function, one should be capable of inferring the function better by leveraging such structures. Specifically, we investigate the low-rank structure, which widely exists for big data matrices. We verify empirically the existence of low-rank Q functions in the context of control and deep RL tasks. As our key contribution, by leveraging Matrix Estimation (ME) techniques, we propose a general framework to exploit the underlying low-rank structure in Q functions. This leads to a more efficient planning procedure for classical control, and additionally, a simple scheme that can be applied to any value-based RL techniques to consistently achieve better performance on "low-rank" tasks. Extensive experiments on control tasks and Atari games confirm the efficacy of our approach. Code is available at https://github.com/YyzHarry/SV-RL.

preprint2020arXiv

Imaging and spectral study on the null point of a fan-spine structure during a solar flare

Using the multi-instrument observations, we make the first simultaneous imaging and spectral study on the null point of a fan-spine magnetic topology during a solar flare. When magnetic reconnection occurs at the null point, the fan-spine configuration brightens in the (extreme-)ultraviolet channels. In the H$α$ images, the fan-spine structure is partly filled and outlined by the bi-directional material flows ejected from the reconnection site. The extrapolated coronal magnetic field confirms the existence of the fan-spine topology. Before and after the flare peak, the total velocity of the outflows is estimated to be about 60 km s$^{-1}$. During the flare, the Si IV line profile at the reconnection region is enhanced both in the blue-wing and red-wing. At the flare peak time, the total velocity of the outflows is found to be 144 km s$^{-1}$. Superposed on the Si IV profile, there are several deep absorption lines with the blueshift of several tens of km s$^{-1}$. The reason is inferred to be that the bright reconnection region observed in Si IV channel is located under the cooler material appearing as dark features in the H$α$ line. The blueshifted absorption lines indicate the movement of the cooler material toward the observer. The depth of the absorption lines also depends on the amount of cooler material. These results imply that this kind of spectral profiles can be used as a tool to diagnose the properties of cooler material above reconnection site.

preprint2020arXiv

Non-Asymptotic Analysis of Monte Carlo Tree Search

In this work, we consider the popular tree-based search strategy within the framework of reinforcement learning, the Monte Carlo Tree Search (MCTS), in the context of infinite-horizon discounted cost Markov Decision Process (MDP). While MCTS is believed to provide an approximate value function for a given state with enough simulations, the claimed proof in the seminal works is incomplete. This is due to the fact that the variant, the Upper Confidence Bound for Trees (UCT), analyzed in prior works utilizes "logarithmic" bonus term for balancing exploration and exploitation within the tree-based search, following the insights from stochastic multi-arm bandit (MAB) literature. In effect, such an approach assumes that the regret of the underlying recursively dependent non-stationary MABs concentrates around their mean exponentially in the number of steps, which is unlikely to hold as pointed out in literature, even for stationary MABs. As the key contribution of this work, we establish polynomial concentration property of regret for a class of non-stationary MAB. This in turn establishes that the MCTS with appropriate polynomial rather than logarithmic bonus term in UCB has the claimed property. Using this as a building block, we argue that MCTS, combined with nearest neighbor supervised learning, acts as a "policy improvement" operator: it iteratively improves value function approximation for all states, due to combining with supervised learning, despite evaluating at only finitely many states. In effect, we establish that to learn an $\varepsilon$ approximation of the value function with respect to $\ell_\infty$ norm, MCTS combined with nearest neighbor requires a sample size scaling as $\widetilde{O}\big(\varepsilon^{-(d+4)}\big)$, where $d$ is the dimension of the state space. This is nearly optimal due to a minimax lower bound of $\widetildeΩ\big(\varepsilon^{-(d+2)}\big)$.

preprint2020arXiv

Observation of the Topologically Originated Edge States in large-gap Quasi-One-Dimensional a-Bi$_4$Br$_4$

Two-dimensional topological insulator features time-reversal-invariant spin-momentum-locked one-dimensional (1D) edge states with a linear energy dispersion. However, experimental access to 1D edge states is still of great challenge and only limited to few techniques to date. Here, by using infrared absorption spectroscopy, we observed robust topologically originated edge states in a-Bi4Br4 belts with definitive signature of strong infrared absorption at belt sides and distinct anisotropy with respect to light polarizations, which is further supported by first-principles calculations. Our work demonstrates for the first time that the infrared spectroscopy can offer a power-efficient approach in experimentally probing 1D edge states of topological materials.

preprint2020arXiv

On Reinforcement Learning for Turn-based Zero-sum Markov Games

We consider the problem of finding Nash equilibrium for two-player turn-based zero-sum games. Inspired by the AlphaGo Zero (AGZ) algorithm, we develop a Reinforcement Learning based approach. Specifically, we propose Explore-Improve-Supervise (EIS) method that combines "exploration", "policy improvement"' and "supervised learning" to find the value function and policy associated with Nash equilibrium. We identify sufficient conditions for convergence and correctness for such an approach. For a concrete instance of EIS where random policy is used for "exploration", Monte-Carlo Tree Search is used for "policy improvement" and Nearest Neighbors is used for "supervised learning", we establish that this method finds an $\varepsilon$-approximate value function of Nash equilibrium in $\widetilde{O}(\varepsilon^{-(d+4)})$ steps when the underlying state-space of the game is continuous and $d$-dimensional. This is nearly optimal as we establish a lower bound of $\widetildeΩ(\varepsilon^{-(d+2)})$ for any policy.

preprint2020arXiv

Private Sequential Learning

We formulate a private learning model to study an intrinsic tradeoff between privacy and query complexity in sequential learning. Our model involves a learner who aims to determine a scalar value, $v^*$, by sequentially querying an external database and receiving binary responses. In the meantime, an adversary observes the learner's queries, though not the responses, and tries to infer from them the value of $v^*$. The objective of the learner is to obtain an accurate estimate of $v^*$ using only a small number of queries, while simultaneously protecting her privacy by making $v^*$ provably difficult to learn for the adversary. Our main results provide tight upper and lower bounds on the learner's query complexity as a function of desired levels of privacy and estimation accuracy. We also construct explicit query strategies whose complexity is optimal up to an additive constant.

preprint2020arXiv

Propagating Slow Sausage Waves in a Sunspot Observed by the New Vacuum Solar Telescope

A sunspot is an ideal waveguide for a variety of magnetohydrodynamic waves, which carry a significant amount of energy to the upper atmosphere and could be used as a tool to probe magnetic and thermal structure of a sunspot. In this study, we used the New Vacuum Solar Telescope and took high-resolution image sequences simultaneously in both TiO (7058$\pm$10 Å) and H$_α$ (6562$\pm$2.5 Å) bandpasses. We extracted the area and total emission intensity variations of sunspot umbra and analyzed the signals with synchrosqueezing transform. We found that the area and emission intensity varied with both three and five minute periodicity. Moreover, the area and intensity oscillated in phase with each other, this fact hold in both TiO and H$_α$ data. We interpret this oscillatory signal as propagating slow sausage wave. The propagation speed is estimated at about 8 km$\cdot$s$^{-1}$. We infer that this sunspot's umbra could have temperature as low as 2800--3500 K.

preprint2020arXiv

Sample Efficient Reinforcement Learning via Low-Rank Matrix Estimation

We consider the question of learning $Q$-function in a sample efficient manner for reinforcement learning with continuous state and action spaces under a generative model. If $Q$-function is Lipschitz continuous, then the minimal sample complexity for estimating $ε$-optimal $Q$-function is known to scale as $Ω(\frac{1}{ε^{d_1+d_2 +2}})$ per classical non-parametric learning theory, where $d_1$ and $d_2$ denote the dimensions of the state and action spaces respectively. The $Q$-function, when viewed as a kernel, induces a Hilbert-Schmidt operator and hence possesses square-summable spectrum. This motivates us to consider a parametric class of $Q$-functions parameterized by its "rank" $r$, which contains all Lipschitz $Q$-functions as $r \to \infty$. As our key contribution, we develop a simple, iterative learning algorithm that finds $ε$-optimal $Q$-function with sample complexity of $\widetilde{O}(\frac{1}{ε^{\max(d_1, d_2)+2}})$ when the optimal $Q$-function has low rank $r$ and the discounting factor $γ$ is below a certain threshold. Thus, this provides an exponential improvement in sample complexity. To enable our result, we develop a novel Matrix Estimation algorithm that faithfully estimates an unknown low-rank matrix in the $\ell_\infty$ sense even in the presence of arbitrary bounded noise, which might be of interest in its own right. Empirical results on several stochastic control tasks confirm the efficacy of our "low-rank" algorithms.

preprint2020arXiv

Stable Reinforcement Learning with Unbounded State Space

We consider the problem of reinforcement learning (RL) with unbounded state space motivated by the classical problem of scheduling in a queueing network. Traditional policies as well as error metric that are designed for finite, bounded or compact state space, require infinite samples for providing any meaningful performance guarantee (e.g. $\ell_\infty$ error) for unbounded state space. That is, we need a new notion of performance metric. As the main contribution of this work, inspired by the literature in queuing systems and control theory, we propose stability as the notion of "goodness": the state dynamics under the policy should remain in a bounded region with high probability. As a proof of concept, we propose an RL policy using Sparse-Sampling-based Monte Carlo Oracle and argue that it satisfies the stability property as long as the system dynamics under the optimal policy respects a Lyapunov function. The assumption of existence of a Lyapunov function is not restrictive as it is equivalent to the positive recurrence or stability property of any Markov chain, i.e., if there is any policy that can stabilize the system then it must possess a Lyapunov function. And, our policy does not utilize the knowledge of the specific Lyapunov function. To make our method sample efficient, we provide an improved, sample efficient Sparse-Sampling-based Monte Carlo Oracle with Lipschitz value function that may be of interest in its own right. Furthermore, we design an adaptive version of the algorithm, based on carefully constructed statistical tests, which finds the correct tuning parameter automatically.

preprint2019arXiv

Atomic Imaging of Mechanically Induced Topological Transition of Ferroelectric Vortices

Ferroelectric vortices formed through complex lattice-charge interactions have great potential in applications for future nanoelectronics such as memories. For practical applications, it is crucial to manipulate these topological states under external stimuli. Here, we apply mechanical loads to locally manipulate the vortices in a PbTiO3-SrTiO3 superlattice via atomically resolved in situ scanning transmission electron microscopy. The vortices undergo a transition to the a-domain with in-plane polarization under external compressive stress and spontaneously recover after removal of the stress. We reveal the detailed transition process at the atomic scale and reproduce this numerically using phase-field simulations. These findings provide new pathways to control the exotic topological ferroelectric structures for future nanoelectronics and also valuable insights into understanding of lattice-charge interactions at nanoscale.

preprint2019arXiv

Spectro-polarimetric Observations at the NVST: I. Instrumental Polarization Calibration and Primary Measurements

This paper is devoted to the primary spectro-polarimetric observation performed at the New Vacuum Solar Telescope of China since 2017, and our aim is to precisely evaluate the real polarimetric accuracy and sensitivity of this polarimetry by using full Stokes spectro-polarimetric observations of the photospheric line Fe I 532.4 nm. In the work, we briefly describe the salient characteristic of the NVST as a polarimeter in technology and then characterize its instrumental polarization based on the operation in 2017 and 2019. It is verified that the calibration method making use of the instrumental polarization calibration unit (ICU) is stable and credible. The calibration accuracy can reach up to 3$\times 10^{-3}$ . Based on the scientific observation of the NOAA 12645 on April 5th, 2017, we estimate that the residual cross-talk from Stokes $I$ to Stokes $Q$, $U$ and $V$, after the instrumental polarization calibration, is about 4$\times10^{-3}$ on average, which is consistent with the calibration accuracy and close to the photon noise. The polarimetric sensitivity (i.e., the detection limit) for polarized light is of the order of $10^{-3}$ with an integration time over 20 seconds. Slow modulation rate is indeed an issue for the present system. The present NVST polarimeter is expected to be integrated with an high-order adaptive optics system and a field scanner to realize 2D magnetic field vector measurements in the following instrumentation update.