Searcharxiv⌕ Search

arXiv subjects

Yiqun Chen

Publications and source records attributed to Yiqun Chen.

At least 19 recordsLinked to original sources

Sharp Fractional Capacitary-Distance Hardy Inequalities

Let $d\in\mathbb N$, $p\in(1,\infty)$, $p':=\frac{p}{p-1}$, and $s\in(0,\min\{1+\frac1p,\frac dp\})$. For an open set $Ω\subset\mathbb{R}^d$, let $F:=\mathbb{R}^d\setminusΩ$. For any $α\in(0,1]$ and $x\inΩ$, let \begin{align*} d_{α,s,p}(x) :=\inf\left\{r\in(0,\infty): \frac{\operatorname{cap}_{s,p}(\overline{F\cap B(x,r)})} {\operatorname{cap}_{s,p}(\overline{B(x,r)})}\geα\right\}, \end{align*} where $\operatorname{cap}_{s,p}$ is the capacity associated with the fractional Sobolev energy $[\,\cdot\,]_{s,p}^p$. In this article, we prove that there exists a positive constant $C$, depending only on $d$, $s$, and $p$, such that, for any $α\in(0,1]$ and $u\in C_{\rm c}^\infty(Ω)$, \begin{align*} \int_Ω\frac{|u(x)|^p}{d_{α,s,p}(x)^{sp}}\,dx \le Cα^{-p'}[u]_{s,p}^p. \end{align*} We also show that both the exponent $p'$ in $α^{-p'}$ as $α\to0^+$ over the class of all open sets and the range $s\in(0,1+\frac1p)$ within $sp<d$ are sharp. Our proofs use variational minimization, equilibrium measures on trees, and weighted Hardy inequalities.

math.AP↗

Capacitary Trapping and Brownian Escape: A Sharp Hardy Principle for Absorbing Media

We study Brownian motion killed upon exiting arbitrary open sets $Ω\subset\mathbb R^n$, $n\in[3,\infty)\cap\mathbb N$. Let $α\in(0,1]$. The infimal radius $d_α(x)$ at which the absorber near $x$ carries an $α$-fraction of the Newtonian capacity of the ball of the same radius provides a local measure of electrostatic trapping. We prove that this capacitary loading forces an absorption probability of at least $c_nα$ within a dimension-dependent multiple of the diffusive time scale $d_α(x)^2$. Independently, if $p\in (0,1)$ and $τ_p(x)$ is the time by which Brownian motion started at $x$ has been absorbed with probability at least $p$, then \begin{align*} \int_Ω\frac{|u\left(x\right)|^2}{τ_p\left(x\right)}\,\mathrm d x \le\frac{2}{p^2}\int_Ω|\nabla u\left(x\right)|^2\,\mathrm d x \end{align*} for every $u\in C_{\mathrm{c}}^\infty(Ω)$. Together these statements give a capacitary Hardy inequality with constant $C_nα^{-2}$ on every open set, answering a problem of Maz'ya, where $C_n$ is a positive constant and, moreover, the exponent of $α^{-2}$ is sharp. As applications, we derive corresponding estimates for survival probabilities, a corresponding spectral lower bound (including a recovery of the Maz'ya--Shubin lower bound), heat dissipation, Schrödinger forms, and Fisher information.

math.CA↗

Learning to Retrieve via Reinforcement Learning in Embedding Space

Dense retrieval models are typically trained with contrastive objectives that learn effective representations but do not directly optimize retrieval metrics or downstream task performance. To address this problem, we introduce RELER (REinforcement LEarning for Retrieval), a reinforcement learning framework that enables existing embedding models to learn to retrieve directly in embedding space and align to task-specific rewards. We train RELER by sampling unit-length query and document embedding actions from von Mises-Fisher (vMF) distributions centered on normalized encoder outputs, scoring the resulting retrieval or downstream outcomes as rewards, and updating the encoder with REINFORCE using a leave-one-out baseline (RLOO). As exploration in the high-dimensional embedding space is prone to sampling noise, we further propose conditional-mean projection (CMP), which projects each sampled embedding onto the low-dimensional subspace spanned by its encoder output and the candidate embeddings it is compared against, reducing noise in the policy gradient while preserving its expectation. We evaluate RELER on BRIGHT, a benchmark with reasoning-intensive queries that remain challenging for existing embedding models. RELER consistently outperforms InfoNCE and LambdaLoss in average nDCG@10 when post-training BGE-M3 and Qwen3-Embedding backbones. We further evaluate downstream utility through retrieval-augmented generation (RAG), where we adapt only the query encoder while keeping the document index and generator fixed. Across seven QA datasets, jointly optimizing retrieval and answer rewards improves both average retrieval performance and answer quality in RAG.

