y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#streaming-data News & Analysis

8 articles tagged with #streaming-data. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

8 articles
AIBullisharXiv – CS AI · Jun 57/10
🧠

EpiEvolve: Self-Evolving Agents for Streaming Pandemic Forecasting under Regime Shifts

Researchers introduce EpiEvolve, a self-evolving AI agent that improves pandemic forecasting by adapting to changing disease patterns in real-time streaming scenarios. The system achieves 12% higher accuracy than static models and reduces recovery time after major shifts from 5 weeks to 2 weeks by leveraging episodic memory and strategic rule learning.

AIBullisharXiv – CS AI · Mar 46/103
🧠

cPNN: Continuous Progressive Neural Networks for Evolving Streaming Time Series

Researchers developed cPNN (Continuous Progressive Neural Networks), a new AI architecture that handles evolving data streams with temporal dependencies while avoiding catastrophic forgetting. The system addresses concept drift in time series data by combining recurrent neural networks with progressive learning techniques, showing quick adaptation to new concepts.

AINeutralarXiv – CS AI · Jun 236/10
🧠

SLeDGe: Semi-Supervised Learning on Data Streams with Graph Structure Learning

Researchers introduce SLeDGe, a semi-supervised learning method designed for streaming data that dynamically learns graph structures to capture evolving relationships between samples. The approach achieves significant accuracy improvements (31.7% relative gain with 0.1% labels) by balancing memory constraints with adaptive graph learning, addressing a key limitation in existing SSL methods that rely on static similarity measures.

AINeutralarXiv – CS AI · Jun 46/10
🧠

Continual Visual and Verbal Learning Through a Child's Egocentric Input

Researchers introduce BabyCL, a continual multimodal learning framework that trains neural networks on egocentric video data in a single chronological pass, mimicking how children actually learn language. The approach outperforms streaming baselines on word-referent mapping tasks while substantially closing the gap to offline training methods.

AINeutralarXiv – CS AI · Jun 26/10
🧠

SHARP: Sleep-based Hierarchical Accelerated Replay for Long Range Non-Stationary Temporal Pattern Recognition

Researchers introduce SHARP, a neural network framework designed to recognize long-range temporal patterns in streaming data by combining a memory module with a pattern-recognition module, inspired by sleep-based memory consolidation in mammals. The approach achieves better performance than recurrent neural networks and transformers on benchmark datasets while maintaining computational efficiency through hierarchical processing.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Correcting Split Selection in Online Decision Trees via Anytime-Valid Inference

Researchers propose an anytime-valid inference method to correct split selection in decision trees used for streaming data, addressing a critical statistical gap where existing Hoeffding Trees lack valid guarantees despite empirical success. The approach provides false-split control across arbitrary data streams while producing smaller, more efficient trees than current methods.

AINeutralarXiv – CS AI · May 276/10
🧠

Modeling Dynamic Mixtures of Time-Delay Systems from Streaming Time Series

Researchers present DelayMix, an online machine learning framework that models streaming time series as dynamic mixtures of time-delay systems, enabling rapid adaptation to regime shifts while maintaining memory efficiency. The method uses tensor decomposition to capture system dynamics and input delays, demonstrating superior forecasting accuracy on non-stationary data compared to existing approaches.

AINeutralarXiv – CS AI · May 116/10
🧠

Decentralized Time-Varying Optimization for Streaming Data via Temporal Weighting

Researchers propose a decentralized gradient descent framework for optimizing time-varying objectives across distributed networks processing streaming data. The work analyzes tracking error using temporal weighting strategies, showing uniform weighting achieves O(1/t) convergence while exponential discounting maintains non-vanishing error floors, with implications for distributed machine learning systems.