arXiv subjects

Tao Zhou

Publications and source records attributed to Tao Zhou.

At least 145 records · Page 8Linked to original sources

arXiv2025

Constraints on the orbital flux phase in $A$V$_3$Sb$_5$ from polar Kerr effect

The $A$V$_3$Sb$_5$ ($A=$ K, Rb, Cs) family of Kagome metals hosts unconventional charge density wave order whose nature is still an open puzzle. Accumulated evidences point to a time-reversal symmetry breaking orbital flux phase that carries loop currents. Such an order may support anomalous Hall effect. However, the polar Kerr effect measurements that probe the a.c. anomalous Hall conductivity seems to have yielded contradictory results. We first argue on symmetry grounds that some previously proposed orbital flux order, most notably the one with Star-of-David distortion, shall not give rise to anomalous Hall or polar Kerr effects. We further take the tri-hexagonal orbital flux phase as an exemplary Kagome flux order that does exhibit anomalous Hall response, and show that the Kerr rotation angle at two relevant experimental optical frequencies generally reaches microradians to sub-milliradians levels. A particularly sharp resonance enhancement is observed at around $\hbar ω=1$ eV, suggesting exceedingly large Kerr rotation at the corresponding probing frequencies not yet accessed by previous experiments. Our study can help to interpret the Kerr measurements on $A$V$_3$Sb$_5$ and to eventually resolve the nature of their CDW order.

cond-mat.mes-hall↗

arXiv2025

A Survey on Deep Learning for Polyp Segmentation: Techniques, Challenges and Future Trends

Early detection and assessment of polyps play a crucial role in the prevention and treatment of colorectal cancer (CRC). Polyp segmentation provides an effective solution to assist clinicians in accurately locating and segmenting polyp regions. In the past, people often relied on manually extracted lower-level features such as color, texture, and shape, which often had issues capturing global context and lacked robustness to complex scenarios. With the advent of deep learning, more and more outstanding medical image segmentation algorithms based on deep learning networks have emerged, making significant progress in this field. This paper provides a comprehensive review of polyp segmentation algorithms. We first review some traditional algorithms based on manually extracted features and deep segmentation algorithms, then detail benchmark datasets related to the topic. Specifically, we carry out a comprehensive evaluation of recent deep learning models and results based on polyp sizes, considering the pain points of research topics and differences in network structures. Finally, we discuss the challenges of polyp segmentation and future trends in this field. The models, benchmark datasets, and source code links we collected are all published at https://github.com/taozh2017/Awesome-Polyp-Segmentation.

cs.CV↗

arXiv2025

Self-adaptive vision-language model for 3D segmentation of pulmonary artery and vein

Accurate segmentation of pulmonary structures iscrucial in clinical diagnosis, disease study, and treatment planning. Significant progress has been made in deep learning-based segmentation techniques, but most require much labeled data for training. Consequently, developing precise segmentation methods that demand fewer labeled datasets is paramount in medical image analysis. The emergence of pre-trained vision-language foundation models, such as CLIP, recently opened the door for universal computer vision tasks. Exploiting the generalization ability of these pre-trained foundation models on downstream tasks, such as segmentation, leads to unexpected performance with a relatively small amount of labeled data. However, exploring these models for pulmonary artery-vein segmentation is still limited. This paper proposes a novel framework called Language-guided self-adaptive Cross-Attention Fusion Framework. Our method adopts pre-trained CLIP as a strong feature extractor for generating the segmentation of 3D CT scans, while adaptively aggregating the cross-modality of text and image representations. We propose a s pecially designed adapter module to fine-tune pre-trained CLIP with a self-adaptive learning strategy to effectively fuse the two modalities of embeddings. We extensively validate our method on a local dataset, which is the largest pulmonary artery-vein CT dataset to date and consists of 718 labeled data in total. The experiments show that our method outperformed other state-of-the-art methods by a large margin. Our data and code will be made publicly available upon acceptance.

cs.CV↗

arXiv2025

Thermodynamic work and heat for a quantum process: Approach by Hamiltonian decomposition

The separation of internal energy into heat and work in quantum thermodynamics is a controversial issue for a long time, and we revisit and solve this problem in this work. It is shown that the Hamiltonian plays dual roles for a quantum system, and by decomposing the interaction Hamiltonian between system and environment accordingly, an ``effective Hamiltonian" for an open quantum system can be proposed. The explicit expression of the effective Hamiltonian is obtained systematically, and as a consequence, the internal energy of an open quantum system can be well defined, leading to the reasonable definitions of work and heat for a general quantum process.

