Search arXiv⌕ Search

arXiv subjects

Jiacheng Ding

Publications and source records attributed to Jiacheng Ding.

At least 19 recordsLinked to original sources

See, Think, Use: Diagnosing Perception and Reasoning Failures in VLMs

We present See, Think, Use, a protocol that traces each answer of a vision-language model to perception, reasoning or the use of perception. The diagnosis shows a developer which stage to improve and directs test-time compute to the stage that fails. Benchmarks score the final answer, and an answer that rests on the image earns the same credit as a guess or a memorized prior. The protocol asks the model two extra questions per item and needs no access to its weights. A localization probe asks for a box around every instance and measures seeing, and a text-replacement probe answers from a description and measures thinking. Use is the rate at which the answer follows the model's own perception across counterfactual image pairs. The rate needs no answer labels, because the question and its prior are the same on both images. On two model families and six datasets the protocol shows that the knob that helps follows the task family. Answers follow the model's perception except on images that contradict a common prior, and asking the model to localize first repairs this failure when its boxes are right. Allocating compute by the measured stages comes close to the best uniform policy at lower cost and beats a random allocation of the same compute wherever a knob raises the short stage. We will release the code, the prompts and the per-question outputs.

cs.CV↗

AbacusGS: Gaussian Splatting without Per-Splat Sorting

3D Gaussian Splatting sorts every splat by depth in every frame. Viewers that draw splats with the hardware rasterizer and sort them on the CPU, as most web and mobile viewers do, spend most of the frame time in this sort. We present AbacusGS, which stores the blending order of a 3DGS scene in the scene layout. AbacusGS groups the splats into octree boxes of at most 128 splats and stores each box in order along an axis chosen at write time. In each frame, AbacusGS sorts only the visible boxes, and one dot product per box decides whether the box is read forward or backward. A short order-aware fine-tuning converts an existing 3DGS model, and the over operator of 3DGS stays unchanged. On 13 standard scenes, AbacusGS loses 0.13 dB PSNR on average against an equally fine-tuned 3DGS model. In an OpenGL viewer that orders splats on the CPU, AbacusGS renders frames 4.5 times faster than per-splat sorting. We also present a compact format of 17 bytes per splat and a CUDA tile renderer that use the same order. The code will be released.

cs.CV↗

Spend the Bits Where the Tiny Objects Are: Rate-Utility Region Coding for Aerial Detection

Bandwidth-limited aerial cameras must compress their images before a remote detector can find the many tiny objects in them. Threshold-based region-of-interest (ROI) coding sends only confidently detected regions, and because tiny objects provide limited visual evidence and often score low, it can discard the regions that contain them. We propose rate-utility region coding (RUO), which sends a region when its expected detection utility justifies its measured byte cost, choosing to drop it or to send it at low or high quality with one multiplier shared across images. RUO trains no model, uses a standard image codec and decodes in a few milliseconds. On all 1,610 VisDrone-DET test-dev images, RUO uses 42.4% fewer bits than a tuned threshold-based ROI coder, averaged over their shared tiny-object average precision (AP) range. RUO also needs fewer bits for tiny objects than the AV1 Image File Format (AVIF), High Efficiency Video Coding (HEVC) and three published learned codecs, and its advantage over threshold-based ROI coding persists when the sender and receiver use different detectors. For AP over all object sizes RUO needs 25.4% more bits than the tuned ROI coder, because its allocation drops large regions first at low rates, so it suits tasks that target tiny objects. We plan to release the code.

cs.CV↗

Recoverability-Aware Evaluation of Diffusion Video Inpainting and Object Removal