cs.IR↗

MatrixReward: Reward from Rubric Matrix for Open-Ended Generation

Open-ended query generation lacks standard answers, thus necessitating an effective reward mechanism. Pointwise scoring rubrics provide limited information about the relative quality of sample answers under the same prompt; merging multiple rubric judgments into a single score may also mask the differences between these answers. We propose MatrixReward, which constructs rewards from a rollout-by-rubric win-rate matrix obtained by comparing every pair of sampled responses under each rubric. The spread of each matrix column captures how strongly that rubric distinguishes the current rollouts, while correlations between columns reveal rubric repetition; together, these statistics yield data-dependent rubric weights. We combine these weights with the prior weights of rubrics. After column normalization and weighting, the observed per-rubric maxima and minima define positive and negative ideal profiles. Each rollout's distances to these two ideals determine its relative-closeness quality reward. Evaluated using Qwen3-8B on four open-ended query-answering benchmarks, MatrixReward achieves an average score of 63.02, outperforming the strongest baseline by approximately 2.0%. These results support the idea that matrices derived from relative comparisons can be used to construct rewards more reasonably for open-ended generative reinforcement learning.

cs.LG↗

RankBuffer: Efficient Ranking-Based Rewards for Open-Ended Generation

Open-ended generation lacks canonical answers, making pointwise rewards difficult to calibrate for group-based reinforcement learning. Directly ranking same-query rollouts provides a more suitable relative reward signal, but existing ranking-based reward methods can incur substantial judging cost. We introduce RankBuffer, which maintains an ordered, query-specific buffer of previously judged responses as a reusable quality scale. Each rollout is first inserted into an anchor interval through an independent coarse judgment, after which only rollouts assigned to the same interval undergo local fine ranking. The resulting complete order is converted into bounded rank rewards, while boundary expansion, local refinement, and inactive-anchor pruning adapt the buffer as the policy evolves. Across four open-ended benchmarks, RankBuffer consistently outperforms all pointwise baselines. It also achieves nearly on-par performance with the strongest ranking-based reward baseline while substantially reducing judging cost. Ablations demonstrate the importance of both local fine ranking and anchor response content, while buffer analyses show that rollout-derived anchors progressively extend and refine the covered quality scale. These results establish response reuse as an effective approach to efficient relative reward construction.

cs.AI↗

On Two Questions by Brezis et al Concerning the Critical Difference Quotient Characterization of First-Order Sobolev Spaces

Let $N\in\mathbb N$ and $γ\in[-1,0)$. In [Anal. PDE 17 (2024)], Brezis, Seeger, Van~Schaftingen, and Yung asked how, in the exceptional range $γ\in[-1,0)$, $\dot{\mathrm{BV}}(γ)$ and $\dot W^{1,1}(γ)$ on ${\mathbb R}^N$ are related to other function spaces, especially to Hardy--Sobolev spaces, and whether these spaces are normable. In this article, we prove that the homogeneous Hardy--Sobolev space is strictly embedded, respectively, into $\dot{\mathrm{BV}}(γ)$ and $\dot W^{1,1}(γ)$, and neither $\dot{W}^{1,1}(γ)/\mathbb R$ nor $\dot{BV}(γ)/\mathbb R$ is normable, which answers the above two questions.

math.FA↗

CoSkill: Joint Reinforcement Learning of Reasoning and Meta-Skill Agents for Hierarchical Skill Evolution

