Searcharxiv⌕ Search

arXiv subjects

Hui Xu

Publications and source records attributed to Hui Xu.

At least 19 recordsLinked to original sources

From Relevance to Utility: Rubric Alignment in Yuanbao Search

Agentic search demands that a search engine move beyond per document relevance ranking to assemble document sets optimized for downstream LLM reasoning. Prior work addresses this either by improving individual pipeline stages in isolation or by applying RL based selection on top of relevance trained upstream modules, leaving the full stack unaligned to utility for reasoning. We propose rubric aligned search, a framework that unifies the traditional search pipeline under a single supervision surface. For each query, we derive a rubric from coarse to fine, specifying weighted positive criteria that the document set must satisfy and negative criteria that it must avoid. From this rubric we derive two training signals. First, a lightweight labeler distills rubric grounded judgments into per document utility labels, which supervise a contrastive dual encoder for retrieval and a multi task ranker trained with four rubric aligned scoring heads. Second, a rubric conditioned evaluator produces a set level reward that drives a dual branch RL selector, combining GRPO with best rollout distillation to resolve credit assignment in subset optimization. Deployed in Yuanbao Search, the pipeline improves end to end answer quality by 8.52% over the online production baseline.

cs.IR↗

A tiny object detection dataset for high-altitude open-water search and rescue

Large aerial platforms often operate above 1.5 km to improve the efficiency of open water search and rescue (OW-SAR). However, long imaging distances, wide fields of view, and limited sensor resolution reduce objects to a few pixels, increasing their susceptibility to environmental interference and making detection harder than for conventional small objects. To our knowledge, existing datasets focus on low-altitude scenarios and do not support automatic detection at 1.5-2.0 km. We therefore present TinyWOD, a tiny object detection dataset for high-altitude OW-SAR using lifebuoys as detection targets. It comprises 11,359 manually annotated images and 19,505 annotated instances spanning diverse environments, lighting conditions, water colors, and surface ripples. Compared with existing datasets, TinyWOD contains much smaller objects and a substantially higher proportion of tiny instances; its average equivalent side length (ESL) is 12.7 pixels, with 76.96% of in stances having ESLs below 15 pixels, reflecting actual high-altitude water-rescue imaging conditions. We define APtiny, a tiny object detection metric, and benchmark mainstream and state-of-the-art networks using this and conventional metrics. All evaluated networks effectively detect tiny waterborne objects, demonstrating TinyWOD's reusability and utility. We expect this dataset to support research on tiny object detection in high-altitude OW-SAR.

cs.CV↗

Orbits along primes in totally minimal systems

In this paper, we show that every totally minimal system admits a point whose orbit along the primes is dense. Moreover, assuming the Dickson-Hardy-Littlewood conjecture, we show that in any totally minimal distal system, the orbit along the primes of every point is dense.

math.DS↗

Beyond Relevance-Centric Retrieval: Rubric-Oriented Document Set Selection and Ranking

As large language models and AI agents become the primary consumers of search results, document set quality determines the upper bound of downstream generation. Yet existing evaluation systems remain confined to scoring documents independently and aggregating via nDCG, ignoring inter-document interactions (redundancy, conflict, complementarity) and unable to answer what makes one document set better than another. To address these issues, we propose a complete evaluate-diagnose-optimize framework. We design SetwiseEvalKit, a three-level, nine-dimension document set evaluation benchmark covering both short-form and long-form scenarios, comprising approximately 28K high-quality evaluation rubrics. We systematically evaluate 12 rerankers: even the best method achieves no more than 45% coverage, cross-document coordination dimensions are universally weak, and no single method maintains top performance across both settings. Building on this, we propose Rubric4Setwise, a training-free method that converts rubric-based evaluation criteria into document set selection signals, achieving the best downstream generation performance with fewer documents and search rounds. It is the only method that maintains state-of-the-art results across both scenarios, validating the effectiveness of closing the loop from evaluation to optimization.

cs.CL↗

Generalised Mixing-Plane Method for Compressible Reacting-Mixture Flows in Steady Multiphysics Turbomachinery Simulations