Video inpainting for object removal is scored over the whole hole, although the background behind the object is visible in other frames of the shot for some hole pixels and in no frame for others. A whole-hole score therefore mixes copying with generation and cannot show which of the two a remover does well. To separate the two, we propose recoverability-stratified evaluation, in which a point tracker run on the clean video labels each hole pixel by whether and how far away it is observed, so that fidelity and temporal stability can be reported per stratum against a copy reference. To reuse the observed content, we also propose evidence-guided sampling (EGS), which blends tracked colors into the clean-latent prediction of a video diffusion remover without training. On DAVIS, the perceptual advantage of three diffusion removers over flow propagation shrinks where the content is visible a few frames away (LPIPS difference-in-differences +0.046 to +0.056 against E2FGVI-HQ), and real paired captures show the same pattern for two of them. Their DAVIS hole warping error is two to four times that of ProPainter, and copying along clean-video tracks lowers their recoverable LPIPS by a quarter to two fifths. EGS closes 43% and 56% of the gap to this copy reference on held-out DAVIS when its colors come from clean-video tracks. With colors tracked on the masked input, a pre-registered confirmation finds no gain on MiniMax-Remover and a loss on ROSE. Diffusion removers thus leave observed content unused on DAVIS, and training-free reuse does not yet hold with tracked evidence.

cs.CV↗

FieldGuideRAG: Image-Grounded GraphRAG for Fine-Grained Recognition with Vision-Language Models

We present FieldGuideRAG, a training-free GraphRAG method in which a vision-language model, or VLM, recognizes fine-grained species by comparing the query with real photographs stored on the nodes of a knowledge graph. Multimodal GraphRAG systems describe each entity in text, and text conveys little of the visual detail that separates look-alike species. Our graph stores one photograph on every species node and links each species to its relatives, its geographic range and its ecological facts. A frozen VLM verifies the query against the photograph of each candidate node. FieldGuideRAG fuses the verification scores with the range edge and answers questions about the organism from the fact edges of the verified species. On CUB-200, a Wikidata graph and four iNaturalist domains, the node photograph improves verification over the species name on every graph, while text descriptions add little. Verification of the candidate pool exceeds a SigLIP retriever by up to 16 points, the range edge adds 7 to 19 points on iNaturalist, and answering from fact edges is correct on up to 89.5% of 28,820 ecological questions. The verification scores also detect queries whose species is missing from the graph. Graphs, prompts and code will be released.

cs.CV↗

HoopMind: A Real-Time Neural Game-Tree System for Opponent-Aware Possession Planning

School coaches prepare for opponents with game film and intuition. The analytics tools of professional teams stay out of reach. We ask how far public data can close this gap. Professional basketball is our case study, chosen for its data rather than the league. We fuse five public sources into one per-shot dataset of 4.23M shots over 21 seasons. The sources are shot locations, two play-by-play feeds, official matchup tracking, and player biometrics. Alignment across them is 99.5% to 100%. We also report two data pitfalls that are easy to miss. We then model a half-court possession as a sequential game. Shot values come from ShotNet, an embedding multilayer perceptron (MLP). On a held-out season it beats a zone-rate baseline and a logistic baseline, and its probabilities are well calibrated. A depth-limited expectimax search then solves the offensive decision tree, with branch-and-bound pruning to keep it real time. All training runs offline, so the online system stays light. A scouting planner and a playable simulator both run in a single browser page.

cs.LG↗

Development of A Novel Compton Camera for MeV Gamma-Ray Measurement in Space

The astrophysical gamma rays in the MeV energy region have not yet been well-explored due to the limitation of detection technology in the past decades, and the famous gamma-ray "MeV gap" exists. Opening the window of MeV gamma-ray is not only critical for the gamma astronomy but also essential for rich frontier researches in astro-particle physics, such as detecting light dark matter, probing the primordial black hole and better understanding of nucleosynthesis. As a pilot experiment of the project for dark matter detection in space at Shanghai Jiao Tong University, a three-layer Compton camera with the energy resolution better than 4% and position resolution of ~2 mm is developed utilizing the novel scintillators. Here we show the design, detailed calibration and validation results of the novel Compton camera, and demonstrate its good ability of MeV gamma-ray source imaging for the upcoming in-orbit mission.

