Researcher profile

Fang Li

Fang Li contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

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

17 published item(s)

preprint2026arXiv

SpaAct: Spatially-Activated Transition Learning with Curriculum Adaptation for Vision-Language Navigation

Vision-and-Language Navigation (VLN) aims to enable an embodied agent to follow natural-language instructions and navigate to a target location in unseen 3D environments. We argue that adapting VLMs to VLN requires endowing them with two complementary capabilities for acquiring such awareness, namely backward action reasoning (why) and forward transition prediction~(how). Based on this insight, we propose SpaAct, a simple yet effective training framework that activates the dynamic spatial awareness in VLMs. Specifically, SpaAct introduces two spatial activation tasks: Action Retrospection, which asks the model to infer the executed action sequence from visual transitions, and Future Frame Selection, which forces the model to predict the visual transitions conditioned on history and action. These two objectives provide lightweight supervision on both backward action reasoning and forward transition prediction, encouraging the model to build dynamic spatial awareness in a VLM-friendly way. To further stabilize adaptation, we design TriPA, a Tri-factor Progressive Adaptive curriculum learning method that organizes training samples from easy to hard, allowing the model to gradually acquire navigation skills from basic locomotion to long-horizon reasoning. Experiments on standard VLN-CE benchmarks show that SpaAct consistently improves VLM-based navigation and achieves state-of-the-art performance. We will release the code and models to support future research.

preprint2022arXiv

Domain-specific Learning of Multi-scale Facial Dynamics for Apparent Personality Traits Prediction

Human personality decides various aspects of their daily life and working behaviors. Since personality traits are relatively stable over time and unique for each subject, previous approaches frequently infer personality from a single frame or short-term behaviors. Moreover, most of them failed to specifically extract person-specific and unique cues for personality recognition. In this paper, we propose a novel video-based automatic personality traits recognition approach which consists of: (1) a \textbf{domain-specific facial behavior modelling} module that extracts personality-related multi-scale short-term human facial behavior features; (2) a \textbf{long-term behavior modelling} module that summarizes all short-term features of a video as a long-term/video-level personality representation and (3) a \textbf{multi-task personality traits prediction module} that models underlying relationship among all traits and jointly predict them based on the video-level personality representation. We conducted the experiments on ChaLearn First Impression dataset, and our approach achieved comparable results to the state-of-the-art. Importantly, we show that all three proposed modules brought important benefits for personality recognition.

preprint2022arXiv

Large-Scale Simulation of Quantum Computational Chemistry on a New Sunway Supercomputer

Quantum computational chemistry (QCC) is the use of quantum computers to solve problems in computational quantum chemistry. We develop a high performance variational quantum eigensolver (VQE) simulator for simulating quantum computational chemistry problems on a new Sunway supercomputer. The major innovations include: (1) a Matrix Product State (MPS) based VQE simulator to reduce the amount of memory needed and increase the simulation efficiency; (2) a combination of the Density Matrix Embedding Theory with the MPS-based VQE simulator to further extend the simulation range; (3) A three-level parallelization scheme to scale up to 20 million cores; (4) Usage of the Julia script language as the main programming language, which both makes the programming easier and enables cutting edge performance as native C or Fortran; (5) Study of real chemistry systems based on the VQE simulator, achieving nearly linearly strong and weak scaling. Our simulation demonstrates the power of VQE for large quantum chemistry systems, thus paves the way for large-scale VQE experiments on near-term quantum computers.

preprint2022arXiv

Mixed-UNet: Refined Class Activation Mapping for Weakly-Supervised Semantic Segmentation with Multi-scale Inference

Deep learning techniques have shown great potential in medical image processing, particularly through accurate and reliable image segmentation on magnetic resonance imaging (MRI) scans or computed tomography (CT) scans, which allow the localization and diagnosis of lesions. However, training these segmentation models requires a large number of manually annotated pixel-level labels, which are time-consuming and labor-intensive, in contrast to image-level labels that are easier to obtain. It is imperative to resolve this problem through weakly-supervised semantic segmentation models using image-level labels as supervision since it can significantly reduce human annotation efforts. Most of the advanced solutions exploit class activation mapping (CAM). However, the original CAMs rarely capture the precise boundaries of lesions. In this study, we propose the strategy of multi-scale inference to refine CAMs by reducing the detail loss in single-scale reasoning. For segmentation, we develop a novel model named Mixed-UNet, which has two parallel branches in the decoding phase. The results can be obtained after fusing the extracted features from two branches. We evaluate the designed Mixed-UNet against several prevalent deep learning-based segmentation approaches on our dataset collected from the local hospital and public datasets. The validation results demonstrate that our model surpasses available methods under the same supervision level in the segmentation of various lesions from brain imaging.

