Trust snapshot

Quick read

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

15 published item(s)

preprint2026arXiv

Learning to Dock: Geometric Deep Learning for Predicting Supramolecular Host-Guest Complexes

Predicting non-covalent host-guest recognition remains challenging due to the complex interplay of electrostatics, dispersion, and steric effects, and the limited transferability of existing docking approaches to synthetic supramolecular systems. Here we present DeepHostGuest, a geometric deep-learning framework that learns generalizable recognition principles directly from experimentally resolved host-guest structures. Hosts are encoded as electrostatic surfaces and guests as molecular graphs, enabling transferable learning across diverse supramolecular systems. DeepHostGuest achieves high-accuracy predictions (RMSD $\leq 2$ Angstrom for 80.8% of test cases), substantially outperforming classical docking without case-specific tuning. Notably, the method generalizes beyond its training domain to crystalline sponge systems, accurately capturing the binding of large amphiphilic molecules within metal-organic cages. Beyond predicting binding conformations, the structures generated by DeepHostGuest serve as a reliable basis for accurate binding free-energy calculations. Density Functional Theory (DFT)-calculated affinities correlate well with experiment, enabling structure-property relationships across 876 host-guest complexes spanning 34 host families. Interpretable feature analysis reveals that binding strength arises from a cooperative interplay of host polarity, guest hydrophobicity, and geometric complementarity, with distinct design regimes across supramolecular classes. Together, these results establish data-driven molecular recognition as a practical route to predictive supramolecular design, enabling high-throughput virtual screening and rational optimization of functional host-guest systems.

preprint2026arXiv

Semantic Voting: Execution-Grounded Consensus for LLM Code Generation

LLM code-generation pipelines often sample multiple candidates and select one final answer without access to a complete oracle. Existing pipelines mix textual voting, ranking, and execution-based agreement, but the relative contribution of each component remains unclear. We study 18 configurations across different models, thinking levels, and benchmarks, comparing output-pattern majority voting, weighted voting, MBR-Exec, and SemanticVote - a method that clusters candidates by execution fingerprints on LLM-generated inputs. Three findings emerge. (1) The best execution-based selector exceeds output-pattern majority voting by 19-52 percentage points on every configuration, with every execution-based selector exceeding it by at least 18 points. (2) Once candidates are executed on diverse inputs, aggregation rule has limited effect: SemanticVote, weighted voting, and MBR-Exec are statistically indistinguishable across all 18 configurations. The largest factor is input quality: sketch-based input generation consistently outperforms direct LLM generation by 0.6-2.1 pp and random fuzzing by up to 11.3 pp. (3) Thinking level interacts differently with selection families: deeper thinking improves majority voting by 12 pp but execution-based methods stay flat or degrade as candidate diversity falls. These results frame inference-time code selection as a signal-quality problem rather than an aggregation-rule problem: when oracles are unavailable, the behavioral evidence matters more than the aggregation rule.

preprint2026arXiv

Sketch-and-Verify: Structured Inference-Time Scaling via Program Sketching

SKETCHVERIFY is a within-tier cost-performance policy, not a universal accuracy improvement. The operational question: a practitioner stuck with a small, cheap code model (here, Gemini 3.1 Flash Lite) for latency, deployment, or budget reasons -- how should they spend a small amount of extra test-time compute? SKETCHVERIFY factorizes the search space: the LLM enumerates K distinct algorithmic strategies, writes a program sketch for each (a partial program with ?? holes), and fills each sketch M times, producing K x M structurally diverse candidates that are verified by execution and selected by fingerprint clustering. Each extra sketch is guaranteed to explore a different algorithm; each extra flat sample likely duplicates an existing one. Our central evidence is a cost-quality Pareto plot on HumanEval+ across three Gemini tiers (Lite, Flash, Pro), and a reanalysis of the 19 problems where Lite greedy fails. Two findings: (1) Within-tier, sketching dominates flat sampling at matched candidate count. On the hard subset, Lite Sketch K=2, M=5 recovers 11/19 (58%) vs. flat N=10 at 5/19 (26%, +32pp); Lite Sketch K=10, M=10 recovers 15/19 (79%) vs. flat N=100 at 10/19 (53%, +26pp). Flat cannot close the gap even at ~3x the budget: flat N=50 still loses to Sketch K=2, M=5 by +11pp. (2) Cross-tier, sketching does not replace upgrading. Pro greedy (89%) dominates Lite Sketch K=10, M=10 (79%) on both pass@1 and dollar cost. Practitioner rule: if a stronger tier is available, use greedy on it; otherwise sketching is the cost-effective way to spend extra compute. We characterize the K-vs-M trade-off via a Flash Lite scaling sweep, report HumanEval+ saturation on Flash and Pro, and show the method composes cleanly with execution-based selection from the concurrent Semantic Voting line of work.

