Searcharxiv⌕ Search

arXiv subjects

Zheng Liu

Publications and source records attributed to Zheng Liu.

At least 37 records · Page 2Linked to original sources

Position Anchor Tuning: Towards Efficient Adaptation of Pre-Trained Point Cloud Transformers

Parameter-efficient fine-tuning (PEFT) has recently emerged as a pivotal research direction for adapting pre-trained point cloud transformers to diverse downstream tasks. Although existing methods achieve excellent fine-tuning performance with high parameter efficiency, they ignore inference efficiency. To tackle this problem, a novel PEFT method termed position anchor tuning (PAT) is proposed in this paper. As multi-head attention (MHA) and feed-forward network (FFN) are computation-heavy blocks in pre-trained transformers, PAT decreases their computational cost through token aggregation-expansion pairs. Each pair comprises a token aggregation module (TAM) and a token expansion module (TEM). For MHA and FFN blocks, TAMs extract representative tokens from their input tokens based on position anchors in 3D space. These extracted tokens, rather than the original input tokens, are processed by the blocks, thereby reducing the number of tokens involved in computation. Then, TEMs propagate the learned representations back to the original input tokens. Since TAMs are solely responsible for capturing task-specific representations, base-sharing low-rank adaptation (BSLoRA) is further introduced to enable them to learn such representations effectively with only a small number of trainable parameters. Extensive experiments on widely used benchmarks demonstrate that PAT performs comparably to state-of-the-art methods while incurring significantly lower computational overhead and fewer trainable parameters.

cs.CV↗

VI-Bench: Benchmarking Prompt Inversion from AIGC Videos

Recent advances in video generation have made prompt-based control increasingly central to AIGC video generation. Prompts specify what a video should depict and how it should be represented, controlling factors such as visual style or camera behavior. Understanding this recoverability is important both for creative reuse and editing, and for assessing prompt leakage risks. However, existing video understanding benchmarks do not measure this capability: a caption may describe what is visible, but a replayable prompt must recover the generation-relevant controls needed to reproduce the video. To address this gap, we introduce VI-Bench, a benchmark built from 16.1 million real-user prompts and 900 human-verified AIGC videos. VI-Bench spans three progressively harder settings, namely single-shot semantic grounding, control over style and camera behavior, and multi-shot compositional inversion, and evaluates five generation-critical dimensions: subject, action, scene, style, and camera. We evaluate 18 representative VLMs, including 2 proprietary and 16 open-source models on VI-Bench, using an Inversion Score that measures prompt-level alignment with the original prompt and video-level fidelity of the regenerated video. The results reveal substantial limitations: even the strongest model achieves only 0.632 on Inversion Score, performance degrades sharply as samples require richer control and multi-shot reasoning, and models often produce plausible prompts whose regenerated videos deviate from the reference. These findings show that video prompt inversion is a distinct and under-evaluated capability requiring models to transform visual understanding into replay-stable generative control.

cs.CV↗

Generative Design of Liquid-Cooling Channels for Thermal Management of 2.5D and 3D Integrated Advanced Packaging

High-power multi-chip packages require increasingly effective cooling as intensive heat is generated within a limited package area. This work presents a physics-guided generative design framework for liquid-cooling channel topology optimization in a 2.7 kW multi-chip package containing two high-power graphics processing units (GPUs) and one central processing unit (CPU). A conditional diffusion model generates symmetric channel layouts using maximum GPU temperature, GPU temperature spread, and pressure drop as performance targets. Generated designs undergo connectivity and dead-end-branch screening and are evaluated using a calibrated reduced-order thermal-fluids model. Based on 5,000 generated layouts, the multi-objective analysis identified the optimal design for thermal properties, with estimated maximum GPU temperature of 70.30 degree Celsius, GPU temperature spread of 24.90 degree Celsius, and pressure drop of 89.72 kPa. Compared to a conventional reference topology, the optimal design reduced the maximum GPU temperature, temperature spread, and pressure drop by 33.6%, 52.5%, and 72.8%, respectively. High-fidelity three-dimensional conjugate heat-transfer simulation in OpenFOAM estimated a maximum GPU temperature of 66.70 degree Celsius and a pressure drop of 92.1 kPa, showing only differences of 8.6% in temperature rise and 2.6% in pressure drop. The results demonstrate that physics-guided generative design based on the reduced-order model can efficiently discover unconventional cooling channel architectures while reducing reliance on repeating computationally expensive simulation.

eess.SY↗

Calibrated Multichannel Monocular Ranging From Standardized License Plates With Metrology-Exact Validation

