Source author record

Ze Xu

Ze Xu appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

math.AG math.NA physics.comp-ph Computation and Language Numerical Analysis

Catalog footprint

What is connected

7works

5topics

4close collaborators

Actions

Connect this record

Open graph Browse works

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

CC-OCR V2: Benchmarking Large Multimodal Models for Literacy in Real-world Document Processing

Large Multimodal Models (LMMs) have recently shown strong performance on Optical Character Recognition (OCR) tasks, demonstrating their promising capability in document literacy. However, their effectiveness in real-world applications remains underexplored, as existing benchmarks adopt task scopes misaligned with practical applications and assume homogeneous acquisition conditions. To address this gap, we introduce CC-OCR V2, a comprehensive and challenging OCR benchmark tailored to real-world document processing. CC-OCR V2 focuses on practical enterprise document processing tasks and incorporates hard and corner cases that are critical yet underrepresented in prior benchmarks, covering 5 major OCR-centric tracks: text recognition, document parsing, document grounding, key information extraction, and document question answering, comprising 7,093 high-difficulty samples. Extensive experiments on 14 advanced LMMs reveal that current models fall short of real-world application requirements. Even state-of-the-art LMMs exhibit substantial performance degradation across diverse tasks and scenarios. These findings reveal a significant gap between performance on current benchmarks and effectiveness in real-world applications. We release the full dataset and evaluation toolkit at https://github.com/eioss/CC-OCR-V2.

preprint2020arXiv

Split representation of adaptively compressed polarizability operator

The polarizability operator plays a central role in density functional perturbation theory and other perturbative treatment of first principle electronic structure theories. The cost of computing the polarizability operator generally scales as $\mathcal{O}(N_{e}^4)$ where $N_e$ is the number of electrons in the system. The recently developed adaptively compressed polarizability operator (ACP) formulation [L. Lin, Z. Xu and L. Ying, Multiscale Model. Simul. 2017] reduces such complexity to $\mathcal{O}(N_{e}^3)$ in the context of phonon calculations with a large basis set for the first time, and demonstrates its effectiveness for model problems. In this paper, we improve the performance of the ACP formulation by splitting the polarizability into a near singular component that is statically compressed, and a smooth component that is adaptively compressed. The new split representation maintains the $\mathcal{O}(N_e^3)$ complexity, and accelerates nearly all components of the ACP formulation, including Chebyshev interpolation of energy levels, iterative solution of Sternheimer equations, and convergence of the Dyson equations. For simulation of real materials, we discuss how to incorporate nonlocal pseudopotentials and finite temperature effects. We demonstrate the effectiveness of our method using one-dimensional model problem in insulating and metallic regimes, as well as its accuracy for real molecules and solids.

preprint2016arXiv

Adaptively compressed polarizability operator for accelerating large scale \textit{ab initio} phonon calculations

Phonon calculations based on first principle electronic structure theory, such as the Kohn-Sham density functional theory, have wide applications in physics, chemistry and material science. The computational cost of first principle phonon calculations typically scales steeply as $\mathcal{O}(N_e^4)$, where $N_e$ is the number of electrons in the system. In this work, we develop a new method to reduce the computational complexity of computing the full dynamical matrix, and hence the phonon spectrum, to $\mathcal{O}(N_e^3)$. The key concept for achieving this is to compress the polarizability operator adaptively with respect to the perturbation of the potential due to the change of the atomic configuration. Such adaptively compressed polarizability operator (ACP) allows accurate computation of the phonon spectrum. The reduction of complexity only weakly depends on the size of the band gap, and our method is applicable to insulators as well as semiconductors with small band gaps. We demonstrate the effectiveness of our method using one-dimensional and two-dimensional model problems.

preprint2015arXiv

Algebraic cycles on a generalized Kummer variety

We compute explicitly the Chow motive of any generalized Kummer variety associated to any abelian surface. In fact, it lies in the rigid tensor subcategory of the category of Chow motives generated by the Chow motive of the underlying abelian surface. One application of this calculation is to show that the Hodge conjecture holds for arbitrary products of generalized Kummer varieties. As another application, all numerically trivial 1-cycles on arbitrary products of generalized Kummer varieties are smash-nipotent.

preprint2012arXiv

A remark on the Abel-Jacobi morphism for the cubic threefold

Let $X$ be a smooth cubic threefold and $J(X)$ be its intermediate Jacobian. We show that there exists a codimension 2 cycle $Z$ on $J(X)\times X$ with $Z_{t}$ homologically trivial for each $t\in J(X)$, such that the morphism $ϕ_{Z}: J(X)\rightarrow J(X)$ induced by the Abel-Jacobi map is the identity. This answers positively a question of Voisin in the case of the cubic threefold.

preprint2011arXiv

On Hard Lefschetz Conjecture on Lawson Homology

Friedlander and Mazur proposed a conjecture of hard Lefschetz type on Lawson homology. We shall relate this conjecture to Suslin conjecture on Lawson homology. For abelian varieties, this conjecture is shown to be equivalent to a vanishing conjecture of Beauville type on Lawson homology. For symmetric products of curves, we show that this conjecture amounts to the vanishing conjecture of Beauville type for the Jacobians of the corresponding curves. As a consequence, Suslin conjecture holds for all symmetric products of curves with genus at most 2.