SearcharxivSearch

arXiv subjects

Yingfang Zhang

Publications and source records attributed to Yingfang Zhang.

9 recordsLinked to original sources

ROAST: Rollout-based On-distribution Activation Steering Technique

Activation steering provides parameter-efficient control over large language models (LLMs) at inference time, but many methods rely on off-distribution supervision and discrete masking, leading to brittle interventions. We propose ROAST (Rollout-based On-distribution Activation Steering Technique), which estimates steering directions from the model's own on-distribution rollouts via ROC and avoids hard sparsification via Continuous Soft Scaling (CSS) and Grouped Mean Normalization. Our empirical analysis reveals that while activation magnitude correlates moderately with directional consistency, the variance in magnitude is significant and often disproportionate to semantic quality. This suggests that high-magnitude activations risk dominating the global steering direction if not properly normalized. To address this, ROAST employs grouped normalization to balance contributions across samples, ensuring a more robust estimation of the consensus steering direction. Across models (0.6B to 32B), ROAST consistently improves performance on diverse tasks (e.g., +9.7% on GSM8K for Qwen3-0.6B and +12.1% on TruthfulQA for GLM4-32B), and analyses show that CSS better preserves activation energy.

cs.LG

Bivariate Hardy-Sobolev Inequality and Its Sharp Stability

This paper establishes a bivariate Hardy-Sobolev inequality. Let $\Omega \subset \mathbb{R}^N$ ($N \geq 3$) be an open domain, $s \in (0,2)$, $\alpha > 1$, $\beta > 1$ with $\alpha + \beta = 2^*(s)$, and $\kappa \in \mathbb{R}$. For any functions $u, v \in D_0^{1,2}(\Omega)$, we prove the inequality: \begin{multline*} \int_{\Omega} |\nabla u|^2 \, \mathrm{d}x + \int_{\Omega} |\nabla v|^2 \, \mathrm{d}x \ge S_{\alpha,\beta,\lambda,\mu}(\Omega) \left( \int_{\Omega} \Big( \lambda \frac{|u|^{2^*(s)}}{|x|^s} + \mu \frac{|v|^{2^*(s)}}{|x|^s} + 2^*(s) \kappa \frac{|u|^\alpha |v|^\beta}{|x|^s} \Big)\, \mathrm{d}x \right)^{\frac{2}{2^*(s)}}. \end{multline*} We derive the best constant $S_{\alpha,\beta,\lambda,\mu}(\Omega)$ and characterize the set of minimizers. Moreover, for $\Omega = \mathbb{R}^N$ and $\kappa > 0$, we obtain sharp stability results for nonnegative functions.

math.AP

Mistake Notebook Learning: Batch-Clustered Failures for Training-Free Agent Adaptation

With the growing adoption of Large Language Model (LLM) agents in persistent, real-world roles, they naturally encounter continuous streams of tasks and inevitable failures. A key limitation, however, is their inability to systematically learn from these mistakes, forcing them to repeat identical errors in similar contexts. Unlike prior training-free methods that primarily store raw instance-level experience or focus on retrieving successful trajectories, we propose Mistake Notebook Learning (MNL), a novel memory framework that enables agents to self-curate generalizable guidance from batch-clustered failures. This mechanism allows agents to distill shared error patterns into structured "mistake notes," updating an external memory only when batch performance improves to ensure stability. To further amplify adaptability, we integrate MNL with test-time scaling, leveraging aggregated failure patterns to actively steer the search process away from known pitfalls. Experiments on mathematical reasoning, Text-to-SQL, and interactive agent benchmarks show that MNL achieves competitive performance compared to existing memory mechanisms and in-context methods in both effectiveness and efficiency. These findings position structured mistake abstraction as a critical lever for robust agent evolution, enabling continuous improvement without the cost of parameter updates. The code is available at https://github.com/Bairong-Xdynamics/MistakeNotebookLearning/tree/main.

cs.CL