hep-ex↗

HAWKEYE: Seeing One Layer Deeper -- A Cohesion-Aware Structural Channel for Temporal Link Prediction

State-of-the-art temporal-link-prediction (TLP) models are, in essence, multi-channel information aggregators: they combine an interaction-history channel, a time-encoding channel, and a structure channel. The first two have been refined relentlessly; the structure channel remains a crude afterthought -- DyGFormer encodes it as a 1--2-bit neighbour-cooccurrence count. We begin with a measurement: on sparse temporal graphs the classical 1-hop common-neighbour signal is near-random (discriminative AUC $\approx 0.50$), because two nodes almost never share a direct neighbour; the genuinely discriminative signal lies one hop deeper -- the 2-hop cohesive bridge, whose discAUC reaches 0.73--0.98, on both bipartite and non-bipartite graphs. Motivated by this, we propose HAWKEYE, a cohesion-aware structural channel that incrementally maintains the classical k-family of cohesiveness indicators (degree $\to$ k-core $\to$ k-truss) and forms 2-hop cohesive-bridge features. HAWKEYE is a drop-in replacement for a temporal-graph model's native structure channel, with no change to the backbone. Swapping HAWKEYE into DyGFormer improves test AP/MRR over the cooccurrence channel by +0.6 to +10.8 points across six multi-seed-validated datasets (uci, enron, USLegis, CanParl, reddit, mooc). On the bipartite recommendation benchmark tgbl-subreddit, a 3-seed single-pass struct-only ablation shows HAWKEYE nearly doubling the baseline test MRR (0.103$\pm$0.003 $\to$ 0.204$\pm$0.005, +10.1 points across all three seeds); the streaming pipeline scales to the 67M-edge tgbl-flight in five minutes per pass. We further characterise when it helps: the gain tracks a graph's training-free 2-hop discAUC and vanishes on degenerate or saturated graphs -- a predictable boundary. All code, data, and figure-generation scripts are released.

cs.DB↗

TriAgent: Divergence-Aware Multi-Agent Committees for Cost-Efficient Financial Sentiment Analysis

Production LLM-based financial sentiment analysis faces a structural cost trap: most queries are trivially classifiable, yet expensive cloud reasoners process them all, and the bill scales linearly with user count. We present TriAgent, a multi-agent committee stratified by contextual granularity -- a word-level lexicon (VADER), a sentence-level domain transformer (FinBERT), and a cross-sentence reasoner (Qwen2.5, 0.5B-14B-4bit, with Mistral-7B and Phi-3.5-mini cross-family checks). A three-way Semantic Divergence Index (SDI) measures pairwise disagreement across granularities and routes each query accordingly. Our central finding is the critic plateau: when the LLM is re-tasked as a critic over the smaller agents' outputs, F1 plateaus at ~0.87 across 1.5B-7B Qwen (bootstrap 95% CIs overlap), while a same-size 3-persona vote drops to F1=0.66, which is driven by granularity-stratified diversity. Three corollaries follow from the same SDI signal: (i) a Shared Consensus Dictionary on multilingual sentence-BERT answers 95% of Chinese queries from an English cache at F1=0.99 -- cross-border canonicalization at zero marginal cost; (ii) SDI doubles as a post-hoc LLM-hallucination detector at AUC=0.90; (iii) the SDI single-stage strategy attains the best risk-adjusted return (Sharpe=3.50) on a 20-ticker back-test, dominating both always-FinBERT (1.36) and always-LLM (0.11). At 10M-user scale, TriAgent saves $9.3M/year vs. a GPT-4o-mini baseline. Code, lexicons, and the SCD are released.

cs.CL↗

FIFA World Cup 2026 as a Contamination-Free Benchmark for LLM Forecasting Agents: Four Models, a Bookmaker, and 104 Matches

