Arrow Research search

Author name cluster

Qian Cao

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

7 papers
2 author rows

Possible papers

7

NeurIPS Conference 2025 Conference Paper

LocDiff: Identifying Locations on Earth by Diffusing in the Hilbert Space

  • Zhangyu Wang
  • Zeping Liu
  • Jielu Zhang
  • Zhongliang Zhou
  • Qian Cao
  • Nemin Wu
  • Lan Mu
  • Yang Song

Image geolocalization is a fundamental yet challenging task, aiming at inferring the geolocation on Earth where an image is taken. State-of-the-art methods employ either grid-based classification or gallery-based image-location retrieval, whose spatial generalizability significantly suffers if the spatial distribution of test images does not align with the choices of grids and galleries. Recently emerging generative approaches, while getting rid of grids and galleries, use raw geographical coordinates and suffer quality losses due to their lack of multi-scale information. To address these limitations, we propose a multi-scale latent diffusion model called LocDiff for image geolocalization. We developed a novel positional encoding-decoding framework called Spherical Harmonics Dirac Delta (SHDD) Representations, which encodes points on a spherical surface (e. g. , geolocations on Earth) into a Hilbert space of Spherical Harmonics coefficients and decodes points (geolocations) by mode-seeking on spherical probability distributions. We also propose a novel SirenNet-based architecture (CS-UNet) to learn an image-based conditional backward process in the latent SHDD space by minimizing a latent KL-divergence loss. To the best of our knowledge, LocDiff is the first image geolocalization model that performs latent diffusion in a multi-scale location encoding space and generates geolocations under the guidance of images. Experimental results show that LocDiff can outperform all state-of-the-art grid-based, retrieval-based, and diffusion-based baselines across 5 challenging global-scale image geolocalization datasets, and demonstrates significantly stronger generalizability to unseen geolocations.

NeurIPS Conference 2024 Conference Paper

TorchSpatial: A Location Encoding Framework and Benchmark for Spatial Representation Learning

  • Nemin Wu
  • Qian Cao
  • Zhangyu Wang
  • Zeping Liu
  • Yanlin Qi
  • Jielu Zhang
  • Joshua Ni
  • Xiaobai Yao

Spatial representation learning (SRL) aims at learning general-purpose neural network representations from various types of spatial data (e. g. , points, polylines, polygons, networks, images, etc. ) in their native formats. Learning good spatial representations is a fundamental problem for various downstream applications such as species distribution modeling, weather forecasting, trajectory generation, geographic question answering, etc. Even though SRL has become the foundation of almost all geospatial artificial intelligence (GeoAI) research, we have not yet seen significant efforts to develop an extensive deep learning framework and benchmark to support SRL model development and evaluation. To fill this gap, we propose TorchSpatial, a learning framework and benchmark for location (point) encoding, which is one of the most fundamental data types of spatial representation learning. TorchSpatial contains three key components: 1) a unified location encoding framework that consolidates 15 commonly recognized location encoders, ensuring scalability and reproducibility of the implementations; 2) the LocBench benchmark tasks encompassing 7 geo-aware image classification and 10 geo-aware imageregression datasets; 3) a comprehensive suite of evaluation metrics to quantify geo-aware models’ overall performance as well as their geographic bias, with a novel Geo-Bias Score metric. Finally, we provide a detailed analysis and insights into the model performance and geographic bias of different location encoders. We believe TorchSpatial will foster future advancement of spatial representationlearning and spatial fairness in GeoAI research. The TorchSpatial model framework and LocBench benchmark are available at https: //github. com/seai-lab/TorchSpatial, and the Geo-Bias Score evaluation framework is available at https: //github. com/seai-lab/PyGBS.

ECAI Conference 2020 Conference Paper

Learning to Reuse Translations: Guiding Neural Machine Translation with Examples

  • Qian Cao
  • Shaohui Kuang
  • Deyi Xiong

In this paper, we study the problem of enabling neural machine translation (NMT) to reuse previous translations from similar examples in target prediction. Distinguishing reusable translations from noisy segments and learning to reuse them in NMT are non-trivial. To solve these challenges, we propose an Example-Guided NMT (EGNMT) framework with two models: (1) a noise-masked encoder model that masks out noisy words according to word alignments and encodes the noise-masked sentences with an additional example encoder and (2) an auxiliary decoder model that predicts reusable words via an auxiliary decoder sharing parameters with the primary decoder. We define and implement the two models with the state-of-the-art Transformer. Experiments show that the noisemasked encoder model allows NMT to learn useful information from examples with low fuzzy match scores (FMS) while the auxiliary decoder model is good for high-FMS examples. More experiments on Chinese-English, English-German and English-Spanish translation demonstrate that the combination of the two EGNMT models can achieve improvements of up to +9 BLEU points over the baseline system and +7 BLEU points over a two-encoder Transformer.