The mixing-plane method plays a pivotal role in steady simulations of multiple turbomachinery components. With advances in computational power, a whole-engine gas turbine simulation is no longer an elusive approach. However, whole-engine simulations require simultaneous coupling of the compressor, turbine and combustor. A key challenge is that the working fluid after the combustor can no longer be treated as a perfect gas, since the combustion introduces composition variations and combustion products. Conventional mixing-plane methods based on a fixed-composition gas cannot guarantee a thermodynamically consistent mixed-out state. To overcome the difficulty, this paper extends the classic mixing-plane approach to handle compressible reacting flows. The nonlinearity in the thermodynamic closure is addressed using a novel nested algorithm combining an outer pressure-root search with an inner enthalpy inversion. Physical state checks and power-law pressure sampling are incorporated to improve numerical robustness at low normal velocities where the pressure root approaches its upper physical bound. The performance of the method is demonstrated in three configurations: a quasi-1D interface test elucidating the thermodynamic stiffness of the proposed mixing-plane formulation for different fuel types and flow conditions; the Darmstadt transonic compressor case that verifies the proposed method reduces to the classic mixing-plane formulation when the mixture fraction reduces to zero; and a whole-engine simulation of the KJ66 micro-turbojet is used to demonstrate the performance of the method for multiphysics turbomachinery simulations. Good agreement with experimental data is observed, and the maximum relative mass-flow error across the mixing planes remains below 0.11%, demonstrating conservative and thermodynamically consistent interface coupling for compressible reacting turbomachinery flows.

physics.flu-dyn↗

AdaTutoRank: Learning to Rerank Document Sets via Adaptive Tutoring Optimization for RAG and Deep Research

Document rerankers determine what evidence reaches the downstream model in RAG and deep research, yet mainstream rerankers select by relevance matching, and individually relevant documents rarely constitute the complete, complementary, non-redundant set a complex information need demands. Prior work rewards a set by its aggregate rubric score, shifting the objective from ranking documents to composing sets. Yet that score is one scalar shared by every document in the set, so the supervision is sparse: a redundant document is rewarded with the rest whenever the set scores well, and a decisive one penalized with the rest whenever it does not; credit assignment leaves contributors indistinguishable from free riders. On-policy distillation could densify this supervision, but existing methods give every rollout the same fixed guidance, too prescriptive for strong rollouts and too abstract for weak ones. We therefore propose AdaTutoRank, a setwise reranker trained with Adaptive Tutoring Optimization (ATO) under a three-level hierarchy of nine rubric dimensions, which supplies silver labels for the cold start, rewards for reinforcement learning, and hints for distillation. ATO draws three hint forms of increasing specificity from the policy's own frozen snapshot: the rubrics alone, a self-selector's sibling-set chosen under rubrics, and a self-reflector's reflection contrasting the rollout with that sibling-set; each rollout receives the form matched to its quality. Re-scoring that rollout under the hint-conditioned frozen teacher and the hint-free snapshot distills the hint's effect into a token-level advantage that complements the group-relative outcome advantage. Across ten benchmarks spanning RAG, deep research, and setwise evaluation, AdaTutoRank attains the best overall performance while issuing fewer retrieval calls.

cs.CL↗

IndustryLLM: Failure-Driven LLM Training for Industrial Procurement

Industrial procurement requires language models to bridge informal buyer jargon, sparse marketplace attributes, and authoritative engineering standards under strict safety tolerances. We present IndustryLLM, an open-weight industrial language model trained from Qwen3.5-35B-A3B-Base (35B total parameters with ~3B activated per token, with the vision encoder frozen). Rather than relying on generic text scaling, we introduce a failure-driven adaptation recipe spanning continued pre-training (CPT) and supervised fine-tuning (SFT). CPT leverages a curated ~100B-token corpus integrating 5B tokens of national standards (e.g., GB/T) and technical archives, 10B tokens of de-identified real-world industrial transaction and inquiry records, and 60B tokens of general replay. To overcome register mismatch and factual brittleness, we systematically reconstruct an estimated 20B-token domain subset via multi-register rewriting across 10 genres and 8 writing styles, confidence-routed minimal factual editing, and error-targeted QA synthesis (resolving colloquial typos like '42-luo-mu' -> 42CrMo, expanding ambiguous codes like '16674' -> GB/T 16674, and clarifying conflicting dimensional specs). For downstream deployment, we formalize an evidence-gated constraint-evaluation interface enforcing three-valued logic where unverified product evidence remains unknown rather than satisfied. Offline evaluations demonstrate consistent gains on procurement-query structuring (+2.97 percentage points in exact match, 95% CI [2.11, 3.86] in No-Think mode), while randomized online A/B experiments in production yield substantial improvements (+4.25% GMV, +8.3% satisfied inquiries) alongside a latency reduction from 6-7 s to 1.5 s. Model weights and configs are released at https://huggingface.co/alibaba-multimodal-industrial-ai/IndustryLLM.

cs.AI↗

A Discretely Entropy Conserving/Stable Flux Reconstruction Scheme via Hybridized Split Form Differential Operator and Generalized Entropy Projection

This paper proposes a novel discretely entropy conserving/stable flux reconstruction (FR) scheme for nonlinear conservation laws. The scheme combines a hybridized split-form differential operator with a generalized entropy projection, enabling discrete entropy conservation for arbitrary nodal distributions and arbitrary correction functions without modifying the original quadrature weights. The formulation is built directly upon the classical FR framework and is shown to preserve conservation properties while achieving entropy conservation in the semi-discrete sense. Numerical experiments using the isentropic vortex problem confirm the theoretically predicted accuracy and demonstrate robust entropy behavior with entropy-dissipative interface fluxes.

