SearcharxivSearch

arXiv subjects

Li Cao

Publications and source records attributed to Li Cao.

16 recordsLinked to original sources

BenchEvolver: Frontier Task Synthesis via Solution-Centric Evolution

The rapid progress of frontier large language models has led to widespread benchmark saturation, limiting the ability of existing datasets to differentiate model capabilities or provide useful training signal. For instance, on LiveCodeBench, frontier models achieve over 99% Pass@1 on easy splits and exceed 90% Pass@1 on average across difficulty levels. Constructing new, challenging datasets typically requires substantial human effort, creating a bottleneck for progress. We introduce BenchEvolver, a solution-centric evolutionary framework that automatically transforms existing coding problems into harder variants. Rather than generating problems from scratch, BenchEvolver evolves reference solutions through structured transformations and derives corresponding statements and tests from the evolved solutions. This design grounds generation in executable semantics, enabling scalable construction of high-quality, diverse, and difficult tasks with verifiable correctness. Applying BenchEvolver to LiveCodeBench and SciCode, we obtain evolved tasks that are substantially harder while maintaining validity, reference correctness, and diversity. We further curate LiveCodeBench-Plus, a 91-problem benchmark combining evolved and difficult original LCB-v6 tasks, where frontier-model Pass@1 ranges from 27.5% to 62.6%, restoring clear discrimination among strong coding models. Importantly, evolved tasks remain challenging even for the model that generates them, enabling self-improvement. We further show that RL on evolved LCB tasks improves held-out coding performance: for gpt-oss-20b, seed+evolved training achieves +8.7 and +8.3 Pass@1 gains on LCB v6 Hard and LCB-Pro Easy, exceeding seed-only gains by 70.7% and 34.8%, respectively. Our results show that BenchEvolver can convert saturated benchmarks into frontier-level evaluation suites and reusable training signal.

cs.SE

AdaReTaKe: Adaptive Redundancy Reduction to Perceive Longer for Video-language Understanding

Multimodal Large Language Models (MLLMs) have revolutionized video understanding, yet are still limited by context length when processing long videos. Recent methods compress videos by leveraging visual redundancy uniformly, yielding promising results. Nevertheless, our quantitative analysis shows that redundancy varies significantly across time and model layers, necessitating a more flexible compression strategy. We propose AdaReTaKe, a training-free method that flexibly reduces visual redundancy by allocating compression ratios among time and layers with theoretical guarantees. Integrated into state-of-the-art MLLMs, AdaReTaKe improves processing capacity from 256 to 2048 frames while preserving critical information. Experiments on VideoMME, MLVU, LongVideoBench, and LVBench datasets demonstrate that AdaReTaKe outperforms existing methods by 2.3% and 2.8% for 7B and 72B models, respectively, with even greater improvements of 5.9% and 6.0% on the longest LVBench. Our code is available at https://github.com/SCZwangxiao/video-FlexReduc.git.

cs.CV

ReTaKe: Reducing Temporal and Knowledge Redundancy for Long Video Understanding

Video Large Language Models (VideoLLMs) have made significant strides in video understanding but struggle with long videos due to the limitations of their backbone LLMs. Existing solutions rely on length extrapolation, which is memory-constrained, or visual token compression, which primarily leverages low-level temporal redundancy while overlooking the more effective high-level knowledge redundancy. To address this, we propose $\textbf{ReTaKe}$, a training-free method with two novel modules DPSelect and PivotKV, to jointly reduce both temporal visual redundancy and knowledge redundancy for video compression. To align with the way of human temporal perception, DPSelect identifies keyframes based on inter-frame distance peaks. To leverage LLMs' learned prior knowledge, PivotKV marks the keyframes as pivots and compress non-pivot frames by pruning low-attention tokens in their KV cache. ReTaKe enables VideoLLMs to process 8 times longer frames (up to 2048), outperforming similar-sized models by 3-5% and even rivaling much larger ones on VideoMME, MLVU, LongVideoBench, and LVBench. Moreover, by overlapping compression operations with prefilling, ReTaKe introduces only ~10% prefilling latency overhead while reducing decoding latency by ~20%. Our code is available at https://github.com/SCZwangxiao/video-ReTaKe.