quant-ph↗

arXiv2024

Self-Calibrated Dual Contrasting for Annotation-Efficient Bacteria Raman Spectroscopy Clustering and Classification

Raman scattering is based on molecular vibration spectroscopy and provides a powerful technology for pathogenic bacteria diagnosis using the unique molecular fingerprint information of a substance. The integration of deep learning technology has significantly improved the efficiency and accuracy of intelligent Raman spectroscopy (RS) recognition. However, the current RS recognition methods based on deep neural networks still require the annotation of a large amount of spectral data, which is labor-intensive. This paper presents a novel annotation-efficient Self-Calibrated Dual Contrasting (SCDC) method for RS recognition that operates effectively with few or no annotation. Our core motivation is to represent the spectrum from two different perspectives in two distinct subspaces: embedding and category. The embedding perspective captures instance-level information, while the category perspective reflects category-level information. Accordingly, we have implemented a dual contrastive learning approach from two perspectives to obtain discriminative representations, which are applicable for Raman spectroscopy recognition under both unsupervised and semi-supervised learning conditions. Furthermore, a self-calibration mechanism is proposed to enhance robustness. Validation of the identification task on three large-scale bacterial Raman spectroscopy datasets demonstrates that our SCDC method achieves robust recognition performance with very few (5$\%$ or 10$\%$) or no annotations, highlighting the potential of the proposed method for biospectral identification in annotation-efficient clinical scenarios.

eess.SP↗

arXiv2024

Enhancing Large-scale UAV Route Planing with Global and Local Features via Reinforcement Graph Fusion

Numerous remarkable advancements have been made in accuracy, speed, and parallelism for solving the Unmanned Aerial Vehicle Route Planing (UAVRP). However, existing UAVRP solvers face challenges when attempting to scale effectively and efficiently for larger instances. In this paper, we present a generalization framework that enables current UAVRP solvers to robustly extend their capabilities to larger instances, accommodating up to 10,000 points, using widely recognized test sets. The UAVRP under a large number of patrol points is a typical large-scale TSP problem.Our proposed framework comprises three distinct steps. Firstly, we employ Delaunay triangulation to extract subgraphs from large instances while preserving global features. Secondly, we utilize an embedded TSP solver to obtain sub-results, followed by graph fusion. Finally, we implement a decoding strategy customizable to the user's requirements, resulting in high-quality solutions, complemented by a warming-up process for the heatmap. To demonstrate the flexibility of our approach, we integrate two representative TSP solvers into our framework and conduct a comprehensive comparative analysis against existing algorithms using large TSP benchmark datasets. The results unequivocally demonstrate that our framework efficiently scales existing TSP solvers to handle large instances and consistently outperforms state-of-the-art (SOTA) methods. Furthermore, since our proposed framework does not necessitate additional training or fine-tuning, we believe that its generality can significantly advance research on end-to-end UAVRP solvers, enabling the application of a broader range of methods to real-world scenarios.

cs.AI↗

arXiv2024

Bridging the User-side Knowledge Gap in Knowledge-aware Recommendations with Large Language Models

In recent years, knowledge graphs have been integrated into recommender systems as item-side auxiliary information, enhancing recommendation accuracy. However, constructing and integrating structural user-side knowledge remains a significant challenge due to the improper granularity and inherent scarcity of user-side features. Recent advancements in Large Language Models (LLMs) offer the potential to bridge this gap by leveraging their human behavior understanding and extensive real-world knowledge. Nevertheless, integrating LLM-generated information into recommender systems presents challenges, including the risk of noisy information and the need for additional knowledge transfer. In this paper, we propose an LLM-based user-side knowledge inference method alongside a carefully designed recommendation framework to address these challenges. Our approach employs LLMs to infer user interests based on historical behaviors, integrating this user-side information with item-side and collaborative data to construct a hybrid structure: the Collaborative Interest Knowledge Graph (CIKG). Furthermore, we propose a CIKG-based recommendation framework that includes a user interest reconstruction module and a cross-domain contrastive learning module to mitigate potential noise and facilitate knowledge transfer. We conduct extensive experiments on three real-world datasets to validate the effectiveness of our method. Our approach achieves state-of-the-art performance compared to competitive baselines, particularly for users with sparse interactions.

cs.IR↗

arXiv2024

Learnable Prompting SAM-induced Knowledge Distillation for Semi-supervised Medical Image Segmentation