Longitudinal driver assistance depends on the distance to the vehicle ahead, a quantity normally supplied by radar, laser scanner, or stereo pair. However, a low-cost camera can estimate the distance as well, taking the rear license plate as a metric reference, including standards fix both the plate envelope and the regulated character height, so the pinhole projection converts either one into a distance. This research presents a approach and validates it. Plate localization now withstands the low-contrast and cluttered frames that previously drew the detector onto the vehicle body, or onto the character cluster of a sparsely lettered plate. Character height, plate outline, and mounting-hole span form three distance channels, merged by a consensus gated inverse-variance fusion that discards a corrupted channel before it can bias the result, with each channel separately corrected for the foreshortening of the direction along which it is measured, the correction following from the plate's recovered attitude. Finally, an innovation gate protects the temporal filter, so that a single bad detection cannot become a false warning. Evaluation is carried out in a metrology-exact testbed in which the commanded distance is the true distance, through 51 USA registries with distances of 1 to 12 m and viewing angles to 30 degrees under five lighting conditions. The plate is located in every frame. Mean absolute percentage error is 4.32% for the outline channel, while the fusion returns 5.79% mean and 2.17% median, without any of its single-channel failure modes. Roll is recovered to within one degree; the two out-of-plane tilts only to within several. The algorithm can provide a solid foundation for low-cost distance estimation which can serve as an emergency backup for other sensors.

cs.CV↗

Atlas: Algorithm-Hardware Co-Design for On-Device City-Scale 3D Gaussian Splatting in VR

3D Gaussian splatting (3DGS) has drawn significant attention in the architectural community recently. However, enabling city scale 3DGS on mobile VR devices remains challenging, as the memory requirement of large scale scenes far exceeds the memory capacity of today's mobile GPUs. This paper presents Atlas, an on device city scale 3DGS rendering framework that enables scalable rendering without runtime Internet access. The key insight is that although the full 3DGS model is massive, each frame only requires a small subset of Gaussians under the current pose and level of detail requirement. Based on this insight, Atlas introduces a hierarchical memory offloading mechanism that dynamically loads only necessary Gaussian data into device memory. To further improve performance, Atlas proposes temporal aware LoD search and stereo rasterization to avoid redundant computation in VR. We further show that our technique can be integrated with existing 3DGS accelerators with negligible hardware overhead. Overall, Atlas achieves 18.5x speedup over the GPU baseline and 3.9x speedup over the state of the art 3DGS accelerators, with 92.4% energy savings.

cs.AR↗

Repo-To-Skill: Distilling GitHub Repositories Into AI4AI Skills

Autonomous agents are beginning to carry out machine-learning (ML) research end to end. These agents combine a model backbone with a harness for planning, execution, memory, and verification, but this architecture still leaves domain-specific know-how outside the agent. We call this missing layer operational knowledge, the know-how that separates knowing a method from making it work. That knowledge is not absent from the field. It appears in repositories and papers, but in forms written for human readers and too large to load during a task. Once distilled into compact, verified skills, this knowledge can be reused across tasks rather than rediscovered during each run. We present DisCo, a skill-powered research agent that creates skills and uses them during research. Its distillation runs in two complementary forms: task-agnostic, condensing the field's widely used repositories into reusable skills, and task-oriented, producing the skills a concrete task calls for. The former, applied across the open ecosystem, yields the AREX-Skill Library, with 5,000+ verified skills distilled from 1,000 widely used ML repositories and organized into 20 areas and 178 capability families. With the GPT-5.5 backbone, research harness, and downstream execution budget held fixed, the skill-equipped research agent scores 134.3% higher on MLE-bench, 34.4% higher on PaperBench, 9.2% higher on FrontierCS, and 14.0% higher on PassNet than the same agent without skills. These gains come from adding distilled operating context under that fixed setup.

cs.AI↗

Quantum Magnetometry with Orientation beyond Steady-State Limits in Cavity-Magnon Systems

We propose a transient vector quantum magnetometry protocol based on cavity-magnon systems. By exploiting finite-time dynamics initialized from a reservoir-engineered squeezed steady state, our scheme retains residual squeezing-induced quadrature noise reduction, which suppresses transient added noise and enhances the short-time signal-to-noise ratio beyond conventional unsqueezed steady-state limits. IQ demodulation of orthogonal cavity-output quadratures enables crosstalk-free reconstruction of all three components of a transient magnetic field, providing access to both its magnitude and orientation. This vector capability is relevant for short-lived magnetic phenomena such as pulsed spin excitations, magnetic textures, nanoscale current transients, and biomagnetic signals. In the long-time limit, we derive a closed-form stationary noise spectrum and identify the on-resonance noise-cancellation condition $g_{am}=\sqrt{κ_aκ_m}/2$ at which the cavity-added noise vanishes without strong coherent coupling. Injected squeezing further suppresses the cavity-added noise away from resonance, while an array of $N$ yttrium iron garnet spheres reduces the magnon-probe noise contribution by a factor of $1/N$. Our results establish cavity-magnon systems as a scalable platform for transient, vector-resolved quantum magnetometry.