preprint2022arXiv

Optimisation of total population in logistic model with nonlocal dispersals and heterogeneous environments

In this paper, we investigate the issue of maximizing the total equilibrium population with respect to resources distribution m(x) and diffusion rates d under the prescribed total amount of resources in a logistic model with nonlocal dispersals. Among other things, we show that for $d\ge1$, there exist $C_0, C_1>0$, depending on the $\|m\|_{L^1}$ only, such that $$C_0\sqrt{d}<\mbox{supremum~ of~ total~ population}<C_1\sqrt{d}.$$ However, when replaced by random diffusion, a conjecture, proposed by Ni and justified in [3], indicates that in the one-dimensional case, supremum of total population$=3\|m\|_{L^1}$. This reflects serious discrepancies between models with local and nonlocal dispersal strategies.

preprint2022arXiv

Some elementary properties of Laurent phenomenon algebras

Let $Σ$ be Laurent phenomenon (LP) seed of rank $n$, $\mathcal{A}(Σ)$, $\mathcal{U}(Σ)$ and $\mathcal{L}(Σ)$ be its corresponding Laurent phenomenon algebra, upper bound and lower bound respectively. We prove that each seed of $\mathcal{A}(Σ)$ is uniquely defined by its cluster, and any two seeds of $\mathcal{A}(Σ)$ with $n-1$ common cluster variables are connected with each other by one step of mutation. The method in this paper also works for (totally sign-skew-symmetric) cluster algebras. Moreover, we show that $\mathcal{U}(Σ)$ is invariant under seed mutations when each exchange polynomials coincides with its exchange Laurent polynomials of $Σ$. Besides, we obtain the standard monomial bases of $\mathcal{L}(Σ)$. We also prove that $\mathcal{U}(Σ)$ coincides with $\mathcal{L}(Σ)$ under certain conditions.

preprint2020arXiv

Extreme-Scale Density Functional Theory High Performance Computing of DGDFT for Tens of Thousands of Atoms using Millions of Cores on Sunway TaihuLight

High performance computing (HPC) is a powerful tool to accelerate the Kohn-Sham density functional theory (KS-DFT) calculations on modern heterogeneous supercomputers. Here, we describe a massively extreme-scale parallel and portable implementation of discontinuous Galerkin density functional theory (DGDFT) method on the Sunway TaihuLight supercomputer. The DGDFT method uses the adaptive local basis (ALB) functions generated on-the-fly during the self-consistent field (SCF) iteration to solve the KS equations with the high precision comparable to that of plane-wave basis set. In particular, the DGDFT method adopts a two-level parallelization strategy that makes use of different types of data distribution, task scheduling, and data communication schemes, and combines with the feature of master-slave multi-thread heterogeneous parallelism of SW26010 processor, resulting in extreme-scale HPC KS-DFT calculations on the Sunway TaihuLight supercomputer. We show that the DGDFT method can scale up to 8,519,680 processing cores (131,072 core groups) on the Sunway TaihuLight supercomputer for investigating the electronic structures of two-dimensional (2D) metallic graphene systems containing tens of thousands of carbon atoms.

preprint2020arXiv

On inner Poisson structures of a quantum cluster algebra without coefficients

The main aim of this article is to characterize inner Poisson structure on a quantum cluster algebra without coefficients. Mainly, we prove that inner Poisson structure on a quantum cluster algebra without coefficients is always a standard Poisson structure. In order to relate with compatible Poisson structure, we introduce the concept of so-called locally inner Poisson structure on a quantum cluster algebra and then show it is equivalent to locally standard Poisson structure in the case without coefficients. Based on the result from \cite{LP} we obtain finally the equivalence between locally inner Poisson structure and compatible Poisson structure in this case.

preprint2020arXiv

On maximal green sequences in abelian length categories

In this article, we study the relationship among maximal green sequences, complete forward hom-orthogonal sequences and stability functions in abelian length categories. Mainly, we firstly give a one-to-one correspondence between maximal green sequences and complete forward hom-orthogonal sequences via mutual constructions, and then prove that a maximal green sequence can be induced by a central charge if and only if it satisfies crossing inequalities. As applications, we show that crossing inequalities can be computed by $c$-vectors for finite dimensional algebras; finally, we give the Rotation Lemma for finite dimensional Jacobian algebras.

preprint2020arXiv

Periodicities in cluster algebras and cluster automorphism groups

