Searcharxiv⌕ Search

arXiv subjects

Xiaodong Zhu

Publications and source records attributed to Xiaodong Zhu.

At least 19 recordsLinked to original sources

RecGPT-Mobile-V2 Technical Report

Personalized Query prediction maps implicit behavioral signals---clicks, favorites, purchases, and post-purchase exploration---to explicit retrieval intent. On-device deployment makes this task particularly challenging: behavioral trajectories are noisy and multi-scale, multiple Queries may be valid for a single trajectory, and a uniform reasoning policy either expends unnecessary computation on simple instances or allocates insufficient capacity to complex ones. We introduce RecGPT-Mobile-V2, an end-to-end framework that treats intent quality and execution efficiency as coupled objectives within a staged design. The framework transforms heterogeneous interactions into an evidence-preserving trajectory, establishes a recommendation-native foundation through domain adaptation and supervised alignment, and applies reasoning-cost optimization only after grouped rollouts meet grounding and utility criteria. The resulting teacher is distilled into a compact student deployed with low-bit execution, structured compression, and budget-aware device--cloud routing. In an aligned CoT ablation, an evidence-focused short rationale increases ROUGE-L from 0.228 to 0.315 and Jaccard from 0.174 to 0.248, while slightly outperforming the full five-stage rationale. In the controlled RL comparison, the complete reward formulation improves Query quality from 73.2% under quality-only RL to 78.6%, lowers the hard-failure rate from 3.6% to 1.6%, and reduces the median CoT length from 62 to 14 tokens. Online retrieval analysis further indicates that the Query recall channel retrieves inventory complementary to that surfaced by established recall channels. Collectively, these findings support sufficiency-oriented rather than uniformly short reasoning: retain decision-relevant evidence and allocate additional computation only when it is likely to improve the predicted Query.

cs.IR↗

PILOT Technical Report

Existing agentic approaches for recommendation system optimization remain fundamentally reactive: they adjust parameters in response to observed metric changes but lack the ability to proactively design controlled experiments, personalize strategies at the user-segment level, or accumulate reusable experimental methodology across tasks. We present PILOT (Proactive Insight Learner for Online Tree-Experiments), an LLM-agent framework that organizes three roles within a constrained control loop where deterministic services enforce all safety, statistical, and permission boundaries: (1) an Experiment Manager that drives the full experiment lifecycle -- task intake, observation governance, anomaly recovery, and postmortem -- by selecting only from a rule-generated legal-command envelope; (2) a Search Planner that proposes candidate decision trees for user-segment-level personalization, invoked only when the Manager requests planning; and (3) a Memory Curator that asynchronously distills experiment outcomes into strategy-level domain knowledge and provenance-tracked methodology, failure-isolated from the main loop. The Manager makes the agent proactive, the Planner enables population-level personalization beyond global tuning, and the Curator turns every completed task into a learning opportunity for the next. Deployed on Taobao's platform with 5 experimental buckets, PILOT is compared against ROAM(Reactive Optimization with Agent-driven Moves), a free-exploration agent without lifecycle governance or structured hypothesis testing. PILOT achieves up to +1.40% IPV, +1.60% Core IPV, +0.96% transaction count, and +1.50% transaction amount, improving over ROAM's best results (+1.00% IPV, +0.90% Core IPV, +0.60% transaction count, +1.13% transaction amount) while raising search efficiency from 53.3% to 93.3% (+40 pp), with no human intervention throughout the experimental cycle.

cs.IR↗

DREAM Technical Report

