Researcher profile

Zhen Liang

Zhen Liang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 19 - UnverifiedVerification L1Unclaimed author
5works
0followers
8topics
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

5 published item(s)

preprint2026arXiv

Metis: Learning to Jailbreak LLMs via Self-Evolving Metacognitive Policy Optimization

Red teaming is critical for uncovering vulnerabilities in Large Language Models (LLMs). While automated methods have improved scalability, existing approaches often rely on static heuristics or stochastic search, rendering them brittle against advanced safety alignment. To address this, we introduce Metis, a framework that reformulates jailbreaking as inference-time policy optimization within an adversarial Partially Observable Markov Decision Process (POMDP). Metis employs a self-evolving metacognitive loop to perform causal diagnosis of a target's defense logic and leverages structured feedback as a semantic gradient to refine its policy, offering enhanced interpretability through transparent reasoning traces. Extensive evaluations across 10 diverse models demonstrate that Metis achieves the strongest average Attack Success Rate (ASR) among compared methods at 89.2%, maintaining high efficacy on resilient frontier models (e.g., 76.0% on O1 and 78.0% on GPT-5-chat) where traditional baselines exhibit substantial performance degradation. By replacing redundant exploration with directed optimization, Metis reduces token costs by an average of 8.2x and up to 11.4x. Our analysis reveals that current defenses remain vulnerable to internally-steered, closed-loop reasoning trajectories under the tested settings, highlighting a critical need for next-generation defenses capable of reasoning about safety dynamically during inference.

preprint2022arXiv

Gap sequences and Topological properties of Bedford-McMullen sets

In this paper, we study the topological properties and the gap sequences of Bedford-McMullen sets. First, we introduce a topological condition, the component separation condition (CSC), and a geometric condition, the exponential rate condition (ERC). Then we prove that the CSC implies the ERC, and that both of them are sufficient conditions for obtaining the asymptotic estimate of gap sequences. We also explore topological properties of Bedford-McMullen sets and prove that all normal Bedford-McMullen sets with infinitely many connected components satisfy the CSC, from which we obtain the asymptotic estimate of the gap sequences of Bedford-McMullen sets without any restrictions. Finally, we apply our result to Lipschitz equivalence.

preprint2022arXiv

PR-PL: A Novel Transfer Learning Framework with Prototypical Representation based Pairwise Learning for EEG-Based Emotion Recognition

Affective brain-computer interfaces based on electroencephalography (EEG) is an important branch in the field of affective computing. However, individual differences and noisy labels seriously limit the effectiveness and generalizability of EEG-based emotion recognition models. In this paper, we propose a novel transfer learning framework with Prototypical Representation based Pairwise Learning (PR-PL) to learn discriminative and generalized prototypical representations for emotion revealing across individuals and formulate emotion recognition as pairwise learning for alleviating the reliance on precise label information. Extensive experiments are conducted on two benchmark databases under four cross-validation evaluation protocols (cross-subject cross-session, cross-subject within-session, within-subject cross-session, and within-subject within-session). The experimental results demonstrate the superiority of the proposed PR-PL against the state-of-the-arts under all four evaluation protocols, which shows the effectiveness and generalizability of PR-PL in dealing with the ambiguity of EEG responses in affective studies. The source code is available at https://github.com/KAZABANA/PR-PL.

preprint2020arXiv

Construction and box dimension of recurrent fractal interpolation surfaces

In this paper, we present a general framework to construct recurrent fractal interpolation surfaces (RFISs) on rectangular grids. Then we introduce bilinear RFISs, which are easy to be generated while there are no restrictions on interpolation points and vertical scaling factors. We also obtain the box dimension of bilinear RFISs under certain constraints, where the main assumption is that vertical scaling factors have uniform sums under a compatible partition.

preprint2019arXiv

Turaev Hyperbolicity of Classical and Virtual Knots

By work of W. Thurston, knots and links in the 3-sphere are known to either be torus links, or to contain an essential torus in their complement, or to be hyperbolic, in which case a unique hyperbolic volume can be calculated for their complement. We employ a construction of Turaev to associate a family of hyperbolic 3-manifolds of finite volume to any classical or virtual link, even if non-hyperbolic. These are in turn used to define the Turaev volume of a link, which is the minimal volume among all the hyperbolic 3-manifolds associated via this Turaev construction. In the case of a classical link, we can also define the classical Turaev volume, which is the minimal volume among all the hyperbolic 3-manifolds associated via this Turaev construction for the classical projections only. We then investigate these new invariants.