Searcharxiv⌕ Search

arXiv subjects

Lei Wang

Publications and source records attributed to Lei Wang.

At least 37 records · Page 2Linked to original sources

Geometry-Aware Preference Optimization for Text-to-Image Diffusion Models

Preference alignment has become a standard practice for text-to-image diffusion models. Direct Preference Optimization (DPO) simplifies this process by eliminating explicit reward modeling. Its diffusion variant, Diffusion-DPO, has become a widely adopted baseline. Diffusion-DPO essentially encourages the likelihood of preferred samples while suppressing dispreferred ones. In this paper, we revisit DPO-style alignment methods for diffusion models from the perspective of the manifold hypothesis. Under this view, natural images concentrate near a low-dimensional manifold embedded in the high-dimensional ambient space, whereas DPO directly optimizes preference distributions in the full space without accounting for this geometric structure. This creates a mismatch in the optimization dynamics: it suppresses geometry-preserving tangential updates, while insufficiently restricting hazardous normal-direction updates. This mismatch gradually degrades image quality and diversity. To address this issue, we propose Anisotropic Geometry-Aware Preference Optimization (APO), which replaces the uniform Euclidean treatment of prediction errors with a geometry-aware anisotropic metric derived from the reference model. Concretely, APO adaptively strengthens regularization in directions where the reference denoising function is highly sensitive, while relaxing constraints in directions that permit safe semantic adjustment. This recalibrates preference optimization according to the local manifold geometry, and maintains the original manifold structure. Experiments show that APO achieves strong performance and an average win rate exceeding 60\% against various existing alignment methods across diverse benchmarks. It requires significantly fewer training steps than prior methods, and preserves generation diversity throughout training.

cs.CV↗

Learning to Revise Reasoning with Segment-wise On-Policy Distillation

On-policy distillation (OPD) improves large language model reasoning by training students on their own rollouts with dense token-wise supervision from the teacher. However, token-wise OPD does not explicitly provide a coherent alternative reasoning step showing how the student's step could be revised to improve subsequent reasoning. Furthermore, this paradigm can become less effective when the student produces a degenerate reasoning prefix, as subsequent teacher supervision remains conditioned on that prefix and may reinforce poor reasoning patterns. In this work, we focus on learning reasoning revision with segment-wise OPD to rework intermediate reasoning steps and better support subsequent reasoning. Through controlled reasoning interventions, we find that replacing student segments with teacher redrafts improves subsequent reasoning accuracy. Therefore, we address the problem of turning teacher redrafts into explicit supervision for learning to revise reasoning. We propose Segment-wise On-Policy Distillation (Seg-OPD), which selects student segments based on an uncertainty metric and obtains corresponding teacher redrafts. Seg-OPD trains the student to prefer teacher redrafts over their paired student segments while retaining dense token-wise OPD supervision. Extensive experiments on mathematical reasoning and competitive programming tasks show that Seg-OPD-trained students achieve higher revision success rates than baselines. Seg-OPD consistently outperforms the compared state-of-the-art baselines in reasoning accuracy with an average relative improvement of 5.22% across diverse models and tasks. Code is available at https://anonymous.4open.science/r/Seg-OPD.

cs.AI↗

Multimodal reasoning for broadly neutralizing antibody discovery from label-free human B cell repertoires across virus families

Discovering broadly neutralizing antibodies (bnAbs) from human natural immune repertoires remains a fundamental challenge in immunology, hindered by: the extreme rarity of bnAb, incomplete understanding of their cellular origins across pathogens, and the inability of existing computational tools to generalize across emerging viral threats. Here we present ImmuneAgent, a closed-loop AI system that integrates multimodal reasoning with continual meta-learning and wet-lab feedback to overcome these barriers. Applied to screen the natural BCR repertoires from vaccinated or infected cohorts, the system achieves a ~55% neutralization antibody discovery rate (60 of 110 cloned candidates) and a ~11% bnAb yield (12 of 110), substantially outperforming a state-of-the-art sequence-based neutralization predictor or cofolding models evaluated at the same cloning budget. Five ImmuneAgent-discovered antibodies conferred 100% in vivo protection against lethal influenza challenge, comparable to the clinical-stage therapeutic MEDI8852. The system recovered the cellular and structural determinants of bnAb activity and identified FCRL5+CD27+ atypical memory B cells as a conserved bnAb reservoir and hydrophobic interface enrichment as a cross-viral structural signature, which generalized to unseen antigens, discovering human metapneumovirus (hMPV) cross-neutralizing and human papillomavirus (HPV)-neutralizing antibodies without antigen-specific sorting. These results validate that ImmuneAgent is a generalizable framework for rapid therapeutic antibody discovery against emerging viral threats.