Industrial recommender systems commonly use cascaded retrieval, ranking, and re-ranking pipelines. Although efficient, these pipelines fragment information and objectives across modules, rely on rigid rules, and have limited awareness of real-time intent, leaving session-level shifts among browsing, comparison, and purchase insufficiently addressed. We present DREAM (Developing Recommender Engine with Agentic Methods), an autonomous optimization control architecture that adds a perception-aware, orchestrable, and auditable policy layer atop existing pipelines without replacing them. DREAM has two core components. First, a three-tier Intent Engine fuses on-device signals into structured L0/L1/L2 intent representations; its edge-cloud trigger chain reduces reporting volume to approximately 8.7%. Second, a Meta Engine uses a MetaModel for layered M1-to-M2-to-M3 reasoning: intent summarization, strategy planning informed by Strategy Memory, and parameter translation. It dispatches the resulting parameters through a unified outlet with safety guardrails. A Reward Dual Loop continuously optimizes both components by combining offline simulation for strategy-space exploration with online feedback for outcome calibration, forming a cycle of generation, execution, evaluation, and experience accumulation. Large-scale A/B tests on Taobao's homepage feed show that re-ranking control alone improves IPV by 2.06%, Core IPV by 2.39%, and GMV by 0.88%. Extending control to fine ranking raises these gains to 2.71%, 3.06%, and 1.31%, respectively, while consistently improving PV by more than 1%. These gains require neither replacement of pipeline models nor compromise of serving stability, supporting agentic meta-control as a viable paradigm for industrial recommendation.

cs.IR↗

MetaStrategy: Generative Ranking with Executable LLM Strategies

Industrial recommender systems rank heterogeneous content under coupled user, business, commercial, and experience objectives. Existing generative ranking methods typically construct item sequences directly, making them difficult to integrate with mature predictive models, operational rules, and field-level guardrails. We present MetaStrategy, a framework that instead generates a structured, executable ranking strategy. Conditioned on request context, a large language model (LLM) policy emits a typed JSON bundle controlling objective weights, content and category preferences, experience constraints, and position policies. A deterministic validator and compiler instantiate an isolated Generator that competes atomically with incumbents under the list-level Evaluator of the Generator-Evaluator (GE) architecture. We train the policy in a production-path replay environment that re-executes logged requests through the current re-ranking stack without user exposure. The method combines selection, relative-rank, and baseline-lift rewards, a self-competitive curriculum that feeds frequent strategies back as competitors, and Evaluator-routed reward-augmented on-policy distillation that transfers complementary 4B-parameter Teachers into a compact 0.8B-parameter Student. We deploy MetaStrategy in Taobao Homepage Guess You Like through diff-triggered nearline generation; LLM inference remains outside synchronous ranking, with no observable increase in response time (RT). In a seven-day user-randomized online A/B test, MetaStrategy wins 27.93% of treatment-side GE calls and significantly improves click page views (click PV) by 2.11%, item-detail page views (IPV) by 3.12%, and transaction amount by 2.83%.

cs.IR↗

Riemann-Hilbert problem and long-time asymptotics of the Yajima-Oikawa equation

The Yajima-Oikawa equation is an integrable long wave-short wave resonance interaction model arising as a deformation of the Zakharov system for Langmuir waves coupled to ion-acoustic waves. In this work, a Riemann-Hilbert approach is developed for the Cauchy problem for the Yajima-Oikawa equation with rapidly decaying initial data. A main novelty is the formulation of a direct and inverse scattering theory adapted to its third-order spectral problem, including a detailed treatment of the singular spectral point \(k=0\). The associated Riemann-Hilbert problem is expressed in terms of two reflection coefficients determined by the initial data, together with possible discrete eigenvalues and norming constants. We prove a vanishing lemma which ensures the unique solvability of the Riemann-Hilbert problem under suitable positivity assumptions, and hence obtain a rigorous reconstruction formula for the solution. We also classify the admissible discrete spectrum and derive exact pure soliton solutions from the reflectionless Riemann-Hilbert problem. In the solitonless case, we apply the Deift-Zhou nonlinear steepest descent method to obtain rigorous long-time asymptotic formulas in the different regions of the upper \((x,t)\)-plane. The leading oscillatory behavior of the short-wave component is described explicitly in terms of the reflection coefficients evaluated at the stationary phase points, while the long-wave component is shown to be of lower order away from the transition region. These results provide, to the best of our knowledge, the first Riemann-Hilbert framework for the long-time asymptotic analysis of the Yajima-Oikawa equation in the presence of continuous spectrum.

nlin.SI↗

Long-time asymptotics of the Tzitzéica equation on the line

In this paper, the renowned Riemann-Hilbert method is employed to investigate the initial value problem of Tzitzéica equation on the line. Initially, our analysis focuses on elucidating the properties of two reflection coefficients, which are determined by the initial values. Subsequently, leveraging these reflection coefficients, we construct a Riemann-Hilbert problem that is a powerful tool to articulate the solution of the Tzitzéica equation. Finally, the nonlinear steepest descent method is applied to the oscillatory Riemann-Hilbert problem, which enables us to delineate the long-time asymptotic behaviors of solutions to the Tzitzéica equation across various regions. Moreover, it is shown that the leading-order terms of asymptotic formulas match well with direct numerical simulations.