quant-ph↗

AREX: Towards a Recursively Self-Improving Agent for Deep Research

Deep research requires agents to find answers that jointly satisfy multiple constraints. Discovering such answers is costly, whereas verifying a candidate can often be decomposed into tractable constraint-wise checks. This discovery--verification asymmetry suggests that a research agent should do more than simply search longer: it should recursively improve its current answer by verifying intermediate results and using the partially verified state to guide subsequent refinement. We introduce AREX, a family of Recursively Self-Improving (RSI) deep research agents. AREX alternates between an inner research loop that gathers evidence and constructs a provisional answer, and an outer self-improvement loop that audits the answer constraint-wise, identifies unresolved claims, and launches targeted follow-up research. To sustain RSI over long horizons, AREX learns an autonomous context-update tool that compresses growing interaction history into a compact improvement state preserving verified evidence and unresolved constraints, without relying on an external model. We train AREX on verified synthetic tasks and high-quality trajectories through agentic mid-training and long-horizon reinforcement learning. To mitigate sparse final rewards during long horizon learning, we emphasize key steps where decisive evidence is acquired or erroneous research directions are corrected. We instantiate a dense 4B model and a 122B-A10B Mixture-of-Experts model. Across BrowseComp, WideSearch, DeepSearchQA, Humanity's Last Exam (HLE), and other reasoning and tool-use benchmarks, AREX substantially outperforms comparable-scale baselines and remains competitive with models using substantially more activated parameters.

cs.AI↗

Kato's main conjecture for nonordinary modular forms

We prove Kato's main conjecture for modular forms at nonordinary primes for weights in the Fontaine-Laffaille range. The key ingredients in the proof are a reformulation of the conjecture in terms of signed Selmer groups due to Lei-Loeffler-Zerbes, certain $p$-adic families of Rankin-Eisenstein classes arising from the work of Lei-Loeffler-Zerbes and Kings-Loeffler-Zerbes, and the lower bound divisibility in an Iwasawa-Greenberg main conjecture for Rankin-Selberg $p$-adic $L$-functions obtained in our earlier work \cite{CLW}.

math.NT↗

Scientific Graphics Program Synthesis via Dual Self-Consistency Reinforcement Learning

Graphics Program Synthesis is pivotal for interpreting and editing visual data, effectively facilitating the reverse-engineering of static visuals into editable TikZ code. While TikZ is the de facto standard for scientific schematics due to its programmatic flexibility, its requirement for rigorous spatial precision presents a significant challenge for Multimodal Large Language Models. Progress is currently stifled by two primary gaps: (1) Data Quality Gap: existing image-TikZ corpora often lack strict executability and reliable visual alignment; (2) Evaluation Gap: a lack of benchmarks for both structural and visual fidelity. To address these, we present a closed-loop framework featuring: SciTikZ-230K, a large-scale, high-quality dataset from our Execution-Centric Data Engine covering 11 diverse scientific disciplines; SciTikZ-Bench, a multifaceted benchmark spanning from basic geometric constructs to intricate hierarchical schematics to evaluate both visual fidelity and structural logic. To further broaden the scope of visual-code optimization methodology, we introduce a novel Dual Self-Consistency Reinforcement Learning optimization paradigm, which utilizes Round-Trip Verification to penalize degenerate code and boost overall self-consistency. Empowered by these, our trained model SciTikZer-8B achieves state-of-the-art performance, consistently outperforming proprietary giants like Gemini-2.5-Pro and massive models like Qwen3-VL-235B-A22B-Instruct.

cs.CV↗

Scientific Image Synthesis: Benchmarking, Methodologies, and Downstream Utility

