Search arXiv⌕ Search

arXiv subjects

Jiahao Liu

Publications and source records attributed to Jiahao Liu.

At least 73 records · Page 4Linked to original sources

Probabilistic Token Alignment for Large Language Model Fusion

Training large language models (LLMs) from scratch can yield models with unique functionalities and strengths, but it is costly and often leads to redundant capabilities. A more cost-effective alternative is to fuse existing pre-trained LLMs with different architectures into a more powerful model. However, a key challenge in existing model fusion is their dependence on manually predefined vocabulary alignment, which may not generalize well across diverse contexts, leading to performance degradation in several evaluation. To solve this, we draw inspiration from distribution learning and propose the probabilistic token alignment method as a general and soft mapping for alignment, named as PTA-LLM. Our approach innovatively reformulates token alignment into a classic mathematical problem: optimal transport, seamlessly leveraging distribution-aware learning to facilitate more coherent model fusion. Apart from its inherent generality, PTA-LLM exhibits interpretability from a distributional perspective, offering insights into the essence of the token alignment. Empirical results demonstrate that probabilistic token alignment enhances the target model's performance across multiple capabilities. Our code is avaliable at https://runjia.tech/neurips_pta-llm/.

cs.CL↗

LongCat-Flash Technical Report

We introduce LongCat-Flash, a 560-billion-parameter Mixture-of-Experts (MoE) language model designed for both computational efficiency and advanced agentic capabilities. Stemming from the need for scalable efficiency, LongCat-Flash adopts two novel designs: (a) Zero-computation Experts, which enables dynamic computational budget allocation and activates 18.6B-31.3B (27B on average) per token depending on contextual demands, optimizing resource usage. (b) Shortcut-connected MoE, which enlarges the computation-communication overlap window, demonstrating notable gains in inference efficiency and throughput compared to models of a comparable scale. We develop a comprehensive scaling framework for large models that combines hyperparameter transfer, model-growth initialization, a multi-pronged stability suite, and deterministic computation to achieve stable and reproducible training. Notably, leveraging the synergy among scalable architectural design and infrastructure efforts, we complete model training on more than 20 trillion tokens within 30 days, while achieving over 100 tokens per second (TPS) for inference at a cost of \$0.70 per million output tokens. To cultivate LongCat-Flash towards agentic intelligence, we conduct a large-scale pre-training on optimized mixtures, followed by targeted mid- and post-training on reasoning, code, and instructions, with further augmentation from synthetic data and tool use tasks. Comprehensive evaluations demonstrate that, as a non-thinking foundation model, LongCat-Flash delivers highly competitive performance among other leading models, with exceptional strengths in agentic tasks. The model checkpoint of LongCat-Flash is open-sourced to foster community research. LongCat Chat: https://longcat.ai Hugging Face: https://huggingface.co/meituan-longcat GitHub: https://github.com/meituan-longcat

cs.CL↗

Combinatorial Proofs for Overpartitions and Two-Colored Partitions II

Andrews and El Bachraoui recently studied various two-colored integer partitions, including those related to two-colored partitions into distinct parts with constraints and overpartitions. Their work raised questions about the existence of combinatorial proofs for these results, which were partially addressed by the first author and Zou. This paper provides combinatorial proofs for the remaining results concerning two-colored partitions and overpartitions with constraints.

math.CO↗

TCPO: Thought-Centric Preference Optimization for Effective Embodied Decision-making

Using effective generalization capabilities of vision language models (VLMs) in context-specific dynamic tasks for embodied artificial intelligence remains a significant challenge. Although supervised fine-tuned models can better align with the real physical world, they still exhibit sluggish responses and hallucination issues in dynamically changing environments, necessitating further alignment. Existing post-SFT methods, reliant on reinforcement learning and chain-of-thought (CoT) approaches, are constrained by sparse rewards and action-only optimization, resulting in low sample efficiency, poor consistency, and model degradation. To address these issues, this paper proposes Thought-Centric Preference Optimization (TCPO) for effective embodied decision-making. Specifically, TCPO introduces a stepwise preference-based optimization approach, transforming sparse reward signals into richer step sample pairs. It emphasizes the alignment of the model's intermediate reasoning process, mitigating the problem of model degradation. Moreover, by incorporating Action Policy Consistency Constraint (APC), it further imposes consistency constraints on the model output. Experiments in the ALFWorld environment demonstrate an average success rate of 26.67%, achieving a 6% improvement over RL4VLM and validating the effectiveness of our approach in mitigating model degradation after fine-tuning. These results highlight the potential of integrating preference-based learning techniques with CoT processes to enhance the decision-making capabilities of vision-language models in embodied agents.