The limited availability of labeled data has driven advancements in semi-supervised learning for medical image segmentation. Modern large-scale models tailored for general segmentation, such as the Segment Anything Model (SAM), have revealed robust generalization capabilities. However, applying these models directly to medical image segmentation still exposes performance degradation. In this paper, we propose a learnable prompting SAM-induced Knowledge distillation framework (KnowSAM) for semi-supervised medical image segmentation. Firstly, we propose a Multi-view Co-training (MC) strategy that employs two distinct sub-networks to employ a co-teaching paradigm, resulting in more robust outcomes. Secondly, we present a Learnable Prompt Strategy (LPS) to dynamically produce dense prompts and integrate an adapter to fine-tune SAM specifically for medical image segmentation tasks. Moreover, we propose SAM-induced Knowledge Distillation (SKD) to transfer useful knowledge from SAM to two sub-networks, enabling them to learn from SAM's predictions and alleviate the effects of incorrect pseudo-labels during training. Notably, the predictions generated by our subnets are used to produce mask prompts for SAM, facilitating effective inter-module information exchange. Extensive experimental results on various medical segmentation tasks demonstrate that our model outperforms the state-of-the-art semi-supervised segmentation approaches. Crucially, our SAM distillation framework can be seamlessly integrated into other semi-supervised segmentation methods to enhance performance. The code will be released upon acceptance of this manuscript at: https://github.com/taozh2017/KnowSAM

cs.CV↗

arXiv2024

CALA: A Class-Aware Logit Adapter for Few-Shot Class-Incremental Learning

Few-Shot Class-Incremental Learning (FSCIL) defines a practical but challenging task where models are required to continuously learn novel concepts with only a few training samples. Due to data scarcity, existing FSCIL methods resort to training a backbone with abundant base data and then keeping it frozen afterward. However, the above operation often causes the backbone to overfit to base classes while overlooking the novel ones, leading to severe confusion between them. To address this issue, we propose Class-Aware Logit Adapter (CALA). Our method involves a lightweight adapter that learns to rectify biased predictions through a pseudo-incremental learning paradigm. In the real FSCIL process, we use the learned adapter to dynamically generate robust balancing factors. These factors can adjust confused novel instances back to their true label space based on their similarity to base classes. Specifically, when confusion is more likely to occur in novel instances that closely resemble base classes, greater rectification is required. Notably, CALA operates on the classifier level, preserving the original feature space, thus it can be flexibly plugged into most of the existing FSCIL works for improved performance. Experiments on three benchmark datasets consistently validate the effectiveness and flexibility of CALA. Codes will be available upon acceptance.

cs.CV↗

arXiv2024

Bringing Multimodality to Amazon Visual Search System

Image to image matching has been well studied in the computer vision community. Previous studies mainly focus on training a deep metric learning model matching visual patterns between the query image and gallery images. In this study, we show that pure image-to-image matching suffers from false positives caused by matching to local visual patterns. To alleviate this issue, we propose to leverage recent advances in vision-language pretraining research. Specifically, we introduce additional image-text alignment losses into deep metric learning, which serve as constraints to the image-to-image matching loss. With additional alignments between the text (e.g., product title) and image pairs, the model can learn concepts from both modalities explicitly, which avoids matching low-level visual features. We progressively develop two variants, a 3-tower and a 4-tower model, where the latter takes one more short text query input. Through extensive experiments, we show that this change leads to a substantial improvement to the image to image matching problem. We further leveraged this model for multimodal search, which takes both image and reformulation text queries to improve search quality. Both offline and online experiments show strong improvements on the main metrics. Specifically, we see 4.95% relative improvement on image matching click through rate with the 3-tower model and 1.13% further improvement from the 4-tower model.

cs.CV↗

arXiv2024

DiffRaman: A Conditional Latent Denoising Diffusion Probabilistic Model for Bacterial Raman Spectroscopy Identification Under Limited Data Conditions

Raman spectroscopy has attracted significant attention in various biochemical detection fields, especially in the rapid identification of pathogenic bacteria. The integration of this technology with deep learning to facilitate automated bacterial Raman spectroscopy diagnosis has emerged as a key focus in recent research. However, the diagnostic performance of existing deep learning methods largely depends on a sufficient dataset, and in scenarios where there is a limited availability of Raman spectroscopy data, it is inadequate to fully optimize the numerous parameters of deep neural networks. To address these challenges, this paper proposes a data generation method utilizing deep generative models to expand the data volume and enhance the recognition accuracy of bacterial Raman spectra. Specifically, we introduce DiffRaman, a conditional latent denoising diffusion probability model for Raman spectra generation. Experimental results demonstrate that synthetic bacterial Raman spectra generated by DiffRaman can effectively emulate real experimental spectra, thereby enhancing the performance of diagnostic models, especially under conditions of limited data. Furthermore, compared to existing generative models, the proposed DiffRaman offers improvements in both generation quality and computational efficiency. Our DiffRaman approach offers a well-suited solution for automated bacteria Raman spectroscopy diagnosis in data-scarce scenarios, offering new insights into alleviating the labor of spectroscopic measurements and enhancing rare bacteria identification.

