Test-Time Adaptation (TTA) aims to adapt pretrained models to unseen test data, which is crucial for resource-constrained edge devices that must handle distribution shifts on the fly without human supervision. However, conventional TTA methods often fail in realistic scenarios characterized by continuous shifts and severe class imbalances while incurring prohibitive memory overheads. To enable continuous adaptation to test data on edge devices under a realistic TTA setting, we propose a Bias-Resistant Online Statistical Alignment (BOSA) method. BOSA facilitates unbiased adaptation via a discrepancy-aware statistical alignment mechanism integrated with a class-balanced memory bank. To ensure memory efficiency, we further design a saliency-guided activation sparsification and gradient reconstruction scheme, which drastically reduces memory overhead without sacrificing gradient integrity. Extensive evaluations demonstrate that BOSA achieves superior accuracy with a compact memory consumption compared to state-of-the-art methods under realistic TTA settings.
论文检索
输入标题、作者或关键词，从 100,903 篇学术成果中精准定位
Agents in the real world must often balance multiple objectives, such as speed, stability, and energy efficiency in continuous control. To account for changing conditions and preferences, an agent must ideally learn a Pareto frontier of policies representing multiple optimal trade-offs. Recent advances in multi-policy multi-objective reinforcement learning (MORL) enable learning a Pareto front directly, but require full multi-objective consideration from the start of training. In practice, multi-objective preferences may arise after a policy has already been trained on a single specialised objective. Existing MORL methods cannot leverage such a pre-trained ‘specialist’ to learn Pareto fronts and avoid incurring the sample costs of retraining. We introduce Mixed Advantage Pareto Extraction (MAPEX), an offline MORL method that constructs a frontier of policies by reusing pre-trained specialist policies, critics, and replay buffers. MAPEX combines evaluations from specialist critics into a mixed advantage signal, and weights a behaviour cloning loss with it to train new policies that balance multiple objectives. MAPEX’s post hoc Pareto front extraction preserves the simplicity of single-objective off-policy RL, and avoids retrofitting these algorithms into complex MORL frameworks. We formally describe the MAPEX procedure and evaluate MAPEX on five multi-objective MuJoCo environments. Given the same starting policies, MAPEX produces comparable fronts at 0.001% the sample cost of established baselines.
Model editing updates a pre-trained LLM with new facts or rules without retraining while preserving unrelated behavior. In real deployment, edits arrive as long streams, creating a plasticity–stability dilemma: repeated locate-then-edit “hard writes” can accumulate interference over time, while rigid preservation constraints may protect only explicitly constrained directions, allowing past edits or unconstrained behaviors to deviate. We propose RLSEdit, a recursive least-squares editor for long sequential editing. RLSEdit formulates editing as an online quadratic optimization with soft constraints, minimizing a cumulative key-value fitting objective together with two regularizers that control deviation from the pre-trained weights and from a designated anchor mapping. This objective admits an efficient Woodbury-based online recursion, with per-edit cost independent of history length and scaling only with the current edit size. We further provide deviation bounds and an asymptotic characterization of the adherence–preservation trade-off in the many-edits regime. Experiments on CounterFact and ZsRE across multiple model families show stable scaling to 10K edits, outperforming strong baselines in both edit success and holistic stability, while retaining early edits and preserving general capabilities on GLUE and held-out reasoning/code benchmarks. Code will be at here.
Propositional Model Counting (#SAT) is essential for probabilistic reasoning but faces scalability limits on single cores. Existing distributed approaches struggle with high initialization overheads (static decomposition) or rigid architecture. We propose a novel, generic framework for distributed exact model counting. Leveraging C++ templates, our architecture decouples parallel orchestration from solving logic, enabling state-of-the-art solvers to be parallelized with minimal modification. We implement an adaptive work-stealing strategy that ensures effective load balancing. Experiments on competition benchmarks show that our approach achieves near-linear scalability and significantly outperforms existing distributed solvers.
Graph Transformers (GTs) have emerged as a powerful paradigm for graph representation learning, leveraging attention mechanisms to enable flexible information exchange. Recent GTs often adopt local attention to restrict computation to neighborhoods, thereby reducing costs and enhancing scalability. However, local attention computation poses a serious issue that significantly reduces the efficacy of the overall approaches – because computation is restricted to local neighborhoods, node pairs that share topological patterns receive similar attention scores, thereby reducing attention’s discriminative power. Consequently, GT-based models typically overemphasize common structural motifs but fail to capture node-specific properties. To address this problem, we propose DNFormer, a novel GT grounded in differential modeling. We introduce a differential local attention mechanism in DNFormer that computes attention scores as differences across multiple topology-aware similarity measures, rather than relying on a single score. This mechanism suppresses shared topological patterns among neighbors and emphasizes relative node-to-node distinctions. As a result, DNFormer mitigates structural dominance in attention aggregation, better capturing node-specific relational patterns while preserving local structural properties. Extensive experiments confirm DNFormer's superior performance over representative GT baselines.
Coarse-grained time series (CGTS) are critical for business and macroeconomic analysis. However, CGTS are typically updated infrequently and contain few observations, so model-centric training on raw data is prone to overfitting and degraded forecast accuracy. To address this, we propose SI-CVAE, a scale-invariant conditional generative model built around variable-length subsequences, and adopt a data-centric "train on synthetic, test on real" paradigm to enhance downstream forecasting. Specifically, we first introduce a variable-length subsequence clustering-and-matching algorithm to capture cross-scale recurring patterns within a series. We then design a frequency-domain conditional VAE with a frequency-domain linear decoder to enable controllable, arbitrary-length sequence synthesis while enforcing scale-invariance constraints. Finally, we develop a time-domain reconstruction strategy with subsequence-conditioned fusion to ensure temporal continuity and spectral consistency across concatenated segments. We conduct extensive experiments on six ship-sales datasets and four U.S. macroeconomic indicators. Results show that replacing or augmenting the original training set with SI-CVAE–generated data yields consistent accuracy gains across multiple forecasting baselines, and that SI-CVAE attains higher synthetic-data quality than state-of-the-art generators on standard metrics.
Predicting responses to genetic perturbation is pivotal for elucidating gene regulatory machinery. However, existing methods often rely on statistical perspectives to model differential expression, overlooking the constraints of the underlying molecular interactome, which renders predictions susceptible to spurious correlations. Based on the fact that a genetic perturbation is a molecular stimulus acting through functional connectivity to reconfigure cellular expression profiles, we propose PertDCR, a framework for context-aware Perturbation response prediction via Distance-Constrained Refinement. Specifically, PertDCR addresses the heterogeneity of perturbation effects by contextualizing the perturbation source with relevant gene programs inferred from the protein-protein interaction network as well as cell representation. To activate biologically valid responses, PertDCR predicts the distance between the perturbation source and highly responsive genes within the PPI network, and dynamically modulates the response intensity based on distance, thereby facilitating accurate perturbation prediction. Extensive experiments demonstrate that PertDCR achieves state-of-the-art performance across diverse unseen genetic perturbations, and the predictions are consistent with underlying biological mechanisms.
Post-training quantization (PTQ) is widely used to compress large language models without retraining. However, many existing weight-only methods rely on heuristic objectives and greedy rounding strategies, leading to noticeable degradation under low-bit quantization. We propose OJBKQ, a layer-wise PTQ method that formulates weight quantization as a joint optimization problem over activations and weights, yielding a multiple-right-hand-side box-constrained integer least squares (BILS) problem per layer. To solve this NP-hard problem, we extend Klein’s randomized variant of Babai’s nearest-plane algorithm to handle box constraints and run the extended algorithm K times to generate K box-constrained Klein points. The minimum-residual candidate among these points and the box-constrained Babai point is selected as a suboptimal solution. Experiments on large language models show that OJBKQ achieves lower perplexity at 3–4 bits than existing PTQ methods, while maintaining comparable computational cost.
Generating high-quality adversarial texts with low query budgets remains a challenging problem in the hard-label scenario. Most existing approaches rely on greedy algorithms, where one position in the text is selected for substitution, followed by the substitutions of other positions. This local search approach may fail to discover high-quality adversarial examples and often leads to excessive query costs. Ideally, an optimal adversarial sample would consider all possible position combinations in the text, but exhaustive search is computationally impractical. To address this challenge, we propose a sampling-based method called LBA, which constructs an approximate distribution of high-quality adversarial examples by integrating both prior and posterior knowledge, and utilizes this distribution for sampling. As sampling progresses, posterior knowledge updates the approximate distribution, which in turn guides more effective sampling. Extensive experiments on six language models, ranging from small-scale to large-scale architectures across four datasets, demonstrate that LBA significantly outperforms state-of-the-art baselines on all evaluation metrics. Additionally, LLM-based assessment indicates that LBA generates more semantically preserved and comprehensible adversarial texts.
High-resolution sinogram completion is critical for computed tomography reconstruction, as missing projections can introduce severe artifacts. While diffusion models provide strong generative priors for this task, their inference cost grows prohibitively with resolution. We propose HRSino, a training-free and efficient diffusion inference approach for high-resolution sinogram completion. By explicitly accounting for spatial heterogeneity in signal characteristics, such as spectral sparsity and local complexity, HRSino allocates inference effort adaptively across spatial regions and resolutions, rather than applying uniform high-resolution diffusion steps. This enables global consistency to be captured at coarse scales while refining local details only where necessary. Experimental results show that HRSino reduces peak memory usage by up to 30.81% and inference time by up to 17.58% compared to the state-of-the-art framework, and maintains completion accuracy across datasets and resolutions.
Unsupervised learning of neural operators is constrained by numerical instability, causing predictions to diverge in long-horizon rollouts. To address this, we present a physics-constrained unsupervised neural operator for long-horizon PDE learning on generalized geometries (UNOP). This framework replaces differential constraints with integral consistency for stable, label-free learning. Unlike prior works, UNOP is built upon Latent Integral Physics Embedding (LIPE), which enforces physical consistency through integral constraints. To extend integral formulations to generalized geometries, the Geometry-Agnostic Latent Adapter (GALA) projects them onto a unified latent grid of PDE inputs, providing a regularized domain for spatial integral evaluation. Based on this shared embedding, the Gated Spectral Evolution Operator (GSEO) performs stable temporal integration while retaining spatial regions with sharp gradients and fine-scale structures, with the evolution constrained by the LIPE objective. Experiments on 1D, 2D, and 3D benchmarks show UNOP outperforms state of the art methods, reducing error accumulation by up to 60% in 20-step rollouts. Code is available at https://github.com/chengxinrui/UNOP.
Federated learning (FL) has emerged as a promising paradigm for adapting large language models (LLMs) to distributed data. To mitigate the high communication and memory overhead, parameter efficient techniques such as Low Rank Adaptation (LoRA) are widely adopted. However, practical deployments often exhibit rank and data heterogeneity, making direct aggregation of LoRA updates biased and unstable. Existing approaches enforce a unified rank or align heterogeneous updates into a single shared subspace, which undermines personalization and accuracy. Moreover, under differential privacy (DP), adding noise to such mixed updates could perturb client specific directions that should remain local, resulting in utility loss. To address these issues, we propose Selective Decoupled Federated LoRA (SDFLoRA), a structure aware LoRA framework that decouples each client update into a shared component for updating and a private component that preserves client specific semantics. Subspace alignment and aggregation are applied selectively to the shared module, while private modules remain local. We further design low rank re-compression to maintain a fixed rank budget for the shared module. This structure supports privacy aware optimization by injecting DP noise exclusively into the shared module. Experiments on multiple benchmarks demonstrate that SDFLoRA beats federated LoRA baselines and exhibits strong robustness under privacy constraints.
Existing degradation-resistant infrared-visible image fusion methods struggle to effectively handle composite degradations, where multiple degradation types exhibit intricate coupling and mutual interference. To address this challenge, we propose SpeciFuse, an infrared-visible image fusion network that learns degradation-specific representations. By explicitly modeling the specificity of individual degradations through a siamese architecture trained on single-degradation data, our method effectively addresses the conflicts arising from multiple degradations, thereby achieving robust fusion performance that generalizes to diverse composite degradation scenarios. In SpeciFuse, a degradation-type specificity decoupling module is designed to disentangle the feature representations by attenuating their redundant correlations in a latent space. It minimizes off-diagonal elements to enforce independence among the encodings of distinct degradation types, while preserving dominant diagonal elements to maintain shared content information. Furthermore, a degradation-aware gated fusion module leverages these decoupled features to dynamically modulate cross-modal fusion across both channel and spatial dimensions. This facilitates a degradation-conditional fusion process that adaptively suppresses degradation artifacts while preserving beneficial information across varying conditions. In extensive comparisons with state-of-the-art methods, SpeciFuse demonstrates more robust performance under diverse composite degradations. The code is available at https://github.com/xbsj-cool/SpeciFuse.
Recent advances in time series forecasting (TSF) leverage large language models (LLMs) to provide semantic priors, enabling more robust forecasting under limited training data. However, directly fusing semantic signals into temporal features often induces modality entanglement and obscures local temporal structures when cross-modal correlations are weak, noisy, or inconsistent. To address these issues, we propose Attention as Selection (AAS), a dual-branch framework that decouples temporal and semantic representations. Specifically, we define cross-modal attention as a selection process, where semantic prompts are employed to induce a sparse temporal attribution distribution over temporal positions. This guides the model to focus on critical time steps without interfering with the construction of temporal representations. Furthermore, low-entropy regularization is employed alongside global cross-modal consistency constraints to regulate the selection behavior, ensuring that semantic guidance remains sparse, stable, and aligned with temporal dynamics. Extensive experiments on six real-world datasets demonstrate that AAS outperforms existing methods across various forecasting scenarios. Code is available at https://github.com/VIMLab-hfut/Attention-as-Selection.
Mobile Manipulation (MM) involves long-horizon decision-making over multi-stage compositions of heterogeneous skills, such as navigation and picking up objects. Despite recent progress, existing MM methods still face two key limitations: (i) low sample efficiency, due to ineffective use of redundant data generated during long-term MM interactions; and (ii) poor spatial generalization, as policies trained on specific tasks struggle to transfer to new spatial layouts without additional training. In this paper, we address these challenges through Adaptive Experience Selection (AES) and model-based dynamic imagination. In particular, AES makes MM agents pay more attention to critical experience fragments in long trajectories that affect task success, improving skill chain learning and mitigating skill forgetting. Based on AES, a Recurrent State-Space Model (RSSM) is introduced for Model-Predictive Forward Planning (MPFP) by capturing the coupled dynamics between the mobile base and the manipulator and imagining the dynamics of future manipulations. RSSM-based MPFP can reinforce MM skill learning on the current task while enabling effective generalization to new spatial layouts. Comparative studies across different experimental configurations demonstrate that our method significantly outperforms existing MM policies. Real-world experiments further validate the feasibility and practicality of our method. The source code is available at https://csu-hero-lab.github.io/SG-MM Web.
Backdoor attacks pose a serious threat to deep reinforcement learning (DRL). Current defenses typically rely on reward anomalies to reverse-engineer triggers and model finetuning to remove backdoors. However, complex trigger patterns undermine their robustness, and fine-tuning entails high costs, limiting practical utility. To this end, we shift defense concerns to trigger-agnostic backdoor output behaviors and propose BehaviorGuard, an online behavior-based backdoor detection and mitigation framework for DRL. Specifically, we find that regardless of attacks, backdoored policies induce consistent shifts in action distributions to ensure reliable activation, leaving detectable traces in high-quantile regions and distribution tails, even in the absence of triggers. Based on this, we design a novel metric that captures behavioral drift in action distributions to identify and suppress backdoor actions at runtime. To our knowledge, this is the first online backdoor defense that counters attacks both in single- and multi-agent DRL. Evaluated across diverse benchmarks with different backdoor attacks, BehaviorGuard consistently surpasses prior methods in both efficacy and efficiency.
Most text-to-motion models treat motion duration as a fixed hyperparameter rather than a variable inferred from semantics, inducing two systematic failure modes: duration trailing on short prompts and stage-wise semantic collapse on long, multi-stage prompts. To address this issue, we propose TPPMG (Temporal Planning-driven Progressive Motion Generation), which factorizes generation as semantics -> temporal structure -> motion realization. TPPMG comprises two components: (1) a Temporal Planner that maps text to an explicit stage-duration script via an LLM with a lightweight duration calibrator; and (2) a Progressive Diffusion Generator that bridges fixed-length diffusion training and variable-length inference through heterogeneous noise scheduling and a sliding-window mechanism, enabling budget-driven variable-length motion synthesis. To evaluate both failure modes with verifiable ground truth, we construct three benchmarks: HumanML3D-Short, HumanML3D-Concat, and BABEL-Concat, along with a comprehensive evaluation suite. Experiments show that TPPMG suppresses duration trailing (UR: 0.52 -> 0.85), substantially improves multi-stage structure recovery (PhaseRecall: 0.56 -> 0.90, BoundaryF1: 0.28 -> 0.56), and reduces boundary discontinuity at stage transitions.
Unsupervised 3D semantic segmentation is vital for label-free open-world perception. However, current methods typically struggle with two core limitations: fixed category assumptions that restrict adaptability in complex scenes, and geometric incompleteness caused by irregular point sampling, which degrade the integrity of local geometric descriptors for fine-grained or long-tail objects. To address these, we propose DyG-Seg, a Dynamic Geometric-Semantic Alignment framework. First, targeting the challenge of incomplete geometry, the Geometric Manifold Rectification (GMR) leverages a diffusion model to reconstruct integral object geometry and recover the underlying manifold topology, thereby enhancing feature discriminability. Utilizing this geometric prior, the Dynamic Prototype Contrastive Clustering (DPCC) applies non-parametric Bayesian inference to automatically estimate the optimal number of clusters and generate pseudo-labels. Finally, our Iterative Optimization with Dynamic Constraints integrates Dynamic Class Balancing (DCB) to mitigate long-tail bias. Capitalizing on the recovered manifold topology, we enforce Spatial Geometric Consistency to rectify structural incompleteness and ensure spatially coherent semantic predictions. Extensive experiments on ScanNet and S3DIS demonstrate that DyG-Seg discovers latent semantic structures and significantly outperforms state-of-the-art unsupervised methods.
Heterogeneous Graph Prompt Learning (HGPL) has emerged as a promising paradigm for bridging the gap between the objectives of pre-training foundation models and their downstream applications in heterogeneous graph settings. However, existing HGPL methods are primarily designed for in-domain scenarios, whereas real-world deployments often span multiple domains, and the data used for pre-training and downstream tasks may originate from different distributions. Consequently, the applicability of current HGPL approaches is limited in in-domain settings, and their performance typically degrades when application domains shift. To address this serious limitation, we develop CHoE, a cross-domain HGPL method built upon an expert network. During pre-training, we introduce and train structure-conditioned experts, and during prompt tuning, we propose a structure-aware expert routing and load balancing mechanism to select structurally compatible experts for each meta-path view. In addition, we design a prompt-based semantic fusion module to integrate representations across views for downstream prediction. Extensive experiments show that CHoE consistently improves performance in few-shot cross-domain applications, outperforming all baseline approaches.
Optimization problems such as Viterbi decoding and V-optimal histogram construction seek a path of exact length L through a state space that minimizes a cost function. These problems are traditionally solved using dynamic programming (DP). A best-first-search (BFS) solution is also applicable, yet requires maintaining a priority queue. In all cases, memory usage grows linearly with both state space size and path length. In this paper, we propose CompactBFS, a framework that limits the growth of the BFS priority queue to space-efficiently determine the exact optimal cost for a fixed-length path and then constructs such a path by a divide-and-conquer strategy that eliminates the memory overhead. We apply CompactBFS to Viterbi decoding, which remains relevant to speech recognition, and V-optimal histogram construction. Our experimental results demonstrate significant gains over state-of-the-art solutions in runtime and memory consumption.