MPCS: Neuroplastic Continual Learning via Multi-Component Plasticity and Topology-Aware EWC

• URL: http://arxiv.org/abs/2605.02509v1
• Date: Mon, 04 May 2026 12:04:09 GMT
• Title: MPCS: Neuroplastic Continual Learning via Multi-Component Plasticity and Topology-Aware EWC
• Abstract summary: We introduce MPCS, a neuroplastic architecture that integrates eleven complementary mechanisms.<n>We evaluate MPCS on MEP-BENCH, a benchmark spanning 31 tasks across regression, classification, logic, and mixed domains.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Continual learning systems face a fundamental tension between plasticity -- acquiring new knowledge -- and stability -- retaining prior knowledge. We introduce MPCS (Multi-Plasticity Continual System), a neuroplastic architecture that integrates eleven complementary mechanisms: task-driven neurogenesis, Fourier-encoded inputs, EWC regularization, meta-replay, mixed consolidation, hybrid gating, synapse pruning/regeneration, Hebbian updates, task similarity routing, adaptive growth control, and continuous neuron importance tracking. We evaluate MPCS on MEP-BENCH, a multi-track benchmark spanning 31 tasks across regression, classification, logic, and mixed domains, using a three-dimensional Pareto criterion over task performance (Perf), representation diversity (RD), and gradient conflict rate (GCR). Across 15 ablation configurations (3 seeds x 4 tracks x 2000 epochs), MPCS achieves a Normalized Efficiency Score of 94.2, placing it on the Pareto frontier among 9 of 14 gate-passing systems. Key findings: (i) Fourier encoding is the single most critical component (removal drops Perf by 30.7 pp and fails the MEP gate on 14% of tasks); (ii) global EWC degrades performance (NES = -4.2); topology-local EWC reduces this penalty (NES 90.5->91.8) but does not eliminate it; removing EWC entirely yields MPCS_EFFICIENT, the highest-Perf system -- establishing a monotone relationship in the high task-similarity regime (s_bar ~= 0.95): global EWC < topology EWC < no EWC; (iii) the Pareto status assessment is predictive: removing the two Pareto-dominated components (EWC + Hebbian) jointly yields MPCS_EFFICIENT, which improves Perf by 0.6 pp at 4.7x lower compute cost (127 vs. 602 min), validating the Pareto frontier as an actionable model-compression guide.

Related papers

• FlowTSFM: Turning Encoder Depth into Quantile Transport [29.781238027602466]
  We introduce FlowTSFM, an encoder architecture that interprets depth as a recurrent transport process.<n>With only 38.8M parameters, FlowTSFM achieves competitive performance on GIFT-Eval and TIME.<n>We also introduce CosMean, a scale-free diagnostic measuring whether recurrent updates consistently align toward the final prediction.
  arXiv  Detail & Related papers  (2026-09-12T01:29:17Z)
• On the Design of Qwen3.8-Next Architecture: Evaluation, Efficiency, and Training Stability [57.03393882933515]
  We describe the architecture and ablations of Qwen3.8-Flash-Next, a sparse mixture-of-experts model with 125B parameters, 6B activated per token, and 51B parameters of n-gram embedding tables held off the accelerator.<n>On fourteen pre-training benchmarks the model leads the 397B-A17B predecessor on eight and trails it on the rest by at most 2.6 points, at 1/3 the activated parameters, 1/3 the training tokens, and roughly 1/9 the training FLOPs.
  arXiv  Detail & Related papers  (2026-08-31T06:35:07Z)
• When Muon Meets Task Interference: A Spectral Perspective on Continual Learning and Model Merging [32.67767249149513]
  We show that the two difficulties are in fact two instances of the same phenomenon.<n>A parameter update useful for one task shifts the model's outputs on another.<n>We identify the recent Muon as a mechanism that regulates this factor by construction.
  arXiv  Detail & Related papers  (2026-08-27T10:56:58Z)