Skill libraries improve the sample efficiency of agentic reinforcement learning (RL) by enabling large language model (LLM) agents to reuse procedural knowledge. Yet existing paradigms exhibit structural shortcomings: they either decouple skill evolution from policy optimization or instantiate meta-skills as fixed workflows. Both treat skills as passive objects to be managed, limiting the flexible evolution of skills and their co-adaptation with the reasoning agent. To address the limitations, we propose CoSkill, a unified multi-agent RL framework that recasts the static meta-skill workflow as a learnable Meta-Skill Agent and jointly trains it with a Reasoning Agent over a hierarchical skill library. By modeling the Reasoning and Meta-Skill Agents as a cooperative team sharing a single backbone, CoSkill enables end-to-end co-adaptation: the Reasoning Agent conditions its actions on a retrieved task skill and step skills selected from its child set, while its task performance guides the Meta-Skill Agent in refining those step skills. Experiments on ALFWorld and WebShop show that CoSkill substantially outperforms prior skill-based and RL baselines, achieving success rates of 98.4% and 90.6%, respectively (+3.5 and +6.2 pp). As shown in Figure 1, CoSkill achieves superior early-stage sample efficiency, asymptotic performance, and wall-clock efficiency. Our code is available at https://github.com/jinyuan-cookie/CoSkill.

cs.AI↗

Tournament-GRPO: Group-Wise Tournament Rewards for Reinforcement Learning in Open-Ended Long-Form Generation

Reinforcement learning in open-ended long-form generation is challenging because reliable reference answers and automatic metrics are often unavailable. Existing rubric-based methods typically rely on pointwise LLM-as-a-judge scoring, but absolute scores are difficult to calibrate across complex responses, may provide weak discrimination among same-query rollouts, and can become saturated during optimization. We propose Tournament-GRPO, a group-wise reward framework that converts rubric-guided LLM judgments into relative rewards through repeated multi-round tournaments among same-query rollouts. Tournament-GRPO compares candidates within groups, accumulates tournament outcomes, and normalizes them into group-wise rewards for GRPO training. Experiments on Deep Research Bench show that Tournament-GRPO consistently outperforms existing reward-design baselines, achieving a 4.52-point overall-score improvement over the strongest baseline. Further analyses show that tournament rewards provide a favorable effectiveness--efficiency trade-off and that tournament design affects training dynamics. These results suggest that rubric-guided tournament comparison provides an effective reward signal for reinforcement learning in open-ended long-form generation.

cs.CL↗

Fetch-then-Explore: Decoupling Selection from Extraction over a Persistent Workspace for Search Agents

Search agents now answer questions that take dozens of searches to settle, yet how such an agent reads a page has drawn far less attention than how it finds one. Nearly all of them use one of two document interfaces, and both tie a page to the moment it is opened. \emph{Visit-and-read} injects a reading of the page into the message history at fetch time, fixing that reading before the agent knows which fact it will need. Stateful \emph{browsing} instead extracts on demand from the page in hand, but holds one page at a time and releases it as soon as the agent opens another. Either way, a page that turns out to matter many turns later has to be fetched and rendered into context all over again. We propose \textbf{Fetch-then-Explore}, which separates page selection from evidence extraction and keeps what it selects: pages are recorded in a per-question workspace on the filesystem rather than the context window or a transient session, and evidence is pulled from them on demand later. Selection becomes almost free, extraction can wait until the agent knows what to look for and be repeated as its hypothesis sharpens, and pages are not released when the agent moves on, so evidence accumulates across the trajectory. In a unified ReAct harness with fixed search, we compare Fetch-then-Explore against snippet-only, visit-and-read, and browsing baselines on two open-web benchmarks, BrowseComp and WideSearch, across three agent backbones. It leads BrowseComp accuracy at every backbone and generally matches or exceeds the baselines on WideSearch, and a behavioral analysis traces the gains to the workspace's defining move: returning to a page after leaving it, which it does far more than any transient interface, so evidence missed on a first pass can still be recovered later.

cs.AI↗

DuMate-DeepResearch: An Auditable Multi-Agent System with Recursive Search and Rubric-Grounded Reasoning