preprint2023arXiv

Multifunctional fiber-based optoacoustic emitter for non-genetic bidirectional neural communication

A bidirectional brain interface with both "write" and "read" functions can be an important tool for fundamental studies and potential clinical treatments for neurological diseases. Here we report a miniaturized multifunctional fiber based optoacoustic emitter (mFOE) that first integrates simultaneous non-genetic optoacoustic stimulation for "write" and electrophysiology recording of neural circuits for "read". The non-genetic feature addresses the challenges of the viral transfection required by optogenetics in primates and human. The orthogonality between optoacoustic waves and electrical field provides a solution to avoid the interference between electrical stimulation and recording. We first validated the non-genetic stimulation function of the mFOE in rat cultured neurons using calcium imaging. In vivo application of mFOE for successful simultaneous optoacoustic stimulation and electrical recording of brain activities was confirmed in mouse hippocampus in both acute and chronical applications up to 1 month. Minimal brain tissue damage has been confirmed after these applications. The capability of non-genetic neural stimulation and recording enabled by mFOE opens up new possibilities for the investigation of neural circuits and brings new insights into the study of ultrasound neurostimulation.

preprint2022arXiv

EaaS: A Service-Oriented Edge Computing Framework Towards Distributed Intelligence

Edge computing has become a popular paradigm where services and applications are deployed at the network edge closer to the data sources. It provides applications with outstanding benefits, including reduced response latency and enhanced privacy protection. For emerging advanced applications, such as autonomous vehicles, industrial IoT, and metaverse, further research is needed. This is because such applications demand ultra-low latency, hyper-connectivity, and dynamic and reliable service provision, while existing approaches are inadequate to address the new challenges. Hence, we envision that the future edge computing is moving towards distributed intelligence, where heterogeneous edge nodes collaborate to provide services in large-scale and geo-distributed edge infrastructure. We thereby propose Edge-as-a-Service (EaaS) to enable distributed intelligence. EaaS jointly manages large-scale cross-node edge resources and facilitates edge autonomy, edge-to-edge collaboration, and resource elasticity. These features enable flexible deployment of services and ubiquitous computation and intelligence. We first give an overview of existing edge computing studies and discuss their limitations to articulate the motivation for proposing EaaS. Then, we describe the details of EaaS, including the physical architecture, proposed software framework, and benefits of EaaS. Various application scenarios, such as real-time video surveillance, smart building, and metaverse, are presented to illustrate the significance and potential of EaaS. Finally, we discuss several challenging issues of EaaS to inspire more research towards this new edge computing framework.

preprint2022arXiv

From Multi-agent to Multi-robot: A Scalable Training and Evaluation Platform for Multi-robot Reinforcement Learning

Multi-agent reinforcement learning (MARL) has been gaining extensive attention from academia and industries in the past few decades. One of the fundamental problems in MARL is how to evaluate different approaches comprehensively. Most existing MARL methods are evaluated in either video games or simplistic simulated scenarios. It remains unknown how these methods perform in real-world scenarios, especially multi-robot systems. This paper introduces a scalable emulation platform for multi-robot reinforcement learning (MRRL) called SMART to meet this need. Precisely, SMART consists of two components: 1) a simulation environment that provides a variety of complex interaction scenarios for training and 2) a real-world multi-robot system for realistic performance evaluation. Besides, SMART offers agent-environment APIs that are plug-and-play for algorithm implementation. To illustrate the practicality of our platform, we conduct a case study on the cooperative driving lane change scenario. Building off the case study, we summarize several unique challenges of MRRL, which are rarely considered previously. Finally, we open-source the simulation environments, associated benchmark tasks, and state-of-the-art baselines to encourage and empower MRRL research.

preprint2022arXiv

Hierarchical Reinforcement Learning with Opponent Modeling for Distributed Multi-agent Cooperation

Many real-world applications can be formulated as multi-agent cooperation problems, such as network packet routing and coordination of autonomous vehicles. The emergence of deep reinforcement learning (DRL) provides a promising approach for multi-agent cooperation through the interaction of the agents and environments. However, traditional DRL solutions suffer from the high dimensions of multiple agents with continuous action space during policy search. Besides, the dynamicity of agents' policies makes the training non-stationary. To tackle the issues, we propose a hierarchical reinforcement learning approach with high-level decision-making and low-level individual control for efficient policy search. In particular, the cooperation of multiple agents can be learned in high-level discrete action space efficiently. At the same time, the low-level individual control can be reduced to single-agent reinforcement learning. In addition to hierarchical reinforcement learning, we propose an opponent modeling network to model other agents' policies during the learning process. In contrast to end-to-end DRL approaches, our approach reduces the learning complexity by decomposing the overall task into sub-tasks in a hierarchical way. To evaluate the efficiency of our approach, we conduct a real-world case study in the cooperative lane change scenario. Both simulation and real-world experiments show the superiority of our approach in the collision rate and convergence speed.

