Source author record

Zhengping Wang

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

ResearcherUnclaimed source record

Machine Learning math.AP Artificial Intelligence nlin.PS physics.optics quant-ph

Catalog footprint

What is connected

5works

6topics

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

20/20 Vision Language Models: A Prescription for Better VLMs through Data Curation Alone

Data curation has shifted the quality-compute frontier for language-model and contrastive image-text pretraining, but its role for vision-language models (VLMs) is far less established. We ask how far data curation alone can take VLM performance, holding architecture, training recipe, and compute fixed and varying only the training data. Our pipeline, applied to the MAmmoTH-VL single-image subset, lifts performance by +11.7pp on average across 20 public VLM benchmarks (spanning grounding, VQA, OCR/documents, captioning, spatial/3D, counting, charts, math, brand-ID, and multi-image reasoning) and by +11.3pp on average across all nine capability axes of DatBench, our high-fidelity VLM eval suite. At 2B, our curated model surpasses InternVL3.5-2B by 9.9pp at ~17x less training compute and closes the gap to Qwen3-VL-2B to within 1.8pp at ~87x less compute, from pretraining alone. Beyond accuracy, curation delivers four further properties: (1) Reliability: per-capability std across training seeds drops by ~67% and the lift survives a 4k-to-16k context-length sweep; (2) OOD generalization: the 9-eval OOD average rises by +7.2pp, and multi-image BLINK rises by +3.09pp despite single-image-only training, with Visual Correspondence gaining +11.8pp; (3) Behavioral gains beyond benchmarks: across ~1,100 open-ended queries the curated 2B is more honest and more specific than the matched-compute baseline, and more concise and less refusal-prone than a frontier 2B reference; (4) Pareto-dominance on inference cost: at every scale (1B, 2B, 4B) the curated model raises accuracy while lowering response FLOPs vs. the matched-compute baseline, and the curated 4B matches near-frontier accuracy at 3.3x lower response FLOPs than Qwen3-VL-4B. Data curation is a high-leverage tool for building better VLMs, reaching near-frontier accuracy at up to ~150x less training compute.

preprint2026arXiv

DatBench: Discriminative, Faithful, and Efficient VLM Evaluations

Empirical evaluation serves as the primary compass guiding research progress in foundation models. Despite a large body of work focused on training frontier vision-language models (VLMs), approaches to their evaluation remain nascent. To guide their maturation, we propose three desiderata that evaluations should satisfy: (1) faithfulness to the modality and application, (2) discriminability between models of varying quality, and (3) efficiency in compute. Through this lens, we identify critical failure modes that violate faithfulness and discriminability, misrepresenting model capabilities: (i) multiple-choice formats reward guessing, poorly reflect downstream use cases, and saturate early as models improve; (ii) blindly solvable questions, which can be answered without images, constitute up to 70% of some evaluations; and (iii) mislabeled or ambiguous samples compromise up to 42% of examples in certain datasets. Regarding efficiency, the computational burden of evaluating frontier models has become prohibitive: by some accounts, nearly 20% of development compute is devoted to evaluation alone. Rather than discarding existing benchmarks, we curate them via transformation and filtering to maximize fidelity and discriminability. We find that converting multiple-choice questions to generative tasks reveals sharp capability drops of up to 35%. In addition, filtering blindly solvable and mislabeled samples improves discriminative power while simultaneously reducing computational cost. We release DatBench-Full, a cleaned evaluation suite of 33 datasets spanning nine VLM capabilities, and DatBench, a discriminative subset that achieves 13x average speedup (up to 50x) while closely matching the discriminative power of the original datasets. Our work outlines a path toward evaluation practices that are both rigorous and sustainable as VLMs continue to scale.

preprint2016arXiv

Stability of traveling waves of nonlinear Schrödinger equation with nonzero condition at infinity

We study the stability of traveling waves of nonlinear Schrödinger equation with nonzero condition at infinity obtained via a constrained variational approach. Two important physical models are Gross-Pitaevskii (GP) equation and cubic-quintic equation. First, under a non-degeneracy condition we prove a sharp instability criterion for 3D traveling waves of (GP), which had been conjectured in the physical literature. This result is also extended for general nonlinearity and higher dimensions, including 4D (GP) and 3D cubic-quintic equations. Second, for cubic-quintic type sub-critical or critical nonlinearity, we construct slow traveling waves and prove their nonlinear instability in any dimension. For traveling waves without vortices (i.e. nonvanishing) of general nonlinearity in any dimension, we find the sharp condition for linear instability. Third, we prove that any 2D traveling wave of (GP) is transversally unstable and find the sharp interval of unstable transversal wave numbers. Near unstable traveling waves of above cases, we construct unstable and stable invariant manifolds.

preprint2014arXiv

Multiple solutions for a nonhomogeneous Schrödinger-Maxwell system in $R^3$

The paper considers the following nonhomogeneous Schrödinger-Maxwell system -Δu + u+λϕ(x) u =|u|^{p-1}u+g(x),\ x\in \mathbb{R}^3, -Δϕ= u^2, \ x\in \mathbb{R}^3, . \leqno{(SM)} where $λ>0$, $p\in(1,5)$ and $g(x)=g(|x|)\in L^2(\mathbb{R}^3)\setminus{0}$. There seems no any results on the existence of multiple solutions to problem (SM) for $p \in (1,3]$. In this paper, we find that there is a constant$C_p>0$ such that problem (SM) has at least two solutions for all $p\in (1,5)$ provided $\|g\|_{L^2} \leq C_p$, but only for $p\in(1,2]$ we need $λ>0$ is small. Moreover, $C_p=\frac{(p-1)}{2p}[\frac{(p+1)S^{p+1}}{2p}]^{1/(p-1)}$, where $S$ is the Sobolev constant.

preprint2013arXiv

Thermally driven continuous-wave and pulsed optical vortex

We demonstrated the continuous-wave (cw) and pulsed optical vortex with topological charges driven by heat generated during the lasing process without introducing the astigmatism effect and reducing lasing efficiency. During the lasing process, the topological charges were changeable by the thermal-induced lens and selected by the mode-matching between the pump and oscillating beams. With a graphene sample as the saturable absorber, the pulsed optical vortex was achieved at the wavelength of 1.36 μm, which identified that graphene could be used as a pulse modulator for the generation of pulsed optical vortex. It could be believed that the thermally driven cw and pulsed optical vortex should have various promising applications based on the compact structure, changeable topological charges and specific wavelength