Searcharxiv⌕ Search

arXiv subjects

Li Liang

Publications and source records attributed to Li Liang.

At least 37 records · Page 2Linked to original sources

A dispersion-driven 3D color near-eye meta-display

Chromatic dispersion, an inherent wavelength-dependent phenomenon in optical systems, has traditionally been regarded as a detrimental effect to be minimized in imaging and display. Here, we present a paradigm shift by deliberately engineering and harnessing metalens dispersion as a functional mechanism for three-dimensional (3D) near-eye displays. Specifically, we exploit lateral dispersion to transform transverse offset between green and red objects into image-space angular separations that make their images intersected virtually, thereby creating color-merged 3D virtual-image perception. This meta-display architecture preserves compactness of conventional planar display while exhibiting less data requirements and lower hardware complexity than other near-eye 3D displays. Experimentally, we demonstrate a multi-color near-eye 3D system achieving an 11° field of view, 22 pixels-per-degree angular resolution, 0.9 m depth of field, and 19 distinct image planes. This work establishes a new pathway for metasurfaces toward visual displays and highlights great potential for future virtual/augmented reality.

physics.optics↗

Gorenstein homological modules over tensor rings

For a tensor ring $T_R(M)$, under certain conditions, we characterize the Gorenstein projective modules over $T_R(M)$, and prove that a $T_R(M)$-module $(X,u)$ is Gorenstein projective if and only if $u$ is monomorphic and ${\rm coker}(u)$ is a Gorenstein projective $R$-module. Gorenstein injective (resp., flat) modules over $T_R(M)$ are also explicitly described. Moreover, we give a characterization for the coherence of $T_R(M)$. Some applications to trivial ring extensions and Morita context rings are given.

math.RA↗

Manipulation of photonic topological edge and corner states via trivial claddings

Crystalline symmetry offers a powerful tool to realize photonic topological phases, in which additional trivial claddings are typically required to confine topological boundary states. However, the utility of the trivial cladding in manipulating topological waves is often overlooked. Here, we demonstrate two topologically distinct kagome photonic crystals (KPCs) based on different crystalline symmetries: \mathbit{C}_\mathbf{6}- symmetric KPCs exhibit a quantum spin Hall phase, while \mathbit{C}_\mathbf{3}-symmetric KPCs serve as trivial cladding. By tuning the geometric parameter of the trivial cladding, we observe that a pair of topological interface states featured with pseudospin-momentum locking undergoes a phase transition, accompanied by the appearance and disappearance of corner states in a finite hexagonal supercell. Such a geometry-induced band inversion is characterized by a sign change in the Dirac mass of the topological interface states and holds potential for applications such as rainbow trapping. Furthermore, we experimentally demonstrate the corner states, which is a hallmark of higher-order topology, also depend critically on the trivial cladding. Our work highlights the crucial role of trivial claddings on the formation of topological boundary states, and offers a novel approach for their manipulation.

physics.optics↗

Homological invariant properties under cleft extensions

We study the behavior of the Gorenstein weak global dimension under a cleft extension of rings; we prove that under some mild conditons the finiteness of the Gorenstein weak global dimension is invariant. Moreover, we compare the relative singularity categories with respect to flat-cotorsion modules under a cleft extension of rings. Some applications to θ-extensions and Morita context rings are given.

math.CT↗

Enhancing WSI-Based Survival Analysis with Report-Auxiliary Self-Distillation

Survival analysis based on Whole Slide Images (WSIs) is crucial for evaluating cancer prognosis, as they offer detailed microscopic information essential for predicting patient outcomes. However, traditional WSI-based survival analysis usually faces noisy features and limited data accessibility, hindering their ability to capture critical prognostic features effectively. Although pathology reports provide rich patient-specific information that could assist analysis, their potential to enhance WSI-based survival analysis remains largely unexplored. To this end, this paper proposes a novel Report-auxiliary self-distillation (Rasa) framework for WSI-based survival analysis. First, advanced large language models (LLMs) are utilized to extract fine-grained, WSI-relevant textual descriptions from original noisy pathology reports via a carefully designed task prompt. Next, a self-distillation-based pipeline is designed to filter out irrelevant or redundant WSI features for the student model under the guidance of the teacher model's textual knowledge. Finally, a risk-aware mix-up strategy is incorporated during the training of the student model to enhance both the quantity and diversity of the training data. Extensive experiments carried out on our collected data (CRC) and public data (TCGA-BRCA) demonstrate the superior effectiveness of Rasa against state-of-the-art methods. Our code is available at https://github.com/zhengwang9/Rasa.