Deep Research (DR) has emerged as a new agentic paradigm to tackle complex, open-ended research tasks, demanding systems that can iteratively frame problems, acquire evidence, verify sources, and synthesize long-form reports. In practice, however, current DR systems are constrained by four interrelated limitations: long-horizon planning over an underspecified scope, the bottleneck of decomposing and scheduling such tasks within a single agent, hallucination risk in long-form synthesis, and limited process auditability. This technical report presents DuMate-DeepResearch, a multi-agent DR framework built on the Qianfan Agent Foundry. The framework decouples the Agent Core, which handles task understanding, planning, and scheduling, from an extensible Tool Ecosystem for retrieval, evidence acquisition, and report rendering, making every intermediate decision and tool invocation explicitly traceable. Building on this infrastructure, DuMate-DeepResearch further introduces three mechanisms: (i) a graph-based dynamic planning strategy expands the research roadmap coarse-to-fine and continuously revises it through reflection, re-planning, backtracking, and parallel branching; (ii) a recursive two-level execution design delegates each complex search sub-task to an inner Search Agent that runs its own planning loop, isolating noisy retrieval and stabilizing long-horizon execution; (iii) a rubric-based test-time optimization mechanism dynamically generates task-specific quality criteria and uses them as live reasoning scaffolds for evidence-grounded synthesis and adaptive stopping. Across two deep research benchmarks, DuMate-DeepResearch establishes new state-of-the-art results: the best overall score (58.03%) on DeepResearch Bench, and the best overall score (61.95%) on DeepResearch Bench II while ranking first in information recall and analysis.

cs.AI↗

UnityMAS-O: A General RL Optimization Framework for LLM-Based Multi-Agent Systems

LLM-based multi-agent systems decompose complex tasks into interacting roles, but most remain manually orchestrated by prompts, tools, and control rules, while agents are rarely optimized through a unified reinforcement learning interface. Existing RL post-training frameworks mainly target single-policy optimization and lack abstractions for user-defined multi-agent workflows, structured interaction, role-specific credit assignment, and configurable parameter sharing. We present UnityMAS-O, a general RL optimization framework for LLM-based multi-agent systems. UnityMAS-O treats the complete workflow as the optimization unit, rather than a single response or policy trajectory. It represents workflows through four first-class objects: logical agent roles, graph trajectories, user-defined rewards, and agent--model mappings. This decouples logical agents from physical model parameters, supporting full sharing, full separation, and partial sharing, with rewards assigned at role, turn, and trajectory levels. UnityMAS-O extends verl with a Ray-based star-topology runtime. A central controller executes workflows, invokes tools, records structured trajectories, and assembles rewards; model-local worker groups handle rollout, buffering, advantage computation, and distributed PPO-style updates. Users can define agents, workflows, model mappings, and rewards without rewriting the optimization infrastructure. We instantiate UnityMAS-O on retrieval-augmented QA, iterative agentic search, and reflective code generation. Across Natural Questions, HotpotQA, and held-out code tasks, multi-agent RL improves manually specified workflows after optimization, with especially large gains for smaller models and strict code all-passed metrics. These results show that UnityMAS-O can serve as a reusable substrate for converting diverse LLM-based multi-agent workflows into trainable multi-agent RL systems.

cs.AI↗

Atomic Characterization and Its Applications of Matrix-Weighted Variable Hardy Spaces

In this article, by means of the matrix-weighted grand maximal function we first introduce the variable Hardy space $H^{p(\cdot)}_W$ on $\mathbb{R}^n$ with the $\mathscr{A}_{p(\cdot),\infty}$ matrix weight $W$ and with the variable exponent $p(\cdot)$ having globally log-Hölder continuity, and then via using several different convex body valued maximal functions we establish its various maximal function equivalent characterizations. Combining a refined Whitney decomposition with both the convex body valued maximal function and its corresponding convex-body reducing operator, we obtain the atomic characterization of $H^{p(\cdot)}_W$. As applications, we give its dual space and establish the boundedness of Calderón--Zygmund operators from $H^{p(\cdot)}_W$ to the matrix-weighted variable Lebesgue space $L^{p(\cdot)}_W$ and to itself. This approach to establishing atomic characterization differs from all previous ones.