While synthetic data has proven effective for improving scientific reasoning in the text domain, multimodal reasoning remains constrained by the difficulty of synthesizing scientifically rigorous images. Existing Text-to-Image (T2I) models often produce outputs that are visually plausible yet scientifically incorrect, resulting in a persistent visual-logic divergence that limits their value for downstream reasoning. Motivated by recent advances in next-generation T2I models, we conduct a systematic study of scientific image synthesis across generation paradigms, evaluation, and downstream use. We analyze both direct pixel-based generation and programmatic synthesis, and propose ImgCoder, a logic-driven framework that follows an explicit "understand - plan - code" workflow to improve structural precision. To rigorously assess scientific correctness, we introduce SciGenBench, which evaluates generated images based on information utility and logical validity. Our evaluation reveals systematic failure modes in pixel-based models and highlights a fundamental expressiveness-precision trade-off. Finally, we show that fine-tuning Large Multimodal Models (LMMs) on rigorously verified synthetic scientific images yields consistent reasoning gains, with potential scaling trends analogous to the text domain, validating high-fidelity scientific synthesis as a viable path to unlocking massive multimodal reasoning capabilities.

cs.CV↗

SpatialDiff: 3D-Aware Object Movement via Implicit Spatial Modeling

Recent advances in image editing allow impressive manipulation of objects, existing methods still struggle to handle spatial movement in complex scenes, such as objects span different depth layers or are partially occluded. Most image editing methods focus solely on prior information from 2D datasets, emphasizing planar features while lacking support for spatial structures. Even approaches that incorporate explicit positional information fail to capture true 3D spatial relationships, thus limiting accurate object movement in complex scenes. In this paper, we present SpatialDiff, a method that effectively captures 3D spatial structures, enabling precise and consistent object movements in complex scenes. Our core innovations are twofold: (1) Implicit 3D Spatial Modeling, which introduces 3D prior knowledge and enables the model to internally build a comprehensive understanding of the three-dimensional spatial structure; and (2) Global Spatial Supervision, which constrains the latent spatial features to enable the model to perceive changes in object spatial positions caused by editing operations. Experimental results demonstrate that our method significantly improves the accuracy and fidelity of spatial movement in complex scenes.

cs.CV↗

Data Center Life Cycle Co-Design Optimization

Liquid cooled supercomputers dissipate tens of megawatts of waste heat through cooling plants organized as parallel subloops that serve coolant distribution units. The number of subloops and the assignment of units to them are design decisions fixed at construction, yet they have not been systematically optimized at this scale. We present a framework that integrates operational energy from a validated control optimizer, embodied carbon and capital cost from a bill of materials, maintenance over the service life, and expected unplanned downtime from a component level reliability model. All 611 ways of partitioning the 25 coolant distribution units of the Frontier supercomputer into two through six subloops are evaluated. When redundancy is not costed, the optimum is two subloops holding 14 and 11 units, at 3,320.7 tonnes of carbon dioxide equivalent and 3,987k dollars over a 7 year horizon, saving 35.7 tonnes and 63k dollars compared to the documented as built configuration of three duty subloops holding 14, 6 and 5 units. The difference is driven by piping rather than by operational energy, and the identity of the optimum is unchanged across 15 sensitivity scenarios and both extremes of physical unit grouping, although its margin narrows under compact grouping. When the N+1 standby train that the plant actually carries is priced, the optimum moves to four or five duty subloops, adjacent to the three the plant runs and far from the unconstrained answer, and the semi-analytical decision rule reproduces this shift across four leadership class systems. Redundancy policy, not cost or carbon, is what sets the subloop count. A conversion of the built plant is shown not to pay back, so the framework is a greenfield design tool.

eess.SY↗

Tilted $p$-wave magnet candidate CeNiAsO

The unexpectedly small ordered moments of CeNiAsO, a candidate for correlated $p$-wave magnet, have posed a serious challenge to the precise determination of its magnetic structure, hindering the understanding of its fundamental properties. By leveraging the high sensitivity to local internal fields, our $^{75}$As nuclear quadrupole / magnetic resonance experiments reveal a commensurate antiferromagnetic order with a small out-of-plane moment $m_z\approx0.05$ $μ_{\mathrm{B}}$. This tilted magnetic configuration not only rotates the spin polarization axis away from the crystallographic $\mathbf{c}$-axis, but also enhances the non-relativistic spin splitting. We refer to this rare paradigm as a \textit{tilted $p$-wave magnet}.

cond-mat.str-el↗

Discovering physical mechanisms from experiment-simulation mismatches