cs.CV

Controlling the Latent Diffusion Model for Generative Image Shadow Removal via Residual Generation

Large-scale generative models have achieved remarkable advancements in various visual tasks, yet their application to shadow removal in images remains challenging. These models often generate diverse, realistic details without adequate focus on fidelity, failing to meet the crucial requirements of shadow removal, which necessitates precise preservation of image content. In contrast to prior approaches that aimed to regenerate shadow-free images from scratch, this paper utilizes diffusion models to generate and refine image residuals. This strategy fully uses the inherent detailed information within shadowed images, resulting in a more efficient and faithful reconstruction of shadow-free content. Additionally, to revent the accumulation of errors during the generation process, a crosstimestep self-enhancement training strategy is proposed. This strategy leverages the network itself to augment the training data, not only increasing the volume of data but also enabling the network to dynamically correct its generation trajectory, ensuring a more accurate and robust output. In addition, to address the loss of original details in the process of image encoding and decoding of large generative models, a content-preserved encoder-decoder structure is designed with a control mechanism and multi-scale skip connections to achieve high-fidelity shadow-free image reconstruction. Experimental results demonstrate that the proposed method can reproduce high-quality results based on a large latent diffusion prior and faithfully preserve the original contents in shadow regions.

cs.CV

Multi-scale Restoration of Missing Data in Optical Time-series Images with Masked Spatial-Temporal Attention Network

Remote sensing images often suffer from substantial data loss due to factors such as thick cloud cover and sensor limitations. Existing methods for imputing missing values in remote sensing images fail to fully exploit spatiotemporal auxiliary information, which restricts the accuracy of their reconstructions. To address this issue, this paper proposes a novel deep learning-based approach called MS2TAN (Multi-Scale Masked Spatial-Temporal Attention Network) for reconstructing time-series remote sensing images. First, we introduce an efficient spatiotemporal feature extractor based on Masked Spatial-Temporal Attention (MSTA) to capture high-quality representations of spatiotemporal neighborhood features surrounding missing regions while significantly reducing the computational complexity of the attention mechanism. Second, a Multi-Scale Restoration Network composed of MSTA-based Feature Extractors is designed to progressively refine missing values by exploring spatiotemporal neighborhood features at different scales. Third, we propose a "Pixel-Structure-Perception" Multi-Objective Joint Optimization method to enhance the visual quality of the reconstructed results from multiple perspectives and to preserve more texture structures. Finally, quantitative experimental results under multi-temporal inputs on two public datasets demonstrate that the proposed method outperforms competitive approaches, achieving a 9.76%/9.30% reduction in Mean Absolute Error (MAE) and a 0.56 dB/0.62 dB increase in Peak Signal-to-Noise Ratio (PSNR), along with stronger texture and structural consistency. Ablation experiments further validate the contribution of the core innovations to imputation accuracy.

cs.CV

Unsupervised convolutional neural network fusion approach for change detection in remote sensing images

With the rapid development of deep learning, a variety of change detection methods based on deep learning have emerged in recent years. However, these methods usually require a large number of training samples to train the network model, so it is very expensive. In this paper, we introduce a completely unsupervised shallow convolutional neural network (USCNN) fusion approach for change detection. Firstly, the bi-temporal images are transformed into different feature spaces by using convolution kernels of different sizes to extract multi-scale information of the images. Secondly, the output features of bi-temporal images at the same convolution kernels are subtracted to obtain the corresponding difference images, and the difference feature images at the same scale are fused into one feature image by using 1 * 1 convolution layer. Finally, the output features of different scales are concatenated and a 1 * 1 convolution layer is used to fuse the multi-scale information of the image. The model parameters are obtained by a redesigned sparse function. Our model has three features: the entire training process is conducted in an unsupervised manner, the network architecture is shallow, and the objective function is sparse. Thus, it can be seen as a kind of lightweight network model. Experimental results on four real remote sensing datasets indicate the feasibility and effectiveness of the proposed approach.

