arXiv AI

Uniform Herding: Exemplar Replay with Representation Refresh

arXiv:2608. 13061v1 Announce Type: new Abstract: As the feature representation changes, replay must preserve the earlier classes.

arXiv AI
Jun 3

FlashbackCL: Mitigating Temporal Forgetting in Federated Learning

arXiv:2606. 03939v1 Announce Type: cross Abstract: Federated Learning (FL) of foundation and edge models increasingly targets deployments where client data distributions drift over time, yet existing forgetting-mitigation methods assume each client's distribution is stationary.

By Mubarak A. Ojewale, Adriana E. Chis, Jorge M. Cortes-Mendoza, Bernardo Pulido-Gaytan, Horacio Gonzalez-Velez
Hugging Face Trending Papers
Jun 2

FlashbackCL: Mitigating Temporal Forgetting in Federated Learning

Federated Learning (FL) of foundation and edge models increasingly targets deployments where client data distributions drift over time, yet existing forgetting-mitigation methods assume each client's distribution is stationary. Flashback, the strongest recent FL method against cross-client (spatial) forgetting, uses monotonically accumulating per-class label counts as a knowledge proxy; this proxy becomes miscalibrated under temporal distribution shift and anchors the global model to an outdated class balance.

arXiv AI
Jun 16

When Generator Replay Degrades: Projected Rehearsal Orchestration for Heterogeneous Federated Class-Incremental Learning

arXiv:2606. 15695v1 Announce Type: cross Abstract: Federated class-incremental learning (FCIL) becomes substantially harder when clients observe different label subsets, progress through tasks at different stages, and provide uneven supervision for the same semantic concepts.

By Thinh T. H. Nguyen, Khoa D. Doan, Binh T. Nguyen, Danh Le-Phuoc, Kok-Seng Wong
arXiv Computation and Language
Aug 27

AEL: Evolving Agent Harness in Open-Ended Environments

The paper introduces Agent Evolving Learning (AEL), a two‑timescale framework that dynamically evolves an LLM agent’s memory‑retrieval harness in open‑ended environments. A fast Thompson‑Sampling bandit selects among retrieval policies each episode, while a slower LLM reflection diagnoses performance drops and injects new policies when the current set plateaus. AEL outperforms ten self‑improving and non‑LLM baselines on a sequential portfolio benchmark, boosting Sharpe ratio by 27% and achieving significant accuracy gains on a support‑ticket routing stream.

By Wujiang Xu, Jiaojiao Han, Minghao Guo, Kai Mei, Xi Zhu, Han Zhang, Dimitris N. Metaxas