arXiv subjects

Tao Chen

Publications and source records attributed to Tao Chen.

At least 199 records · Page 11Linked to original sources

arXiv2025

Percolation in the two-dimensional Ising model

The study of the Ising model from a percolation perspective has played a significant role in the modern theory of critical phenomena. We consider the celebrated square-lattice Ising model and construct percolation clusters by placing bonds, with probability $p$, between any pair of parallel spins within an extended range beyond nearest neighbors. At the Ising criticality, we observe two percolation transitions as $p$ increases: starting from a disordered phase with only small clusters, the percolation system enters into a stable critical phase that persists over a wide range $p_{c_1} < p < p_{c_2}$, and then develops a long-ranged percolation order with giant clusters for both up and down spins. At $p_{c1}$ and for the stable critical phase, the critical behaviors agree well with those for the Fortuin-Kasteleyn random clusters and the spin domains of the Ising model, respectively. At $p_{c2}$, the fractal dimension of clusters and the scaling exponent along $p$ direction are estimated as $y_{h2} = 1.958\,0(6)$ and $y_{p2} = 0.552(9)$, of which the exact values remain unknown. These findings reveal interesting geometric properties of the two-dimensional Ising model that has been studied for more than 100 years.

cond-mat.stat-mech↗

arXiv2025

Extending the Low-Frequency Limit of Time-Domain Thermoreflectance via Periodic Waveform Analysis

Time-domain thermoreflectance (TDTR) is a powerful technique for characterizing the thermal properties of layered materials. However, its effectiveness at modulation frequencies below 0.1 MHz is hindered by pulse accumulation effects, limiting its ability to accurately measure in-plane thermal conductivities below 6 W/(m K). Here, we present a periodic waveform analysis-based TDTR (PWA-TDTR) method that extends the measurable frequency range down to 50 Hz with minimal modifications to the conventional setup. This advancement greatly enhances measurement sensitivity, enabling accurate measurements of in-plane thermal conductivities as low as 0.2 W/(m K). We validate the technique by measuring polymethyl methacrylate (PMMA) and fused silica, using PWA-TDTR to obtain in-plane thermal diffusivity and conventional TDTR to measure cross-plane thermal effusivity. Together, these allow the extraction of both thermal conductivity and volumetric heat capacity, with results in excellent agreement with literature values. We further demonstrate the versatility of PWA-TDTR through (1) thermal conductivity and heat capacity measurements of thin liquid films and (2) depth-resolved thermal conductivity profiling in lithium niobate crystals, revealing point defect-induced inhomogeneities at depths up to 100 um. By overcoming frequency and sensitivity constraints, PWA-TDTR significantly expands the applicability of TDTR, enabling detailed investigations of thermal transport in materials and conditions that were previously challenging to study.

physics.app-ph↗

arXiv2025

Faster Configuration Performance Bug Testing with Neural Dual-level Prioritization

As software systems become more complex and configurable, more performance problems tend to arise from the configuration designs. This has caused some configuration options to unexpectedly degrade performance which deviates from their original expectations designed by the developers. Such discrepancies, namely configuration performance bugs (CPBugs), are devastating and can be deeply hidden in the source code. Yet, efficiently testing CPBugs is difficult, not only due to the test oracle is hard to set, but also because the configuration measurement is expensive and there are simply too many possible configurations to test. As such, existing testing tools suffer from lengthy runtime or have been ineffective in detecting CPBugs when the budget is limited, compounded by inaccurate test oracle. In this paper, we seek to achieve significantly faster CPBug testing by neurally prioritizing the testing at both the configuration option and value range levels with automated oracle estimation. Our proposed tool, dubbed NDP, is a general framework that works with different heuristic generators. The idea is to leverage two neural language models: one to estimate the CPBug types that serve as the oracle while, more vitally, the other to infer the probabilities of an option being CPBug-related, based on which the options and the value ranges to be searched can be prioritized. Experiments on several widely-used systems of different versions reveal that NDP can, in general, better predict CPBug type in 87% cases and find more CPBugs with up to 88.88x testing efficiency speedup over the state-of-the-art tools.

cs.SE↗

arXiv2025

Dolphin: Moving Towards Closed-loop Auto-research through Thinking, Practice, and Feedback