cs.CV↗

Generative AI for Misalignment-Resistant Virtual Staining to Accelerate Histopathology Workflows

Accurate histopathological diagnosis often requires multiple differently stained tissue sections, a process that is time-consuming, labor-intensive, and environmentally taxing due to the use of multiple chemical stains. Recently, virtual staining has emerged as a promising alternative that is faster, tissue-conserving, and environmentally friendly. However, existing virtual staining methods face significant challenges in clinical applications, primarily due to their reliance on well-aligned paired data. Obtaining such data is inherently difficult because chemical staining processes can distort tissue structures, and a single tissue section cannot undergo multiple staining procedures without damage or loss of information. As a result, most available virtual staining datasets are either unpaired or roughly paired, making it difficult for existing methods to achieve accurate pixel-level supervision. To address this challenge, we propose a robust virtual staining framework featuring cascaded registration mechanisms to resolve spatial mismatches between generated outputs and their corresponding ground truth. Experimental results demonstrate that our method significantly outperforms state-of-the-art models across five datasets, achieving an average improvement of 3.2% on internal datasets and 10.1% on external datasets. Moreover, in datasets with substantial misalignment, our approach achieves a remarkable 23.8% improvement in peak signal-to-noise ratio compared to baseline models. The exceptional robustness of the proposed method across diverse datasets simplifies the data acquisition process for virtual staining and offers new insights for advancing its development.

cs.CV↗

A Multimodal Foundation Model to Enhance Generalizability and Data Efficiency for Pan-cancer Prognosis Prediction

Multimodal data provides heterogeneous information for a holistic understanding of the tumor microenvironment. However, existing AI models often struggle to harness the rich information within multimodal data and extract poorly generalizable representations. Here we present MICE (Multimodal data Integration via Collaborative Experts), a multimodal foundation model that effectively integrates pathology images, clinical reports, and genomics data for precise pan-cancer prognosis prediction. Instead of conventional multi-expert modules, MICE employs multiple functionally diverse experts to comprehensively capture both cross-cancer and cancer-specific insights. Leveraging data from 11,799 patients across 30 cancer types, we enhanced MICE's generalizability by coupling contrastive and supervised learning. MICE outperformed both unimodal and state-of-the-art multi-expert-based multimodal models, demonstrating substantial improvements in C-index ranging from 3.8% to 11.2% on internal cohorts and 5.8% to 8.8% on independent cohorts, respectively. Moreover, it exhibited remarkable data efficiency across diverse clinical scenarios. With its enhanced generalizability and data efficiency, MICE establishes an effective and scalable foundation for pan-cancer prognosis prediction, holding strong potential to personalize tailored therapies and improve treatment outcomes.

cs.LG↗

A Versatile Pathology Co-pilot via Reasoning Enhanced Multimodal Large Language Model

Multimodal large language models (MLLMs) have emerged as powerful tools for computational pathology, offering unprecedented opportunities to integrate pathological images with language context for comprehensive diagnostic analysis. These models hold particular promise for automating complex tasks that traditionally require expert interpretation of pathologists. However, current MLLM approaches in pathology demonstrate significantly constrained reasoning capabilities, primarily due to their reliance on expensive chain-of-thought annotations. Additionally, existing methods remain limited to simplex application of visual question answering (VQA) at the region-of-interest (ROI) level, failing to address the full spectrum of diagnostic needs such as ROI classification, detection, segmentation, whole-slide-image (WSI) classification and VQA in clinical practice. In this study, we present SmartPath-R1, a versatile MLLM capable of simultaneously addressing both ROI-level and WSI-level tasks while demonstrating robust pathological reasoning capability. Our framework combines scale-dependent supervised fine-tuning and task-aware reinforcement fine-tuning, which circumvents the requirement for chain-of-thought supervision by leveraging the intrinsic knowledge within MLLM. Furthermore, SmartPath-R1 integrates multiscale and multitask analysis through a mixture-of-experts mechanism, enabling dynamic processing for diverse tasks. We curate a large-scale dataset comprising 2.3M ROI samples and 188K WSI samples for training and evaluation. Extensive experiments across 72 tasks validate the effectiveness and superiority of the proposed approach. This work represents a significant step toward developing versatile, reasoning-enhanced AI systems for precision pathology.