cs.AI↗

Towards Scalable and Interpretable Mobile App Risk Analysis via Large Language Models

Mobile application marketplaces are responsible for vetting apps to identify and mitigate security risks. Current vetting processes are labor-intensive, relying on manual analysis by security professionals aided by semi-automated tools. To address this inefficiency, we propose Mars, a system that leverages Large Language Models (LLMs) for automated risk identification and profiling. Mars is designed to concurrently analyze multiple applications across diverse risk categories with minimal human intervention. To enhance analytical precision and operational efficiency, Mars leverages a pre-constructed risk identification tree to extract relevant indicators from high-dimensional application features. This initial step filters the data, reducing the input volume for the LLM and mitigating the potential for model hallucination induced by irrelevant features. The extracted indicators are then subjected to LLM analysis for final risk determination. Furthermore, Mars automatically generates a comprehensive evidence chain for each assessment, documenting the analytical process to provide transparent justification. These chains are designed to facilitate subsequent manual review and to inform enforcement decisions, such as application delisting. The performance of Mars was evaluated on a real-world dataset from a partner Android marketplace. The results demonstrate that Mars attained an F1-score of 0.838 in risk identification and an F1-score of 0.934 in evidence retrieval. To assess its practical applicability, a user study involving 20 expert analysts was conducted, which indicated that Mars yielded a substantial efficiency gain, ranging from 60% to 90%, over conventional manual analysis.

cs.CR↗

Libra: Assessing and Improving Reward Model by Learning to Think

Reinforcement learning (RL) has significantly improved the reasoning ability of large language models. However, current reward models underperform in challenging reasoning scenarios and predominant RL training paradigms rely on rule-based or reference-based rewards, which impose two critical limitations: 1) the dependence on finely annotated reference answer to attain rewards; and 2) the requirement for constrained output format. These limitations fundamentally hinder further RL data scaling and sustained enhancement of model reasoning performance. To address these limitations, we propose a comprehensive framework for evaluating and improving the performance of reward models in complex reasoning scenarios. We first present a reasoning-oriented benchmark (Libra Bench), systematically constructed from a diverse collection of challenging mathematical problems and advanced reasoning models, to address the limitations of existing reward model benchmarks in reasoning scenarios. We further introduce a novel approach for improving the generative reward model via learning-to-think methodologies. Based on the proposed approach, we develop Libra-RM series, a collection of generative reward models with reasoning capabilities that achieve state-of-the-art results on various benchmarks. Comprehensive downstream experiments are conducted and the experimental results demonstrate the correlation between our Libra Bench and downstream application, and the potential of Libra-RM to further improve reasoning models with unlabeled data.

cs.CL↗

RoCoF Constrained Regional Inertia Security Region: Formulation and Application

The regional inertia, which determines the regional rate of change of frequency (RoCoF), should be kept in a secure status in renewable-penetrated power systems. To break away from mapping the regional maximum RoCoF with regional inertia in a linearized form, this paper comprehensively studies the regional inertia security problem from formulation to applications. Firstly, the regional inertia security region (R-ISR) is defined, whose boundary is non-linear and non-convex. Then, a local linearized method is devised to calculate the global maximum of regional RoCoF. The non-convex ISR boundary is expressed by multiple simple boundaries corresponding to each local solution, which can be obtained by a simple search-based method. Finally, the convexified R-ISR constraint is formed by convex decomposition and embedded in an inertia optimal adjustment model. The results on a 3-region system show some counter-intuitive findings, such as increasing the inertia of one region may worsen its RoCoF.

eess.SY↗

Revisiting the Effect of Grid-Following Converter on Frequency Dynamics -- Part I: Center of Inertia