We introduce WC2026-Agents, a benchmark and dataset for evaluating large language models (LLMs) as autonomous forecasting agents on real, future events. For every one of the 104 matches of the 2026 FIFA World Cup, four frontier models -- Claude Opus 4.8, ChatGPT (GPT-5.5, high reasoning), Gemini 3.1 Pro, and Grok (Expert Mode) -- ran an identical search-act-reflect loop: gather evidence with a web tool, commit to a 1X2 (team-A win / draw / team-B win) distribution and a virtual 100-USD bet, and, after the match, reflect given only the final score. Because every match kicked off after the models' training cutoffs, the benchmark is contamination-free by construction. Crucially, we pair the four agents with a fifth competitor drawn from the same information environment -- the pre-match betting market -- collected as per-match 1X2 odds, giving an economically grounded baseline and letting us score not just what an agent predicts but what it does with money. The release contains 416 forecasts and 414 reflections with verbatim reasoning, ground truth (including penalty shootouts), odds, and a reproducible evaluation suite. A reference evaluation surfaces findings that raw accuracy hides: the four agents issue an identical top pick in 92% of matches and none beats the market's Brier score; indeed, a naive flat stake on the market favorite out-earns all four agents. Yet the agents diverge sharply as decision-makers: betting return-on-investment ranges from -18% to +10%, fading the market is unprofitable for all four, the share of forecasts that cite the market ranges from 12% to 100%, and self-reported error rates on wrong picks range from 36% to 86%. The benchmark thus measures calibration, decision quality, and self-knowledge -- axes on which frontier models differ even when their predictions do not. Data and code: https://github.com/graphuofm/FIFA2026LLM

cs.LG↗

SAGA: Synthetic Agentic Graph Architecture for Temporal Benchmark Generation

High quality temporal graph benchmarks with rich semantics and ground-truth anomaly labels are essential for training graph neural networks, yet remain scarce due to privacy constraints and annotation costs. We present SAGA (Synthetic Agentic Graph Architecture), a system for generating large-scale, semantically rich temporal graphs via a four-phase pipeline. Our Skeleton-First, Semantics-Second architecture decouples structure from semantics: (S) an O(1)-per-edge skeleton generator produces power-law graphs; (A) a dispatcher partitions causally ordered time blocks for parallel execution; (G) LLM agents inject domain semantics using RAG-based rule bases across four domains; and (A) a state alignment engine resolves conflicts via temporal replay, yielding anomaly labels as natural byproducts. Unlike structural generators (e.g., LDBC SNB, Kronecker/R-MAT) or purely LLM-based approaches, SAGA achieves structural realism, semantic richness, and automatic anomaly labeling in a unified framework. On a single H100 GPU with vLLM batching, SAGA generates 500,000 temporal edges with controlled anomalies in under 90 minutes, scaling to 100,000 nodes while maintaining clustering coefficients above 0.99. The system supports real-time pipeline visualization, interactive multi-domain tuning (Finance/AML, Network/IDS, Cyber/APT, Transportation), and a CLI for large-scale GPU-based experiments.

cs.DB↗

Tripod in uniform spanning tree and three-sided radial SLE$_2$

Fix a bounded $3$-polygon $(Ω; x_1, x_2, x_3)$ with three marked boundary points $x_1, x_2, x_3\in\partialΩ$ and suppose $(Ω^δ; x_1^δ, x_2^δ, x_3^δ)$ is an approximation of $(Ω; x_1, x_2, x_3)$ on $δ$-scaled hexagonal lattice. We consider uniform spanning tree (UST) in $Ω^δ$ with wired boundary conditions. Conditional on the event that both branches from $x_1^δ$ and $x_2^δ$ hit the boundary through $x_3^δ$, the two branches meet at a point $\trifurcation^δ$ which we call trifurcation, and the union of the three branches from $x_j^δ$ to $\trifurcation^δ$ form a tripod in the UST. We compute the scaling limit of the tripod: the distribution of trifurcation is absolutely continuous with respect to Lebesgue measure with explicit density; given the trifurcation, the conditional law of the tripod is three-sided radial SLE$_2$. The proof relies on construction of a new observable for trifurcation in our key lemma--Lemma~3.1--where we use Fomin's formula and the geometry of the hexagonal lattice in an essential way. Interestingly, the scaling limit of the observable for trifurcation coincides with the partition function for three-sided radial $\SLE_2$. Our result gives a probabilistic interpretation of the correlation function in CFT which has conformal weights $1$ at the three boundary points and has a spinless field of weights $(1,1)$ at the bulk point.