preprint2022arXiv

Supercloseness of the local discontinuous Galerkin method for a singularly perturbed convection-diffusion problem

A singularly perturbed convection-diffusion problem posed on the unit square in $\mathbb{R}^2$, whose solution has exponential boundary layers, is solved numerically using the local discontinuous Galerkin (LDG) method with piecewise polynomials of degree at most $k>0$ on three families of layer-adapted meshes: Shishkin-type, Bakhvalov-Shishkin-type and Bakhvalov-type.On Shishkin-type meshes this method is known to be no greater than $O(N^{-(k+1/2)})$ accurate in the energy norm induced by the bilinear form of the weak formulation, where $N$ mesh intervals are used in each coordinate direction. (Note: all bounds in this abstract are uniform in the singular perturbation parameter and neglect logarithmic factors that will appear in our detailed analysis.) A delicate argument is used in this paper to establish $O(N^{-(k+1)})$ energy-norm superconvergence on all three types of mesh for the difference between the LDG solution and a local Gauss-Radau projection of the exact solution into the finite element space. This supercloseness property implies a new $N^{-(k+1)}$ bound for the $L^2$ error between the LDG solution on each type of mesh and the exact solution of the problem; this bound is optimal (up to logarithmic factors). Numerical experiments confirm our theoretical results.

preprint2021arXiv

The free energy of twisting spins in Mn$_3$Sn

The magnetic free energy is usually quadratic in magnetic field and depends on the mutual orientation of the magnetic field and the crystalline axes. Tiny in magnitude, this magnetocrystalline anisotropy energy (MAE) is nevertheless indispensable for the existence of permanent magnets. Here, we show that in Mn$_3$Sn, a non-collinear antiferromagnet attracting much attention following the discovery of its large anomalous Hall effect, the free energy of spins has superquadratic components, which drive the MAE. We experimentally demonstrate that the thermodynamic free energy includes terms odd in magnetic field ($\mathcal{O}(H^3)+\mathcal{O}(H^5)$) and generating sixfold and twelve-fold angular oscillations in the torque response. We show that they are quantitatively explained by theory, which can be used to quantify relevant energy scales (Heisenberg, Dzyaloshinskii-Moriya, Zeeman and single-ion anisotropy) of the system. Based on the theory, we conclude that, in contrast with common magnets, what drives the MAE in Mn$_3$Sn is the field-induced deformation of the spin texture.

preprint2020arXiv

A novel sentence embedding based topic detection method for micro-blog

Topic detection is a challenging task, especially without knowing the exact number of topics. In this paper, we present a novel approach based on neural network to detect topics in the micro-blogging dataset. We use an unsupervised neural sentence embedding model to map the blogs to an embedding space. Our model is a weighted power mean word embedding model, and the weights are calculated by attention mechanism. Experimental result shows our embedding method performs better than baselines in sentence clustering. In addition, we propose an improved clustering algorithm referred as relationship-aware DBSCAN (RADBSCAN). It can discover topics from a micro-blogging dataset, and the topic number depends on dataset character itself. Moreover, in order to solve the problem of parameters sensitive, we take blog forwarding relationship as a bridge of two independent clusters. Finally, we validate our approach on a dataset from sina micro-blog. The result shows that we can detect all the topics successfully and extract keywords in each topic.

preprint2020arXiv

Channel-wise Alignment for Adaptive Object Detection

Generic object detection has been immensely promoted by the development of deep convolutional neural networks in the past decade. However, in the domain shift circumstance, the changes in weather, illumination, etc., often cause domain gap, and thus performance drops substantially when detecting objects from one domain to another. Existing methods on this task usually draw attention on the high-level alignment based on the whole image or object of interest, which naturally, cannot fully utilize the fine-grained channel information. In this paper, we realize adaptation from a thoroughly different perspective, i.e., channel-wise alignment. Motivated by the finding that each channel focuses on a specific pattern (e.g., on special semantic regions, such as car), we aim to align the distribution of source and target domain on the channel level, which is finer for integration between discrepant domains. Our method mainly consists of self channel-wise and cross channel-wise alignment. These two parts explore the inner-relation and cross-relation of attention regions implicitly from the view of channels. Further more, we also propose a RPN domain classifier module to obtain a domain-invariant RPN network. Extensive experiments show that the proposed method performs notably better than existing methods with about 5% improvement under various domain-shift settings. Experiments on different task (e.g. instance segmentation) also demonstrate its good scalability.

