Searcharxiv⌕ Search

arXiv subjects

Li Li

Publications and source records attributed to Li Li.

At least 127 records · Page 7Linked to original sources

Human-Aligned MLLM Judges for Fine-Grained Image Editing Evaluation: A Benchmark, Framework, and Analysis

Evaluating image editing models remains challenging due to the coarse granularity and limited interpretability of traditional metrics, which often fail to capture aspects important to human perception and intent. Such metrics frequently reward visually plausible outputs while overlooking controllability, edit localization, and faithfulness to user instructions. In this work, we introduce a fine-grained Multimodal Large Language Model (MLLM)-as-a-Judge framework for image editing that decomposes common evaluation notions into twelve fine-grained interpretable factors spanning image preservation, edit quality, and instruction fidelity. Building on this formulation, we present a new human-validated benchmark that integrates human judgments, MLLM-based evaluations, model outputs, and traditional metrics across diverse image editing tasks. Through extensive human studies, we show that the proposed MLLM judges align closely with human evaluations at a fine granularity, supporting their use as reliable and scalable evaluators. We further demonstrate that traditional image editing metrics are often poor proxies for these factors, failing to distinguish over-edited or semantically imprecise outputs, whereas our judges provide more intuitive and informative assessments in both offline and online settings. Together, this work introduces a benchmark, a principled factorization, and empirical evidence positioning fine-grained MLLM judges as a practical foundation for studying, comparing, and improving image editing approaches.

cs.CV↗

Towards Context-aware Reasoning-enhanced Generative Searching in E-commerce

Search-based recommendation is one of the most critical application scenarios in e-commerce platforms. Users' complex search contexts--such as spatiotemporal factors, historical interactions, and current query's information--constitute an essential part of their decision-making, reflecting implicit preferences that complement explicit query terms. Modeling such rich contextual signals and their intricate associations with candidate items remains a key challenge. Although numerous efforts have been devoted to building more effective search methods, existing approaches still show limitations in integrating contextual information, which hinders their ability to fully capture user intent. To address these challenges, we propose a context-aware reasoning-enhanced generative search framework for better \textbf{understanding the complicated context}. Specifically, the framework first unifies heterogeneous user and item contexts into textual representations or text-based semantic identifiers and aligns them. To overcome the lack of explicit reasoning trajectories, we introduce a self-evolving post-training paradigm that iteratively combines supervised fine-tuning and reinforcement learning to progressively enhance the model's reasoning capability. In addition, we identify potential biases in existing RL algorithms when applied to search scenarios and present a debiased variant of GRPO to improve ranking performance. Extensive experiments on search log data collected from a real-world e-commerce platform demonstrate that our approach achieves superior performance compared with strong baselines, validating its effectiveness for search-based recommendation.

cs.IR↗

Context-Sensitive Pointer Analysis for ArkTS

Current call graph generation methods for ArkTS, a new programming language for OpenHarmony, exhibit precision limitations when supporting advanced static analysis tasks such as data flow analysis and vulnerability pattern detection, while the workflow of traditional JavaScript(JS)/TypeScript(TS) analysis tools fails to interpret ArkUI component tree semantics. The core technical bottleneck originates from the closure mechanisms inherent in TypeScript's dynamic language features and the interaction patterns involving OpenHarmony's framework APIs. Existing static analysis tools for ArkTS struggle to achieve effective tracking and precise deduction of object reference relationships, leading to topological fractures in call graph reachability and diminished analysis coverage. This technical limitation fundamentally constrains the implementation of advanced program analysis techniques. Therefore, in this paper, we propose a tool named ArkAnalyzer Pointer Analysis Kit (APAK), the first context-sensitive pointer analysis framework specifically designed for ArkTS. APAK addresses these challenges through a unique ArkTS heap object model and a highly extensible plugin architecture, ensuring future adaptability to the evolving OpenHarmony ecosystem. In the evaluation, we construct a dataset from 1,663 real-world applications in the OpenHarmony ecosystem to evaluate APAK, demonstrating APAK's superior performance over CHA/RTA approaches in critical metrics including valid edge coverage (e.g., a 7.1% reduction compared to CHA and a 34.2% increase over RTA). The improvement in edge coverage systematically reduces false positive rates from 20% to 2%, enabling future exploration of establishing more complex program analysis tools based on our framework. Our proposed APAK has been merged into the official static analysis framework ArkAnalyzer for OpenHarmony.

