BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Source author record

Huan He

Huan He appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record
cond-mat.str-elquant-phComputation and LanguageArtificial Intelligencehep-thInformation RetrievalMachine Learningmath.NANetworking and Internet ArchitectureNumerical AnalysisComputer Visionmath-phmath.MP

Catalog footprint

What is connected

16works
13topics
4close collaborators

Actions

Connect this record

Log in to claim
Open graphBrowse works

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

16 published item(s)

preprint2026arXiv

MM-StanceDet: Retrieval-Augmented Multi-modal Multi-agent Stance Detection

Multimodal Stance Detection (MSD) is crucial for understanding public discourse, yet effectively fusing text and image, especially with conflicting signals, remains challenging. Existing methods often face difficulties with contextual grounding, cross-modal interpretation ambiguity, and single-pass reasoning fragility. To address these, we propose Retrieval-Augmented Multi-modal Multi-agent Stance Detection (MM-StanceDet), a novel multi-agent framework integrating Retrieval Augmentation for contextual grounding, specialized Multimodal Analysis agents for nuanced interpretation, a Reasoning-Enhanced Debate stage for exploring perspectives, and Self-Reflection for robust adjudication. Extensive experiments on five datasets demonstrate MM-StanceDet significantly outperforms state-of-the-art baselines, validating the efficacy of its multi-agent architecture and structured reasoning stages in addressing complex multimodal stance challenges.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

An Open Natural Language Processing Development Framework for EHR-based Clinical Research: A case demonstration using the National COVID Cohort Collaborative (N3C)

While we pay attention to the latest advances in clinical natural language processing (NLP), we can notice some resistance in the clinical and translational research community to adopt NLP models due to limited transparency, interpretability, and usability. In this study, we proposed an open natural language processing development framework. We evaluated it through the implementation of NLP algorithms for the National COVID Cohort Collaborative (N3C). Based on the interests in information extraction from COVID-19 related clinical notes, our work includes 1) an open data annotation process using COVID-19 signs and symptoms as the use case, 2) a community-driven ruleset composing platform, and 3) a synthetic text data generation workflow to generate texts for information extraction tasks without involving human subjects. The corpora were derived from texts from three different institutions (Mayo Clinic, University of Kentucky, University of Minnesota). The gold standard annotations were tested with a single institution's (Mayo) ruleset. This resulted in performances of 0.876, 0.706, and 0.694 in F-scores for Mayo, Minnesota, and Kentucky test datasets, respectively. The study as a consortium effort of the N3C NLP subgroup demonstrates the feasibility of creating a federated NLP algorithm development and benchmarking platform to enhance multi-institution clinical NLP study and adoption. Although we use COVID-19 as a use case in this effort, our framework is general enough to be applied to other domains of interest in clinical NLP.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

AUTM Flow: Atomic Unrestricted Time Machine for Monotonic Normalizing Flows

Nonlinear monotone transformations are used extensively in normalizing flows to construct invertible triangular mappings from simple distributions to complex ones. In existing literature, monotonicity is usually enforced by restricting function classes or model parameters and the inverse transformation is often approximated by root-finding algorithms as a closed-form inverse is unavailable. In this paper, we introduce a new integral-based approach termed "Atomic Unrestricted Time Machine (AUTM)", equipped with unrestricted integrands and easy-to-compute explicit inverse. AUTM offers a versatile and efficient way to the design of normalizing flows with explicit inverse and unrestricted function classes or parameters. Theoretically, we present a constructive proof that AUTM is universal: all monotonic normalizing flows can be viewed as limits of AUTM flows. We provide a concrete example to show how to approximate any given monotonic normalizing flow using AUTM flows with guaranteed convergence. The result implies that AUTM can be used to transform an existing flow into a new one equipped with explicit inverse and unrestricted parameters. The performance of the new approach is evaluated on high dimensional density estimation, variational inference and image generation. Experiments demonstrate superior speed and memory efficiency of AUTM.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