eess.IV↗

A torsion theoretic interpretation for sheaves of modules and Grothendieck topologies on directed categories

We prove that every Grothendieck topology induces a hereditary torsion pair in the category of presheaves of modules on a ringed site, and obtain a homological characterization of sheaves of modules: a presheaf of modules is a sheaf of modules if and only if it is saturated with respect to torsion presheaves, or equivalently, it is right perpendicular to torsion presheaves in the sense of Geigle and Lenzing. We also study Grothendieck topologies on directed categories $\mathscr{C}$ satisfying certain finiteness condition, and show that every Grothendieck topology on $\mathscr{C}$ is a subcategory topology if and only if $\mathscr{C}$ is an artinian EI category. Consequently, in this case every sheaf category is equivalent to the presheaf category over a full subcategory of $\mathscr{C}$. Finally, we classify all Grothendieck topologies on a special type of noetherian EI categories, and extend the locally self-injective property of representations of $\mathrm{F}$ and $\mathrm{VI}$ to representations of their infinite full subcategories. Some potential applications in group representation theory are given at the end of this paper.

math.RT↗

Representations over diagrams of abelian categories II: Abelian model structures

This is the second paper in a series on representations over diagrams of abelian categories. We show that, under certain conditions, a compatible family of abelian model categories indexed by a skeletal small category can be amalgamated into an abelian model structure on the category of representations. Our approach focuses on classes of morphisms rather than cotorsion pairs of objects. Additionally, we provide an explicit description of cofibrant objects in the resulting abelian model category. As applications, we construct Gorenstein injective and Gorenstein flat model structures on the category of presheaves of modules over a special class of index category and characterize Gorenstein homological objects within this framework.

math.CT↗

PathBench: A comprehensive comparison benchmark for pathology foundation models towards precision oncology

The emergence of pathology foundation models has revolutionized computational histopathology, enabling highly accurate, generalized whole-slide image analysis for improved cancer diagnosis, and prognosis assessment. While these models show remarkable potential across cancer diagnostics and prognostics, their clinical translation faces critical challenges including variability in optimal model across cancer types, potential data leakage in evaluation, and lack of standardized benchmarks. Without rigorous, unbiased evaluation, even the most advanced PFMs risk remaining confined to research settings, delaying their life-saving applications. Existing benchmarking efforts remain limited by narrow cancer-type focus, potential pretraining data overlaps, or incomplete task coverage. We present PathBench, the first comprehensive benchmark addressing these gaps through: multi-center in-hourse datasets spanning common cancers with rigorous leakage prevention, evaluation across the full clinical spectrum from diagnosis to prognosis, and an automated leaderboard system for continuous model assessment. Our framework incorporates large-scale data, enabling objective comparison of PFMs while reflecting real-world clinical complexity. All evaluation data comes from private medical providers, with strict exclusion of any pretraining usage to avoid data leakage risks. We have collected 15,888 WSIs from 8,549 patients across 10 hospitals, encompassing over 64 diagnosis and prognosis tasks. Currently, our evaluation of 19 PFMs shows that Virchow2 and H-Optimus-1 are the most effective models overall. This work provides researchers with a robust platform for model development and offers clinicians actionable insights into PFM performance across diverse clinical scenarios, ultimately accelerating the translation of these transformative technologies into routine pathology practice.

cs.CV↗

Sheaves of modules on atomic sites and discrete representations of topological groups