q-bio.QM↗

Harness Continual Learning: Continual Adaptation Beyond Model Parameters

Continual learning has largely been model-centric, treating model parameters as the state that changes with sequential experience. Modern agents can also adapt through a harness of prompts, memories, tools, skills, and routing rules. Because these contents jointly shape later execution, a harness update can disrupt previously reliable behavior even when the model is frozen. This raises a new question: how can an agent continually improve its state outside the model while retaining behavior acquired earlier? We formulate Harness Continual Learning (HCL), a new continual learning paradigm in which the harness evolves around a frozen foundation model, and define the resulting loss of earlier behavior as harness-level forgetting. We instantiate HCL with four execution-facing components: the Task Interface, Experience Memory, Capability Map, and Adaptive Router. We further introduce guarded harness evolution to separate update generation from state commitment. A Continual Optimizer proposes candidate harnesses from post-execution feedback, and a Continual Evaluator commits the resulting candidate harness only after checking current improvement, historical retention, and validity. Experiments on textual reasoning, multimodal perception, and open-world interaction demonstrate capability accumulation and failure recovery, with relative gains exceeding 10% over corresponding baselines in multiple settings. Component ablations assess the contribution of each harness component, while controlled retention sweeps reveal measurable harness-level forgetting and show that the stability--plasticity trade-off can be explicitly adjusted.

cs.LG↗

Topological Hall Effect Induced by Chiral Spin Textures at the Ferroelectric/Ferromagnetic Interface

Chiral spin textures, largely driven by the Dzyaloshinskii-Moriya interaction, offer significant potential for next-generation computing technologies due to their chirality and topological stability. Ferroelectric/ferromagnetic van der Waals heterostructures are particularly appealing because they can combine interfacial inversion-symmetry breaking and spin-orbit coupling to promote interfacial Dzyaloshinskii-Moriya interaction, while switchable ferroelectric polarization provides a nonvolatile tuning knob. This study investigates interfacial chiral spin textures in few-layer Fe$_3$GeTe$_2$/$α$-In$_2$Se$_3$ heterostructures. Two groups of topological Hall signals are identified just below and above the coercive field, and thickness-dependent transport reveals a notable reduction in critical temperature with increasing Fe$_3$GeTe$_2$ layer thickness. Low-temperature magnetic force microscopy images reveal two types of magnetic bubbles with opposite magnetic contrasts near the coercive field, each associated with distinct topological Hall signals. Together with atomistic spin-dynamics simulations and first-principles calculations, these results support the formation of interfacial DMI-stabilized chiral spin textures. Switching the ferroelectric polarization of the $α$-In$_2$Se$_3$ layer further enables nonvolatile modulation of both anomalous and topological Hall effects. The resulting ferroelectric and magnetic bistabilities generate four distinguishable Hall resistance states programmable by electric and magnetic fields. These findings highlight the potential of van der Waals interfaces for advanced device applications.

cond-mat.mtrl-sci↗

Graph Your Own Prompt