math.FA↗

OASES: Outcome-Aligned Search-Evaluation Co-Training for Agentic Search

Agentic search enables language models to solve knowledge-intensive tasks by adaptively acquiring external evidence over multiple steps. Reinforcement learning with verifiable rewards (RLVR) has emerged as a widely adopted training paradigm for search agents, yet outcome-only rewards are sparse and provide limited credit assignment for intermediate search actions. Existing process-reward methods therefore seek to densify supervision through proxy signals, external evaluators, or likelihood-based information gain. However, proxy rewards can deviate from the final outcome objective, while fixed evaluators can become stale as the search policy evolves, leading to unreliable process supervision. To address these challenges, we propose OASES, an Outcome-Aligned Search-Evaluation Supervision framework for agentic search. OASES derives outcome-aligned process rewards by evaluating how well each intermediate search state supports answering the original question. It further co-trains the search policy and the state evaluator on policy, allowing the evaluator to adapt to evolving search behavior and provide more reliable process rewards. Experiments on five multi-hop QA benchmarks show that OASES consistently outperforms strong RL baselines, with further analyses confirming the benefits of outcome-aligned process rewards and search-evaluation co-training.

cs.AI↗

Focus on the Core: Empowering Diffusion Large Language Models by Self-Contrast

The iterative denoising paradigm of Diffusion Large Language Models (DLMs) endows them with a distinct advantage in global context modeling. However, current decoding strategies fail to leverage this capability, typically exhibiting a local preference that overlooks the heterogeneous information density within the context, ultimately degrading generation quality. To address this limitation, we systematically investigate high-information-density (HD) tokens and present two key findings: (1) explicitly conditioning on HD tokens substantially improves output quality; and (2) HD tokens exhibit an early-decoding tendency, converging earlier than surrounding tokens. Motivated by these findings, we propose Focus on the Core \textbf{(FoCore)}, a training-free decoding strategy that utilizes HD tokens in a self-contrast manner, wherein HD tokens are temporarily remasked as negative samples, to guide generation. We further introduce FoCore\_Accelerate \textbf{(FoCore\_A)}, an efficient variant that, upon detecting HD token convergence, performs parallel decoding over stable candidates within a local context window, substantially accelerating generation. Extensive experiments on math, code and logical reasoning benchmarks demonstrate that FoCore consistently improves generation quality and efficiency across both LLaDA and Dream backbones. For instance, on HumanEval, FoCore improves pass@1 from 39.02 to 42.68 over standard Classifier-Free Guidance, while FoCore-A reduces the number of decoding steps by 2.07x and per-sample latency from 20.76s to 8.64s (-58.4\%).

cs.CL↗

InferenceEvolve: Towards Automated Causal Effect Estimators through Self-Evolving AI

Causal inference is central to scientific discovery, yet choosing appropriate methods remains challenging because of the complexity of both statistical methodology and real-world data. Inspired by the success of artificial intelligence in accelerating scientific discovery, we introduce InferenceEvolve, an evolutionary framework that uses large language models to discover and iteratively refine causal methods. Across widely used benchmarks, InferenceEvolve yields estimators that consistently outperform established baselines: against 58 human submissions in a recent community competition, our best evolved estimator lay on the Pareto frontier across two evaluation metrics. We also developed robust proxy objectives for settings without semi-synthetic outcomes, with competitive results. Analysis of the evolutionary trajectories shows that agents progressively discover sophisticated strategies tailored to unrevealed data-generating mechanisms. These findings suggest that language-model-guided evolution can optimize structured scientific programs such as causal inference, even when outcomes are only partially observed.

cs.AI↗

Real-variable theory of matrix-weighted multi-parameter Besov--Triebel--Lizorkin-type spaces