GDA-AM: On the effectiveness of solving minimax optimization via Anderson Acceleration

Many modern machine learning algorithms such as generative adversarial networks (GANs) and adversarial training can be formulated as minimax optimization. Gradient descent ascent (GDA) is the most commonly used algorithm due to its simplicity. However, GDA can converge to non-optimal minimax points. We propose a new minimax optimization framework, GDA-AM, that views the GDAdynamics as a fixed-point iteration and solves it using Anderson Mixing to con-verge to the local minimax. It addresses the diverging issue of simultaneous GDAand accelerates the convergence of alternating GDA. We show theoretically that the algorithm can achieve global convergence for bilinear problems under mild conditions. We also empirically show that GDA-AMsolves a variety of minimax problems and improves GAN training on several datasets

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Clinical Concept Extraction: a Methodology Review

Background Concept extraction, a subdomain of natural language processing (NLP) with a focus on extracting concepts of interest, has been adopted to computationally extract clinical information from text for a wide range of applications ranging from clinical decision support to care quality improvement. Objectives In this literature review, we provide a methodology review of clinical concept extraction, aiming to catalog development processes, available methods and tools, and specific considerations when developing clinical concept extraction applications. Methods Based on the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guidelines, a literature search was conducted for retrieving EHR-based information extraction articles written in English and published from January 2009 through June 2019 from Ovid MEDLINE In-Process & Other Non-Indexed Citations, Ovid MEDLINE, Ovid EMBASE, Scopus, Web of Science, and the ACM Digital Library. Results A total of 6,686 publications were retrieved. After title and abstract screening, 228 publications were selected. The methods used for developing clinical concept extraction applications were discussed in this review.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Lieb-Schultz-Mattis type constraints on Fractonic Matter

The Lieb-Schultz-Mattis (LSM) theorem and its descendants impose strong constraints on the low-energy behavior of interacting quantum systems. In this paper, we formulate LSM-type constraints for lattice translation invariant systems with generalized U(1) symmetries which have recently appeared in the context of fracton phases: U(1) polynomial shift and subsystem symmetries. Starting with a generic interacting system with conserved dipole moment, we examine the conditions under which it supports a symmetric, gapped, and non-degenerate ground state, which we find requires that both the filling fraction and the bulk charge polarization take integer-values. Similar constraints are derived for systems with higher moment conservation laws or subsystem symmetries, in addition to lower bounds on the ground state degeneracy when certain conditions are violated. Finally, we discuss the mapping between LSM-type constraints for subsystem symmetries and the anomalous symmetry action at boundaries of subsystem symmetric topological (SSPT) states.

0 citations0 reviewsNo code linkedOpen access
preprint2018arXiv

Entanglement Entropy From Tensor Network States for Stabilizer Codes

In this paper, we present the construction of tensor network states (TNS) for some of the degenerate ground states of 3D stabilizer codes. We then use the TNS formalism to obtain the entanglement spectrum and entropy of these ground-states for some special cuts. In particular, we work out the examples of the 3D toric code, the X-cube model and the Haah code. The latter two models belong to the category of "fracton" models proposed recently, while the first one belongs to the conventional topological phases. We mention the cases for which the entanglement entropy and spectrum can be calculated exactly: for these, the constructed TNS is the singular value decomposition (SVD) of the ground states with respect to particular entanglement cuts. Apart from the area law, the entanglement entropies also have constant and linear corrections for the fracton models, while the entanglement entropies for the toric code models only have constant corrections. For the cuts we consider, the entanglement spectra of these three models are completely flat. We also conjecture that the negative linear correction to the area law is a signature of extensive ground state degeneracy. Moreover, the transfer matrices of these TNS can be constructed. We show that the transfer matrices are projectors whose eigenvalues are either 1 or 0. The number of nonzero eigenvalues is tightly related to the ground state degeneracy.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Boson Condensation in Topologically Ordered Quantum Liquids

