Archives AI News

EchoLSTM: A Self-Reflective Recurrent Network for Stabilizing Long-Range Memory

arXiv:2511.01950v1 Announce Type: new Abstract: Standard Recurrent Neural Networks, including LSTMs, struggle to model long-range dependencies, particularly in sequences containing noisy or misleading information. We propose a new architectural principle, Output-Conditioned Gating, which enables a model to perform self-reflection by…

The Coralscapes Dataset: Semantic Scene Understanding in Coral Reefs

arXiv:2503.20000v2 Announce Type: replace-cross Abstract: Coral reefs are declining worldwide due to climate change and local stressors. To inform effective conservation or restoration, monitoring at the highest possible spatial and temporal resolution is necessary. Conventional coral reef surveying methods are…

Weakly Supervised Object Segmentation by Background Conditional Divergence

arXiv:2506.22505v2 Announce Type: replace-cross Abstract: As a computer vision task, automatic object segmentation remains challenging in specialized image domains without massive labeled data, such as synthetic aperture sonar images, remote sensing, biomedical imaging, etc. In any domain, obtaining pixel-wise segmentation…

Bulk-boundary decomposition of neural networks

arXiv:2511.02003v1 Announce Type: new Abstract: We present the bulk-boundary decomposition as a new framework for understanding the training dynamics of deep neural networks. Starting from the stochastic gradient descent formulation, we show that the Lagrangian can be reorganized into a…

PyDPF: A Python Package for Differentiable Particle Filtering

arXiv:2510.25693v2 Announce Type: replace-cross Abstract: State-space models (SSMs) are a widely used tool in time series analysis. In the complex systems that arise from real-world data, it is common to employ particle filtering (PF), an efficient Monte Carlo method for…

TapOut: A Bandit-Based Approach to Dynamic Speculative Decoding

arXiv:2511.02017v1 Announce Type: new Abstract: Speculative decoding accelerates LLMs by using a lightweight draft model to generate tokens autoregressively before verifying them in parallel with a larger target model. However, determining the optimal number of tokens to draft remains a…

Accelerated Frank-Wolfe Algorithms: Complementarity Conditions and Sparsity

arXiv:2511.02821v1 Announce Type: cross Abstract: We develop new accelerated first-order algorithms in the Frank-Wolfe (FW) family for minimizing smooth convex functions over compact convex sets, with a focus on two prominent constraint classes: (1) polytopes and (2) matrix domains given…