The scientific research paradigm is undergoing a profound transformation owing to the development of Artificial Intelligence (AI). Recent works demonstrate that various AI-assisted research methods can largely improve research efficiency by improving data analysis, accelerating computation, and fostering novel idea generation. To further move towards the ultimate goal (i.e., automatic scientific research), in this paper, we introduce Dolphin, a closed-loop LLM-driven framework to enhance the automation level of scientific research. Dolphin first generates novel ideas based on feedback from previous experiments and relevant papers ranked by the topic and task attributes. Then, the generated ideas can be implemented using a code template refined and debugged with the designed exception-traceback-guided local code structure. Finally, Dolphin automatically analyzes the results of each idea and feeds the results back to the next round of idea generation. Experiments are conducted on the benchmark datasets of different topics and a subset of MLE-bench. Results show that Dolphin can continuously improve the performance of the input topic in a loop. We highlight that Dolphin can automatically propose methods that are comparable to the state-of-the-art in some tasks such as 3D point classification.

cs.AI↗

arXiv2025

Local Information Matters: Inference Acceleration For Grounded Conversation Generation Models Through Adaptive Local-Aware Token Pruning

Grounded Conversation Generation (GCG) is an emerging vision-language task that requires models to generate natural language responses seamlessly intertwined with corresponding object segmentation masks. Recent models, such as GLaMM and OMG-LLaVA, achieve pixel-level grounding but incur significant computational costs due to processing a large number of visual tokens. Existing token pruning methods, like FastV and PyramidDrop, fail to preserve the local visual features critical for accurate grounding, leading to substantial performance drops in GCG tasks. To address this, we propose Adaptive Local-Aware Token Pruning (ALTP), a simple yet effective framework that accelerates GCG models by prioritizing local object information. ALTP introduces two key components: (1) Detail Density Capture (DDC), which uses superpixel segmentation to retain tokens in object-centric regions, preserving fine-grained details, and (2) Dynamic Density Formation (DDF), which dynamically allocates tokens based on information density, ensuring higher retention in semantically rich areas. Extensive experiments on the GranDf dataset demonstrate that ALTP significantly outperforms existing token pruning methods, such as FastV and PyramidDrop, on both GLaMM and OMG-LLaVA models. Notably, when applied to GLaMM, ALTP achieves a 90% reduction in visual tokens with a 4.9% improvement in AP50 and a 5.0% improvement in Recall compared to PyramidDrop. Similarly, on OMG-LLaVA, ALTP improves AP by 2.1% and mIOU by 3.0% at a 90% token reduction compared with PDrop.

cs.CV↗

arXiv2025

Consistency-aware Self-Training for Iterative-based Stereo Matching

Iterative-based methods have become mainstream in stereo matching due to their high performance. However, these methods heavily rely on labeled data and face challenges with unlabeled real-world data. To this end, we propose a consistency-aware self-training framework for iterative-based stereo matching for the first time, leveraging real-world unlabeled data in a teacher-student manner. We first observe that regions with larger errors tend to exhibit more pronounced oscillation characteristics during model prediction.Based on this, we introduce a novel consistency-aware soft filtering module to evaluate the reliability of teacher-predicted pseudo-labels, which consists of a multi-resolution prediction consistency filter and an iterative prediction consistency filter to assess the prediction fluctuations of multiple resolutions and iterative optimization respectively. Further, we introduce a consistency-aware soft-weighted loss to adjust the weight of pseudo-labels accordingly, relieving the error accumulation and performance degradation problem due to incorrect pseudo-labels. Extensive experiments demonstrate that our method can improve the performance of various iterative-based stereo matching approaches in various scenarios. In particular, our method can achieve further enhancements over the current SOTA methods on several benchmark datasets.

cs.CV↗

arXiv2025

Semi-supervised Semantic Segmentation with Multi-Constraint Consistency Learning

Consistency regularization has prevailed in semi-supervised semantic segmentation and achieved promising performance. However, existing methods typically concentrate on enhancing the Image-augmentation based Prediction consistency and optimizing the segmentation network as a whole, resulting in insufficient utilization of potential supervisory information. In this paper, we propose a Multi-Constraint Consistency Learning (MCCL) approach to facilitate the staged enhancement of the encoder and decoder. Specifically, we first design a feature knowledge alignment (FKA) strategy to promote the feature consistency learning of the encoder from image-augmentation. Our FKA encourages the encoder to derive consistent features for strongly and weakly augmented views from the perspectives of point-to-point alignment and prototype-based intra-class compactness. Moreover, we propose a self-adaptive intervention (SAI) module to increase the discrepancy of aligned intermediate feature representations, promoting Feature-perturbation based Prediction consistency learning. Self-adaptive feature masking and noise injection are designed in an instance-specific manner to perturb the features for robust learning of the decoder. Experimental results on Pascal VOC2012 and Cityscapes datasets demonstrate that our proposed MCCL achieves new state-of-the-art performance. The source code and models are made available at https://github.com/NUST-Machine-Intelligence-Laboratory/MCCL.