The main goal of this paper is to establish close relations among sheaves of modules on atomic sites, representations of categories, and discrete representations of topological groups. We characterize sheaves of modules on atomic sites as saturated representations, which are precisely representations right perpendicular to torsion representations in the sense of Geigle and Lenzing. Consequently, the category of sheaves is equivalent to the Serre quotient of the category of presheaves by the category of torsion presheaves. We also interpret the sheaf cohomology functors as derived functors of the torsion functor and for some special cases as the local cohomology functors. These results as well as a classical theorem of Artin provides us a new approach to study discrete representations of topological groups. In particular, by importing established facts in representation stability theory, we explicitly classify simple or indecomposable injective discrete representations of some topological groups such as the infinite symmetric group, the infinite general or special linear group over a finite field, and the automorphism group of the linearly ordered set $\mathbb{Q}$. We also show that discrete representations $V$ of these topological groups satisfy a certain stability property.

math.RT↗

Towards A Generalizable Pathology Foundation Model via Unified Knowledge Distillation

Foundation models pretrained on large-scale datasets are revolutionizing the field of computational pathology (CPath). The generalization ability of foundation models is crucial for the success in various downstream clinical tasks. However, current foundation models have only been evaluated on a limited type and number of tasks, leaving their generalization ability and overall performance unclear. To address this gap, we established a most comprehensive benchmark to evaluate the performance of off-the-shelf foundation models across six distinct clinical task types, encompassing a total of 72 specific tasks, including slide-level classification, survival prediction, ROI-tissue classification, ROI retrieval, visual question answering, and report generation. Our findings reveal that existing foundation models excel at certain task types but struggle to effectively handle the full breadth of clinical tasks. To improve the generalization of pathology foundation models, we propose a unified knowledge distillation framework consisting of both expert and self-knowledge distillation, where the former allows the model to learn from the knowledge of multiple expert models, while the latter leverages self-distillation to enable image representation learning via local-global alignment. Based on this framework, we curated a dataset of 96,000 whole slide images (WSIs) and developed a Generalizable Pathology Foundation Model (GPFM). This advanced model was trained on a substantial dataset comprising 190 million images extracted from approximately 72,000 publicly available slides, encompassing 34 major tissue types. Evaluated on the established benchmark, GPFM achieves an impressive average rank of 1.6, with 42 tasks ranked 1st, while the second-best model, UNI, attains an average rank of 3.7, with only 6 tasks ranked 1st.

eess.IV↗

A Multimodal Knowledge-enhanced Whole-slide Pathology Foundation Model

Remarkable strides in computational pathology have been made in the task-agnostic foundation model that advances the performance of a wide array of downstream clinical tasks. Despite the promising performance, there are still several challenges. First, prior works have resorted to either vision-only or image-caption data, disregarding pathology reports with more clinically authentic information from pathologists and gene expression profiles which respectively offer distinct knowledge for versatile clinical applications. Second, the current progress in pathology FMs predominantly concentrates on the patch level, where the restricted context of patch-level pretraining fails to capture whole-slide patterns. Even recent slide-level FMs still struggle to provide whole-slide context for patch representation. In this study, for the first time, we develop a pathology foundation model incorporating three levels of modalities: pathology slides, pathology reports, and gene expression data, which resulted in 26,169 slide-level modality pairs from 10,275 patients across 32 cancer types, amounting to over 116 million pathological patch images. To leverage these data for CPath, we propose a novel whole-slide pretraining paradigm that injects the multimodal whole-slide context into the patch representation, called Multimodal Self-TAught PRetraining (mSTAR). The proposed paradigm revolutionizes the pretraining workflow for CPath, enabling the pathology FM to acquire the whole-slide context. To the best of our knowledge, this is the first attempt to incorporate three modalities at the whole-slide context for enhancing pathology FMs. To systematically evaluate the capabilities of mSTAR, we built the largest spectrum of oncological benchmark, spanning 7 categories of oncological applications in 15 types of 97 practical oncological tasks.

cs.CV↗

Exploring Hallucination of Large Multimodal Models in Video Understanding: Benchmark, Analysis and Mitigation