We propose Graph Consistency Regularization (GCR), a novel framework that injects relational graph structures, derived from model predictions, into the learning process to promote class-aware, semantically meaningful feature representations. Functioning as a form of self-prompting, GCR enables the model to refine its internal structure using its own outputs. While deep networks learn rich representations, these often capture noisy inter-class similarities that contradict the model's predicted semantics. GCR addresses this issue by introducing parameter-free Graph Consistency Layers (GCLs) at arbitrary depths. Each GCL builds a batch-level feature similarity graph and aligns it with a global, class-aware masked prediction graph, derived by modulating softmax prediction similarities with intra-class indicators. This alignment enforces that feature-level relationships reflect class-consistent prediction behavior, acting as a semantic regularizer throughout the network. Unlike prior work, GCR introduces a multi-layer, cross-space graph alignment mechanism with adaptive weighting, where layer importance is learned from graph discrepancy magnitudes. This allows the model to prioritize semantically reliable layers and suppress noisy ones, enhancing feature quality without modifying the architecture or training procedure. GCR is model-agnostic, lightweight, and improves semantic structure across various networks and datasets. Experiments show that GCR promotes cleaner feature structure, stronger intra-class cohesion, and improved generalization, offering a new perspective on learning from prediction structure. [Project website](https://darcyddx.github.io/gcr/) [Code](https://github.com/Darcyddx/graph-prompt)

cs.LG↗

Mie-lithography: void-resonance-assisted femtosecond laser printing for deep-ultraviolet to near-infrared nano dispersion devices

Nanoscale control of optical dispersion is essential for applications ranging from miniaturized spectrometers to color printing, all of which demand broadband spectral tunability. However, the Kramers-Kronig relations impose a fundamental trade-off between dispersion and loss, strictly limiting the design ability of single-material devices across the deep ultraviolet (DUV) to near-infrared (NIR) regimes. Consequently, the fabrication of miniaturized dispersion devices heavily relies on costly nanofabrication or heterogeneous integration. Here we overcome these limitations by shifting the light-matter interaction from solid structure into air-filled voids. We introduce a fabrication strategy termed "Mie-lithography", in which laser printed seed nanocavities excite Mie resonances in air and the resulting localized field enhancement drives the self-assembly of three-dimensionally tunable void-type optical resonators. Because the resonant modes are primarily confined within air voids, this architecture effectively alleviates material-imposed dispersion-loss constraints, allowing on-demand customization of the broadband spectral response. This approach could enable single-step, high-throughput (>= 10^6 pixels/s) printing of dispersion units with a resolution of 63,500 DPI. As a proof of concept, we demonstrate a single-material nano dispersion device for spectral encoding from 200 to 800 nm, with spectral reconstruction using a camera. Our approach can be extended into a platform for ultra-broadband (DUV-NIR) nano devices fabrication and design, opening avenues for high-pixel-density displays and miniaturized spectrometers.

physics.optics↗

Regular simplex tensors: optimization landscape, conjecture proof, and beyond

The concept of tensor eigenpairs has attracted increasing research attention in the past decades. Recent works have focused on a special class termed regular simplex tensors, which are constructed from an equiangular tight frame of n vectors in (n-1) dimensional space for n >= 3 and order m >= 3. Existing works focus on analyzing the robustness of eigenpairs obtained by the tensor power method. At the end of that work, a conjecture was made that if they exist, the only robust eigenvectors of a regular simplex tensor, up to sign equivalence, are the vectors in the regular simplex frame. A subsequent study theoretically proved that this holds for the simplest triangle case where n = 3. However, for cases with higher n, the process becomes complicated in both checking all eigenpairs and determining the explicit formula for the robustness criterion. In this paper, to deal with this issue, a connection between robust and locally optimal eigenpairs is built, recognizing the latter as another pivotal concept in the field of optimization. Then, we turn to checking the local optimality of all eigenpairs, for which we have developed an efficient model with a favorable structure that facilitates the enumeration of all eigenpairs and delineates the optimization landscape for the model. Then, integrating the two advances enables us to narrow the scope of the robust eigenpairs to those locally maximized ones, which are exactly the vectors in the regular simplex frame. Finally, the proof of the conjecture reduces to only examining the vectors in the frame, whose robustness can be easily checked for any higher n and m. This work shows that, up to sign equivalence, excluding the exceptional cases (m, n) = (3, 3)/(3, 4)/(4, 3) where no robust eigenpairs exist, the only robust eigenvectors of a regular simplex tensor are the vectors in the regular simplex frame.