• Privacy-Preserving Federated Temporal Graph Learning with Digital Twin--Guided Adaptive Deception for Cyber-Resilient IoMT [0.6095710009266794]
  This paper presents the Federated Temporal Graph Convolutional Network with Advantage Actor-Critic (Federated TGCN-A2C)<n>The framework achieves 99.48% and 99.61% test accuracy with weighted-F1 scores of 0.9948 and 0.9961, converging within 25 and 10 federated rounds, outperforming Fed-Inforce-Fusion by 0.21 percentage points while covering three additional attack categories.<n>Post-hoc explainability via SHAP, LIME, Grad-CAM, and counterfactual analysis confirms decisions are grounded in semantically meaningful flow features, supporting regulatory accountability in clinical deployments.
  arXiv  Detail & Related papers  (2026-06-19T15:09:38Z)
• How Much Capacity Does EEG Denoising Need? Ultra-Compact Networks reveal Benchmark Saturation and Metric-Utility Gap [0.0]
  Deep learning EEG denoising architectures have scaled from tens of thousands to tens of millions of parameters, yet no prior study has isolated model capacity as the experimental variable.<n>We address both gaps by fixing architecture, loss, data split, and training recipe while sweeping only channel width from 1.05K to 40.26K parameters in a minimal depthwiseseparable convolutional U-Net.
  arXiv  Detail & Related papers  (2026-06-07T12:17:25Z)
• Hallucination Mitigation with Agentic AI, Nested Learning, and AI Sustainability via Semantic Caching [0.42970700836450487]
  This paper adapts a HOPE-inspired Nested Learning architecture with Continuum Memory Systems (CMS)<n>A three-stage agentic pipeline is evaluated with fiveaug -- FCDFactual Claim Density, FGR, THS (Total Hallucination Score) and OSR (Observability Score Ratio)<n>Semantic caching achieves 440 cache hits over 930 potential calls (47.3% hit rate), reducing LLM invocations to 490, lowering energy and CO2e footprint, and making multi-stage review pipelines operationally viable at production scale.
  arXiv  Detail & Related papers  (2026-05-27T20:01:08Z)
• Differentiable latent structure discovery for interpretable forecasting in clinical time series [38.473526928012724]
  We introduce StructGP, a continuous-time multi-task Gaussian process that couples differentiable structure learning to uncover a sparse, ordered directed acyclic graph (DAG) of inter-variable dependencies while preserving principled uncertainty.<n>We propose LP-StructGP, which augments StructGP with latent pathways-shared, temporally shifted trajectories inferred via subject-specific coupling filters and a softmax gating mechanism-to capture cross-patient progression patterns.
  arXiv  Detail & Related papers  (2026-04-30T14:59:50Z)
• Physics-Informed Causal MDPs for Sequential Constraint Repair in Engineering Simulation Pipelines [0.0]
  We introduce PI-CMDP, a framework for CMDPs whose constraint dependencies form a layered DAG.<n>We instantiate PI-CMDP on constraint repair in engineering simulation pipelines.
  arXiv  Detail & Related papers  (2026-04-20T07:40:15Z)
• Phase-Scheduled Multi-Agent Systems for Token-Efficient Coordination [0.0]
  Phase-Scheduled Multi-Agent Systems (PSMAS) is a framework that reconceptualizes agent activation as continuous control over a shared attention space modeled on a circular manifold.<n>PSMAS achieves a mean token reduction of 27.3 percent (range 21.4-34.8 percent) while maintaining task performance within 2.1 percentage points of a fully activated baseline.
  arXiv  Detail & Related papers  (2026-04-19T12:03:54Z)
• When Flat Minima Fail: Characterizing INT4 Quantization Collapse After FP32 Convergence [0.0]
  Post-training quantization assumes that a well-converged model is a quantization-ready model.<n>We show this assumption fails in a structured, measurable, and previously uncharacterized way.
  arXiv  Detail & Related papers  (2026-04-16T15:46:36Z)
