Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
21works
0followers
20topics
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

21 published item(s)

preprint2026arXiv

Enhancing Multimodal In-Context Learning via Inductive-Deductive Reasoning

In-context learning (ICL) allows large models to adapt to tasks using a few examples, yet its extension to vision-language models (VLMs) remains fragile. Our analysis reveals that the fundamental limitation lies in an inductive gap, models often produce correct answers from flawed reasoning, while struggling to extract consistent rules across demonstrations. This gap is further exacerbated by two visual-level obstacles: an overwhelming proportion of redundant visual tokens that obscure textual cues, and a skewed attention distribution that favors the initial image at the expense of subsequent context. To address these issues, we introduce a framework that restructures multimodal ICL as a principled inductive-deductive process. The framework incorporates a similarity-based visual token compression module to filter out redundant patches, a dynamic attention rebalancing mechanism to distribute focus equitably across all images, and a chain-of-thought paradigm that explicitly guides the model to analyze individual examples, derive a generalizable rule, and then apply it to the query. An auxiliary learning pipeline combines supervised fine-tuning with reinforcement learning using verifiable rewards to reinforce faithful citation and noise filtering. Evaluations across eight benchmarks covering visual perception, logical reasoning, STEM problems, and sarcasm detection demonstrate consistent and significant improvements over standard ICL baselines for multiple open-source VLMs, highlighting the potential of equipping models with genuine inductive capabilities in multimodal settings.

preprint2026arXiv

Learning Repetition-Invariant Representations for Polymer Informatics

Polymers are large macromolecules composed of repeating structural units known as monomers and are widely applied in fields such as energy storage, construction, medicine, and aerospace. However, existing graph neural network methods, though effective for small molecules, only model the single unit of polymers and fail to produce consistent vector representations for the true polymer structure with varying numbers of units. To address this challenge, we introduce Graph Repetition Invariance (GRIN), a novel method to learn polymer representations that are invariant to the number of repeating units in their graph representations. GRIN integrates a graph-based maximum spanning tree alignment with repeat-unit augmentation to ensure structural consistency. We provide theoretical guarantees for repetition-invariance from both model and data perspectives, demonstrating that three repeating units are the minimal augmentation required for optimal invariant representation learning. GRIN outperforms state-of-the-art baselines on both homopolymer and copolymer benchmarks, learning stable, repetition-invariant representations that generalize effectively to polymer chains of unseen sizes.

preprint2026arXiv

Transforming Acidic Corrosion and Embrittlement into a Hydrogen-Trapping Cage

The vision of a hydrogen economy demands efficient platforms to close the gap between sustainable proton sources and solid-state hydrogen carriers. Metal hydrides serve as key carriers, yet their synthesis remains constrained by the energy-intensive use of high-pressure H2, which fragments the hydrogen chain. Here, we overturn this paradigm by transforming two classic degradation mechanisms, acidic corrosion and hydrogen embrittlement, into a constructive materials-design strategy. We demonstrate that synergistic control of these processes in acid enables the in-situ engineering of a "hydrogen-trapping cage" (HTC) microstructure within metals. Composed of a dense defect network, this cage directly captures and stabilizes protons as hydrides under mild conditions, guided by the universal criterion |DeltaPeq| > DeltaPph. Using this platform, we synthesize over 20 hydrides, including challenging targets such as LiH and NaH, and showcase its functional power with a cage-rich titanium hydride electrocatalyst. This catalyst achieves an exceptional current density of 1.07 A cm-2 for nitrate-to-ammonia conversion, attributed to rapid H- transport within the engineered cage. This work establishes a transformative "failure-to-function" paradigm, delivering an integrated platform that unifies hydrogen capture, stabilization, and conversion.

preprint2023arXiv

Entangling spins using cubic nonlinear dynamics