math.NA↗

A subcell-refined entropy-residual-driven limiting strategy for high-order discontinuous Galerkin methods

Fine-grained, subcell-level dissipation control is essential for achieving robust high-order discontinuous Galerkin (DG) simulations of nonlinear hyperbolic systems in under-resolved regimes while preserving accuracy. This paper proposes a subcell-refined entropy-residual-driven limiting strategy for DG on Legendre-Gauss-Lobatto nodes. The limiter introduces only nearest-neighbor pairwise dissipation within each element, with closed-form coefficients that supply the minimal dissipation required to restore the element entropy inequality. The strategy is a diagonal, locally stable approximation of classical entropy-stable methods, and a generalized subcell framework reveals split-form DG and residual-distribution-based entropy correction schemes as particular choices of the limiting coefficients. For the Euler equations, a physically consistent jump operator separately models thermal and shear entropy production while preserving velocity and pressure equilibrium; a subcell refinement of the Zhang-Shu positivity limiter ensures pointwise positivity. Extensive numerical tests confirm that the scheme maintains optimal high-order accuracy, strictly enforces entropy dissipation, and significantly reduces the difficulty of a posteriori positivity-preserving procedures.

physics.comp-ph↗

Cognitive Link-Flexible FTN-OTFS Design for High-Mobility LEO Satellite Communications

Low Earth orbit (LEO) satellite links are challenged by pronounced signal-to-noise ratio (SNR) variation and severe Doppler shifts. Although mobility robustness is provided by orthogonal time frequency space (OTFS) modulation, the rate-reliability tradeoff of faster-than-Nyquist (FTN) signaling is constrained by fixed packing. In this paper, an SNR-aware flexible FTN-OTFS framework is proposed, in which the packing factor is adapted to changing link conditions under a prescribed reliability requirement. Link-state perception and packing decisions are supported by estimated SNR and offline reliability thresholds, with constant decision complexity achieved through a fixed-mode lookup table. Elevation-dependent propagation, fractional Doppler, and FTN-induced interference are incorporated into the signal model, while colored noise is accommodated by covariance-aware linear minimum mean-square error detection. Throughput and bit error rate are analytically characterized, and energy efficiency and peak-to-average power ratio are evaluated. Simulation results show that conservative packing preserves reliability under unfavorable conditions, while denser signaling improves throughput as the link strengthens. These findings highlight the potential of cognitive FTN adaptation for efficient future LEO wireless communications.

cs.IT↗

Cayley-tree pseudo-orbit tracing: period subgroups and relative geometry

We introduce Cayley-tree POTP, obtained by imposing the pseudo-orbit equations of a finitely generated group action only along a spanning tree of a Cayley graph. For zero-dimensional actions, we characterize this property by equicontinuity along normalized replacement paths; for subshifts, the criterion is expressed in the right-coset space of the common left-period subgroup. These criteria characterize virtual freeness and, for commensurated subgroup pairs, identifies Cayley-tree POTP of the coset full shift with relative quasi-tree geometry and a finite Bass--Serre decomposition. For infinite-index VFP pairs, Cayley-tree POTP of the coset full shift is equivalent to virtual cohomological codimension one, although ordinary POTP holds for every such shift. Finally, we prove that the strong topological Rokhlin property passes to finite-index overgroups. Consequently every finitely generated virtually free group has this property, answering the virtually cyclic case posed by Doucha, and Cayley-tree POTP is generic for its Cantor actions.

math.DS↗

$Δ^*$-Mixing and Products of Full-Scattering Systems

We resolve two questions posed by Huang and Ye concerning full-scattering systems. First, we construct a four-symbol subshift which is $Δ^*$-mixing but not full-scattering, thereby showing that $Δ^*$-mixing does not imply full-scattering. Second, we prove that every finite product of full-scattering systems is full-scattering.

math.DS↗

Training Documents Reranker with Search Rubrics for Deep Research Agent

Retrieval systems help deep research agents generate high-quality answers by providing relevant documents. However, existing retrievers typically select documents through relevance matching, while individually well-matched top-$k$ documents may not form a \textit{set} that satisfies the complex information needs of an agent query (\eg, diverse, concise and authoritative documents). In this paper, we propose search-oriented rubrics that \textit{explicitly} define the requirements that high-quality document sets should satisfy for each agent query. Our search rubrics are organized into a hierarchical structure and synthesized using a powerful LLM. Based on these search rubrics, we further train a document reranker \textbf{RubricRanker} to select a high-quality subset from retrieved documents. We design a two-stage training framework that consists of rubrics-guided supervised fine-tuning and rubric-based reinforcement learning. Extensive experiments demonstrate that RubricRanker outperforms the strongest baseline by 2.6 points on four deep research benchmarks and generalizes well to five RAG benchmarks.