preprint2020arXiv

Customized Graph Embedding: Tailoring Embedding Vectors to different Applications

Graph is a natural representation of data for a variety of real-word applications, such as knowledge graph mining, social network analysis and biological network comparison. For these applications, graph embedding is crucial as it provides vector representations of the graph. One limitation of existing graph embedding methods is that their embedding optimization procedures are disconnected from the target application. In this paper, we propose a novel approach, namely Customized Graph Embedding (CGE) to tackle this problem. The CGE algorithm learns customized vector representations of graph nodes by differentiating the importance of distinct graph paths automatically for a specific application. Extensive experiments were carried out on a diverse set of node classification datasets, which demonstrate strong performances of CGE and provide deep insights into the model.

preprint2020arXiv

Effects of Digital Map on the RT-based Channel Model for UAV mmWave Communications

Based on the geometry and ray tracing (RT) theory, a millimeter wave (mmWave) channel model and parameter computation method for unmanned aerial vehicle (UAV) assisted air-to-ground (A2G) communications are proposed in this paper. In order to speed up the parameter calculation, a reconstruction process of scene database on the original digital map is developed. Moreover, the effects of reconstruction accuracy on the channel parameter and characteristic are analyzed by extensive simulations at 28 GHz under the campus scene. The simulation and analysis results show that the simplified database can save up to 50% time consumption. However, the difference of statistical properties is slight in the campus scenario.

preprint2020arXiv

PrBi: Topology meets quadrupolar degrees of freedom

Novel materials incorporating electronic degrees of freedom other than charge, including spin, orbital or valley \textit{et al} have manifested themselves to be of the great interests and applicable potentials. Recently, the multipolar degrees of freedom have attracted remarkable attention in the electronic correlated effects. In this work, we systematically studied the transport, magnetic and thermodynamic properties of the topological semimetal candidate PrBi in the framework of crystalline electric field theory. Our results demonstrate the $Γ_3$ non-Kramers doublet as the ground state of Pr$^{3+}$ (4$f^2$) ions. This ground state is nonmagnetic but carries a non-zero quadrupolar moment $\langle\hat{O}_2^0\rangle$. A quadrupolar phase transition is inferred below 0.08 K. No obvious quadrupolar Kondo effect can be identified. Ultrahigh-field quantum oscillation measurements confirm PrBi as a semimetal with non-trivial Berry phase and low total carrier density 0.06 /f.u. We discuss the interplay between low carrier density and $4f^2$ quadrupolar moment, and ascribe the weak quadrupolar ordering and Kondo effect to consequences of the low carrier density. PrBi, thus, opens a new window to the physics of topology and strongly correlated effect with quadrupolar degrees of freedom in the low-carrier-density limit, evoking the need for a reexamination of the Nozières exhaustion problem in the context of multi-channel Kondo effect.

preprint2020arXiv

Topological Dirac states in a layered telluride TaPdTe$_5$ with quasi-one-dimensional PdTe$_2$ chains

We report the synthesis and systematic studies of a new layered ternary telluride TaPdTe5 with quasi-one-dimensional PdTe2 chains. This compound crystalizes in a layered orthorhombic structure with space group Cmcm. Analysis of its curved field-dependent Hall resistivity, using the two-band model, indicates the hole-dominated transport with a high mobility $μ_h$ = 2.38 $\times$ 10$^3$ cm$^2$ V$^{-1}$ s$^{-1}$ at low temperatures. The in-plane magnetoresistance (MR) displays significant anisotropy with field applied along the crystallographic $b$ axis. The MR with the current applied along the $c$-axis is also measured in high magnetic fields up to 51.7 T. Remarkably, it follows a power-law dependence and reaches (9.5 $\times$ 10$^3$)% at 2.1 K without any signature of saturation. The De Haas-van Alphen oscillations show a small Fermi-surface pocket with a nontrivial Berry phase. The Shubnikov-de Haas (SdH) oscillations are detected at low temperatures and under magnetic fields above 28.5 T. Two effective masses $m^*$ (0.26$m_e$ and 0.41$m_e$) are extracted from the oscillatory SdH data. Our first-principles calculations unveil a topological Dirac cone in its surface states, and, in particular, the topological index indicates that TaPdTe$_5$ is a topologically nontrivial material.