Boson condensation in topological quantum field theories (TQFT) has been previously investigated through the formalism of Frobenius algebras and the use of vertex lifting coefficients. While general, this formalism is physically opaque and computationally arduous: analyses of TQFT condensation are practically performed on a case by case basis and for very simple theories only, mostly not using the Frobenius algebra formalism. In this paper we provide a new way of treating boson condensation that is computationally efficient. With a minimal set of physical assumptions, such as commutativity of lifting and the definition of confined particles, we can prove a number of theorems linking Boson condensation in TQFT with chiral algebra extensions, and with the factorization of completely positive matrices over the nonnegative integers. We present numerically efficient ways of obtaining a condensed theory fusion algebra and S matrices; and we then use our formalism to prove several theorems for the S and T matrices of simple current condensation and of theories which upon condensation result in a low number of confined particles. We also show that our formalism easily reproduces results existent in the mathematical literature such as the noncondensability of 5 and 10 layers of the Fibonacci TQFT.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

No-Go Theorem for Boson Condensation in Topologically Ordered Quantum Liquids

Certain phase transitions between topological quantum field theories (TQFT) are driven by the condensation of bosonic anyons. However, as bosons in a TQFT are themselves nontrivial collective excitations, there can be topological obstructions that prevent them from condensing. Here we formulate such an obstruction in the form of a no-go theorem. We use it to show that no condensation is possible in SO(3)$_k$ TQFTs with odd $k$. We further show that a layered theory obtained by tensoring SO(3)$_k$ TQFT with itself any integer number of times does not admit condensation transitions either. This includes (as the case $k=3$) the noncondensability of any number of layers of the Fibonacci TQFT.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Disentangling Theorem and Monogamy for Entanglement Negativity

Entanglement negativity is a measure of mixed-state entanglement increasingly used to investigate and characterize emerging quantum many-body phenomena, including quantum criticality and topological order. We present two results for the entanglement negativity: a disentangling theorem, which allows the use of this entanglement measure as a means to detect whether a wave-function of three subsystems $A$, $B$, and $C$ factorizes into a product state for parts $AB_1$ and $B_2C$; and a monogamy relation, which states that if $A$ is very entangled with $B$, then $A$ cannot be simultaneaously very entangled also with $C$.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Modular Matrices as Topological Order Parameter by Gauge Symmetry Preserved Tensor Renormalization Approach

Topological order has been proposed to go beyond Landau symmetry breaking theory for more than twenty years. But it is still a challenging problem to generally detect it in a generic many-body state. In this paper, we will introduce a systematic numerical method based on tensor network to calculate modular matrices in 2D systems, which can fully identify topological order with gapped edge. Moreover, it is shown numerically that modular matrices, including S and T matrices, are robust characterization to describe phase transitions between topologically ordered states and trivial states, which can work as topological order parameters. This method only requires local information of one ground state in the form of a tensor network, and directly provides the universal data (S and T matrices), without any non-universal contributions. Furthermore it is generalizable to higher dimensions. Unlike calculating topological entanglement entropy by extrapolating, which numerical complexity is exponentially high, this method extracts a much more complete set of topological data (modular matrices) with much lower numerical cost.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Twisted Gauge Theory Model of Topological Phases in Three Dimensions

We propose an exactly solvable lattice Hamiltonian model of topological phases in $3+1$ dimensions, based on a generic finite group $G$ and a $4$-cocycle $ω$ over $G$. We show that our model has topologically protected degenerate ground states and obtain the formula of its ground state degeneracy on the $3$-torus. In particular, the ground state spectrum implies the existence of purely three-dimensional looplike quasi-excitations specified by two nontrivial flux indices and one charge index. We also construct other nontrivial topological observables of the model, namely the $SL(3,\mathbb{Z})$ generators as the modular $S$ and $T$ matrices of the ground states, which yield a set of topological quantum numbers classified by $ω$ and quantities derived from $ω$. Our model fulfills a Hamiltonian extension of the $3+1$-dimensional Dijkgraaf-Witten topological gauge theory with a gauge group $G$. This work is presented to be accessible for a wide range of physicists and mathematicians.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