math.OC↗

One Sequence, Many Decodings: CAGenMol-2 Recasts Drug Design as Masked Molecular Inference

Drug design couples property evaluation, conditional generation, structure-based design, and local optimization, yet machine learning systems typically address these capabilities with separate task-specific models. We introduce CAGenMol-2, a masked diffusion molecular language model that represents molecules, continuous scalar properties, and 3D protein pockets within a single wrapped sequence. Within this pretrained interface, downstream operations are selected by which sequence regions are observed or masked at inference, allowing one checkpoint to perform property prediction, property- and pocket-conditioned generation, and partial-constraint design without task-specific architectures or backbone fine-tuning. We further propose Adaptive Fragment Optimization (AdaFO), a gradient-free mask-and-refill search that turns the masked decoder into an iterative local molecular optimizer. On CrossDocked2020, AdaFO increases Success Rate from 30.2\% to 70.8\%, the best reported under this protocol, while largely preserving drug-likeness and diversity. Finally, scaffold-preserving directional editing and CRBN/VHL case studies demonstrate its use in compound design workflows spanning local molecular editing, structure-based prioritization, and downstream simulation-based screening.

cs.LG↗

Adaptive Resource Allocation for Effective and Efficient LLM Social Survey Simulation

Large Language Models (LLMs) enable scalable social survey simulation, yet existing pipelines typically use the same strong general-purpose model and a fixed, often large, respondent history for every respondent-question request. This uniform approach overlooks three factors. First, stronger models may rely on their own knowledge rather than respondent-specific evidence while costing more. Second, additional history can help when evidence is limited, but irrelevant responses may add noise and increase input length. Third, the preferred model and history budget can depend on each other. We propose E2Sim, an adaptive resource allocation framework that jointly selects a model and history budget for each request. Given a respondent persona, ranked response history, and target question, a lightweight policy predicts the accuracy and cost of each configuration and selects the most suitable one. We use respondent-history drop-and-swap augmentation to improve robustness to incomplete or variable histories, and a margin-based curriculum that progresses from easier allocation decisions to harder ones. Experiments on four real-world social survey datasets, multiple model pools, and different history-budget spaces show improvements over the oracle best-fixed configurations, with accuracy gains of up to 6.3 percentage points and cost reductions of up to 55.3 percent. Code is available at https://anonymous.4open.science/r/E2Sim-DE66.

cs.CY↗

SCBO: Semantically Coherent Batching and Ordering for LLM-Based Social Surveys

Large Language Models (LLMs) offer a scalable way to simulate survey respondents using demographic profiles and observed reference responses. However, the conventional approach of predicting one question per prompt repeatedly encodes the same context, limits each target to a narrow set of reference responses, and prevents later predictions from using information in earlier answers. Predicting multiple questions in one prompt can reduce these costs, share a broader pool of references, and let later predictions build on earlier ones. This requires forming coherent batches, selecting shared references, and ordering questions and references effectively. We propose Semantically Coherent Batching and Ordering (SCBO), a training-free framework that addresses these challenges. SCBO first uses an LLM to extract compact semantic representations from survey items and filter out template noise. It then groups related questions into batches and builds a shared reference bank using target-specific retrieval and centroid-based completion. Finally, it orders target questions from easy to hard and arranges references according to their semantic alignment with those questions. Experiments on four large-scale survey datasets and four LLMs show that SCBO substantially reduces token consumption and inference time while generally improving prediction accuracy over a non-batched baseline. Code is available at https://anonymous.4open.science/r/SCBO-41D8.

cs.CL↗

Compressed LLM Reprogramming for Vision-Aided Beam Prediction in Vehicular Networks