math-ph↗

Genus two KdV soliton gases and their long-time asymptotics

This paper employs the Riemann-Hilbert problem to provide a comprehensive analysis of the asymptotic behavior of the high-genus Korteweg-de Vries soliton gases. It is demonstrated that the two-genus soliton gas is related to the two-phase Riemann-Theta function as \(x \to +\infty\), and approaches to zero as \(x \to -\infty\). Additionally, the long-time asymptotic behavior of this two-genus soliton gas can be categorized into five distinct regions in the \(x\)-\(t\) plane, which from left to right are rapidly decay, modulated one-phase wave, unmodulated one-phase wave, modulated two-phase wave, and unmodulated two-phase wave. Moreover, an innovative method is introduced to solve the model problem associated with the high-genus Riemann surface, leading to the determination of the leading terms, which is also related with the multi-phase Riemann-Theta function. A general discussion on the case of arbitrary \(N\)-genus soliton gas is also presented.

nlin.SI↗

DeformTrace: A Deformable State Space Model with Relay Tokens for Temporal Forgery Localization

Temporal Forgery Localization (TFL) aims to precisely identify manipulated segments in video and audio, offering strong interpretability for security and forensics. While recent State Space Models (SSMs) show promise in precise temporal reasoning, their use in TFL is hindered by ambiguous boundaries, sparse forgeries, and limited long-range modeling. We propose DeformTrace, which enhances SSMs with deformable dynamics and relay mechanisms to address these challenges. Specifically, Deformable Self-SSM (DS-SSM) introduces dynamic receptive fields into SSMs for precise temporal localization. To further enhance its capacity for temporal reasoning and mitigate long-range decay, a Relay Token Mechanism is integrated into DS-SSM. Besides, Deformable Cross-SSM (DC-SSM) partitions the global state space into query-specific subspaces, reducing non-forgery information accumulation and boosting sensitivity to sparse forgeries. These components are integrated into a hybrid architecture that combines the global modeling of Transformers with the efficiency of SSMs. Extensive experiments show that DeformTrace achieves state-of-the-art performance with fewer parameters, faster inference, and stronger robustness.

cs.CV↗

GEM-TFL: Bridging Weak and Full Supervision for Forgery Localization through EM-Guided Decomposition and Temporal Refinement

Temporal Forgery Localization (TFL) aims to precisely identify manipulated segments within videos or audio streams, providing interpretable evidence for multimedia forensics and security. While most existing TFL methods rely on dense frame-level labels in a fully supervised manner, Weakly Supervised TFL (WS-TFL) reduces labeling cost by learning only from binary video-level labels. However, current WS-TFL approaches suffer from mismatched training and inference objectives, limited supervision from binary labels, gradient blockage caused by non-differentiable top-k aggregation, and the absence of explicit modeling of inter-proposal relationships. To address these issues, we propose GEM-TFL (Graph-based EM-powered Temporal Forgery Localization), a two-phase classification-regression framework that effectively bridges the supervision gap between training and inference. Built upon this foundation, (1) we enhance weak supervision by reformulating binary labels into multi-dimensional latent attributes through an EM-based optimization process; (2) we introduce a training-free temporal consistency refinement that realigns frame-level predictions for smoother temporal dynamics; and (3) we design a graph-based proposal refinement module that models temporal-semantic relationships among proposals for globally consistent confidence estimation. Extensive experiments on benchmark datasets demonstrate that GEM-TFL achieves more accurate and robust temporal forgery localization, substantially narrowing the gap with fully supervised methods.

cs.CV↗

Direct Scattering for the KdV Equation with a Step-like Finite-Gap Potential: A Riemann--Hilbert Approach