We develop a comprehensive theory for a general class of multi-parameter function spaces of Besov-Triebel-Lizorkin type, with a matrix weight. We prove the equivalence of different quasi-norms, the identification of function and sequence spaces via the $φ$-transform, the boundedness of almost diagonal operators and multi-parameter singular integrals under minimal assumptions, molecular and wavelet characterisations, and Sobolev-type embedding theorems. We identify matrix-weighted $L^p$ spaces, Sobolev spaces, and multi-parameter BMO spaces as examples of our general scale of spaces. Thus, our result on the boundedness of multi-parameter singular integrals on these spaces is seen as an extension, with a different method, of a recent theorem of Domelevo et al. [J. Math. Anal. Appl. 2024] on matrix-weighted $L^p$ spaces. For this theory, we develop several tools of independent interest. Many previous results were restricted to integrability exponents $p\in(1,\infty)$, while Besov-Triebel-Lizorkin spaces naturally involve the full range $p\in(0,\infty)$. We extend the definition of multi-parameter $A_p$ matrix weights to $p\in(0,1]$ and establish their basic properties, culminating in the $L^p$-boundedness of a matrix-weighted strong maximal operator (suitably rescaled when $p\in(0,1]$) for all $p\in(0,\infty)$. For $p\in(1,\infty)$, this is due to Vuorinen [Adv. Math. 2024] by convex-set-valued techniques of Bownik and Cruz-Uribe [arXiv 2022; Math. Ann. (to appear)]; the lack of convexity requires us to develop a new approach that works for all $p\in(0,\infty)$. We also need and prove a multi-parameter extension of Carleson-type embeddings from Frazier and Roudenko [Math. Ann. 2021] but attributed by them to F. Nazarov. We prove the necessity of the conditions of the new embedding using a nontrivial elaboration of Carleson's classical counterexample [Mittag-Leffler Rep. 1974].

math.FA↗

Towards AI Search Paradigm

In this paper, we introduce the AI Search Paradigm, a comprehensive blueprint for next-generation search systems capable of emulating human information processing and decision-making. The paradigm employs a modular architecture of four LLM-powered agents (Master, Planner, Executor and Writer) that dynamically adapt to the full spectrum of information needs, from simple factual queries to complex multi-stage reasoning tasks. These agents collaborate dynamically through coordinated workflows to evaluate query complexity, decompose problems into executable plans, and orchestrate tool usage, task execution, and content synthesis. We systematically present key methodologies for realizing this paradigm, including task planning and tool integration, execution strategies, aligned and robust retrieval-augmented generation, and efficient LLM inference, spanning both algorithmic techniques and infrastructure-level optimizations. By providing an in-depth guide to these foundational components, this work aims to inform the development of trustworthy, adaptive, and scalable AI search systems.

cs.CL↗

Personalized Prediction of Perceived Message Effectiveness Using Large Language Model Based Digital Twins

Perceived message effectiveness (PME) by potential intervention end-users is important for selecting and optimizing personalized smoking cessation intervention messages for mobile health (mHealth) platform delivery. This study evaluates whether large language models (LLMs) can accurately predict PME for smoking cessation messages. We evaluated multiple models for predicting PME across three domains: content quality, coping support, and quitting support. The dataset comprised 3010 message ratings (5-point Likert scale) from 301 young adult smokers. We compared (1) supervised learning models trained on labeled data, (2) zero and few-shot LLMs prompted without task-specific fine-tuning, and (3) LLM-based digital twins that incorporate individual characteristics and prior PME histories to generate personalized predictions. Model performance was assessed on three held-out messages per participant using accuracy, Cohen's kappa, and F1. LLM-based digital twins outperformed zero and few-shot LLMs (12 percentage points on average) and supervised baselines (13 percentage points), achieving accuracies of 0.49 (content), 0.45 (coping), and 0.49 (quitting), with directional accuracies of 0.75, 0.66, and 0.70 on a simplified 3-point scale. Digital twin predictions showed greater dispersion across rating categories, indicating improved sensitivity to individual differences. Integrating personal profiles with LLMs captures person-specific differences in PME and outperforms supervised and zero and few-shot approaches. Improved PME prediction may enable more tailored intervention content in mHealth. LLM-based digital twins show potential for supporting personalization of mobile smoking cessation and other health behavior change interventions.

cs.CL↗