math.PR↗

The Shear-to-Cosmology Paradigm I. Hybrid Field-Level and Simulation-Based Framework for Weak Lensing Surveys

Precise cosmological inference from next-generation weak lensing surveys requires extracting non-Gaussian information beyond standard two-point statistics. We present a hybrid machine-learning (ML) framework that integrates field-level inference (FLI) with simulation-based inference (SBI) to map observed shear fields directly to cosmological parameters, eliminating the need for convergence reconstruction. The FLI network extracts rich non-Gaussian information from the shear field to produce informative features, which are then used by SBI to model the resulting complex posteriors. To mitigate noise from intrinsic galaxy shapes, we develop a blind, training-free, PCA-based shear denoising method. Tests on CSST-like mock catalogs reveal significant performance gains. The shear-based inference achieves approximately twice the cosmological constraining power in Figure of Merit (FoM) compared to the conventional convergence-based approach. Moreover, the combination of PCA denoising and ML compression can deliver a 36.4% improvement in FoM over standard shear two-point statistics. This work establishes a scalable and robust pathway for cosmological inference, unlocking the full potential of Stage-IV weak-lensing surveys.

astro-ph.CO↗

Enhancing cosmological constraints with nonlinear tanh transformations of Hermite-Gaussian Derivative fields

A key goal in large-scale structure analysis is to extract multi-scale information to improve cosmological parameter constraints. In particular, higher-order derivative fields are especially valuable as they capture the geometric and topological information of the cosmic web that is highly sensitive to cosmological parameters. Traditional derivative-based methods, such as finite-difference or Fourier approaches, suffer from noise amplification at small scales and cannot stably capture multi-scale features. We present a robust two-step framework: first, stable multi-scale arbitrary-order derivatives are obtained via Hermite-Gaussian convolutional filters that suppress small-scale noise; second, a tanh nonlinear transformation compresses extreme density contrasts and enhances the visibility of cosmic web structures. Using the Quijote simulations, we show that combining multi-scale first-order spectra yields improvements of 1.2-3.0 times across all seven cosmological parameters, while multi-order spectra at a fixed scale provide 1.3-2.9 times gains. The most comprehensive combination achieves nominal gains of 2.0-5.3 times. Our method offers a robust approach to extracting additional cosmological information for future surveys.

astro-ph.CO↗

ChronoConnect: Tracking Pathways Along Highly Dynamic Vertices in Temporal Graphs

With the proliferation of temporal graph data, there is a growing demand for analyzing information propagation patterns during graph evolution. Existing graph analysis systems, mostly based on static snapshots, struggle to effectively capture information flows along the temporal dimension. To address this challenge, we introduce ChronoConnect, a novel system that enables tracking temporal pathways in temporal graph, especially beneficial to downstream mining tasks, e.g., understanding what are the critical pathways in propagating information towards a specific group of vertices. Built on ChronoConnect, users can conveniently configure and execute a variety of temporal traversal algorithms to efficiently analyze information diffusion processes under time constraints. Moreover, ChronoConnect utilizes parallel processing to tackle the explosive size-growth of evolving graphs. We showcase the effectiveness and enhanced performance of ChronoConnect through the implementation of algorithms that track pathways along highly dynamic vertices in temporal graphs. Furthermore, we offer an interactive user interface for graph visualization and query result exploration. We envision ChronoConnect to become a powerful tool for users to examine how information spreads over a temporal graph.