We develop the direct scattering theory for the KdV equation with step-like finite-gap backgrounds under perturbations. More precisely, we consider initial data that asymptotically approach two distinct one-gap periodic travelling wave solutions as \(x \to \pm \infty\). Under suitable assumptions on the perturbation, we formulate the direct scattering problem and establish the analytic structure of the associated scattering data. In particular, we reformulate the problem in terms of a vector Riemann--Hilbert problem, which provides a foundation for the study of long-time asymptotics of perturbed finite-gap potentials. This formulation highlights the connection between step-like finite-gap scattering theory and the Riemann--Hilbert framework arising in soliton-gas type settings.

math.AP↗

Long-time asymptotics of the Sawada-Kotera equation on the line

The Sawada-Kotera (SK) equation is an integrable system characterized by a third-order Lax operator and is related to the modified Sawada-Kotera (mSK) equation through a Miura transformation. This work formulates the Riemann-Hilbert problem associated with the SK and mSK equations by using direct and inverse scattering transforms. The long-time asymptotic behaviors of the solutions to these equations are then analyzed via the Deift-Zhou steepest descent method for Riemann-Hilbert problems. It is shown that the asymptotic solutions of the SK and mSK equations are categorized into four distinct regions: the decay region, the dispersive wave region, the Painlevé region, and the rapid decay region. Notably, the Painlevé region is governed by the F-XVIII equation in the Painlevé classification of fourth-order ordinary differential equations, a fourth-order analogue of the Painlevé transcendents. This connection is established through the Riemann-Hilbert formulation in this work. Similar to the KdV equation, the SK equation exhibits a transition region between the dispersive wave and Painlevé regions, arising from the special values of the reflection coefficients at the origin. Finally, numerical comparisons demonstrate that the asymptotic solutions agree excellently with results from direct numerical simulations.

nlin.SI↗

Long-time asymptotics of the good Boussinesq equation and its modified version: Painlevé region

This work investigates the long-time asymptotic behaviors of initial value problem for the good Boussinesq equation and the modified Boussinesq equation in Painlevé region. The Deift-Zhou steepest descent method is used to deform the associated $3 \times 3$ Riemann-Hilbert problem to the Painlevé IV model. Then asymptotic formulas for the modified Boussinesq equation in both the Painlevé region and the Painlevé transition region are derived, characterized by the Clarkson-McLeod solution of the Painlevé IV equation. Additionally, the leading-order term of the good Boussinesq equation in Painlevé region is obtained via the Miura transformation. The theoretical asymptotic solutions are validated against direct numerical simulations, confirming the accuracy of the asymptotic analysis.

math.AP↗

Finite-Alphabet-Aware Trajectory and Precoder Optimization for UAV Relaying

Unmanned aerial vehicles (UAVs) have become key enablers in relay-assisted wireless communications thanks to their flexibility and line-of-sight channel advantage. However, most existing trajectory optimization frameworks assume ideal Gaussian inputs, overlooking the fact that practical wireless systems rely on structured, finite-alphabet constellations. This mismatch can lead to suboptimal, and sometimes misleading, design choices. In this paper, we challenge that convention by introducing a finite-alphabet-aware framework for joint trajectory and precoder optimization in UAV-assisted relay systems. We formulate a non-convex design problem that directly accounts for discrete signal structures and propose an efficient solution based on alternating optimization and successive convex approximation. Simulation results reveal that strategies optimized under Gaussian assumptions can waste energy and degrade throughput in real deployments. In contrast, our approach adapts both the UAV's trajectory and transmission strategy to the underlying modulation format, delivering consistent performance gains under practical system constraints. This work takes a key step toward aligning UAV communication design with the realities of modern wireless systems: discrete signals, power limits, and intelligent mobility.

cs.IT↗

Miura transformations and large-time behaviors of the Hirota-Satsuma equation

The good Boussinesq equation has several modified versions such as the modified Boussinesq equation, Mikhailov-Lenells equation and Hirota-Satsuma equation. This work builds the full relations among these equations by Miura transformation and invertible linear transformations and draws a pyramid diagram to demonstrate such relations. The direct and inverse spectral analysis shows that the solution of Riemann-Hilbert problem for Hirota-Satsuma equation has simple pole at origin, the solution of Riemann-Hilbert problem for the good Boussinesq equation has double pole at origin, while the solution of Riemann-Hilbert problem for the modified Boussinesq equation and Mikhailov-Lenells equation doesn't have singularity at origin. Further, the large-time asymptotic behaviors of the Hirota-Satsuma equation with Schwartz class initial value is studied by Deift-Zhou nonlinear steepest descent analysis. In such initial condition, the asymptotic expressions of the Hirota-Satsuma equation and good Boussinesq equation away from the origin are derived and it is shown that the leading term of asymptotic formulas matches well the direct numerical simulations.