A Study of Highly Frustrated Spin Systems with mixed PEPS in Infinite Honeycomb Lattice

Highly frustrated spin systems represent a central and challenging problem in condensed mater physics. To this problem, we introduce an algorithm based on mixed projected entangled pair states (m-PEPS), which is a novel type of tensor network. We use the famous Kitaev model on an infinite honeycomb lattice, which can be solved exactly, as a benchmark. With very limited parameters and finite scaling, our calculation results are in good agreement with the exact results, indicating the efficiency of our algorithm. After presenting the benchmark, we investigate the Kitaev-Heisenberg model, which was proposed to describe the effective magnetic momentum interaction in iridate Na$_2$IrO$_3$ which may be used to realize the spin liquid phase. However, our calculations suggest that the gapless spin liquid phase is not robust at the thermodynamic limit, and thus this phenomenon is very difficult to observe.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Universal Optimal Gates Regarding Quantum Entanglement and Discord Generating

Fernando Galve \emph{et al.} $[Phys. Rev. Lett. \textbf{110}, 010501 (2013)]$ introduced discording power for a two-qubit unitary gate to evaluate its capability to produce quantum discord, and found that a $π/8$ gate has maximal discording power. This work analyzes the entangling power of a two-qubit unitary gate, which reflects its ability to generate quantum entanglement in another way. Based on the renowned Cartan decomposition of two-qubit unitary gates, we show that the magic power of the $π/8$ gate produces maximal entanglement for a general value of purities for two-qubit states.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Can P2P Technology Benefit Eyeball ISPs? A Cooperative Profit Distribution Answer

Peer-to-Peer (P2P) technology has been regarded as a promising way to help Content Providers (CPs) cost-effectively distribute content. However, under the traditional Internet pricing mechanism, the fact that most P2P traffic flows among peers can dramatically decrease the profit of ISPs, who may take actions against P2P and impede the progress of P2P technology. In this paper, we develop a mathematical framework to analyze such economic issues. Inspired by the idea from cooperative game theory, we propose a cooperative profit-distribution model based on Nash Bargaining Solution (NBS), in which eyeball ISPs and Peer-assisted CPs (PCPs) form two coalitions respectively and then compute a fair Pareto point to determine profit distribution. Moreover, we design a fair and feasible mechanism for profit distribution within each coalition. We show that such a cooperative method not only guarantees the fair profit distribution among network participators, but also helps to improve the economic efficiency of the overall network system. To our knowledge, this is the first work that systematically studies solutions for P2P caused unbalanced profit distribution and gives a feasible cooperative method to increase and fairly share profit.

0 citations0 reviewsNo code linkedOpen access
preprint2011arXiv

Internet Resource Pricing Models, Mechanisms, and Methods

With the fast development of video and voice network applications, CDN (Content Distribution Networks) and P2P (Peer-to-Peer) content distribution technologies have gradually matured. How to effectively use Internet resources thus has attracted more and more attentions. For the study of resource pricing, a whole pricing strategy containing pricing models, mechanisms and methods covers all the related topics. We first introduce three basic Internet resource pricing models through an Internet cost analysis. Then, with the evolution of service types, we introduce several corresponding mechanisms which can ensure pricing implementation and resource allocation. On network resource pricing methods, we discuss the utility optimization in economics, and emphasize two classes of pricing methods (including system optimization and entities' strategic optimizations). Finally, we conclude the paper and forecast the research direction on pricing strategy which is applicable to novel service situation in the near future.

0 citations0 reviewsNo code linkedOpen access