Large Language Model (LLM) reprogramming-based beam prediction demonstrates strong data efficiency by adapting pretrained language models for vehicle-to-infrastructure (V2I) beam prediction, yet the resulting model complexity makes such approaches impractical for latency-sensitive deployment. We propose LLMBP-Lite, a compact LLM-reprogrammed framework for beam prediction. It leverages structural redundancy through pruning along three complementary dimensions: Transformer depth, source-prototype vocabulary size, and prompt length. Additionally, knowledge distillation can be optionally employed to maintain the pretrained representational capacity after compression. Experiments on the real-world dataset demonstrate that LLMBP-Lite achieves a $65\times$ inference speedup over the uncompressed LLM-based baseline while maintaining prediction accuracy and consistently outperforming recurrent baselines under limited training data. These results demonstrate that the tradeoff between data efficiency and deployment efficiency can be substantially mitigated in vehicular networks.

eess.SP↗

LongCat-DeepResearch Technical Report

We present LongCat-DeepResearch, a deep research system that combines an enhanced LongCat model with a multi-agent workflow for producing comprehensive, evidence-grounded reports. The workflow separates global planning from detailed investigation and coordinates revision at the section level. Multiple planning agents first explore external sources and refine an actionable research plan, termed ResearchSpec. Research agents then investigate and draft their assigned sections in parallel, gathering additional evidence in separate contexts as their analyses develop. Once the sections are assembled, global review guides targeted local revisions, reducing reliance on repeated full-report rewriting. This workflow also supports the construction of research tasks and trajectories for the mid-training and post-training of LongCat's general-purpose models. LongCat-DeepResearch achieves 55.25 on DeepResearchBench, 51.35 on DeepResearchBench II, and 79.83 on ResearchRubrics. On an in-house benchmark, it scores 76.04, ranking second among four compared systems. Development-set analyses show benefits from combining planning perspectives, while further planning refinement has mixed effects. Additional editing improves average automatic readability preference across two benchmarks, with different trends on each.

cs.AI↗

Baroclinic Annular Mode Modulates Global Atmospheric Rivers and Extreme Precipitation

The Baroclinic Annular Mode (BAM) strongly influences extratropical circulation, yet its role in the global hydrological cycle remains unclear. Using ERA5 reanalysis and a global atmospheric river (AR) database, we show that BAM systematically reorganizes AR occurrence and extreme precipitation in both hemispheres. During high-BAM states, AR frequency increases along the flanks of major storm tracks and decreases near their climatological cores, redistributing preferred AR corridors. Relative AR-frequency changes locally exceed 50%, with the most zonally coherent patterns over the Southern Ocean. Extreme precipitation varies correspondingly, with 99th-percentile precipitation occurrence increasing by more than 50% across broad poleward storm-track regions. A large fraction of these extremes coincide with ARs, and AR-associated extreme precipitation shows similar BAM-related modulations. Low-BAM states show broadly opposite anomalies. These results identify BAM as a key mode linking large-scale circulation to global moisture transport and hydrological extremes.

physics.ao-ph↗

GeoShrink: Accelerating Diffusion Transformers with Two Lines of Code

Diffusion transformers incur substantial inference cost through repeated model evaluations along a sampling trajectory. We introduce GeoShrink, a training-free acceleration method that retains the original solver grid while evaluating the model only at a prescribed set of anchors. At skipped stages, GeoShrink predicts the solver-facing output by adding a geometrically retained fraction of the latest observed innovation to the most recent exact output. We derive this rule from chordal tangent transport and round-trip line projection, and establish a geometric anchor-spacing principle that minimizes the largest adjacent gap expansion under fixed coverage and first span. The analysis characterizes the geometric closure and propagation of prediction errors without assuming access to future model outputs. Experiments cover image, video, motion, and audio generation, together with adapted 3D backends. At approximately $5\times$ acceleration, GeoShrink improves FLUX PSNR by 3.10 dB over the strongest listed baseline. On HunyuanVideo, it achieves a reported $4.99\times$ speedup and improves ChronoMagic-Bench-150 PSNR by 5.44 dB over the strongest listed fidelity baseline. Comparisons at fixed evaluation budgets further show substantial gains on motion, audio, music, and 3D generation.

cs.CV↗

Near-Oracle KV Selection via Pre-hoc Sparsity for Long-Context Inference