nlin.SI↗

Optimal Trade and Industrial Policies in the Global Economy: A Deep Learning Framework

We propose a deep learning framework, DL-opt, designed to efficiently solve for optimal policies in quantifiable general equilibrium trade models. DL-opt integrates (i) a nested fixed point (NFXP) formulation of the optimization problem, (ii) automatic implicit differentiation to enhance gradient descent for solving unilateral optimal policies, and (iii) a best-response dynamics approach for finding Nash equilibria. Utilizing DL-opt, we solve for non-cooperative tariffs and industrial subsidies across 7 economies and 44 sectors, incorporating sectoral external economies of scale. Our quantitative analysis reveals significant sectoral heterogeneity in Nash policies: Nash industrial subsidies increase with scale elasticities, whereas Nash tariffs decrease with trade elasticities. Moreover, we show that global dual competition, involving both tariffs and industrial subsidies, results in lower tariffs and higher welfare outcomes compared to a global tariff war. These findings highlight the importance of considering sectoral heterogeneity and policy combinations in understanding global economic competition.

econ.GN↗

Beyond Accuracy: An Empirical Study on Unit Testing in Open-source Deep Learning Projects

Deep Learning (DL) models have rapidly advanced, focusing on achieving high performance through testing model accuracy and robustness. However, it is unclear whether DL projects, as software systems, are tested thoroughly or functionally correct when there is a need to treat and test them like other software systems. Therefore, we empirically study the unit tests in open-source DL projects, analyzing 9,129 projects from GitHub. We find that: 1) unit tested DL projects have positive correlation with the open-source project metrics and have a higher acceptance rate of pull requests, 2) 68% of the sampled DL projects are not unit tested at all, 3) the layer and utilities (utils) of DL models have the most unit tests. Based on these findings and previous research outcomes, we built a mapping taxonomy between unit tests and faults in DL projects. We discuss the implications of our findings for developers and researchers and highlight the need for unit testing in open-source DL projects to ensure their reliability and stability. The study contributes to this community by raising awareness of the importance of unit testing in DL projects and encouraging further research in this area.

cs.SE↗

Long-time asymptotics of the Sawada-Kotera equation and Kaup-Kupershmidt equation on the line

Both Sawada-Kotera (SK) equation and Kaup-Kupershmidt (KK) equation are integrable systems with third-order Lax operator. Moreover, they are related with the same modified nonlinear equation (called modified SK-KK equation) by Miura transformations. This work first constructs the Riemann-Hilbert problem associated with the SK equation, KK equation and modified SK-KK equation by direct and inverse scattering transforms. Then the long-time asymptotics of these equations are studied based on Deift-Zhou steepest-descent method for Riemann-Hilbert problem. Finally, it is shown that the asymptotic solutions match very well with the results of direct numerical simulations.

nlin.SI↗

GUIGAN: Learning to Generate GUI Designs Using Generative Adversarial Networks

Graphical User Interface (GUI) is ubiquitous in almost all modern desktop software, mobile applications, and online websites. A good GUI design is crucial to the success of the software in the market, but designing a good GUI which requires much innovation and creativity is difficult even to well-trained designers. Besides, the requirement of the rapid development of GUI design also aggravates designers' working load. So, the availability of various automated generated GUIs can help enhance the design personalization and specialization as they can cater to the taste of different designers. To assist designers, we develop a model GUIGAN to automatically generate GUI designs. Different from conventional image generation models based on image pixels, our GUIGAN is to reuse GUI components collected from existing mobile app GUIs for composing a new design that is similar to natural-language generation. Our GUIGAN is based on SeqGAN by modeling the GUI component style compatibility and GUI structure. The evaluation demonstrates that our model significantly outperforms the best of the baseline methods by 30.77% in Frechet Inception distance (FID) and 12.35% in 1-Nearest Neighbor Accuracy (1-NNA). Through a pilot user study, we provide initial evidence of the usefulness of our approach for generating acceptable brand new GUI designs.

cs.HC↗