TCS Journal 2016 Journal Article

Semi-online scheduling with bounded job sizes on two uniform machines

  • Qian Cao
  • Zhaohui Liu

In this paper, we investigate a semi-online scheduling problem on two uniform machines with the speed ratio s. It is assumed that all jobs have their processing times between p and tp ( p > 0, t ≥ 1 ). The objective is to minimize the makespan. We give the competitive ratio of LS algorithm which is a piecewise function on t ≥ 1 and s ≥ 1. It shows that LS is an optimal algorithm for most regions on s and t. We further present two optimal algorithms. The algorithm H 1 with competitive ratio of s is optimal for 1. 325 ≤ s ≤ 1 + 5 2 and s < t ≤ s 2 − 1 1 + s − s 2. The algorithm H 2 with competitive ratio of s is optimal for 1. 206 ≤ s ≤ 1. 5 and s ≤ t ≤ min ⁡ { 2 s − 1, 2 ( s 2 − 1 ) 1 + s − s 2 }, and it is also optimal for 1 ≤ s ≤ 1 + 17 4 and max ⁡ { 2 s − 1, − s + 9 s 2 + 8 s 2 s } ≤ t ≤ 2 s with competitive ratio of 1 + t 2.

TCS Journal 2012 Journal Article

Several semi-online scheduling problems on two identical machines with combined information

  • Qian Cao
  • T.C.E. Cheng
  • Guohua Wan
  • Yi Li

In this paper we consider several semi-online scheduling problems on two identical machines with combined information. The objective of each problem is to minimize the makespan. The first problem is semi-online scheduling with known optimal solution value and maximum job size. We obtain a lower bound 6 5 and design an optimal algorithm with a competitive ratio 6 5. The second problem is semi-online scheduling with a buffer of size k, where k ( k ≥ 1 ) is a finite positive integer, and known maximum job size. We obtain a lower bound 6 5 and design an algorithm with a competitive ratio 5 4. The third problem is semi-online scheduling with a buffer of size 1 and jobs arriving in decreasing order of their processing times. We obtain a lower bound 7 6, which matches an upper bound in the literature. The last problem is semi-online scheduling with a buffer of size 1 and all the job processing times being bounded in the interval [ 1, t ] ( t ≥ 1 ). We obtain a lower bound max { min { 4 3, t + 2 6 }, min { 5 4, t + 1 4 }, min { 7 6, t + 2 3 } }, where the lower bound 4 3 for t ≥ 6 matches an upper bound in the literature, and design an algorithm with a competitive ratio max { t + 2 3, 8 7 } for 1 ≤ t ≤ 3 2, which is optimal for 10 7 ≤ t ≤ 3 2.

TCS Journal 2011 Journal Article

Semi-online scheduling with known partial information about job sizes on two identical machines

  • Qian Cao
  • Zhaohui Liu
  • T.C.E. Cheng

In this paper we consider the semi-online scheduling problem with known partial information about job sizes on two identical machines, where all the jobs have processing times in the interval [ p, t p ] ( p > 0, t ≥ 1 ) and the maximum job size is t p. The objective is to minimize the makespan. For 1 ≤ t < 4 3 and t ≥ 2, we obtain lower bounds t + 1 2 and 4 3 on the optimal solution, respectively, which match the upper bounds given by He and Zhang (1999) in [2]. For 4 3 ≤ t < 2, we prove that a lower bound on the optimal solution is max { 4 t + 4 3 t + 4, 2 t t + 1 } and design an algorithm with a competitive ratio equal to this lower bound.

TCS Journal 2010 Journal Article

Online scheduling with reassignment on two uniform machines

  • Qian Cao
  • Zhaohui Liu

In this paper, we investigate the online scheduling problem on two uniform machines, where the last job of each machine can be reassigned after all jobs have been assigned. The objective is to minimize the makespan. We prove that the classical List Scheduling algorithm with the competitive ratio s + 1 s is optimal for s ≥ 1 + 5 2, where s is the speed ratio between the two machines. Also, we prove the lower bound s + 1 for 1 ≤ s < 1 + 5 2 and design an algorithm that matches the bound.

v2026.09.13