The hallucination of large multimodal models (LMMs), providing responses that appear correct but are actually incorrect, limits their reliability and applicability. This paper aims to study the hallucination problem of LMMs in video modality, which is dynamic and more challenging compared to static modalities like images and text. From this motivation, we first present a comprehensive benchmark termed HAVEN for evaluating hallucinations of LMMs in video understanding tasks. It is built upon three dimensions, i.e., hallucination causes, hallucination aspects, and question formats, resulting in 6K questions. Then, we quantitatively study 7 influential factors on hallucinations, e.g., duration time of videos, model sizes, and model reasoning, via experiments of 16 LMMs on the presented benchmark. In addition, inspired by recent thinking models like OpenAI o1, we propose a video-thinking model to mitigate the hallucinations of LMMs via supervised reasoning fine-tuning (SRFT) and direct preference optimization (TDPO)-- where SRFT enhances reasoning capabilities while TDPO reduces hallucinations in the thinking process. Extensive experiments and analyses demonstrate the effectiveness. Remarkably, it improves the baseline by 7.65% in accuracy on hallucination evaluation and reduces the bias score by 4.5%. The code and data are public at https://github.com/Hongcheng-Gao/HAVEN.

cs.CV↗

Reinforcement Learning for Adaptive Planner Parameter Tuning: A Perspective on Hierarchical Architecture

Automatic parameter tuning methods for planning algorithms, which integrate pipeline approaches with learning-based techniques, are regarded as promising due to their stability and capability to handle highly constrained environments. While existing parameter tuning methods have demonstrated considerable success, further performance improvements require a more structured approach. In this paper, we propose a hierarchical architecture for reinforcement learning-based parameter tuning. The architecture introduces a hierarchical structure with low-frequency parameter tuning, mid-frequency planning, and high-frequency control, enabling concurrent enhancement of both upper-layer parameter tuning and lower-layer control through iterative training. Experimental evaluations in both simulated and real-world environments show that our method surpasses existing parameter tuning approaches. Furthermore, our approach achieves first place in the Benchmark for Autonomous Robot Navigation (BARN) Challenge.

cs.RO↗

Dominance Regions of Pursuit-evasion Games in Non-anticipative Information Patterns

The evader's dominance region is an important concept and the foundation of geometric methods for pursuit-evasion games. This article mainly reveals the relevant properties of the evader's dominance region, especially in non-anticipative information patterns. We can use these properties to research pursuit-evasion games in non-anticipative information patterns. The core problem is under what condition the pursuer has a non-anticipative strategy to prevent the evader leaving its initial dominance region before being captured regardless of the evader's strategy. We first define the evader's dominance region by the shortest path distance, and we rigorously prove for the first time that the initial dominance region of the evader is the reachable region of the evader in the open-loop sense. Subsequently, we prove that there exists a non-anticipative strategy by which the pursuer can capture the evader before the evader leaves its initial dominance region's closure in the absence of obstacles. For cases with obstacles, we provide a counter example to illustrate that such a non-anticipative strategy does not always exist, and provide a necessary condition for the existence of such strategy. Finally, we consider a scenario with a single corner obstacle and provide a sufficient condition for the existence of such a non-anticipative strategy. At the end of this article, we discuss the application of the evader's dominance region in target defense games. This article has important reference significance for the design of non-anticipative strategies in pursuit-evasion games with obstacles.

math.OC↗

Skip Mamba Diffusion for Monocular 3D Semantic Scene Completion

3D semantic scene completion is critical for multiple downstream tasks in autonomous systems. It estimates missing geometric and semantic information in the acquired scene data. Due to the challenging real-world conditions, this task usually demands complex models that process multi-modal data to achieve acceptable performance. We propose a unique neural model, leveraging advances from the state space and diffusion generative modeling to achieve remarkable 3D semantic scene completion performance with monocular image input. Our technique processes the data in the conditioned latent space of a variational autoencoder where diffusion modeling is carried out with an innovative state space technique. A key component of our neural network is the proposed Skimba (Skip Mamba) denoiser, which is adept at efficiently processing long-sequence data. The Skimba diffusion model is integral to our 3D scene completion network, incorporating a triple Mamba structure, dimensional decomposition residuals and varying dilations along three directions. We also adopt a variant of this network for the subsequent semantic segmentation stage of our method. Extensive evaluation on the standard SemanticKITTI and SSCBench-KITTI360 datasets show that our approach not only outperforms other monocular techniques by a large margin, it also achieves competitive performance against stereo methods. The code is available at https://github.com/xrkong/skimba

cs.CV↗