• Auxiliary Finite-Difference Residual-Gradient Regularization for PINNs [0.0]
  We study a hybrid design in which the governing PDE residual remains automatic-differentiation based, while finite differences appear only in a weak auxiliary term.<n>The FD term regularizes the residual field without replacing the PDE residual itself.<n>Across seeds 0-5 and 100k epochs, the most reliable tested configuration is a fixed shell weight of 5e-4 under the Kourkoutas-beta regime.
  arXiv  Detail & Related papers  (2026-04-15T23:09:19Z)
• RPMS: Enhancing LLM-Based Embodied Planning through Rule-Augmented Memory Synergy [34.723296971298424]
  LLM agents often fail in closed-world embodied environments because actions must satisfy strict preconditions.<n>We identify two structurally coupled failure modes: (P1) invalid action generation and (P2) state drift.<n>We present RPMS, a conflict-managed architecture that enforces action feasibility via structured rule retrieval.
  arXiv  Detail & Related papers  (2026-03-18T15:26:00Z)
• Generalizing GNNs with Tokenized Mixture of Experts [75.8310720413187]
  We show that improving stability requires reducing reliance on shift-sensitive features, leaving an irreducible worst-case generalization floor.<n>We propose STEM-GNN, a pretrain-then-finetune framework with a mixture-of-experts encoder for diverse computation paths.<n>Across nine node, link, and graph benchmarks, STEM-GNN achieves a stronger three-way balance, improving robustness to degree/homophily shifts and to feature/edge corruptions while remaining competitive on clean graphs.
  arXiv  Detail & Related papers  (2026-02-09T22:48:30Z)
• ReLE: A Scalable System and Structured Benchmark for Diagnosing Capability Anisotropy in Chinese LLMs [37.23311145049677]
  We present ReLE, a scalable system designed to diagnose Capability Anisotropy.<n>We evaluate 304 models across a Domain $times$ Capability Symbolic matrix comprising 207,843 samples.
  arXiv  Detail & Related papers  (2026-01-24T09:57:59Z)
• Towards a Science of Scaling Agent Systems [79.64446272302287]
  We formalize a definition for agent evaluation and characterize scaling laws as the interplay between agent quantity, coordination structure, modelic, and task properties.<n>We derive a predictive model using coordination metrics, that cross-validated R2=0, enabling prediction on unseen task domains.<n>We identify three effects: (1) a tool-coordination trade-off: under fixed computational budgets, tool-heavy tasks suffer disproportionately from multi-agent overhead, and (2) a capability saturation: coordination yields diminishing or negative returns once single-agent baselines exceed 45%.
  arXiv  Detail & Related papers  (2025-12-09T06:52:21Z)
• Towards Channel Charting Enhancement with Non-Reconfigurable Intelligent Surfaces [8.162955286698688]
  We investigate how fully-passive electromagnetic skins (EMSs) can be engineered to enhance channel charting (CC)<n>We employ two complementary state-of-the-art CC techniques, semi-supervised t-distributed neighbor embedding (t-SNE) and a semi-supervised Autoencoder (AE)<n>We show that the accuracy of CC hinges on a balance between signal-to-noise ratio (SNR) and spatial dissimilarity.
  arXiv  Detail & Related papers  (2025-11-02T12:43:43Z)
• Robust Residual Finite Scalar Quantization for Neural Compression [46.574899938569125]
  Finite Scalar Quantization (FSQ) offers simplified training but suffers from residual magnitude decay in multi-stage settings.<n>We propose Robust Residual Finite Scalar Quantization (RFSQ), addressing this fundamental limitation through two novel conditioning strategies.<n>Our experiments across audio and image modalities demonstrate RFSQ's effectiveness and generalizability.
  arXiv  Detail & Related papers  (2025-08-20T15:18:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.