Entangled states with a large number of $N$ atomic spins are a key ingredient for quantum information processing and quantum metrology. Nowadays, the preparation of such states has mainly relied on the quadratic nonlinear dynamics. Here, we investigate the preparation of spin-spin multipartite entanglement, witnessed by quantum Fisher information, by using the cubic nonlinear dynamics. We find that, in the regime of weak coupling, the cubic scheme can greatly speed up the rate of entanglement generation as compared to the quadratic scheme (about $N$ times faster). In the strong coupling regime, the cubic nonlinear dynamics enables the periodic in time generation of a broad variety of new-type macroscopic superposition states, which allow us to realize near-Heisenberg-limit phase sensitivity. In addition, we also reveal an interesting feature that the amount of entanglement generated by the cubic scheme has a macroscopic sensitivity to the parity of $N$, which has no counterpart in quadratic nonlinear dynamics and can be exploited for sensing the parity of $N$ at the single-spin level. We also propose a new approach for a fast and high-fidelity generation of maximally entangled Greenberger-Horne-Zeilinger (GHZ) states. By using an alternative cubic-quadratic-admixture type of nonlinear interaction, we show that one may accelerate the procedure of GHZ-state generation. The realization of the cubic nonlinear dynamics is also considered, showing that the cubic nonlinear dynamics can be realized by either repeatedly using linear- and quadratic-nonlinear dynamics or utilizing light-mediated interactions in just one step. Finally, by taking realistic imperfections into account, we find that the cubic scheme is sensitivity to the single-spin decay in the strong coupling regime, while is robust against the collective dephasing.

preprint2023arXiv

Graph Data Augmentation for Graph Machine Learning: A Survey

Data augmentation has recently seen increased interest in graph machine learning given its demonstrated ability to improve model performance and generalization by added training data. Despite this recent surge, the area is still relatively under-explored, due to the challenges brought by complex, non-Euclidean structure of graph data, which limits the direct analogizing of traditional augmentation operations on other types of image, video or text data. Our work aims to give a necessary and timely overview of existing graph data augmentation methods; notably, we present a comprehensive and systematic survey of graph data augmentation approaches, summarizing the literature in a structured manner. We first introduce three different taxonomies for categorizing graph data augmentation methods from the data, task, and learning perspectives, respectively. Next, we introduce recent advances in graph data augmentation, differentiated by their methodologies and applications. We conclude by outlining currently unsolved challenges and directions for future research. Overall, our work aims to clarify the landscape of existing literature in graph data augmentation and motivates additional work in this area, providing a helpful resource for researchers and practitioners in the broader graph machine learning domain. Additionally, we provide a continuously updated reading list at https://github.com/zhao-tong/graph-data-augmentation-papers.

preprint2022arXiv

Can phantom transition at $z\sim 1$ restore the Cosmic concordance?

The tension among inferences of Hubble constant ($H_0$) is found in a large array of datasets combinations. Modification to the late expansion history is the most direct solution to this discrepancy. In this work, we examine the viability of restoring the cosmological concordance with a novel version of transitional dark energy (TDE). The main anchors for the cosmic distance scale: cosmic microwave background (CMB) radiation, baryon acoustic oscillation (BAO), and Type Ia supernova (SNe Ia) calibrated by Cepheids form a "impossible trinity", i.e., it's plausible to reconcile with any two of the three but unlikely to accommodate them all. Particularly, the tension between BAO and the calibrated SNe Ia can not be reconciled within the scenarios of late dark energy. Nevertheless, our analysis suggests that the TDE model can reconcile with CMB and SNe Ia calibrated by its absolute magnitude ($M_{\rm{B}}$) when the equation of state (EoS) of DE transits around $z\sim1$. Meanwhile, we see a positive sign that the EoS transits with the inclusion of a local prior on $M_{\rm{B}}$, whereas the opposite is true without the $M_{\rm{B}}$ prior.

preprint2022arXiv

Component Prototypes towards a Low-Latency, Small-form-factor Optical Link for the ATLAS Liquid Argon Calorimeter Phase-I Trigger Upgrade

This paper presents several component prototypes towards a low-latency, small-form-factor optical link designed for the ATLAS Liquid Argon Calorimeter Phase-I trigger upgrade. A prototype of the custom-made dual-channel optical transmitter module, the Miniature optical Transmitter (MTx), with separate transmitter optical sub-assemblies (TOSAs) has been demonstrated at data rates up to 8 Gbps per channel. A Vertical-Cavity Surface-Emitting Laser (VCSEL) driver ASIC has been developed and is used in the current MTx prototypes. A serializer ASIC prototype, operating at up to 8 Gbps per channel, has been designed and tested. A low-latency, low-overhead encoder ASIC prototype has been designed and tested. The latency of the whole link, including the transmitter latency and the receiver latency but not the latency of the fiber, is estimated to be less than 57.9 ns. The size of the MTx is 45 mm x 15 mm x 6 mm.