cs.MM↗

arXiv2025

Seeing What Matters: Empowering CLIP with Patch Generation-to-Selection

The CLIP model has demonstrated significant advancements in aligning visual and language modalities through large-scale pre-training on image-text pairs, enabling strong zero-shot classification and retrieval capabilities on various domains. However, CLIP's training remains computationally intensive, with high demands on both data processing and memory. To address these challenges, recent masking strategies have emerged, focusing on the selective removal of image patches to improve training efficiency. Although effective, these methods often compromise key semantic information, resulting in suboptimal alignment between visual features and text descriptions. In this work, we present a concise yet effective approach called Patch Generation-to-Selection to enhance CLIP's training efficiency while preserving critical semantic content. Our method introduces a gradual masking process in which a small set of candidate patches is first pre-selected as potential mask regions. Then, we apply Sobel edge detection across the entire image to generate an edge mask that prioritizes the retention of the primary object areas. Finally, similarity scores between the candidate mask patches and their neighboring patches are computed, with optimal transport normalization refining the selection process to ensure a balanced similarity matrix. Our approach, CLIP-PGS, sets new state-of-the-art results in zero-shot classification and retrieval tasks, achieving superior performance in robustness evaluation and language compositionality benchmarks.

cs.CV↗

arXiv2025

FAVOR-Bench: A Comprehensive Benchmark for Fine-Grained Video Motion Understanding