cs.SE↗

Recent Advances of End-to-End Video Coding Technologies for AVS Standard Development

Video coding standards are essential to enable the interoperability and widespread adoption of efficient video compression technologies. In pursuit of greater video compression efficiency, the AVS video coding working group launched the standardization exploration of end-to-end intelligent video coding, establishing the AVS End-to-End Intelligent Video Coding Exploration Model (AVS-EEM) project. A core design principle of AVS-EEM is its focus on practical deployment, featuring inherently low computational complexity and requiring strict adherence to the common test conditions of conventional video coding. This paper details the development history of AVS-EEM and provides a systematic introduction to its key technical framework, covering model architectures, training strategies, and inference optimizations. These innovations have collectively driven the project's rapid performance evolution, enabling continuous and significant gains under strict complexity constraints. Through over two years of iterative refinement and collaborative effort, the coding performance of AVS-EEM has seen substantial improvement. Experimental results demonstrate that its latest model achieves superior compression efficiency compared to the conventional AVS3 reference software, marking a significant step toward a deployable intelligent video coding standard.

eess.IV↗

HPC: Hierarchical Point-based Latent Representation for Streaming Dynamic Gaussian Splatting Compression

While dynamic Gaussian Splatting has driven significant advances in free-viewpoint video, maintaining its rendering quality with a small memory footprint for efficient streaming transmission still presents an ongoing challenge. Existing streaming dynamic Gaussian Splatting compression methods typically leverage a latent representation to drive the neural network for predicting Gaussian residuals between frames. Their core latent representations can be categorized into structured grid-based and unstructured point-based paradigms. However, the former incurs significant parameter redundancy by inevitably modeling unoccupied space, while the latter suffers from limited compactness as it fails to exploit local correlations. To relieve these limitations, we propose HPC, a novel streaming dynamic Gaussian Splatting compression framework. It employs a hierarchical point-based latent representation that operates on a per-Gaussian basis to avoid parameter redundancy in unoccupied space. Guided by a tailored aggregation scheme, these latent points achieve high compactness with low spatial redundancy. To improve compression efficiency, we further undertake the first investigation to compress neural networks for streaming dynamic Gaussian Splatting through mining and exploiting the inter-frame correlation of parameters. Combined with latent compression, this forms a fully end-to-end compression framework. Comprehensive experimental evaluations demonstrate that HPC substantially outperforms state-of-the-art methods. It achieves a storage reduction of 67% against its baseline while maintaining high reconstruction fidelity.

cs.CV↗

Beyond Kasner Epochs: Ordered Oscillations and Spike Dynamics Inside Black Holes with Higher-Derivative Corrections

Building upon the long-standing paradigm that dynamics near a spacelike singularity are governed by a sequence of Kasner epochs, we demonstrate that this picture is fundamentally altered when higher-curvature or quantum gravitational corrections are included. By incorporating such terms alongside a minimally coupled scalar field, we discover three distinct dynamical phases near the singularity: modified Kasner eons, persistent periodic oscillations, and oscillatory spike dynamics with growing amplitude. In particular, the Kasner-like geometry persisting only in highly constrained situations. The latter two regimes represent a clean departure from classical Kasner phenomenology, revealing a richer and more ordered landscape of behaviors in the deep interior of black holes beyond Einstein gravity. This work establishes a comprehensive approach for understanding the gravitational nonlinearity in the most extreme gravitational environment.

gr-qc↗

CMOOD: Concept-based Multi-label OOD Detection