preprint2022arXiv

Critical Quantum Metrology in the Non-Linear Quantum Rabi Model

The quantum Rabi model (QRM) with linear coupling between light mode and qubit exhibits the analog of a second order phase transition for vanishing mode frequency which allows for criticality-enhanced quantum metrology in a few-body system. We show that the QRM including a non-linear coupling term exhibits much higher measurement precisions due to its first order like phase transition at \emph{finite} frequency, avoiding the detrimental slowing-down effect close to the critical point of the linear QRM. When a bias term is added to the Hamiltonian, the system can be used as a fluxmeter or magnetometer if implemented in circuit QED platforms.

preprint2022arXiv

Deep Hierarchy Quantization Compression algorithm based on Dynamic Sampling

Unlike traditional distributed machine learning, federated learning stores data locally for training and then aggregates the models on the server, which solves the data security problem that may arise in traditional distributed machine learning. However, during the training process, the transmission of model parameters can impose a significant load on the network bandwidth. It has been pointed out that the vast majority of model parameters are redundant during model parameter transmission. In this paper, we explore the data distribution law of selected partial model parameters on this basis, and propose a deep hierarchical quantization compression algorithm, which further compresses the model and reduces the network load brought by data transmission through the hierarchical quantization of model parameters. And we adopt a dynamic sampling strategy for the selection of clients to accelerate the convergence of the model. Experimental results on different public datasets demonstrate the effectiveness of our algorithm.

preprint2022arXiv

EHAP-ORAM: Efficient Hardware-Assisted Persistent ORAM System for Non-volatile Memory

Oblivious RAM (ORAM) is a provable secure primitive to prevent access pattern leakage on the memory bus. It serves as the intermediate layer between the trusted on-chip components and the untrusted external memory systems to modulate the original memory access patterns into indistinguishable memory sequences. By randomly remapping the data blocks and accessing redundant blocks, ORAM prevents access pattern leakage through obfuscation. While there is much prior work focusing on improving ORAM's performance on the conventional DRAM-based memory system, when the memory technology shifts to use non-volatile memory (NVM), new challenges come up as to how to efficiently support crash consistency for ORAM. In this work, we propose EHAP-ORAM, which studies how to persist ORAM construction with an NVM-based memory system. We first analyze the design requirements for a persistent ORAM system and discuss the need to preserve crash consistency and atomicity for both data and ORAM metadata. Next, we discuss some of the challenges in the design of a persistent ORAM system and propose some solutions to those challenges. Then, we propose the modified on-chip ORAM controller architecture. Based on the improved hardware architecture of the ORAM controller on-chip, we propose different persistency protocols to ensure the crash consistency of the ORAM system and satisfy that the metadata in PosMap is safe when it is persisted to NVM in trusted/untrusted off-chip. The proposed architecture and persistency protocol steps minimize the overhead and leakage during the write-back process. Finally, we compared our persistent ORAM with the system without crash consistency support, show that in non-recursive and recursive cases, EHAP-ORAM only incurs 3.36% and 3.65% performance overhead. The results show that the EHAP-ORAM can support efficient crash consistency with minimal performance and hardware overhead.

preprint2022arXiv

Learning from Counterfactual Links for Link Prediction

Learning to predict missing links is important for many graph-based applications. Existing methods were designed to learn the association between observed graph structure and existence of link between a pair of nodes. However, the causal relationship between the two variables was largely ignored for learning to predict links on a graph. In this work, we visit this factor by asking a counterfactual question: "would the link still exist if the graph structure became different from observation?" Its answer, counterfactual links, will be able to augment the graph data for representation learning. To create these links, we employ causal models that consider the information (i.e., learned representations) of node pairs as context, global graph structural properties as treatment, and link existence as outcome. We propose a novel data augmentation-based link prediction method that creates counterfactual links and learns representations from both the observed and counterfactual links. Experiments on benchmark data show that our graph learning method achieves state-of-the-art performance on the task of link prediction.

preprint2022arXiv

Limit on the dark matter mass from its interaction with photons