Understanding the impact of grid-following (GFL) converters on system frequency dynamics is crucial, from both the center of inertia (COI) and frequency spatial variation perspectives. Part I of this series clarifies the mechanisms by which GFLs influence COI frequency dynamics. A multi-generator model of the power system with GFLs is developed, incorporating the local dynamics of GFLs and their interaction with synchronous generators via virtual tie lines. By aggregating the multi-generator model into the COI frame, the interaction between the COI frequency and the equivalent frequency of GFLs is revealed. The equivalent inertia and other components at the GFL side, determined by control parameters and operating conditions, support the COI through virtual tying power. Simulation validates the accuracy of the proposed modeling and demonstrates that the impact of GFLs on COI frequency is relatively weak. The equivalent inertia and other components of GFLs still significantly influence COI frequency dynamics, with their effects being both time-variable and adjustable.

eess.SY↗

Revisiting the Effect of Grid-Following Converter on Frequency Dynamics -- Part II: Spatial Variation

Besides the center of inertia (COI) frequency dynamics addressed in Part I, the spatial frequency variation in power systems with grid-following (GFL) converters is also crucial. Part II revisits the effect of GFLs on frequency spatial variation. Leveraging the interfacing state variables and equivalent frequency defined in Part I, an extended frequency divider (FD) formula is proposed. The linearized mapping relationship between network node frequency and synchronous generator (SG) rotor frequency, as well as GFL equivalent frequency, is modeled. The superposition contribution from GFLs is determined by the electrical distance between the generator and the frequency observation node, as well as the system power flow conditions. Additionally, the frequency mapping for branch currents, which is overlooked in previous research, is addressed. Simulation results validate the accuracy of the proposed extended FD formula. They quantitatively demonstrate that the superposition contribution of GFLs to node frequency is relatively weak and that the superposition coefficient is time-varying. The branch frequency superposition reveals a complex and distinctly different pattern.

eess.SY↗

A Large-Scale Evolvable Dataset for Model Context Protocol Ecosystem and Security Analysis

The Model Context Protocol (MCP) has recently emerged as a standardized interface for connecting language models with external tools and data. As the ecosystem rapidly expands, the lack of a structured, comprehensive view of existing MCP artifacts presents challenges for research. To bridge this gap, we introduce MCPCorpus, a large-scale dataset containing around 14K MCP servers and 300 MCP clients. Each artifact is annotated with 20+ normalized attributes capturing its identity, interface configuration, GitHub activity, and metadata. MCPCorpus provides a reproducible snapshot of the real-world MCP ecosystem, enabling studies of adoption trends, ecosystem health, and implementation diversity. To keep pace with the rapid evolution of the MCP ecosystem, we provide utility tools for automated data synchronization, normalization, and inspection. Furthermore, to support efficient exploration and exploitation, we release a lightweight web-based search interface. MCPCorpus is publicly available at: https://github.com/Snakinya/MCPCorpus.

cs.CR↗

Symbol letters of Feynman integrals from Gram determinants

Symbol letters are crucial for analytically calculating Feynman integrals in terms of iterated integrals. We present a novel method to construct the symbol letters for a given integral family without prior knowledge of the canonical differential equations. We provide a program package implementing our algorithm, and demonstrate its effectiveness in solving non-trivial problems with multiple loops and legs. Using our method, we successfully bootstrap the canonical differential equations for a two-loop five-point family with two external masses and for a three-loop four-point family with two external masses, which were previously unknown in the literature. We anticipate that our method can be applied to a wide range of cutting-edge calculations in the future.

hep-ph↗

Bootstrapping form factor squared in ${\cal N}=4$ super-Yang-Mills