cs.DB↗

A New Wavelet Scattering Transform-Based Statistic for Cosmological Analysis of Large-Scale Structure

Large-scale structure (LSS) analysis in galaxy surveys is a powerful cosmological probe but is limited by tracer bias, which can obscure underlying information and weaken parameter constraints. Existing methods either model bias or restrict analyses to low-density regions, yet their sensitivity to bias remains poorly understood. We propose a novel method based on the wavelet scattering transform (WST) to distinguish LSS across cosmological models while mitigating tracer bias. Central to our approach are the WST $m$-mode ratios, $R^{\rm wst}$, a new statistical measure, and a high-density apodization preprocessing that smoothly rescales extreme values. We use a reduced chi-square to assess the cosmological parameter constraints and find that $R^{\rm wst}$, in the scale range $j \in [3,7]$, achieves $χ^2_{ν, \rm cos} \approx 6$ for cosmology while maintaining $χ^2_{ν, \rm bias} \sim 1$--a regime unattained by other statistics. $R^{\rm wst}$ thus provides robust cosmological sensitivity with effective bias mitigation for future surveys.

astro-ph.CO↗

Testing the Equivalence Principle on Cosmological Scales Using Peculiar Acceleration Power Spectrum

While the (weak) Equivalence Principle (EP) has been rigorously tested within the solar system, its validity on cosmological scales, particularly in the context of dark matter and dark energy, remains uncertain. In this study, we propose a novel method to test EP on cosmological scales by measuring the peculiar acceleration power spectrum of galaxies using the redshift drift technique. We develop an EP estimator, $E_{\rm ep}$, to evaluate the consistency of the peculiar acceleration power spectrum across different tracers. By calculating the ratio of the peculiar acceleration power spectra of tracers, the ensemble average of $E_{\rm ep}$ is expected to be unity if EP holds on cosmological scales for these tracers. We validate this estimator using N-body simulations, focusing on four redshift bins with $z\leq 1.5$ and scales of $k$ in the range of $0.007$ and $0.2$ $h/\rm Mpc$. By fitting a single parameter $δ_{\rm ep}$ across redshifts, we find that DM particle mocks without EP violation yield $δ_{\rm ep}$ consistent with zero under the small redshift measurement uncertainty case, while the large redshift uncertainty case slightly induces biases at low redshifts. In addition, when using DM halo mocks with controlled EP violations, no-violation and mild-violation cases show no significant detection, while moderate and strong violations produce statistically significant $δ_{\rm ep}$ values and high $χ^2$, especially at low redshifts, confirming the estimator's sensitivity. Taking advantage of advanced observing capabilities, such as next-generation facilities that extend beyond the Square Kilometer Array, the proposed method offers a promising approach for future cosmological tests of EP.

astro-ph.CO↗

AI-Powered Reconstruction of Dark Matter Velocity Fields from Redshift-Space Halo Distribution

We propose a UNet-based deep learning model to reconstruct the real-space dark matter (DM) velocity field from the redshift-space distribution of sparse DM halos. Using various statistical measures, we show that the reconstructed velocity components--including velocity magnitude, momentum, and divergence--closely match the ground truth, achieving better than 10% relative error and a correlation coefficient of 0.88. In the power spectrum comparison over $k \in [0.05, 0.3] h/{\rm Mpc}$, the UNet reconstruction outperforms linear theory and agrees with the true field within $2σ$. The model also effectively corrects redshift-space distortions (RSD), yielding unbiased power spectrum multipoles of DM fields within $2σ$. Notably, the UNet remains robust even with incomplete halo mass information. These results highlight the model's broad applicability to cosmological analyses, including RSD, cosmic web studies, the kinetic Sunyaev-Zel'dovich effect, and BAO reconstruction.

astro-ph.CO↗