SearcharxivSearch

arXiv subjects

Zhao Gao

Publications and source records attributed to Zhao Gao.

4 recordsLinked to original sources

Is It Time for the Renaissance of Salient Object Detection in the Era of MLLMs?

The zero-shot capabilities of multimodal large language models (MLLMs) are pushing salient object detection (SOD) beyond task-specific supervision. To disentangle MLLMs beyond conventional mask-based evaluation, we decompose SOD into localization and segmentation, and re-engineer datasets with phrases, boxes, and attributes, establishing a diagnostic benchmark for MLLM saliency perception (SaliLLM). SaliLLM uncovers a striking capability mismatch: MLLMs outperform state-of-the-art (SOTA) methods in localization, yet remain substantially weaker in segmentation. Further analyses attribute this gap primarily to mismatches between MLLMs and annotations over foreground cardinality, granularity, and extent. Motivated by this diagnosis, we recast zero-shot SOD as protocol-aligned Foreground Organization and introduce the first training-free framework that leverages Gestalt-inspired Collaborative attention for Unified SOD (FOCUS). FOCUS couples top-down Bayesian-surprise calibration of protocol-conditioned foreground granularity with bottom-up propagation of MLLMs evidence over entity-centric perceptual manifolds induced by self-supervised features, yielding coherent object extents as prompts for a general segmenter. Across 13 RGB, RGB-D, and RGB-T SOD benchmarks, FOCUS generally surpasses SOTA methods without training, reducing mean absolute error by 11\%, 34\%, and 48\% compared with fully, weakly, and self-supervised methods, respectively. Our findings signal the renaissance of SOD: from task-specific supervision to zero-shot foreground organization. Code is available in the supplementary material.

cs.CV

Taiji: A DPU Memory Elasticity Solution for In-production Cloud Environments

The growth of cloud computing drives data centers toward higher density and efficiency. Data processing units (DPUs) enhance server network and storage performance but face challenges such as long hardware upgrade cycles and limited resources. To address these, we propose Taiji, a resource-elasticity architecture for DPUs. Combining hybrid virtualization with parallel memory swapping, Taiji switches the DPU's operating system (OS) into a guest OS and inserts a lightweight virtualization layer, making nearly all DPU memory swappable. It achieves memory overcommitment for the switched guest OS via high-performance memory elasticity, fully transparent to upper-layer applications, and supports hot-switch and hot-upgrade to meet in-production cloud requirements. Experiments show that Taiji expands DPU memory resources by over 50%, maintains virtualization overhead around 5%, and ensures 90% of swap-ins complete within 10 microseconds. Taiji delivers an efficient, reliable, low-overhead elasticity solution for DPUs and is deployed in large-scale production systems across more than 30,000 servers.

cs.OS

Some questions arising from the study of cohomology on flag varieties

A fundamental problem at the confluence of algebraic geometry and representation theory is to describe the cohomology of line bundles on flag varieties over a field of characteristic p. When p=0, the solution is given by the celebrated Borel-Weil-Bott Theorem, while for p>0 the problem is widely open. In this note we describe a collection of open questions that arise from the study of particular cases of the general theory, focusing on their combinatorial and commutative algebra aspects.

math.AG

Cohomology of line bundles on the incidence correspondence

For a finite dimensional vector space V of dimension n, we consider the incidence correspondence (or partial flag variety) X in P(V) x P(V*), parametrizing pairs consisting of a point and a hyperplane containing it. We completely characterize the vanishing and non-vanishing behavior of the cohomology groups of line bundles on X in characteristic p>0. If n=3 then X is the full flag variety of V, and the characterization is contained in the thesis of Griffith from the 70s. In characteristic 0, the cohomology groups are described for all V by the Borel-Weil-Bott theorem. Our strategy is to recast the problem in terms of computing cohomology of (twists of) divided powers of the cotangent sheaf on projective space, which we then study using natural truncations induced by Frobenius, along with careful estimates of Castelnuovo-Mumford regularity. When n=3, we recover the recursive description of characters from recent work of Linyuan Liu, while for general n we give character formulas for the cohomology of a restricted collection of line bundles. Our results suggest truncated Schur functions as the natural building blocks for the cohomology characters.

math.AG