Trust snapshot

Quick read

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

12 published item(s)

preprint2026arXiv

Bridging Visual Intuition and Chemical Expertise: An Autonomous Analysis Framework for Nonadiabatic Dynamics Simulations via Mentor-Engineer-Student Collaboration

Analyzing nonadiabatic molecular dynamics trajectories traditionally heavily relies on expert intuition and visual pattern recognition, a process that is difficult to formalize. We present VisU, a vision-driven framework that leverages the complementary strengths of two state-of-the-art large language models to establish a "virtual research collective." This collective operates through a "Mentor-Engineer-Student" paradigm that mimics the collaborative intelligence of a professional chemistry laboratory. Within this ecosystem, the Mentor provides physical intuition through visual reasoning, while the Engineer adaptively constructs analysis scripts, and the Student executes the pipeline and manages the data and results. VisU autonomously orchestrates a four-stage workflow comprising Preprocessing, Recursive Channel Discovery, Important-Motion Identification, and Validation/Summary. This systematic approach identifies reaction channels and key nuclear motions while generating professional academic reports. By bridging visual insight with chemical expertise, VisU establishes a new paradigm for human-AI collaboration in the analysis of excited-state dynamics simulation results, significantly reducing dependence on manual interpretation and enabling more intuitive, scalable mechanistic discovery.

preprint2026arXiv

PolitNuggets: Benchmarking Agentic Discovery of Long-Tail Political Facts

Large Reasoning Models (LRMs) embedded in agentic frameworks have transformed information retrieval from static, long context question answering into open-ended exploration. Yet real world use requires models to discover and synthesize "long-tail" facts from dispersed sources, a capability that remains under-evaluated. We introduce PolitNuggets, a multilingual benchmark for agentic information synthesis via constructing political biographies for 400 global elites, covering over 10000 political facts. We standardize evaluation with an optimized multi agent system and propose FactNet, an evidence conditional protocol that scores discovery, fine-grained accuracy, and efficiency. Across models and settings, we find that current systems often struggle with fine-grained details, and vary substantially in efficiency. Finally, using benchmark diagnostics, we relate agent performance to underlying model capabilities, highlighting the importance of short-context extraction, multilingual robustness, and reliable tool use.

preprint2022arXiv

Arbitrary Bit-width Network: A Joint Layer-Wise Quantization and Adaptive Inference Approach

Conventional model quantization methods use a fixed quantization scheme to different data samples, which ignores the inherent "recognition difficulty" differences between various samples. We propose to feed different data samples with varying quantization schemes to achieve a data-dependent dynamic inference, at a fine-grained layer level. However, enabling this adaptive inference with changeable layer-wise quantization schemes is challenging because the combination of bit-widths and layers is growing exponentially, making it extremely difficult to train a single model in such a vast searching space and use it in practice. To solve this problem, we present the Arbitrary Bit-width Network (ABN), where the bit-widths of a single deep network can change at runtime for different data samples, with a layer-wise granularity. Specifically, first we build a weight-shared layer-wise quantizable "super-network" in which each layer can be allocated with multiple bit-widths and thus quantized differently on demand. The super-network provides a considerably large number of combinations of bit-widths and layers, each of which can be used during inference without retraining or storing myriad models. Second, based on the well-trained super-network, each layer's runtime bit-width selection decision is modeled as a Markov Decision Process (MDP) and solved by an adaptive inference strategy accordingly. Experiments show that the super-network can be built without accuracy degradation, and the bit-widths allocation of each layer can be adjusted to deal with various inputs on the fly. On ImageNet classification, we achieve 1.1% top1 accuracy improvement while saving 36.2% BitOps.

preprint2022arXiv

Cost Effective MLaaS Federation: A Combinatorial Reinforcement Learning Approach