How can models effectively detect out-of-distribution (OOD) samples in complex, multi-label settings without extensive retraining? Existing OOD detection methods struggle to capture the intricate semantic relationships and label co-occurrences inherent in multi-label settings, often requiring large amounts of training data and failing to generalize to unseen label combinations. While large language models have revolutionized zero-shot OOD detection, they primarily focus on single-label scenarios, leaving a critical gap in handling real-world tasks where samples can be associated with multiple interdependent labels. To address these challenges, we introduce COOD, a novel zero-shot multi-label OOD detection framework. COOD leverages pre-trained vision-language models, enhancing them with a concept-based label expansion strategy and a new scoring function. By enriching the semantic space with both positive and negative concepts for each label, our approach models complex label dependencies, precisely differentiating OOD samples without the need for additional training. Extensive experiments demonstrate that our method significantly outperforms existing approaches, achieving approximately 95% average AUROC on both VOC and COCO datasets, while maintaining robust performance across varying numbers of labels and different types of OOD samples.

cs.CV↗

Neural Ordinary Differential Equations for Mapping the Magnetic QCD Phase Diagram via Holography

The QCD phase diagram is crucial for understanding strongly interacting matter under extreme conditions, with major implications for cosmology, neutron stars, and heavy-ion collisions. We present a novel holographic QCD model utilizing neural ordinary differential equations (ODEs) to map the QCD phase diagram under magnetic field $B$, baryon chemical potential $μ_B$, and temperature $T$. By solving the inverse problem of constructing a gravitational theory from Lattice QCD data, we reveal an unprecedentedly rich phase structure at finite $B$, including multiple critical endpoints (CEPs) in strong magnetic fields. Specifically, for {$B = 1.618 \, \mathrm{GeV}^2=2.592 \times 10^{19}$ Gauss}, we identify two distinct CEPs at $(T_C = 87.3 \, \mathrm{MeV}, \, μ_C = 115.9 \, \mathrm{MeV})$ and $(T_C = 78.9 \, \mathrm{MeV}, \, μ_C = 244.0 \, \mathrm{MeV})$. Notably, the critical exponents vary depending on the CEP's location, and the conventional scaling relations can be violated in the presence of strong magnetic fields. These findings significantly advance our understanding of the QCD phase structure and provide concrete predictions for experimental validation at upcoming facilities such as FAIR, JPARC-HI, and NICA.

hep-th↗

CooperLLM: Cloud-Edge-End Cooperative Federated Fine-tuning for LLMs via ZOO-based Gradient Correction

Large Language Models (LLMs) perform well on many NLP tasks, but fine-tuning them on resource-constrained mobile devices is challenging due to high memory and computation costs, despite growing demands for privacy-preserving personalization. Federated Learning (FL) enables local-data training, yet existing methods either rely on memory-intensive backpropagation or use zeroth-order optimization (ZOO), which avoids backward passes but suffers from slow convergence and degraded accuracy. We propose CooperLLM, a cloud-assisted edge-end cooperative federated fine-tuning framework that combines ZOO on mobile devices with cloud-guided gradient rectification. Mobile clients perform lightweight ZOO updates on private data, while the cloud fine-tunes on auxiliary public data using backpropagation and injects guided perturbations to rectify local updates, improving convergence and accuracy without violating privacy. To address system bottlenecks, CooperLLM introduces pipeline scheduling and adaptive compression to overlap computation and communication and reduce memory usage. Experiments on multiple Transformer models and datasets show that CooperLLM reduces on-device memory by up to $86.4\%$, accelerates convergence by $8.8 \times$, and improves accuracy by up to 10 percentage points over state-of-the-art ZOO-based baselines.

cs.LG↗

OpenACM: An Open-Source SRAM-Based Approximate CiM Compiler