A core bottleneck in large language model (LLM) inference is the cost of attending over the ever-growing key-value (KV) cache. Although near-oracle top-k KV selection can preserve the quality of dense attention while sharply reducing computation and bandwidth, existing sparse methods generally rely on posterior heuristics, i.e., selectors conditioned on observed attention or proxy scores. Such conditioning introduces posterior bias: it tends to distort true token importance and miss salient tokens, thereby impairing long-range reasoning. To tackle this problem, we propose Pre-hoc Sparsity (PrHS), which selects KV entries before attention scoring and provides explicit accuracy control. Let the attention mass of discarded entries be delta (the dropped mass). Through a marginal-to-mutual-information analysis, we derive an upper bound on the mutual-information loss that depends only on the dropped mass. This relation explains failure modes of posterior heuristics and enables verifiable guarantees by controlling the dropped mass in advance. Within PrHS, we instantiate three orthogonal pre-hoc selectors along the axes of time, depth, and layer. Extensive experiments on LLaMA and Mistral families validate PrHS. Across GSM8K and CoQA, PrHS reduces retrieval overhead by over 90%, achieving 3x higher retrieval sparsity than HShare at matched or better accuracy. It incurs under 1% average degradation on LongBench, lowers attention FLOPs by about 15% versus prior sparse baselines, and yields a 9.9x speedup in attention-operator latency and 2.8x higher throughput on NVIDIA A100-80GB GPUs than the dense baseline.

cs.LG↗

Fine-Tune, Then Rectify

Driven by recent advances in artificial intelligence, a growing literature has demonstrated the potential of using large language models (LLMs) as scalable surrogates to generate human-like responses. Two common approaches to improve the performance of LLMs include: fine-tuning, which aligns the LLM more closely with human responses, and rectification, which corrects biases in LLM outputs. In this paper, we develop a two-stage framework that combines fine-tuning and rectification, and optimally allocates limited labeled samples across the two stages. A key insight is that the conventional fine-tuning objective of minimizing mean squared prediction error is generally not aligned with the downstream rectification stage. For mean estimation, we propose to minimize the variance of the prediction errors; for general M-estimation, we propose to minimize a scalarized variance metric as the fine-tuning objective. Building on this insight, we leverage the scaling law of fine-tuning to optimally allocate the limited labeled human data between the fine-tuning and rectification stages. Our empirical analysis validates the fine-tuning scaling law and confirms that our proposed optimal allocation rule reliably identifies the optimal sample allocation. We demonstrate substantial efficiency gains in estimation and inference performance relative to fine-tuning or rectification alone, or to employing the conventional mean squared error objective within the fine-tuning then rectification framework. Such efficiency gains translate to significant cost savings for making reliable decisions.

cs.LG↗

Electroweak phase transition triggered by a long-lived scalar and LHC searches

We investigate a long-lived scalar $S$ that triggers a strongly first-order electroweak phase transition (SFOEWPT) in the singlet scalar extension of standard model (SM). A sufficient small mixing angle between $S$ and the SM-like Higgs boson $h$ naturally leads to a long lifetime for $S$. We focus on the mass range $m_S>m_h/2$, where the dominant production channel at the LHC is the Higgs-mediated process $gg\to h^*\to SS$ with an off-shell $h$. By analyzing the finite-temperature effective potential, we identify the parameter space realizing an SFOEWPT and calculate the associated gravitational-wave spectra, finding that part of the parameter space can be probed by LISA. We further study the LHC sensitivity to the long-lived $S$ using the ATLAS detector and proposed far detectors, including ANUBIS, CODEX-b, FACET, FASER2, MoEDAL-MAPP1 and MAPP2, and MATHUSLA. The combined sensitivity of the main detector and far detectors, particularly ANUBIS and MATHUSLA, allows a large fraction of the SFOEWPT parameter space to be probed for $10^{-10}\leq \sinθ\leq 10^{-5}$, with $m_S$ up to $250~\mathrm{GeV}$. For $\sinθ\leq 10^{-11}$, however, the SFOEWPT parameter space becomes inaccessible to both the main detector and the far-detector searches.

hep-ph↗