With the advancement of deep learning techniques, major cloud providers and niche machine learning service providers start to offer their cloud-based machine learning tools, also known as machine learning as a service (MLaaS), to the public. According to our measurement, for the same task, these MLaaSes from different providers have varying performance due to the proprietary datasets, models, etc. Federating different MLaaSes together allows us to improve the analytic performance further. However, naively aggregating results from different MLaaSes not only incurs significant momentary cost but also may lead to sub-optimal performance gain due to the introduction of possible false-positive results. In this paper, we propose Armol, a framework to federate the right selection of MLaaS providers to achieve the best possible analytic performance. We first design a word grouping algorithm to unify the output labels across different providers. We then present a deep combinatorial reinforcement learning based-approach to maximize the accuracy while minimizing the cost. The predictions from the selected providers are then aggregated together using carefully chosen ensemble strategies. The real-world trace-driven evaluation further demonstrates that Armol is able to achieve the same accuracy results with $67\%$ less inference cost.

preprint2022arXiv

FedWalk: Communication Efficient Federated Unsupervised Node Embedding with Differential Privacy

Node embedding aims to map nodes in the complex graph into low-dimensional representations. The real-world large-scale graphs and difficulties of labeling motivate wide studies of unsupervised node embedding problems. Nevertheless, previous effort mostly operates in a centralized setting where a complete graph is given. With the growing awareness of data privacy, data holders who are only aware of one vertex and its neighbours demand greater privacy protection. In this paper, we introduce FedWalk, a random-walk-based unsupervised node embedding algorithm that operates in such a node-level visibility graph with raw graph information remaining locally. FedWalk is designed to offer centralized competitive graph representation capability with data privacy protection and great communication efficiency. FedWalk instantiates the prevalent federated paradigm and contains three modules. We first design a hierarchical clustering tree (HCT) constructor to extract the structural feature of each node. A dynamic time warping algorithm seamlessly handles the structural heterogeneity across different nodes. Based on the constructed HCT, we then design a random walk generator, wherein a sequence encoder is designed to preserve privacy and a two-hop neighbor predictor is designed to save communication cost. The generated random walks are then used to update node embedding based on a SkipGram model. Extensive experiments on two large graphs demonstrate that Fed-Walk achieves competitive representativeness as a centralized node embedding algorithm does with only up to 1.8% Micro-F1 score and 4.4% Marco-F1 score loss while reducing about 6.7 times of inter-device communication per walk.

preprint2022arXiv

Parallel Spatio-Temporal Attention-Based TCN for Multivariate Time Series Prediction

As industrial systems become more complex and monitoring sensors for everything from surveillance to our health become more ubiquitous, multivariate time series prediction is taking an important place in the smooth-running of our society. A recurrent neural network with attention to help extend the prediction windows is the current-state-of-the-art for this task. However, we argue that their vanishing gradients, short memories, and serial architecture make RNNs fundamentally unsuited to long-horizon forecasting with complex data. Temporal convolutional networks (TCNs) do not suffer from gradient problems and they support parallel calculations, making them a more appropriate choice. Additionally, they have longer memories than RNNs, albeit with some instability and efficiency problems. Hence, we propose a framework, called PSTA-TCN, that combines a parallel spatio-temporal attention mechanism to extract dynamic internal correlations with stacked TCN backbones to extract features from different window sizes. The framework makes full use parallel calculations to dramatically reduce training times, while substantially increasing accuracy with stable prediction windows up to 13 times longer than the status quo.

preprint2022arXiv

Topological classification for intersection singularities of exceptional surfaces in pseudo-Hermitian systems

Exceptional points play a pivotal role in the topology of non-Hermitian systems, and significant advances have been made in classifying exceptional points and exploring the associated phenomena. Exceptional surfaces, which are hypersurfaces of exceptional degeneracies in parameter space, can support hypersurface singularities, such as cusps, intersections and swallowtail catastrophes. Here we topologically classify the intersection singularity of exceptional surfaces for a generic pseudo-Hermitian system with parity-time symmetry. By constructing the quotient space under equivalence relations of eigenstates, we reveal that the topology of such gapless structures can be described by a non-Abelian free group on three generators. Importantly, the classification predicts a new kind of non-Hermitian gapless topological phase and can systematically explain how the exceptional surfaces and their intersections evolve under perturbations with symmetries preserved. Our work opens a new pathway for designing systems with robust topological phases, and provides inspiration for applications such as sensing and lasing which can utilize the special properties inherent in exceptional surfaces and intersections.