Multimodal Large Language Models (MLLMs) have shown remarkable capabilities in video content understanding but still struggle with fine-grained motion comprehension. To comprehensively assess the motion understanding ability of existing MLLMs, we introduce FAVOR-Bench, comprising 1,776 videos with structured manual annotations of various motions. Our benchmark includes both close-ended and open-ended tasks. For close-ended evaluation, we carefully design 8,184 multiple-choice question-answer pairs spanning six distinct sub-tasks. For open-ended evaluation, we develop both a novel cost-efficient LLM-free and a GPT-assisted caption assessment method, where the former can enhance benchmarking interpretability and reproducibility. Comprehensive experiments with 21 state-of-the-art MLLMs reveal significant limitations in their ability to comprehend and describe detailed temporal dynamics in video motions. To alleviate this limitation, we further build FAVOR-Train, a dataset consisting of 17,152 videos with fine-grained motion annotations. The results of finetuning Qwen2.5-VL on FAVOR-Train yield consistent improvements on motion-related tasks of TVBench, MotionBench and our FAVOR-Bench. Comprehensive assessment results demonstrate that the proposed FAVOR-Bench and FAVOR-Train provide valuable tools to the community for developing more powerful video understanding models. Project page: \href{https://favor-bench.github.io/}{https://favor-bench.github.io/}.

cs.CV↗

arXiv2025

TokenCarve: Information-Preserving Visual Token Compression in Multimodal Large Language Models

Multimodal Large Language Models (MLLMs) are becoming increasingly popular, while the high computational cost associated with multimodal data input, particularly from visual tokens, poses a significant challenge. Existing training-based token compression methods improve inference efficiency but require costly retraining, while training-free methods struggle to maintain performance when aggressively reducing token counts. In this study, we reveal that the performance degradation of MLLM closely correlates with the accelerated loss of information in the attention output matrix. This insight introduces a novel information-preserving perspective, making it possible to maintain performance even under extreme token compression. Based on this finding, we propose TokenCarve, a training-free, plug-and-play, two-stage token compression framework. The first stage employs an Information-Preservation-Guided Selection (IPGS) strategy to prune low-information tokens, while the second stage further leverages IPGS to guide token merging, minimizing information loss. Extensive experiments on 11 datasets and 2 model variants demonstrate the effectiveness of TokenCarve. It can even reduce the number of visual tokens to 22.2% of the original count, achieving a 1.23x speedup in inference, a 64% reduction in KV cache storage, and only a 1.54% drop in accuracy. Our code is available at https://github.com/ShawnTan86/TokenCarve.

cs.CV↗

arXiv2025

Attention Reallocation: Towards Zero-cost and Controllable Hallucination Mitigation of MLLMs

Multi-Modal Large Language Models (MLLMs) stand out in various tasks but still struggle with hallucinations. While recent training-free mitigation methods mostly introduce additional inference overhead via retrospection strategy and contrastive decoding, we propose attention reallocation (AttnReal) to mitigate hallucinations with nearly zero extra cost. Our approach is motivated by the key observations that, MLLM's unreasonable attention distribution causes features to be dominated by historical output tokens, which further contributes to hallucinated responses because of the distribution gap between different token types. Based on the observations, AttnReal recycles excessive attention from output tokens and reallocates it to visual tokens, which reduces MLLM's reliance on language priors and ensures the decoding process depends more on the visual inputs. More interestingly, we find that, by controlling the intensity of AttnReal, we can achieve a wide-range trade-off between the response faithfulness and overall performance. Comprehensive results from different benchmarks validate the effectiveness of AttnReal across six open-source MLLMs and three decoding strategies.

cs.CV↗

arXiv2025

Seeing Delta Parameters as JPEG Images: Data-Free Delta Compression with Discrete Cosine Transform

With transformer-based models and the pretrain-finetune paradigm becoming mainstream, the high storage and deployment costs of individual finetuned models on multiple tasks pose critical challenges. Delta compression attempts to lower the costs by reducing the redundancy of delta parameters (i.e., the difference between the finetuned and pre-trained model weights). However, existing methods usually face problems including data accessibility and training requirements. To tackle this issue, we introduce Delta-DCT, the first data-free delta compression method inspired by classic JPEG image compression, leveraging the Discrete Cosine Transform (DCT). We first (a) group delta parameters within a layer into patches. Then we (b) assess the importance of each patch and allocate them with different quantization bit-widths. Afterwards, we (c) convert these patches to the DCT domain and conduct quantization to each patch based on the allocated bit-width. The proposed Delta-DCT does not require any training or data calibration, while achieving performance comparable to or even surpassing original finetuned models under 1-bit equivalent delta compression ratios on different kinds of models including: (1) recently-released LLMs of different sizes from 7B to 13B, (2) relatively smaller language models including RoBERTa and T5 models, (3) variants of vision transformer models, and (4) multi-modal BEiT-3 models.

cs.CV↗

arXiv2025

Correction-to-scaling exponent for percolation and the Fortuin--Kasteleyn Potts model in two dimensions

The number $n_s$ of clusters (per site) of size $s$, a central quantity in percolation theory, displays at criticality an algebraic scaling behavior of the form $n_s\simeq s^{-τ}\, A\, (1+B s^{-Ω})$. For the Fortuin--Kasteleyn representation of the $Q$-state Potts model in two dimensions, the Fisher exponent $τ$ is known as a function of the real parameter $0\le Q\le4$, and, for bond percolation (the $Q\rightarrow 1$ limit), the correction-to-scaling exponent is derived as $Ω=72/91$. We theoretically derive the exact formula for the correction-to-scaling exponent $Ω=8/[(2g+1)(2g+3)]$ as a function of the Coulomb-gas coupling strength $g$, which is related to $Q$ by $Q=2+2\cos(2 πg)$. Using an efficient Monte Carlo cluster algorithm, we study the O($n$) loop model on the hexagonal lattice, which is in the same universality class as the $Q=n^2$ Potts model, and has significantly suppressed finite-size corrections and critical slowing-down. The predictions of the above formula include the exact value for percolation as a special case and agree well with the numerical estimates of $Ω$ for both the critical and tricritical branches of the Potts model.

cond-mat.stat-mech↗

arXiv2025

DeRS: Towards Extremely Efficient Upcycled Mixture-of-Experts Models

Upcycled Mixture-of-Experts (MoE) models have shown great potential in various tasks by converting the original Feed-Forward Network (FFN) layers in pre-trained dense models into MoE layers. However, these models still suffer from significant parameter inefficiency due to the introduction of multiple experts. In this work, we propose a novel DeRS (Decompose, Replace, and Synthesis) paradigm to overcome this shortcoming, which is motivated by our observations about the unique redundancy mechanisms of upcycled MoE experts. Specifically, DeRS decomposes the experts into one expert-shared base weight and multiple expert-specific delta weights, and subsequently represents these delta weights in lightweight forms. Our proposed DeRS paradigm can be applied to enhance parameter efficiency in two different scenarios, including: 1) DeRS Compression for inference stage, using sparsification or quantization to compress vanilla upcycled MoE models; and 2) DeRS Upcycling for training stage, employing lightweight sparse or low-rank matrixes to efficiently upcycle dense models into MoE models. Extensive experiments across three different tasks show that the proposed methods can achieve extreme parameter efficiency while maintaining the performance for both training and compression of upcycled MoE models.