We propose a bootstrap program for the {\it form factor squared} with operator ${\rm tr}(ϕ^2)$ in maximally supersymmetric Yang-Mills theory in the planar limit, which plays a central role for perturbative calculations of important physical observables such as energy correlators. The tree-level $N$-point form factor (FF) squared can be obtained by cutting $N$ propagators of a collection of two-point ``master diagrams" at $(N{-}1)$ loops: for $N=3,4,5,6$ there are merely $1, 2, 4, 13$ topologies of such diagrams respectively, and their numerators are strongly constrained by power-counting (including ``no triangle" property) and other constraints such as the ``rung rule". Moreover, these two-point diagrams provide a ``unification" of FF squared at different numbers of loops and legs, which is similar to extracting (planar) amplitude squared from vacuum master diagrams (dual to $f$-graphs): by cutting $2\leq n<N$ propagators, one can also extract the planar integrand of $n$-point FF squared at $(N-n)$ loops, thus our results automatically include integrands of 2-point (Sudakov) FF up to four loops (where the squaring is trivial), 3-point FF squared up to three loops, and so on. Our ansatz is completely fixed using soft limits of (tree and loop) FF squared and the multi-collinear limit which reduces it to the splitting function, without any other inputs such as unitarity cuts. This method opens up the exciting possibility of a {\it graphical bootstrap} for FF squared for higher $N$ (which contains {\it e.g.} planar Sudakov FF to $N{-}2$ loops) similar to that for the amplitude squared via $f$-graphs. We also comment on applications to the computation of leading order energy correlators where new structures are expected after performing phase-space integrations.

hep-th↗

Image Restoration Learning via Noisy Supervision in the Fourier Domain

Noisy supervision refers to supervising image restoration learning with noisy targets. It can alleviate the data collection burden and enhance the practical applicability of deep learning techniques. However, existing methods suffer from two key drawbacks. Firstly, they are ineffective in handling spatially correlated noise commonly observed in practical applications such as low-light imaging and remote sensing. Secondly, they rely on pixel-wise loss functions that only provide limited supervision information. This work addresses these challenges by leveraging the Fourier domain. We highlight that the Fourier coefficients of spatially correlated noise exhibit sparsity and independence, making them easier to handle. Additionally, Fourier coefficients contain global information, enabling more significant supervision. Motivated by these insights, we propose to establish noisy supervision in the Fourier domain. We first prove that Fourier coefficients of a wide range of noise converge in distribution to the Gaussian distribution. Exploiting this statistical property, we establish the equivalence between using noisy targets and clean targets in the Fourier domain. This leads to a unified learning framework applicable to various image restoration tasks, diverse network architectures, and different noise models. Extensive experiments validate the outstanding performance of this framework in terms of both quantitative indices and perceptual quality.

eess.IV↗

UAV-Enabled Integrated Sensing and Communication in Maritime Emergency Networks

With line-of-sight mode deployment and fast response, unmanned aerial vehicle (UAV), equipped with the cutting-edge integrated sensing and communication (ISAC) technique, is poised to deliver high-quality communication and sensing services in maritime emergency scenarios. In practice, however, the real-time transmission of ISAC signals at the UAV side cannot be realized unless the reliable wireless fronthaul link between the terrestrial base station and UAV are available. This paper proposes a multicarrier-division duplex based joint fronthaul-access scheme, where mutually orthogonal subcarrier sets are leveraged to simultaneously support four types of fronthaul/access transmissions. In order to maximize the end-to-end communication rate while maintaining an adequate sensing quality-of-service (QoS) in such a complex scheme, the UAV trajectory, subcarrier assignment and power allocation are jointly optimized. The overall optimization process is designed in two stages. As the emergency area is usually far away from the coast, the optimal initial operating position for the UAV is first found. Once the UAV passes the initial operating position, the UAV's trajectory and resource allocation are optimized during the mission period to maximize the end-to-end communication rate under the constraint of minimum sensing QoS. Simulation results demonstrate the effectiveness of the proposed scheme in dealing with the joint fronthaul-access optimization problem in maritime ISAC networks, offering the advantages over benchmark schemes.

eess.SP↗

UAV-Enabled Joint Sensing, Communication, Powering and Backhaul Transmission in Maritime Monitoring Networks

This paper addresses the challenge of energy-constrained maritime monitoring networks by proposing an unmanned aerial vehicle (UAV)-enabled integrated sensing, communication, powering and backhaul transmission scheme with a tailored time-division duplex frame structure. Within each time slot, the UAV sequentially implements sensing, wireless charging and uplink receiving with buoys, and lastly forwards part of collected data to the central ship via backhaul links. Considering the tight coupling among these functions, we jointly optimize time allocation, UAV trajectory, UAV-buoy association, and power scheduling to maximize the performance of data collection, with the practical consideration of sea clutter effects during UAV sensing. A novel optimization framework combining alternating optimization, quadratic transform and augmented first-order Taylor approximation is developed, which demonstrates good convergence behavior and robustness. Simulation results show that under sensing quality-of-service constraint, buoys are able to achieve an average data rate over 22bps/Hz using around 2mW harvested power per active time slot, validating the scheme's effectiveness for open-sea monitoring. Additionally, it is found that under the influence of sea clutters, the optimal UAV trajectory always keeps a certain distance with buoys to strike a balance between sensing and other multi-functional transmissions.