preprint2020arXiv

Modeling and theoretical analysis of SDBD plasma actuators driven by Fast-Rise-Slow-Decay Pulsed-DC voltages

Surface dielectric barrier discharge (SDBD) actuators driven by the Pulsed-DC voltages are analyzed. The Pulsed-DC SDBD studied in this work is equivalent to a classical SDBD driven by a tailored Fast-Rise-Slow-Decay (FRSD) voltage waveform. The plasma channel formation and charge production process in the voltage rising stage are studied at different slopes using a classical 2D fluid model, the thrust generated in the voltage decaying stage is studied based on an analytical approach taking 2D model results as the input. A thrust pulse is generated in the trailing edge of the voltage waveform and reaches maximum when the voltage decreases by approximately the value of cathode voltage fall~($\approx$600~V). The time duration of the rising and trailing edge, the decay rate and the amplitude of applied voltage are the main factors affecting the performance of the actuator. Analytical expressions are formulated for the value and time moment of peak thrust, the upper limit of thrust is also estimated. Higher voltage rising rate leads to higher charge density in the voltage rising stage thus higher thrust. Shorter voltage trailing edge, in general, results in higher value and earlier appearance of the peak thrust. The detailed profile of the trailing edge also affects the performance. Results in this work allow us to flexibly design the FRSD waveforms for an SDBD actuator according to the requirements of active flow control in different application conditions.

preprint2020arXiv

PHOTOPiC: Calculate photo-ionization functions and model coefficients for gas discharge simulations

A program to compute photo-ionization functions and fitting parameters for an efficient photo-ionization model is presented. The code integrates the product of spectrum emission intensity, the photo-ionization yield and the absorption coefficient to calculate the photo-ionization function of each gas and the total photo-ionization function of the mixture. The coefficients of Helmholtz photo-ionization model is obtained by fitting the total photo-ionization function. A database consisting $\rm N_2$, $\rm O_2$, $\rm CO_2$ and $\rm H_2O$ molecules are included and can be modified by the users. The program provides more accurate photo-ionization functions and source terms for plasma fluid models.

preprint2018arXiv

Semistable models for modular curves and power operations for Morava E-theories of height 2

We construct an integral model for Lubin-Tate curves as moduli of finite subgroups of formal deformations over complete Noetherian local rings. They are p-adic completions of the modular curves X_0(p) at a mod-p supersingular point. Our model is semistable in the sense that the only singularities of its special fiber are normal crossings. Given this model, we obtain a uniform presentation for the Dyer-Lashof algebra of Morava E-theories at height 2 as local moduli of power operations in elliptic cohomology.

preprint2017arXiv

Norm coherence for descent of level structures on formal deformations

We give a formulation for descent of level structures on deformations of formal groups, and study the compatibility between the descent and a norm construction. Under this framework, we generalize Ando's construction of H-infinity complex orientations for Morava E-theories associated to Honda formal group laws over F_p. We show the existence and uniqueness of such an orientation for any Morava E-theory associated to a formal group law over an algebraic extension of F_p and, in particular, orientations for a family of elliptic cohomology theories. These orientations correspond to coordinates on deformations of formal groups which are compatible with norm maps along descent.

preprint2015arXiv

The Hecke algebra action on Morava E-theory of height 2

Given a one-dimensional formal group of height 2, let E be the Morava E-theory spectrum associated to its universal deformation over the Lubin-Tate ring. By computing with moduli spaces of elliptic curves, we give an explicitation for an algebra of Hecke operators acting on E-cohomology. This leads to a vanishing result for Rezk's logarithmic cohomology operation on the units of E. It identifies a family of elements in the kernel with meromorphic modular forms whose Serre derivative is zero. Our calculation finds a connection to logarithms of modular units. In particular, we work out an action of Hecke operators on certain "logarithmic" q-series, in the sense of Knopp and Mason, that agrees with our vanishing result and extends the classical Hecke action on modular forms.