In this work, we explore the phenomenology of generalized dark matter (GDM) which interacts with photons ($γ$). We assume that DM establishes elastic scattering with $γ$ when it has already become nonrelativistic, otherwise the abundance of DM today is disfavored by current observations. Within this scenario, the equation of state (EoS) of DM is determined by its mass ($m_χ$) and the DM-$γ$ scattering cross-section. The distinctive imprints of a nonzero EoS of DM on CMB angular power spectrum allow us to set a lower limit on $m_χ$ with Planck 2018 data alone, i.e., $m_χ > 8.7$ keV at $95\%$ C.L. In the study of cosmic concordance problems, we find that the GDM scenario preserves the sound horizon ($r_s(z_*)$) predicted in the fiducial $Λ$CDM model, and thus does not solve the $H_0$ tension. When performing the joint analysis of Planck+LSS datasets, the best-fit $S_8= 0.785\pm 0.017$ closely matches the given $S_8$ prior. This suggests that the GDM scenario can be counted as a viable candidate to restore the $S_8$ ($σ_{8}$) tension.

preprint2022arXiv

On the Relationship Between Counterfactual Explainer and Recommender

Recommender systems employ machine learning models to learn from historical data to predict the preferences of users. Deep neural network (DNN) models such as neural collaborative filtering (NCF) are increasingly popular. However, the tangibility and trustworthiness of the recommendations are questionable due to the complexity and lack of explainability of the models. To enable explainability, recent techniques such as ACCENT and FIA are looking for counterfactual explanations that are specific historical actions of a user, the removal of which leads to a change to the recommendation result. In this work, we present a general framework for both DNN and non-DNN models so that the counterfactual explainers all belong to it with specific choices of components. This framework first estimates the influence of a certain historical action after its removal and then uses search algorithms to find the minimal set of such actions for the counterfactual explanation. With this framework, we are able to investigate the relationship between the explainers and recommenders. We empirically study two recommender models (NCF and Factorization Machine) and two datasets (MovieLens and Yelp). We analyze the relationship between the performance of the recommender and the quality of the explainer. We observe that with standard evaluation metrics, the explainers deliver worse performance when the recommendations are more accurate. This indicates that having good explanations to correct predictions is harder than having them to wrong predictions. The community needs more fine-grained evaluation metrics to measure the quality of counterfactual explanations to recommender systems.

preprint2022arXiv

Robust Vehicle Positioning based on Multi-Epoch and Multi-Antenna TOAs in Harsh Environments

For radio-based time-of-arrival (TOA) positioning systems applied in harsh environments, obstacles in the surroundings and on the vehicle itself will block the signals from the anchors, reduce the number of available TOA measurements and thus degrade the localization performance. Conventional multi-antenna positioning technique requires a good initialization to avoid local minima, and suffers from location ambiguity due to insufficient number of TOA measurements and/or poor geometry of anchors at a single epoch. A new initialization method based on semidefinite programming (SDP), namely MEMA-SDP, is first designed to address the initialization problem of the MEMA-TOA method. Then, an iterative refinement step is developed to obtain the optimal positioning result based on the MEMA-SDP initialization. We derive the Cramer-Rao lower bound (CRLB) to analyze the accuracy of the new MEMA-TOA method theoretically, and show its superior positioning performance over the conventional single-epoch and multi-antenna (SEMA) localization method. Simulation results in harsh environments demonstrate that i) the new MEMA-SDP provides an initial estimation that is close to the real location, and empirically guarantees the global optimality of the final refined positioning solution, and ii) compared with the conventional SEMA method, the new MEMA-TOA method has higher positioning accuracy without location ambiguity, consistent with the theoretical analysis.

preprint2022arXiv

The Miniature Optical Transmitter and Transceiver For the High-Luminosity LHC (HL-LHC) experiments

We present the design and test results of the Miniature optical Transmitter (MTx) and Transceiver (MTRx) for the high luminosity LHC (HL-LHC) experiments. MTx and MTRx are Transmitter Optical Subassembly (TOSA) and Receiver Optical Subassembly (ROSA) based. There are two major developments: the Vertical Cavity Surface Emitting Laser (VCSEL) driver ASIC LOCld and the mechanical latch that provides the connection to fibers. In this paper, we concentrate on the justification of this work, the design of the latch and the test results of these two modules with a Commercial Off-The-Shelf (COTS) VCSEL driver.