cs.CV↗

arXiv2024

A class of refined implicit-explicit Runge-Kutta methods with robust time adaptability and unconditional convergence for the Cahn-Hilliard model

One of main obstacles in verifying the energy dissipation laws of implicit-explicit Runge-Kutta (IERK) methods for phase field equations is to establish the uniform boundedness of stage solutions without the global Lipschitz continuity assumption of nonlinear bulk. With the help of discrete orthogonal convolution kernels, an updated time-space splitting technique is developed to establish the uniform boundedness of stage solutions for a refined class of IERK methods in which the associated differentiation matrices and the average dissipation rates are always independent of the time-space discretization meshes. This makes the refined IERK methods highly advantageous in self-adaptive time-stepping procedures as some larger adaptive step-sizes in actual simulations become possible. From the perspective of optimizing the average dissipation rate, we construct some parameterized refined IERK methods up to third-order accuracy, in which the involved diagonally implicit Runge-Kutta methods for the implicit part have an explicit first stage and allow a stage-order of two such that they are not necessarily algebraically stable. Then we are able to establish, for the first time, the original energy dissipation law and the unconditional $L^2$ norm convergence. Extensive numerical tests are presented to support our theory.

math.NA↗

arXiv2024

Long-lived vectors from electromagnetic cascades at SHiP

We simulate dark-vector, $V$, production from electromagnetic cascades at the recently approved SHiP experiment. The cascades (initiated by photons from $π^0\rightarrow γγ$) can lead to 3-4 orders of magnitude increase of the event rate relative to using primary production alone. We provide new SHiP sensitivity projections for dark photons and electrophilic gauge bosons, which are significantly improved compared to previous literature. The main gain in sensitivity occurs for long-lived dark vectors with masses below $\sim 50-300~{\rm MeV}$. The dominant production mode in this parameter space is low-energy annihilation $e^+ e^- \rightarrow V(γ)$. This motivates a detailed study of backgrounds and efficiencies in the SHiP experiment for sub-GeV signals.

hep-ph↗

arXiv2024

Beyond Pairwise Interactions: Unveiling the Role of Higher-Order Interactions via Stepwise Reduction

Complex systems, such as economic, social, biological, and ecological systems, usually feature interactions not only between pairwise entities but also among three or more entities. These multi-entity interactions are known as higher-order interactions. Hypergraph, as a mathematical tool, can effectively characterize higher-order interactions, where nodes denote entities and hyperedges represent interactions among multiple entities. Meanwhile, all higher-order interactions can also be projected into a number of lower-order interactions or even some pairwise interactions. Whether it is necessary to consider all higher-order interactions, and whether it is with little loss to replace them by lower-order or even pairwise interactions, remain a controversial issue. If the role of higher-order interactions is insignificant, the complexity of computation and the difficulty of analysis can be drastically reduced by projecting higher-order interactions into lower-order or pairwise interactions. We use link prediction, a fundamental problem in network science, as the entry point. Specifically, we evaluate the impact of higher-order interactions on link predictive accuracy to explore the necessity of these structures. We propose a method to decompose the higher-order structures in a stepwise way, thereby allowing to systematically explore the impacts of structures at different orders on link prediction. The results indicate that in some networks, incorporating higher-order interactions significantly enhances the accuracy of link prediction, while in others, the effect is insignificant. Therefore, we think that the role of higher-order interactions varies in different types of networks. Overall, since the improvement in predictive accuracy provided by higher-order interactions is significant in some networks, we believe that the study of higher-order interactions is both necessary and valuable.

physics.soc-ph↗

arXiv2024

An Efficient Dynamic Resource Allocation Framework for Evolutionary Bilevel Optimization