cs.CV

LWS: A Framework for Log-based Workload Simulation in Session-based SUT

Artificial intelligence for IT Operations (AIOps) plays a critical role in operating and managing cloud-native systems and microservice-based applications but is limited by the lack of high-quality datasets with diverse scenarios. Realistic workloads are the premise and basis of generating such AIOps datasets, with the session-based workload being one of the most typical examples. Due to privacy concerns, complexity, variety, and requirements for reasonable intervention, it is difficult to copy or generate such workloads directly, showing the importance of effective and intervenable workload simulation. In this paper, we formulate the task of workload simulation and propose a framework for Log-based Workload Simulation (LWS) in session-based systems. LWS extracts the workload specification including the user behavior abstraction based on agglomerative clustering as well as relational models and the intervenable workload intensity from session logs. Then LWS combines the user behavior abstraction with the workload intensity to generate simulated workloads. The experimental evaluation is performed on an open-source cloud-native application with both well-designed and public real-world workloads, showing that the simulated workload generated by LWS is effective and intervenable, which provides the foundation of generating high-quality AIOps datasets.

cs.SE

Actionable and Interpretable Fault Localization for Recurring Failures in Online Service Systems

Fault localization is challenging in an online service system due to its monitoring data's large volume and variety and complex dependencies across or within its components (e.g., services or databases). Furthermore, engineers require fault localization solutions to be actionable and interpretable, which existing research approaches cannot satisfy. Therefore, the common industry practice is that, for a specific online service system, its experienced engineers focus on localization for recurring failures based on the knowledge accumulated about the system and historical failures. Although the above common practice is actionable and interpretable, it is largely manual, thus slow and sometimes inaccurate. In this paper, we aim to automate this practice through machine learning. That is, we propose an actionable and interpretable fault localization approach, DejaVu, for recurring failures in online service systems. For a specific online service system, DejaVu takes historical failures and dependencies in the system as input and trains a localization model offline; for an incoming failure, the trained model online recommends where the failure occurs (i.e., the faulty components) and which kind of failure occurs (i.e., the indicative group of metrics) (thus actionable), which are further interpreted by both global and local interpretation methods (thus interpretable). Based on the evaluation on 601 failures from three production systems and one open-source benchmark, in less than one second, DejaVu can on average rank the ground truths at 1.66-th to 5.03-th among a long candidate list, outperforming baselines by at least 51.51%.

cs.SE

The analysis of effective galaxies number count for Chinese Space Station Optical Survey(CSS-OS) by image simulation