cs.IR↗

SEER: A Self-Grounded Evidence Interface for Controlled Spatial Relation Classification

Spatial relation questions require a model to identify the queried subject and object before comparing their layout. Yet a VLM can recognize both entities and still answer from the wrong instance or an ambiguous global view. We ask whether making query-specific evidence explicit can mitigate this failure and propose SEER (Self-grounded Evidence for Entity-Relation Reasoning), a training-free inference-time evidence interface for frozen VLMs. SEER hides candidate relations during pair localization, constructs a query-specific view with explicit subject/object roles, and retains the full image and sparse box geometry as complementary evidence. For relation-choice protocols with exact inverse support, an optional refinement swaps the entity roles and changes the forward decision only when exactly one visual state obeys the corresponding inverse relation. On an image-disjoint GQA-Train900 test frozen before model scoring, SEER pools to +3.94 [2.17,5.72] over Full; the gain remains positive under label-independent grounding-order counterbalancing and on the 535 rows whose entity names are unique. The unchanged protocol yields +4.35 to +11.79 on all 2,434 filtered EmbSpatial pair-relation questions across three models. Matched controls separate local refocus from role-explicit conditioning. These results establish query-specific evidence construction as the principal intervention, with reciprocal consistency as a smaller protocol-specific refinement.

cs.CV↗

RECAP: Relation Evidence Calibration for Detecting Spatial Relation Hallucinations in Vision-Language Models

Vision-language models can answer spatial relation questions confidently even when the image supports an incompatible relation. We formulate relation-grounded selective prediction: accept or reject an already-produced yes/no answer by auditing its visual support, rather than treating uncertainty as evidence. RECAP, our relation-evidence calibration framework, compares image-conditioned likelihoods for a claim, its semantic contradictions, and optional one-sided supports, then converts these witnesses into an answer-conditioned rejection risk. A calibration-only gate preserves confidence as a veto when confidence is demonstrably informative and otherwise deploys relation evidence alone. Across 20 group/image-disjoint splits, RECAP lowers H-FPR@80 over confidence by between 2.0 and 17.9 points on VSR and raises Acc@80 by 3.0, 8.6, and 12.6 points on What'sUp for Qwen3-VL-8B, InternVL3.5-8B, and LLaVA-1.5-7B. It outperforms matched VCD-style visual contrast on all four primary metrics in all six settings. Full-pool VSR fallback, target-ranked GSR-Bench transfer, equal-budget supervised controls, and two additional checkpoints show a consistent operating principle: structured counterevidence complements certainty when confidence is misaligned, while the gate retains confidence when it is already useful.

cs.CV↗

Rigid Functions, IP-Systems, and Topological Mild Mixing

We study uniform rigidity and topological mild mixing through continuous observables. For a fixed sequence of times, the observables rigid along that sequence form a closed unital $T^{\pm1}$-invariant algebra and determine the maximal factor uniformly rigid along the prescribed sequence. We then give functional forms of the classical ${\rm SIP}^{*}$- and ${\rm IP}^{*}$-return-time criteria: a topological dynamical system is mildly mixing exactly when it has no nonconstant locally SIP-rigid observable, and in the minimal category the same property is equivalent to the absence of nonconstant locally IP-rigid observables. Finally, a locally IP-rigid observable yields a canonical orbit-name factor carrying marked local data. For fixed local data, the $T^{\pm 1}$-invariant core of the local rigidity algebra determines a uniformly rigid factor whenever the core is nontrivial.

math.DS↗

Adherence Semigroups and Density Finite-Sums Configurations

In this paper, we use the adherence semigroup to describe finite-sums configurations in topological dynamical systems. We establish a correspondence between exact finite sumsets and powers of adherence elements. As applications, we give dynamical formulations of density finite-sums results, characterize total minimality through the density of adherence-power orbits, and give a positive answer to the ultrafilter question in [Question~8.9, 6]. We also characterize the sets that belong to the common sum of two commuting nonprincipal ultrafilters.

math.DS↗

Asymptotics of randomly weighted sums without moment conditions of random weights

In the paper, we investigate the asymptotics of randomly weighted sums with upper tail asymptotically independent and quasi-upper tail asymptotically independent primary random variables without requiring moment assumptions on random weights. For the case of primary random variables with regularly varying tails, we obtain more explicit results via an extension of Breiman's theorem. Then an application of the obtained results is established to asymptotically estimate for the finite-time and infinite-time ruin probabilities in a discrete-time risk model.

math.PR↗