Directly Aligning the Full Diffusion Trajectory with Fine-Grained Human Preference

Recent studies have demonstrated the effectiveness of directly aligning diffusion models with human preferences using differentiable reward. However, they exhibit two primary challenges: (1) they rely on multistep denoising with gradient computation for reward scoring, which is computationally expensive, thus restricting optimization to only a few diffusion steps; (2) they often need continuous offline adaptation of reward models in order to achieve desired aesthetic quality, such as photorealism or precise lighting effects. To address the limitation of multistep denoising, we propose Direct-Align, a method that predefines a noise prior to effectively recover original images from any time steps via interpolation, leveraging the equation that diffusion states are interpolations between noise and target images, which effectively avoids over-optimization in late timesteps. Furthermore, we introduce Semantic Relative Preference Optimization (SRPO), in which rewards are formulated as text-conditioned signals. This approach enables online adjustment of rewards in response to positive and negative prompt augmentation, thereby reducing the reliance on offline reward fine-tuning. By fine-tuning the FLUX model with optimized denoising and online reward adjustment, we improve its human-evaluated realism and aesthetic quality by over 3x.

cs.AI

Hunyuan-Game: Industrial-grade Intelligent Game Creation Model

Intelligent game creation represents a transformative advancement in game development, utilizing generative artificial intelligence to dynamically generate and enhance game content. Despite notable progress in generative models, the comprehensive synthesis of high-quality game assets, including both images and videos, remains a challenging frontier. To create high-fidelity game content that simultaneously aligns with player preferences and significantly boosts designer efficiency, we present Hunyuan-Game, an innovative project designed to revolutionize intelligent game production. Hunyuan-Game encompasses two primary branches: image generation and video generation. The image generation component is built upon a vast dataset comprising billions of game images, leading to the development of a group of customized image generation models tailored for game scenarios: (1) General Text-to-Image Generation. (2) Game Visual Effects Generation, involving text-to-effect and reference image-based game visual effect generation. (3) Transparent Image Generation for characters, scenes, and game visual effects. (4) Game Character Generation based on sketches, black-and-white images, and white models. The video generation component is built upon a comprehensive dataset of millions of game and anime videos, leading to the development of five core algorithmic models, each targeting critical pain points in game development and having robust adaptation to diverse game video scenarios: (1) Image-to-Video Generation. (2) 360 A/T Pose Avatar Video Synthesis. (3) Dynamic Illustration Generation. (4) Generative Video Super-Resolution. (5) Interactive Game Video Generation. These image and video generation models not only exhibit high-level aesthetic expression but also deeply integrate domain-specific knowledge, establishing a systematic understanding of diverse game and anime art styles.

cs.CV

A strong-form stability for a class of $L^p$ Caffarelli-Kohn-Nirenberg interpolation inequality

We study the stability of a class of Caffarelli-Kohn-Nirenberg (CKN) interpolation inequality and establish a strong-form stability as following: \begin{equation*} \inf_{v\in\mathcal{M}_{p,a,b}}\frac{ \|u-v\|_{H_b^p} \|u-v\|_{L^p_a}^{p-1} }{\|u\|_{H^p_b}\|u\|_{L^p_a}^{p-1}} \le C\delta_{p,a,b}(u)^{t}, \end{equation*} where $t=1$ for $p=2$ and $t=\frac{1}{p}$ for $p > 2$, and $\delta_{p,a,b}(u)$ is deficit of the CKN. We also note that it is impossible to establish stability results for $\|\cdot\|_{H_b^p}$ or $\|\cdot\|_{L_a^p}$ separately. Moreover, we consider the second-order CKN inequalities and establish similar results for radial functions.

math.AP

Hunyuan-DiT: A Powerful Multi-Resolution Diffusion Transformer with Fine-Grained Chinese Understanding

