BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Yuhang Jiang

Yuhang Jiang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Machine Learningcond-mat.mes-hallArtificial IntelligenceComputer VisionComputation and LanguageMultiagent Systemsphysics.atm-clus

Trust snapshot

Quick read

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

9 published item(s)

preprint2026arXiv

A Benchmark for End-to-End Zero-Shot Biomedical Relation Extraction with LLMs: Experiments with OpenAI Models

Extracting relations from scientific literature is a fundamental task in biomedical NLP because entities and relations among them drive hypothesis generation and knowledge discovery. As literature grows rapidly, relation extraction (RE) is indispensable to curate knowledge graphs to be used as computable structured and symbolic representations. With the rise of LLMs, it is pertinent to examine if it is better to skip tailoring supervised RE methods, save annotation burden, and just use zero shot RE (ZSRE) via LLM API calls. In this paper, we propose a benchmark with seven biomedical RE datasets with interesting characteristics and evaluate three Open AI models (GPT-4, o1, and GPT-OSS-120B) for end-to-end ZSRE. We show that LLM-based ZSRE is inching closer to supervised methods in performances on some datasets but still struggles on complex inputs expressing multiple relations with different predicates. Our error analysis reveals scope for improvements.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Listwise Policy Optimization: Group-based RLVR as Target-Projection on the LLM Response Simplex

Reinforcement learning with verifiable rewards (RLVR) has become a standard approach for large language models (LLMs) post-training to incentivize reasoning capacity. Among existing recipes, group-based policy gradient is prevalent, which samples a group of responses per prompt and updates the policy via group-relative advantage signals. This work reveals that these optimization strategies share a common geometric structure: each implicitly defines a target distribution on the response simplex and projects toward it via first-order approximation. Building on this insight, we propose Listwise Policy Optimization (LPO) to explicitly conduct the target-projection, which demystifies the implicit target by restricting the proximal RL objective to the response simplex, and then projects the policy via exact divergence minimization. This framework provides (i) monotonic improvement on the listwise objective with bounded, zero-sum, and self-correcting projection gradients, and (ii) flexibility in divergence selection with distinct structural properties through the decoupled projection step. On diverse reasoning tasks and LLM backbones, LPO consistently improves training performance over typical policy gradient baselines under matched targets, while intrinsically preserving optimization stability and response diversity.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Credit Assignment with Meta-Policy Gradient for Multi-Agent Reinforcement Learning

Reward decomposition is a critical problem in centralized training with decentralized execution~(CTDE) paradigm for multi-agent reinforcement learning. To take full advantage of global information, which exploits the states from all agents and the related environment for decomposing Q values into individual credits, we propose a general meta-learning-based Mixing Network with Meta Policy Gradient~(MNMPG) framework to distill the global hierarchy for delicate reward decomposition. The excitation signal for learning global hierarchy is deduced from the episode reward difference between before and after "exercise updates" through the utility network. Our method is generally applicable to the CTDE method using a monotonic mixing network. Experiments on the StarCraft II micromanagement benchmark demonstrate that our method just with a simple utility network is able to outperform the current state-of-the-art MARL algorithms on 4 of 5 super hard scenarios. Better performance can be further achieved when combined with a role-based utility network.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

PFRL: Pose-Free Reinforcement Learning for 6D Pose Estimation

6D pose estimation from a single RGB image is a challenging and vital task in computer vision. The current mainstream deep model methods resort to 2D images annotated with real-world ground-truth 6D object poses, whose collection is fairly cumbersome and expensive, even unavailable in many cases. In this work, to get rid of the burden of 6D annotations, we formulate the 6D pose refinement as a Markov Decision Process and impose on the reinforcement learning approach with only 2D image annotations as weakly-supervised 6D pose information, via a delicate reward definition and a composite reinforced optimization method for efficient and effective policy training. Experiments on LINEMOD and T-LESS datasets demonstrate that our Pose-Free approach is able to achieve state-of-the-art performance compared with the methods without using real-world ground-truth 6D pose labels.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Reducing Conservativeness Oriented Offline Reinforcement Learning