Bilevel optimization problems are characterized by an interactive hierarchical structure, where the upper level seeks to optimize its strategy while simultaneously considering the response of the lower level. Evolutionary algorithms are commonly used to solve complex bilevel problems in practical scenarios, but they face significant resource consumption challenges due to the nested structure imposed by the implicit lower-level optimality condition. This challenge becomes even more pronounced as problem dimensions increase. Although recent methods have enhanced bilevel convergence through task-level knowledge sharing, further efficiency improvements are still hindered by redundant lower-level iterations that consume excessive resources while generating unpromising solutions. To overcome this challenge, this paper proposes an efficient dynamic resource allocation framework for evolutionary bilevel optimization, named DRC-BLEA. Compared to existing approaches, DRC-BLEA introduces a novel competitive quasi-parallel paradigm, in which multiple lower-level optimization tasks, derived from different upper-level individuals, compete for resources. A continuously updated selection probability is used to prioritize execution opportunities to promising tasks. Additionally, a cooperation mechanism is integrated within the competitive framework to further enhance efficiency and prevent premature convergence. Experimental results compared with chosen state-of-the-art algorithms demonstrate the effectiveness of the proposed method. Specifically, DRC-BLEA achieves competitive accuracy across diverse problem sets and real-world scenarios, while significantly reducing the number of function evaluations and overall running time.

cs.NE↗

arXiv2024

Exploring the Interplay Between Video Generation and World Models in Autonomous Driving: A Survey

World models and video generation are pivotal technologies in the domain of autonomous driving, each playing a critical role in enhancing the robustness and reliability of autonomous systems. World models, which simulate the dynamics of real-world environments, and video generation models, which produce realistic video sequences, are increasingly being integrated to improve situational awareness and decision-making capabilities in autonomous vehicles. This paper investigates the relationship between these two technologies, focusing on how their structural parallels, particularly in diffusion-based models, contribute to more accurate and coherent simulations of driving scenarios. We examine leading works such as JEPA, Genie, and Sora, which exemplify different approaches to world model design, thereby highlighting the lack of a universally accepted definition of world models. These diverse interpretations underscore the field's evolving understanding of how world models can be optimized for various autonomous driving tasks. Furthermore, this paper discusses the key evaluation metrics employed in this domain, such as Chamfer distance for 3D scene reconstruction and Fréchet Inception Distance (FID) for assessing the quality of generated video content. By analyzing the interplay between video generation and world models, this survey identifies critical challenges and future research directions, emphasizing the potential of these technologies to jointly advance the performance of autonomous driving systems. The findings presented in this paper aim to provide a comprehensive understanding of how the integration of video generation and world models can drive innovation in the development of safer and more reliable autonomous vehicles.

cs.AI↗

arXiv2024

Adaptive neural network basis methods for partial differential equations with low-regular solutions

This paper aims to devise an adaptive neural network basis method for numerically solving a second-order semilinear partial differential equation (PDE) with low-regular solutions in two/three dimensions. The method is obtained by combining basis functions from a class of shallow neural networks and the resulting multi-scale analogues, a residual strategy in adaptive methods and the non-overlapping domain decomposition method. At the beginning, in view of the solution residual, we partition the total domain $Ω$ into $K+1$ non-overlapping subdomains, denoted respectively as $\{Ω_k\}_{k=0}^K$, where the exact solution is smooth on subdomain $Ω_{0}$ and low-regular on subdomain $Ω_{k}$ ($1\le k\le K$). Secondly, the low-regular solutions on different subdomains $Ω_{k}$~($1\le k\le K$) are approximated by neural networks with different scales, while the smooth solution on subdomain $Ω_0$ is approximated by the initialized neural network. Thirdly, we determine the undetermined coefficients by solving the linear least squares problems directly or the nonlinear least squares problem via the Gauss-Newton method. The proposed method can be extended to multi-level case naturally. Finally, we use this adaptive method for several peak problems in two/three dimensions to show its high-efficient computational performance.

math.NA↗

arXiv2024

Integrated spectrally multiplexed light-matter interface at telecom band

Light-matter interface is an important building block for long-distance quantum networks. Towards a scalable quantum network with high-rate quantum information processing, it requires to develop integrated light-matter interfaces with broadband and multiplexing capacities. Here we demonstrate a light-matter interface at telecom band in an integrated system. A five-spectral-channel atomic-frequency-comb photonic memory is prepared on a laser-written Er3+:LiNbO3 chip. The bandwidth of each channel is 4 GHz with a channel spacing of 15 GHz. The signal photons from time-bin entangled photon pairs at telecom band are sent into the on-chip memory and recalled after a storage time of 152 ns. The entanglement-preserving nature of our integrated quantum interface is assessed by an input/output fidelity of >92% for all the five spectral channels. Our light-matter interfaces constitute a notable step forward toward a high-rate quantum network involving integrated device.

quant-ph↗