The Chinese Space Station Optical Survey (CSS-OS) is a mission to explore the vast universe. This mission will equip a 2-meter space telescope to perform a multi-band NUV-optical large area survey (over 40% of the sky) and deep survey (~1% of the sky) for the cosmological and astronomical goals. Galaxy detection is one of the most important methods to achieve scientific goals. In this paper, we evaluate the galaxy number density for CSS-OS in i band (depth, i ~26 for large area survey and ~27 for the deep survey, point source, 5-sigma by the method of image simulation. We also compare galaxies detected by CSS-OS with that of LSST (i~27, point source, 5-sigma. In our simulation, the HUDF galaxy catalogs are used to create mock images due to long enough integration time which meets the completeness requirements of the galaxy analysis for CSS-OS and LSST. The galaxy surface profile and spectrum are produced by the morphological information, photometric redshift and SEDs from the catalogs. The instrumental features and the environmental condition are also considered to produce the mock galaxy images. The galaxies of CSS-OS and LSST are both extracted by SExtractor from the mock i band image and matched with the original catalog. Through the analysis of the extracted galaxies, we find that the effective galaxy number count is ~13 arcmin^-2, ~40 arcmin^-2 and ~42 arcmin^-2 for CSS-OS large area survey, CSS-OS deep survey and LSST, respectively. Moreover, CSS-OS shows the advantage in small galaxy detection with high spatial resolution, especially for the deep survey: about 20% of the galaxies detected by CSS-OS deep survey are not detected by LSST, and they have a small effective radius of re < 0.3".

astro-ph.IM

Testing photometric redshift measurements with filter definition of the Chinese Space Station Optical Survey (CSS-OS)

The Chinese Space Station Optical Survey (CSS-OS) is a major science project of the Space Application System of the China Manned Space Program. This survey is planned to perform both photometric imaging and slitless spectroscopic observations, and it will focus on different cosmological and astronomical goals. Most of these goals are tightly dependent on the accuracy of photometric redshift (photo-z) measurement, especially for the weak gravitational lensing survey as a main science driver. In this work, we assess if the current filter definition can provide accurate photo-z measurement to meet the science requirement. We use the COSMOS galaxy catalog to create a mock catalog for the CSS-OS. We compare different photo-z codes and fitting methods that using the spectral energy distribution (SED) template-fitting technique, and choose to use a modified LePhare code in photo-z fitting process. Then we investigate the CSS-OS photo-z accuracy in certain ranges of filter parameters, such as band position, width, and slope. We find that the current CSS-OS filter definition can achieve reasonably good photo-z results with sigma_z~0.02 and outlier fraction ~3%.

astro-ph.IM

Intrapixel effects of CCD and CMOS detectors

Intrapixel nonuniformity is known to exist in CCD and CMOS image sensors, though the effects in backside illuminated (BSI) CCDs are too small to be a concern for most astronomical observations. However, projects like the Large Synoptic Survey Telescope require precise knowledge of the detector characteristics, and intrapixel effects may need more attention. By scanning CCD and CMOS cameras with a small light spot (unresolved by the optics), we find in the images that the spot's flux, centroid displacement, and ellipticity vary periodically on the pixel scale in most cases. The amplitude of variation depends on not only the detector but also how well the spot is sampled by the pixels. With a spot radius of 2 pixels (encircling 80% energy) as measured, the flux and the ellipticity extracted from the BSI CCD camera vary by 0.2-0.3% (rms) and 0.005 (rms), respectively, while the deviation of the centroid position (rms ~ 0.01 pixel) is not correlated with the pixels. The effects are more pronounced for the BSI CMOS camera and even worse for the frontside illuminated CMOS camera. The results suggest that a closer examination of the intrapixel effects is needed for precision astronomy.

astro-ph.IM

Superpixel Segmentation Using Gaussian Mixture Model

Superpixel segmentation algorithms are to partition an image into perceptually coherence atomic regions by assigning every pixel a superpixel label. Those algorithms have been wildly used as a preprocessing step in computer vision works, as they can enormously reduce the number of entries of subsequent algorithms. In this work, we propose an alternative superpixel segmentation method based on Gaussian mixture model (GMM) by assuming that each superpixel corresponds to a Gaussian distribution, and assuming that each pixel is generated by first randomly choosing one distribution from several Gaussian distributions which are defined to be related to that pixel, and then the pixel is drawn from the selected distribution. Based on this assumption, each pixel is supposed to be drawn from a mixture of Gaussian distributions with unknown parameters (GMM). An algorithm based on expectation-maximization method is applied to estimate the unknown parameters. Once the unknown parameters are obtained, the superpixel label of a pixel is determined by a posterior probability. The success of applying GMM to superpixel segmentation depends on the two major differences between the traditional GMM-based clustering and the proposed one: data points in our model may be non-identically distributed, and we present an approach to control the shape of the estimated Gaussian functions by adjusting their covariance matrices. Our method is of linear complexity with respect to the number of pixels. The proposed algorithm is inherently parallel and can get faster speed by adding simple OpenMP directives to our implementation. According to our experiments, our algorithm outperforms the state-of-the-art superpixel algorithms in accuracy and presents a competitive performance in computational efficiency.

cs.CV

NUV Star Catalogue from the Lunar-based Ultraviolet Telescope Survey. First Release

We present a star catalogue extracted from the Lunar-based Ultraviolet Telescope (LUT) survey program. LUT's observable sky area is a circular belt around the Moon's north pole, and the survey program covers a preferred area for about 2400 deg$^2$ which includes a region of the Galactic plane. The data is processed with an automatic pipeline which copes with stray light contamination, artificial sources, cosmic rays, flat field calibration, photometry and so on. In the first release version, the catalogue provides high confidence sources which have been cross-identified with Tycho-2 catalogue. All the sources have signal-to-noise ratio larger than 5, and the corresponding magnitude limit is typically 14.4 mag, which can be deeper as ~16 mag if the stray light contamination is in the lowest level. A total number of 86,467 stars are recorded in the catalogue. The full catalogue in electronic form is available on line.

astro-ph.IM

Data Processing Pipeline for Pointing Observations of Lunar-based Ultraviolet Telescope

We describe the data processing pipeline developed to reduce the pointing observation data of Lunar-based Ultraviolet Telescope (LUT), which belongs to the Chang'e-3 mission of the Chinese Lunar Exploration Program. The pointing observation program of LUT is dedicated to monitor variable objects in a near-ultraviolet (245-345 nm) band. LUT works in lunar daytime for sufficient power supply, so some special data processing strategies have been developed for the pipeline. The procedures of the pipeline include stray light removing, astrometry, flat fielding employing superflat technique, source extraction and cosmic rays rejection, aperture and PSF photometry, aperture correction, and catalogues archiving, etc. It has been intensively tested and works smoothly with observation data. The photometric accuracy is typically ~0.02 mag for LUT 10 mag stars (30 s exposure), with errors come from background noises, residuals of stray light removing, and flat fielding related errors. The accuracy degrades to be ~0.2 mag for stars of 13.5 mag which is the 5σ detection limit of LUT.

astro-ph.IM

WKB Wave Functions with the Induced Gravity Theory

The Wheeler-DeWitt equation for the induced gravity theory is constructed in the minisuperspace approximation, and then solved using the WKB method under three types of boundary condition proposed respectively by Hartle & Hawking (``no boundary''), Linde and Vilenkin (``tunneling from nothing''). It is found that no matter how the gravitational and cosmological ``constants'' vary in the classical models, they will acquire constant values when the universe comes from quantum creation, and that, in particular, the resulting tunneling wave function under the Linde or Vilenkin boundary condition reaches its maximum value if the cosmological constant vanishes.

gr-qc

EGRET gamma-ray source 2EG J0809+5117, a quasar with redshift of 1.14?

The low dispersion (400$Å$/mm) spectrum of the optical counterpart of a flat-spectrum radio source 87GB 080315.5+512613, which is one of two possible radio counterparts of 2EG J0809+5117, was obtained recently. The optical counterpart, which is $2.02''$ away from 87GB 080315.5+512613 and $19.3'$ away from 2EG J0809+5117, was identified as a quasar with redshift of 1.14. We noted that Mattox et al. (1997) suggested the other radio counterpart 87GB 080459.4+495915 (OJ 508), which is $87.1'$ away from 2EG J0809+5117, is the more potential identification, though it was previously suggested to be the identification (with low confidence) of another nearby EGRET source 2EG J0807+4849. Our observation suggests that it is quite possible that 87GB 080315.5+512613 is the identification of 2EG J0809+5117 rather than 87GB 080459.4+495915. But we still can not exclude the possibility of 87GB 080459.4+495915 at present. Moreover, in order to determine whether or not 87GB 080315.5+512613 is a blazar type quasar, the optical polarization and variability measures of its optical counterpart are strongly encouraged.

astro-ph