In offline reinforcement learning, a policy learns to maximize cumulative rewards with a fixed collection of data. Towards conservative strategy, current methods choose to regularize the behavior policy or learn a lower bound of the value function. However, exorbitant conservation tends to impair the policy's generalization ability and degrade its performance, especially for the mixed datasets. In this paper, we propose the method of reducing conservativeness oriented reinforcement learning. On the one hand, the policy is trained to pay more attention to the minority samples in the static dataset to address the data imbalance problem. On the other hand, we give a tighter lower bound of value function than previous methods to discover potential optimal actions. Consequently, our proposed method is able to tackle the skewed distribution of the provided dataset and derive a value function closer to the expected value function. Experimental results demonstrate that our proposed method outperforms the state-of-the-art methods in D4RL offline reinforcement learning evaluation tasks and our own designed mixed datasets.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Evidence of Flat Bands and Correlated States in Buckled Graphene Superlattices

Two-dimensional atomic crystals can radically change their properties in response to external influences such as substrate orientation or strain, resulting in essentially new materials in terms of the electronic structure. A striking example is the creation of flat-bands in bilayer-graphene for certain 'magic' twist-angles between the orientations of the two layers. The quenched kinetic-energy in these flat-bands promotes electron-electron interactions and facilitates the emergence of strongly-correlated phases such as superconductivity and correlated-insulators. However, the exquisite fine-tuning required for finding the magic-angle where flat-bands appear in twisted-bilayer graphene, poses challenges to fabrication and scalability. Here we present an alternative route to creating flat-bands that does not involve fine tuning. Using scanning tunneling microscopy and spectroscopy, together with numerical simulations, we demonstrate that graphene monolayers placed on an atomically-flat substrate can be forced to undergo a buckling-transition, resulting in a periodically modulated pseudo-magnetic field, which in turn creates a post-graphene material with flat electronic bands. Bringing the Fermi-level into these flat-bands by electrostatic doping, we observe a pseudogap-like depletion in the density-of-states, which signals the emergence of a correlated-state. The described approach of 2D crystal buckling offers a strategy for creating other superlattice systems and, in particular, for exploring interaction phenomena characteristic of flat-bands.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Fast Hardware-Aware Neural Architecture Search

Designing accurate and efficient convolutional neural architectures for vast amount of hardware is challenging because hardware designs are complex and diverse. This paper addresses the hardware diversity challenge in Neural Architecture Search (NAS). Unlike previous approaches that apply search algorithms on a small, human-designed search space without considering hardware diversity, we propose HURRICANE that explores the automatic hardware-aware search over a much larger search space and a two-stage search algorithm, to efficiently generate tailored models for different types of hardware. Extensive experiments on ImageNet demonstrate that our algorithm outperforms state-of-the-art hardware-aware NAS methods under the same latency constraint on three types of hardware. Moreover, the discovered architectures achieve much lower latency and higher accuracy than current state-of-the-art efficient models. Remarkably, HURRICANE achieves a 76.67% top-1 accuracy on ImageNet with a inference latency of only 16.5 ms for DSP, which is a 3.47% higher accuracy and a 6.35x inference speedup than FBNet-iPhoneX, respectively. For VPU, we achieve a 0.53% higher top-1 accuracy than Proxyless-mobile with a 1.49x speedup. Even for well-studied mobile CPU, we achieve a 1.63% higher top-1 accuracy than FBNet-iPhoneX with a comparable inference latency. HURRICANE also reduces the training time by 30.4% compared to SPOS.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Revealing the Atomic Site-Dependent g Factor within a Single Magnetic Molecule via the Extended Kondo Effect

The site-dependent g factor of a single magnetic molecule, with intramolecular resolution, is demonstrated for the first time by low-temperature, high-magnetic-field scanning tunneling microscopy of dehydrogenated Mn-phthalocyanine molecules on Au(111). This is achieved by exploring the magneticfield dependence of the extended Kondo effect at different atomic sites of the molecule. Importantly, an inhomogeneous distribution of the g factor inside a single molecule is revealed. Our results open up a new route to access local spin properties within a single molecule.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Reversible Single Spin Control of Individual Magnetic Molecule by Hydrogen Atom Adsorption

The reversible control of a single spin of an atom or a molecule is of great interest in Kondo physics and a potential application in spin based electronics.Here we demonstrate that the Kondo resonance of manganese phthalocyanine molecules on an Au(111) substrate have been reversibly switched off and on via a robust route through attachment and detachment of single hydrogen atom to the magnetic core of the molecule. As further revealed by density functional theory calculations, even though the total number of electrons of the Mn ion remains almost the same in the process, gaining one single hydrogen atom leads to redistribution of charges within 3d orbitals with a reduction of the molecular spin state from S = 3/2 to S = 1 that directly contributes to the Kondo resonance disappearance. This process is reversed by a local voltage pulse or thermal annealing to desorb the hydrogen atom.

0 citations0 reviewsNo code linkedOpen access