We present Hunyuan-DiT, a text-to-image diffusion transformer with fine-grained understanding of both English and Chinese. To construct Hunyuan-DiT, we carefully design the transformer structure, text encoder, and positional encoding. We also build from scratch a whole data pipeline to update and evaluate data for iterative model optimization. For fine-grained language understanding, we train a Multimodal Large Language Model to refine the captions of the images. Finally, Hunyuan-DiT can perform multi-turn multimodal dialogue with users, generating and refining images according to the context. Through our holistic human evaluation protocol with more than 50 professional human evaluators, Hunyuan-DiT sets a new state-of-the-art in Chinese-to-image generation compared with other open-source models. Code and pretrained models are publicly available at github.com/Tencent/HunyuanDiT

cs.CV

Sharp quantitative stability for the fractional Sobolev trace inequality

In this paper, we study the stability of fractional Sobolev trace inequality within both the functional and critical point settings. In the functional setting, we establish the following sharp estimate: $$C_{\mathrm{BE}}(n,m,\alpha)\inf_{v\in\mathcal{M}_{n,m,\alpha}}\left\Vert f-v\right\Vert_{D_\alpha(\mathbb{R}^n)}^2 \leq \left\Vert f\right\Vert_{D_\alpha(\mathbb{R}^n)}^2 - S(n,m,\alpha) \left\Vert\tau_mf\right\Vert_{L^{q}(\mathbb{R}^{n-m})}^2,$$ where $0\leq m< n$, $\frac{m}{2}<\alpha<\frac{n}{2}, q=\frac{2(n-m)}{n-2\alpha}$ and $\mathcal{M}_{n,m,\alpha}$ denotes the manifold of extremal functions. Additionally, We find an explicit bound for the stability constant $C_{\mathrm{BE}}$ and establish a compactness result ensuring the existence of minimizers. In the critical point setting, we investigate the validity of a sharp quantitative profile decomposition related to the Escobar trace inequality and establish a qualitative profile decomposition for the critical elliptic equation \begin{equation*} \Delta u= 0 \quad\text{in }\mathbb{R}_+^n,\quad\frac{\partial u}{\partial t}=-|u|^{\frac{2}{n-2}}u \quad\text{on }\partial\mathbb{R}_+^n. \end{equation*} We then derive the sharp stability estimate: $$ C_{\mathrm{CP}}(n,\nu)d(u,\mathcal{M}_{\mathrm{E}}^{\nu})\leq \left\Vert \Delta u +|u|^{\frac{2}{n-2}}u\right\Vert_{H^{-1}(\mathbb{R}_+^n)}, $$ where $\nu=1,n\geq 3$ or $\nu\geq2,n=3$ and $\mathcal{M}_{\mathrm{E}}^\nu$ represents the manifold consisting of $\nu$ weak-interacting Escobar bubbles. Through some refined estimates, we also give a strict upper bound for $C_{\mathrm{CP}}(n,1)$, which is $\frac{2}{n+2}$.

math.AP

Chiral photonic topological states in Penrose quasicrystals

Electromagnetic topological edge states typically are created in photonic systems with crystalline symmetry and these states emerge because of the topological feature of bulk Bloch bands in momentum space according to the bulk-edge correspondence principle. In this work, we demonstrate the existence of chiral topological electromagnetic edge states in Penrose-tiled photonic quasicrystals made of magneto-optical materials, without relying on the concept of bulk Bloch bands in momentum space. Despite the absence of bulk Bloch bands, which naturally defiles the conventional definition of topological invariants in momentum space characterizing these states, such as the Chern number, we show that some bandgaps in these photonic quasicrystals still could host unidirectional topological electromagnetic edge states immune to backscattering in both cylinders-in-air and holes-in-slab configurations. Employing a real-space topological invariant based on the Bott index, our calculations reveal that the bandgaps hosting these chiral topological edge states possess a nontrivial Bott index of $\pm 1$, depending on the direction of the external magnetic field. Our work opens the door to the study of topological states in photonic quasicrystals.

physics.optics