eess.SP↗

Bidirectional Knowledge Distillation for Enhancing Sequential Recommendation with Large Language Models

Large language models (LLMs) have demonstrated exceptional performance in understanding and generating semantic patterns, making them promising candidates for sequential recommendation tasks. However, when combined with conventional recommendation models (CRMs), LLMs often face challenges related to high inference costs and static knowledge transfer methods. In this paper, we propose a novel mutual distillation framework, LLMD4Rec, that fosters dynamic and bidirectional knowledge exchange between LLM-centric and CRM-based recommendation systems. Unlike traditional unidirectional distillation methods, LLMD4Rec enables iterative optimization by alternately refining both models, enhancing the semantic understanding of CRMs and enriching LLMs with collaborative signals from user-item interactions. By leveraging sample-wise adaptive weighting and aligning output distributions, our approach eliminates the need for additional parameters while ensuring effective knowledge transfer. Extensive experiments on real-world datasets demonstrate that LLMD4Rec significantly improves recommendation accuracy across multiple benchmarks without increasing inference costs. This method provides a scalable and efficient solution for combining the strengths of both LLMs and CRMs in sequential recommendation systems.

cs.IR↗

LLM-Based User Simulation for Low-Knowledge Shilling Attacks on Recommender Systems

Recommender systems (RS) are increasingly vulnerable to shilling attacks, where adversaries inject fake user profiles to manipulate system outputs. Traditional attack strategies often rely on simplistic heuristics, require access to internal RS data, and overlook the manipulation potential of textual reviews. In this work, we introduce Agent4SR, a novel framework that leverages Large Language Model (LLM)-based agents to perform low-knowledge, high-impact shilling attacks through both rating and review generation. Agent4SR simulates realistic user behavior by orchestrating adversarial interactions, selecting items, assigning ratings, and crafting reviews, while maintaining behavioral plausibility. Our design includes targeted profile construction, hybrid memory retrieval, and a review attack strategy that propagates target item features across unrelated reviews to amplify manipulation. Extensive experiments on multiple datasets and RS architectures demonstrate that Agent4SR outperforms existing low-knowledge baselines in both effectiveness and stealth. Our findings reveal a new class of emergent threats posed by LLM-driven agents, underscoring the urgent need for enhanced defenses in modern recommender systems.

cs.IR↗

17 GHz Lossless InP-Membrane Active Metasurface

High-speed active metasurfaces enable spatiotemporal control of incident light within an ultra-thin layer, offering new possibilities for optical communication, computing, and sensing. However, a fundamental tradeoff between electrical conductivity and optical absorption of the material has hindered the realization of active metasurfaces that simultaneously achieve broad modulation bandwidth and low optical loss. Here, we experimentally demonstrate a high-speed active metasurface operating in the 1.5-μm wavelength range that realizes a record-high modulation bandwidth of 17.5 GHz, while maintaining a high quality (Q) factor of 102 and an ultra-low optical loss of 0.56 dB. The key enabling technology is the indium-phosphide (InP) membrane platform; an n-type InP offers both high electron mobility and low free-carrier optical absorption, making it an ideal material for active metasurface devices. The high-Q Friedrich-Wintgen quasi-bound-states-in-the-continuum mode inside the InP-membrane high-contrast grating (HCG) is utilized to trap the normally incident light within an organic electro-optic (OEO) material, enabling efficient modulation. InP HCG also serves as an ultralow-resistance interdigitated electrodes for applying high-speed electrical signals to the OEO material, thereby offering 50-fold improvement in modulation bandwidth compared to conventional silicon-based counterparts. Our work paves the way towards high-speed, low-loss active metasurfaces for spatiotemporal control of light beyond the gigahertz regime.

physics.optics↗