Scientific discovery often begins where observation and prediction disagree. As computation and machine learning survey chemical space, experiment-simulation mismatches are exposed at scale, while tracing them to physical mechanisms remains expert-led. Here we present eXplainable DFT (XDFT), a self-evolving agent that turns this process into an executable search. XDFT formalizes candidate mechanisms as executable hypotheses, adjudicates their consequences against experiment and distils trajectories into priors for later searches. This couples a solving loop from mismatch to mechanism with a learning loop through which solving changes the solver. Across 112 source-audited cases in which standard calculations predict a metal whereas experiments find a semiconductor, XDFT resolved 105 with evidence-supported mechanisms within a single-GPU envelope. After 60 cases, the resolving mechanism ranked among the first three hypotheses for 80% of held-out cases, up from 7% under the initial expert prior. XDFT also returned evidence-graded mechanisms for seven expert-curated questions about physical mechanisms. These results establish experiment-simulation mismatches as tractable starting points for scientific agents that discover physical mechanisms while learning how to find the next.

cond-mat.mtrl-sci↗

BEACON: Benefit-Aware Early-Exit for Automatic Modulation Classification via Recoverability Prediction

Convolutional neural networks (CNNs) have emerged as a powerful tool for automatic modulation classification (AMC) by directly extracting discriminative features from raw in-phase and quadrature (I/Q) signals. However, deploying CNN-based AMC models on IoT devices remains challenging because of limited computational resources, energy constraints, and real-time processing requirements. Early-exit (EE) strategies alleviate this burden by allowing qualified samples to terminate inference at an EE branch. However, our empirical analysis reveals a critical limitation of existing confidence-based EE strategies: they predominantly select samples whose early and final predictions are correct and consistent, while failing to capture whether deeper inference can provide a tangible accuracy gain. To address this limitation, we propose BEACON, a Benefit-Aware Early-Exit framework for AMC via recoverability prediction. BEACON introduces a benefit-aware EE criterion that explicitly predicts recoverable errors, defined as instances where the final-exit branch corrects an initial early-branch misclassification. Using only short-branch observables, we design a lightweight benefit-aware predictor (LBAP) to implement this criterion, estimating the likelihood of such recoverable cases and triggering deeper inference only when an accuracy gain is expected. Extensive experiments on ResNet-18-based AMC models demonstrate that the proposed approach consistently outperforms state-of-the-art baselines, achieving a superior accuracy-computation tradeoff across diverse EE threshold settings and signal-to-noise ratio regimes. These findings validate the effectiveness of the benefit-aware criterion and its practicality for energy-efficient on-device AMC under stringent resource constraints.

eess.SP↗

Dissipation-engineered dual-charger quantum batteries

Suppressing coherent energy backflow while maintaining extractable energy in a stable nonequilibrium state remains a central challenge for quantum energy storage. Here, we introduce a reservoir-engineered dual-charger quantum battery architecture, in which nonequilibrium dissipation is exploited as a control resource to stabilize useful stored energy. A hot-reservoir-coupled driver supplies excitations, while a cold-reservoir-coupled cache biases the resonant three-body transition toward charging and suppresses the dressed-state coherences responsible for energy backflow. This mechanism establishes a population-inverted steady state with finite ergotropy and converts reversible charger--battery exchange into persistent energy storage. For uniformly spaced multilevel batteries, we show that the stored energy and ergotropy scale approximately linearly with the number of accessible levels, while the stored-energy utilization approaches unity. The accompanying stationary heat current provides a thermodynamic signature of the charging regime. Our results demonstrate dissipation engineering as a strategy for achieving stable and scalable quantum energy storage beyond transient coherent charging protocols.

quant-ph↗

Digital Twin-Based Cooling System Optimization for Data Center

Data center cooling systems consume significant auxiliary energy, yet optimization studies rarely quantify the gap between theoretically optimal and operationally deployable control strategies. This paper develops a digital twin of the liquid cooling infrastructure at the Frontier exascale supercomputer, in which a hot-temperature water system comprises three parallel subloops, each serving dedicated coolant distribution unit clusters through plate heat exchangers and variable-speed pumps. The surrogate model is built based on Modelica and validated through one full calendar year of 10-minute operational data following ASHRAE Guideline 14. The model achieves a subloop coefficient of variation of the root mean square error below 2.7% and a normalized mean bias error within 2.5%. Using this validated surrogate model, a layered optimization framework evaluates three progressively constrained strategies: an analytical flow-only optimization achieves 20.4% total energy saving, unconstrained joint optimization of flow rate and supply temperature demonstrates 30.1% total energy saving, and ramp-constrained optimization of flow rate and supply temperature, enforcing actuator rate limits, can reach total energy saving of 27.8%. The analysis reveals that the baseline system operates at 2.9 times the minimum thermally safe flow rate, and the co-optimizing supply temperature with flow rate nearly doubles the savings achievable by flow reduction alone.

eess.SY↗