In this paper, we study the relations between groups related to cluster automorphism groups which are defined by Assem, Schiffler and Shamchenko in \cite{ASS}. We establish the relationship among (strict) direct cluster automorphism groups and those groups consisting of periodicities of respectively labeled seeds and exchange matrices in the language of short exact sequences. As an application, we characterize automorphism-finite cluster algebras in the cases with bipartite seeds or finite mutation type. Finally, we study the relation between the groups $\mathrm{Aut}\mathcal{A}$ and $\mathrm{Aut}_{M_n}S$ and give the negative answer via counter-examples to King and Pressland&#39;s a problem in \cite{KP}.

preprint2020arXiv

Poisson structure and second quantization of quantum cluster algebras

Motivated by the phenomenon that compatible Poisson structures on a cluster algebra play a key role on its quantization (that is, quantum cluster algebra), we introduce the second quantization of a quantum cluster algebra, which means the correspondence between compatible Poisson structures of the quantum cluster algebra and its secondly quantized cluster algebras. Based on this observation, we find that a quantum cluster algebra possesses dual quantum cluster algebras such that their second quantization is essentially the same. As an example, we give the secondly quantized cluster algebra $A_{p,q}(SL(2))$ of $Fun_{\mathbb C}(SL_{q}(2))$ in \S5.2.1 and show that it is a non-trivial second quantization, which may be realized as a parallel supplement to two parameters quantization of the general quantum group. Furthermore, we obtain a class of quantum cluster algebras with coefficients which possess a non-trivial second quantization. Its one special kind is quantum cluster algebras with almost principal coefficients with an additional condition. Finally, we prove that the compatible Poisson structures of a quantum cluster algebra without coefficients is always a locally standard Poisson structure. Following this, it is shown that the second quantization of a quantum cluster algebra without coefficients is in fact trivial.

preprint2020arXiv

Semi-wave and spreading speed of the nonlocal Fisher-KPP equation with free boundaries

In Cao, Du, Li and Li [8], a nonlocal diffusion model with free boundaries extending the local diffusion model of Du and Lin [12] was introduced and studied. For Fisher-KPP type nonlinearities, its long-time dynamical behaviour is shown to follow a spreading-vanishing dichotomy. However, when spreading happens, the question of spreading speed was left open in [8]. In this paper we obtain a rather complete answer to this question. We find a condition on the kernel function such that spreading grows linearly in time exactly when this condition holds, which is achieved by completely solving the associated semi-wave problem that determines this linear speed; when the kernel function violates this condition, we show that accelerating spreading happens.

preprint2020arXiv

Zero-Shot Recognition through Image-Guided Semantic Classification

We present a new embedding-based framework for zero-shot learning (ZSL). Most embedding-based methods aim to learn the correspondence between an image classifier (visual representation) and its class prototype (semantic representation) for each class. Motivated by the binary relevance method for multi-label classification, we propose to inversely learn the mapping between an image and a semantic classifier. Given an input image, the proposed Image-Guided Semantic Classification (IGSC) method creates a label classifier, being applied to all label embeddings to determine whether a label belongs to the input image. Therefore, semantic classifiers are image-adaptive and are generated during inference. IGSC is conceptually simple and can be realized by a slight enhancement of an existing deep architecture for classification; yet it is effective and outperforms state-of-the-art embedding-based generalized ZSL approaches on standard benchmarks.

preprint2018arXiv

The enough $g$-pairs property and denominator vectors of cluster algebras

In this paper, we introduce the enough $g$-pairs property for a principal coefficients cluster algebra, which can be understood as a strong version of the sign-coherence of the $G$-matrices. Then we prove that any skew-symmetrizable principal coefficients cluster algebra has the enough $g$-pairs property. As an application, we prove the positivity of denominator vectors for any skew-symmetrizable cluster algebra. In fact, we give complete answers to some long standing conjectures on denominator vectors of cluster variables (see Conjecture 1.1 below), which are proposed by Fomin and Zelevinsky in [Compos. Math. 143(2007), 112-164]. In addition, we prove that the seeds whose clusters contain particular cluster variables form a connected subgraph of the exchange graph of this cluster algebra. Lastly, a criterion to distinguish whether particular cluster variables belong to one common cluster is given.

preprint2017arXiv

A conjecture on $C$-matrices of cluster algebras

For a skew-symmetrizable cluster algebra $\mathcal A_{t_0}$ with principal coefficients at $t_0$, we prove that each seed $Σ_t$ of $\mathcal A_{t_0}$ is uniquely determined by its {\bf C-matrix}, which was proposed by Fomin and Zelevinsky in \cite{FZ3} as a conjecture. Our proof is based on the fact that the positivity of cluster variables and sign-coherence of $c$-vectors hold for $\mathcal A_{t_0}$, which was actually verified in \cite{GHKK}. More discussion is given in the sign-skew-symmetric case so as to obtain a conclusion as weak version of the conjecture in this general case.