cs.LG↗

arXiv2025

A comprehensive review on developments of synthetic dimensions

The concept of synthetic dimensions has emerged as a powerful framework in photonics and atomic physics, enabling the exploration of high-dimensional physics beyond conventional spatial constraints. Originally developed for quantum simulations in high dimensions, synthetic dimensions have since demonstrated advantages in designing novel Hamiltonians and manipulating quantum or optical states for exploring topological physics, and for applications in computing and information processing. Here we provide a comprehensive overview of progress in synthetic dimensions across photonic, atomic, and other physical platforms over the past decade. We showcase different approaches used to construct synthetic dimensions and highlight key physical phenomena enabled by the advantage of such a framework. By offering a unified perspective on developments in this field, we aim to provide insights into how synthetic dimensions can bridge fundamental physics and applied technologies, fostering interdisciplinary engagement in quantum simulation, atomic and photonic engineering, and information processing.

physics.optics↗

arXiv2025

Autoregressive Medical Image Segmentation via Next-Scale Mask Prediction

While deep learning has significantly advanced medical image segmentation, most existing methods still struggle with handling complex anatomical regions. Cascaded or deep supervision-based approaches attempt to address this challenge through multi-scale feature learning but fail to establish sufficient inter-scale dependencies, as each scale relies solely on the features of the immediate predecessor. To this end, we propose the AutoRegressive Segmentation framework via next-scale mask prediction, termed AR-Seg, which progressively predicts the next-scale mask by explicitly modeling dependencies across all previous scales within a unified architecture. AR-Seg introduces three innovations: (1) a multi-scale mask autoencoder that quantizes the mask into multi-scale token maps to capture hierarchical anatomical structures, (2) a next-scale autoregressive mechanism that progressively predicts next-scale masks to enable sufficient inter-scale dependencies, and (3) a consensus-aggregation strategy that combines multiple sampled results to generate a more accurate mask, further improving segmentation robustness. Extensive experimental results on two benchmark datasets with different modalities demonstrate that AR-Seg outperforms state-of-the-art methods while explicitly visualizing the intermediate coarse-to-fine segmentation process.

eess.IV↗

arXiv2025

BadRefSR: Backdoor Attacks Against Reference-based Image Super Resolution

Reference-based image super-resolution (RefSR) represents a promising advancement in super-resolution (SR). In contrast to single-image super-resolution (SISR), RefSR leverages an additional reference image to help recover high-frequency details, yet its vulnerability to backdoor attacks has not been explored. To fill this research gap, we propose a novel attack framework called BadRefSR, which embeds backdoors in the RefSR model by adding triggers to the reference images and training with a mixed loss function. Extensive experiments across various backdoor attack settings demonstrate the effectiveness of BadRefSR. The compromised RefSR network performs normally on clean input images, while outputting attacker-specified target images on triggered input images. Our study aims to alert researchers to the potential backdoor risks in RefSR. Codes are available at https://github.com/xuefusiji/BadRefSR.

cs.CV↗

arXiv2025

Error-mitigated Geometric Quantum Control over an Oscillator

Quantum information is very fragile to environmentally and operationally induced imperfections. Therefore, the construction of practical quantum computers requires quantum error-correction techniques to protect quantum information. In particular, encoding a logical qubit into the large Hilbert space of an oscillator is a hardware-efficient way of correcting quantum errors. In this strategy, selective number-dependent arbitrary phase (SNAP) gates are vital for universal quantum control. However, the quality of SNAP gates is considerably limited by the small coupling-induced nonlinearity of the oscillator. Here, to resolve this limitation, we propose a robust scheme based on quantum optimal control via functional theory, by designing an appropriate trajectory for a target operation. Besides, we combine the geometric phase approach with our trajectory design scheme to minimize the decoherence effect, by shortening the gate time. Numerical simulation shows that both errors can be significantly mitigated and that the robustness of the geometric gate against both $X$ and $Z$ errors can be maintained. Therefore, our scheme provides a promising alternative for fault-tolerant quantum computation.

quant-ph↗