preprint2022arXiv

Why does Self-Supervised Learning for Speech Recognition Benefit Speaker Recognition?

Recently, self-supervised learning (SSL) has demonstrated strong performance in speaker recognition, even if the pre-training objective is designed for speech recognition. In this paper, we study which factor leads to the success of self-supervised learning on speaker-related tasks, e.g. speaker verification (SV), through a series of carefully designed experiments. Our empirical results on the Voxceleb-1 dataset suggest that the benefit of SSL to SV task is from a combination of mask speech prediction loss, data scale, and model size, while the SSL quantizer has a minor impact. We further employ the integrated gradients attribution method and loss landscape visualization to understand the effectiveness of self-supervised learning for speaker recognition performance.

preprint2020arXiv

A Differential Approach for Gaze Estimation

Non-invasive gaze estimation methods usually regress gaze directions directly from a single face or eye image. However, due to important variabilities in eye shapes and inner eye structures amongst individuals, universal models obtain limited accuracies and their output usually exhibit high variance as well as biases which are subject dependent. Therefore, increasing accuracy is usually done through calibration, allowing gaze predictions for a subject to be mapped to his/her actual gaze. In this paper, we introduce a novel image differential method for gaze estimation. We propose to directly train a differential convolutional neural network to predict the gaze differences between two eye input images of the same subject. Then, given a set of subject specific calibration images, we can use the inferred differences to predict the gaze direction of a novel eye sample. The assumption is that by allowing the comparison between two eye images, annoyance factors (alignment, eyelid closing, illumination perturbations) which usually plague single image prediction methods can be much reduced, allowing better prediction altogether. Experiments on 3 public datasets validate our approach which constantly outperforms state-of-the-art methods even when using only one calibration sample or when the latter methods are followed by subject specific gaze adaptation.

preprint2020arXiv

Abnormally low thermal conductivity of 2D selenene: An ab initio study

The lattice thermal conductivity and thermal transport properties of 2D $α$-selenene are investigated based on the first-principles calculations. The isotropic in-plane thermal conductivity is as low as 3.04 W m$^{-1}$ K$^{-1}$ at room temperature, even abnormally lower than $α$-tellurene which processes analogous configuration and lower Debye temperature. We find this abnormal phenomenon reasonably stems from the larger anharmonicity of the acoustic phonon branch. Moreover, the phonon spectra, elastic properties, and related thermal properties are also exhibited. Acoustic phonons contribute mainly to the total thermal conductivity. Furthermore, size effect, boundary effect, the total phase space for three-phonon processes, phonon group velocity and relaxation time are further investigated, and the last one is unveiled to be the key ingredient of thermal transport in 2D selenene.

preprint2020arXiv

Gromov-Hausdorff limits of Kähler manifolds with Ricci curvature bounded below

We show that non-collapsed Gromov-Hausdorff limits of polarized Kahler manifolds, with Ricci curvature bounded below, are normal projective varieties, and the metric singularities of the limit space are precisely given by a countable union of analytic subvarieties. This extends a fundamental result of Donaldson-Sun, in which 2-sided Ricci curvature bounds were assumed. As a basic ingredient we show that, under lower Ricci curvature bounds, almost Euclidean balls in Kahler manifolds admit good holomorphic coordinates. Further applications are integral bounds for the scalar curvature on balls, and a rigidity theorem for Kahler manifolds with almost Euclidean volume growth.

preprint2019arXiv

Dual pairs in the Pin-group and duality for the corresponding spinorial representation

In this paper, we give a complete picture of Howe correspondence for the setting ($O(E, b), Pin(E, b), Π$), where $O(E, b)$ is an orthogonal group (real or complex), $Pin(E, b)$ is the two-fold Pin-covering of $O(E, b)$, and $Π$ is the spinorial representation of $Pin(E, b)$. More precisely, for a dual pair ($G, G'$) in $O(E, b)$, we determine explicitly the nature of its preimages $(\tilde{G}, \tilde{G'})$ in $Pin(E, b)$, and prove that apart from some exceptions, $(\tilde{G}, \tilde{G'})$ is always a dual pair in $Pin(E, b)$; then we establish the Howe correspondence for $Π$ with respect to $(\tilde{G}, \tilde{G'})$.