Skip to main content
Search

Xinjiang University

3 related articles

Subscribe to updates
  1. Federated load event recognition stops sharing semantics unconditionally: FedReST edges an architecture-matched FedAvg by 0.00524 Event F1 on REFIT 2014 at 10% labels

    Federated non-intrusive load monitoring lets households collaborate without centralizing raw power traces, yet sparse local labels and household-specific operating patterns make cross-client semantic evidence unevenly reliable. FedReST splits collaboration into two admissions: the server uses reliability-gated partial optimal transport to accept only semantic mass that both sides support, and each receiving client filters the resulting update through function-preserving gradient projection so locally mastered states are not disturbed. On frozen REFIT 2014 rolling folds with 10% visible labels and matched two-epoch local budgets, corrected-core FedReST shows paired differences of +0.00524 in Event F1 and +0.00104 in Window F1 against an architecture-matched Head+BN FedAvg reference.

  2. Right tool, swapped argument: BiCP cuts confirmed injected attacks from 83/682 to 0/682 on a 922-case fixed replay

    Tool-using language-model agents can pick the intended tool yet execute an injected argument, and existing counterfactual guards lose source sensitivity when they score with a reasoning prefix that already encodes the injected decision. BiCP removes the current-step reasoning prefix before scoring, probes both the tool-name target and the complete-call target, and routes proposals by operation risk. On a 922-case fixed replay, the full method reduces confirmed InjecAgent attacks from 83/682 to 0/682 and unsafe conditional executions from 33/240 to 0/240, while benign task success rises from 66/120 to 78/120.

  3. After a Distribution Fault, Speed Is Not the Only Goal: Graph Attention Cuts Self-Healing Decisions to 2.3 ms Near the Optimum

    Distribution-network self-healing has traded decision quality, real-time speed and explainability against one another: mathematical programming nears the optimum but is slow, while deep reinforcement learning decides in milliseconds but stays opaque. Embedding a graph attention network as the shared backbone of a soft actor–critic agent and writing a resilience index into the reward brings online decisions to 2.3 ms on the IEEE 33-bus and 123-bus systems, within 2.8% of the mixed-integer linear programming optimum. Attention heatmaps and SHAP attributions show where the agent looks and why it decides.

You’re all caught up