The rise of data-intensive AI workloads has exacerbated the ``memory wall'' bottleneck. Digital Compute-in-Memory (DCiM) using SRAM offers a scalable solution, but its vast design space makes manual design impractical, creating a need for automated compilers. A key opportunity lies in approximate computing, which leverages the error tolerance of AI applications for significant energy savings. However, existing DCiM compilers focus on exact arithmetic, failing to exploit this optimization. This paper introduces OpenACM, the first open-source, accuracy-aware compiler for SRAM-based approximate DCiM architectures. OpenACM bridges the gap between application error tolerance and hardware automation. Its key contribution is an integrated library of accuracy-configurable multipliers (exact, tunable approximate, and logarithmic), enabling designers to make fine-grained accuracy-energy trade-offs. The compiler automates the generation of the DCiM architecture, integrating a transistor-level customizable SRAM macro with variation-aware characterization into a complete, open-source physical design flow based on OpenROAD and the FreePDK45 library. This ensures full reproducibility and accessibility, removing dependencies on proprietary tools. Experimental results on representative convolutional neural networks (CNNs) demonstrate that OpenACM achieves energy savings of up to 64\% with negligible loss in application accuracy. The framework is available on \href{https://github.com/ShenShan123/OpenACM}{OpenACM:URL}

cs.AR↗

First Submillimeter Lights from Dome A: Tracing the Carbon Cycle in the Feedback of Massive Stars

The cycling of carbon between its ionized, atomic, and molecular phases shapes the chemical compositions and physical conditions of the interstellar medium (ISM). However, ground-based studies of the full carbon cycle have been limited by atmospheric absorption. Dome~A, the most promising site for submillimeter astronomy, has long resisted successful submillimeter astronomical observations. Using the 60~cm Antarctic Terahertz Explorer, we present the first successful CO ($4-3$) and [CI] ($^3P_1 - ^3P_0$) mapping observations of two archetypal triggered massive star-formation regions at Dome~A. These data, together with archival [CII], provide the first complete characterization of all three carbon phases in these environments. We find elevated C$^{0}$/CO abundance ratios in high-extinction regions, plausibly driven by deep penetration of intense radiation fields from massive stars into a clumpy ISM. These findings mark a major milestone for submillimeter astronomy at Dome~A and offer valuable insights into the impact of massive star feedback on the surrounding ISM.

astro-ph.GA↗

Entanglement Detection with Variational Quantum Interference: Theory and Experiment

Entanglement detection is a fundamental task in quantum information science, serving as a cornerstone for quantum benchmarking and foundational studies. With an increasing qubit number that can be effectively controlled, there is a pressing need for a scalable and robust detection protocol which requires minimal resources while maintaining high detection capability. By integrating the Positive Partial Transposition criterion with variational quantum interference, we propose an entanglement detection protocol that requires moderate classical and quantum computation resources. We numerically show that this protocol achieves a high detection capability with shallow quantum circuits, surpassing some widely-used entanglement detection methods. The protocol also exhibits strong resilience to circuit noise, ensuring its applicability across different physical platforms. We further demonstrate the protocol experimentally on an eight-photon linear-optical platform, where it successfully detects the entanglement of a three-qubit mixed state that is inaccessible to conventional entanglement witnesses. By combining quantum interference with classical optimization, our protocol provides a scalable and resource-efficient route toward practical entanglement detection.

quant-ph↗

Counterflow and coflow instabilities in miscible binary superfluids

We explore instabilities in binary superfluids with a nonvanishing relative superflow, particularly focusing on counterflow and coflow instabilities. We extend recent results on the thermodynamic origin of finite superflow instabilities in single-component superfluids to binary systems and derive a criterion for the onset of instability through a hydrodynamic analysis, which applies to interacting many-body systems at finite temperature. We find that the onset of these instabilities is signaled by the determinant of the Hessian of the thermal free energy diverging and changing sign. We verify this hydrodynamic prediction in a holographic binary superfluid modeled with gauge/gravity duality, which naturally incorporates strong coupling, finite temperature, and dissipation. We also compare to results obtained using the Gross-Pitaevskii equation for weakly interacting Bose-Einstein condensates and find that the same criterion continues to apply at zero temperature, where it reduces to evaluating derivatives of the supercurrents with respect to the superfluid velocities. We observe that the critical velocities of these instabilities follow a general scaling law related to the interaction strength between superfluid components. Finally, the nonlinear stages of the instabilities are studied by full time evolution using gauge/gravity duality, where vortex annihilation leads to a decrease of superfluid velocity back to a value where the binary superfluid phase is stable.

hep-th↗

Hash Grid Feature Pruning

Hash grids are widely used to learn an implicit neural field for Gaussian splatting, serving either as part of the entropy model or for inter-frame prediction. However, due to the irregular and non-uniform distribution of Gaussian splats in 3D space, numerous sparse regions exist, rendering many features in the hash grid invalid. This leads to redundant storage and transmission overhead. In this work, we propose a hash grid feature pruning method that identifies and prunes invalid features based on the coordinates of the input Gaussian splats, so that only the valid features are encoded. This approach reduces the storage size of the hash grid without compromising model performance, leading to improved rate-distortion performance. Following the Common Test Conditions (CTC) defined by the standardization committee, our method achieves an average bitrate reduction of 8% compared to the baseline approach.

cs.CV↗

The well-posedness of three-dimensional Navier-Stokes and magnetohydrodynamic equations with partial fractional dissipation

It is well-known that if one replaces standard velocity and magnetic dissipation by $(-Δ)^αu$ and $(-Δ)^βb$ respectively, the magnetohydrodynamic equations are well-posed for $α\ge\frac{5}{4}$ and $α+ β\ge \frac{5}{2}$. This paper considers the 3D Navier-Stokes and magnetohydrodynamic equations with partial fractional hyper-dissipation. It is proved that when each component of the velocity and magnetic field lacks dissipation along some direction, the existence and conditional uniqueness of the solution still hold. This paper extends the previous results in (Yang, Jiu and Wu J. Differential Equations 266(1): 630-652, 2019) to a more general case.

math.AP↗

Rigidity for homogeneous solutions to the two-dimensional Euler equations in sector-type domains

We study the rigidity problem for $(-α)$-homogeneous solutions to the two-dimensional incompressible stationary Euler equations in sector-type domains $Ω_{a, b, θ_0}:= \{(r,θ): a 0$, and $b = +\infty$ or $b < +\infty$, we show that if a solution satisfies some homogeneity assumptions on the boundary of $Ω_{a, b, θ_0}$ and if the radial or angular component of the velocity does not vanish in $\overline{Ω_{a, b, θ_0}}\setminus\{\bm{0}\}$, then it must be homogeneous throughout $\overline{Ω_{a, b, θ_0}}\setminus\{\bm{0}\}$.

math.AP↗

Revisiting the field normalization approaches/practices

Field normalization plays a crucial role in scientometrics to ensure fair comparisons across different disciplines. In this paper, we revisit the effectiveness of several widely used field normalization methods. Our findings indicate that source-side normalization (as employed in SNIP) does not fully eliminate citation bias across different fields and the imbalanced paper growth rates across fields are a key factor for this phenomenon. To address the issue of skewness, logarithmic transformation has been applied. Recently, a combination of logarithmic transformation and mean-based normalization, expressed as ln(c+1)/mu, has gained popularity. However, our analysis shows that this approach does not yield satisfactory results. Instead, we find that combining logarithmic transformation (ln(c+1)) with z-score normalization provides a better alternative. Furthermore, our study suggests that the better performance is achieved when combining both source-side and target-side field normalization methods.

cs.DL↗

Black hole interiors of homogeneous holographic solids under shear strain

We investigate the interior of AdS black holes under finite shear strain in a class of holographic axion models, which are widely used to describe strongly-coupled systems with broken translations. We demonstrate that the shear anisotropy necessarily eliminates the inner Cauchy horizon, such that the deformed black hole approaches a spacelike singularity. The anisotropic effect induced by the axion fields triggers a collapse of the Einstein-Rosen bridge at the would-be Cauchy horizon, accompanied by a rapid change in the anisotropy of the spatial geometry. In addition, for a power-law axion potential, sufficiently large shear deformations give rise to a domain wall solution that includes a Lifshitz like scaling geometry near the boundary as well as a near horizon Kasner epoch with the Kasner exponents determined by the powers of the potential. Finally, we find that the interior dynamics of black holes generally enter an era described by an anisotropic Kasner universe at later interior time. Depending on the form of the potential, they either tend to stable Kasner universes, or exhibit an endless alternation of different Kasner epochs toward the singularity.

hep-th↗