Close Menu
techwavedispatch.com

    Subscribe to Updates

    Get the latest creative news from FooBar about art, design and business.

    What's Hot

    [2609.39632] Towards Better Exploration in Sequential Test-Time Scaling

    November 21, 2026

    A Sparse Low-Rank Biclique Decomposition for Graphs

    November 21, 2026

    Hours after Anthropic claims a Claude proof of the Riemann hypothesis, Stanford releases an all-human competing draft

    November 21, 2026
    Facebook X (Twitter) Instagram
    Trending
    • [2609.39632] Towards Better Exploration in Sequential Test-Time Scaling
    • A Sparse Low-Rank Biclique Decomposition for Graphs
    • Hours after Anthropic claims a Claude proof of the Riemann hypothesis, Stanford releases an all-human competing draft
    • [2609.37351] Clause-Factored Bilateral State Grounding and Scoped Passivity for Counterfactual Open-World Deductive Reasoning
    • Best Laptops for Travel (2026): Which to Take on the Road
    • [2611.25796] How Reliable Are Explanations of Language Models That Detect Insider Threats?
    • Lifting Classifier Training with Latent Gaussian Mixture Models
    • New open model Inkling 2 Mini thinks in loops to solve problems with fewer words and still runs on a laptop
    Facebook X (Twitter) Instagram
    techwavedispatch.com
    Subscribe
    Saturday, November 21
    • Home
    • AI Tools & Software
    • Machine Learning
    • Generative AI
    • Robotics & Automation
    • Future Tech & Hardware
    • AI in Business
    • Ethics & Regulations
    • More
      • Gadgets & Smart Devices
      • Cybersecurity & AI
      • Tech Breakthroughs
    techwavedispatch.com
    Home»Machine Learning»A Log-Timescale Perturbation Bound for Selective State Space Models at Every Sequence Length
    Machine Learning

    A Log-Timescale Perturbation Bound for Selective State Space Models at Every Sequence Length

    adminBy adminNovember 18, 2026No Comments2 Mins Read
    Facebook Twitter Pinterest LinkedIn Tumblr Email
    A Log-Timescale Perturbation Bound for Selective State Space Models at Every Sequence Length
    Share
    Facebook Twitter LinkedIn Pinterest Email

    arXiv:2611.21952v1 Announce Type: new
    Abstract: Mamba models deployed on streaming data, such as limit order book updates, run far past the sequence lengths they were trained on. A guarantee on how much a small change of input can move the hidden state therefore has to hold at every length. The closest existing bound we know of measures the change of the timescale additively, and it grows linearly with the sequence length unless the timescale is bounded away from zero. In this paper, we measure the change on a log scale instead. The key observation is that the decay factor of each step then moves by at most a fixed fraction of that step’s input weight, so the per-step errors cannot pile up. Using this, we prove that two runs of a selective-scan cell from a common start stay within a bound that holds at every length, shrinks to zero with the size of the change and needs no lower bound on the timescale. We give a construction showing that, for small changes, this bound is within a factor of about 2 of the best possible, and we extend it to the update used in Mamba’s released code when the timescale is bounded above. We then evaluate block-level bounds built from the theorem on two small models trained on one day of order book data. With a bounded timescale, a bound built on the existing analysis is tighter than ours for at most the first 8 steps. With Mamba’s softplus timescale, whose certified lower bound is as small as $10^{-21}$, it is looser at every length. Our bounds hold for every input to a block, but they remain more than five orders of magnitude above the changes that gradient attacks find.

    Bound Length LogTimescale Models Perturbation Selective Sequence Space State
    Share. Facebook Twitter Pinterest LinkedIn Tumblr Email
    admin
    • Website

    Related Posts

    [2609.39632] Towards Better Exploration in Sequential Test-Time Scaling

    November 21, 2026

    A Sparse Low-Rank Biclique Decomposition for Graphs

    November 21, 2026

    [2609.37351] Clause-Factored Bilateral State Grounding and Scoped Passivity for Counterfactual Open-World Deductive Reasoning

    November 21, 2026
    Leave A Reply Cancel Reply

    Top Posts

    NVIDIA Is Investigating Reports That CEO Jensen Huang Was The Target Of Chinese Spy Efforts

    November 8, 202619 Views

    ADIndex: Layer-Adaptive Sparse Attention Indexing via Group-Level Distillation

    November 11, 20265 Views

    Anthropic releases new Mythos and Fable models amid RSI concerns

    November 9, 20265 Views

    If AGI is so close, why is everyone leaving? The neolabs and their bets

    November 6, 20265 Views
    Don't Miss
    Machine Learning

    [2609.39632] Towards Better Exploration in Sequential Test-Time Scaling

    By adminNovember 21, 20260

    [Submitted on 30 Sep 2026 (v1), last revised 19 Nov 2026 (this version, v3)] View…

    A Sparse Low-Rank Biclique Decomposition for Graphs

    November 21, 2026

    Hours after Anthropic claims a Claude proof of the Riemann hypothesis, Stanford releases an all-human competing draft

    November 21, 2026

    [2609.37351] Clause-Factored Bilateral State Grounding and Scoped Passivity for Counterfactual Open-World Deductive Reasoning

    November 21, 2026
    About Us

    Welcome to TechWave Dispatch

    At TechWave Dispatch, we bring you the latest news, insights, and developments from the ever-evolving world of technology. Our mission is to keep readers informed about the innovations shaping our digital future.

    From artificial intelligence and machine learning to cybersecurity, robotics, smart devices, and groundbreaking technologies, we cover the topics that matter in today's fast-moving tech landscape.

    Our Picks

    [2609.39632] Towards Better Exploration in Sequential Test-Time Scaling

    November 21, 2026

    A Sparse Low-Rank Biclique Decomposition for Graphs

    November 21, 2026

    Hours after Anthropic claims a Claude proof of the Riemann hypothesis, Stanford releases an all-human competing draft

    November 21, 2026
    Most Popular

    After blocking Muse, Amazon now lets users text Alexa to help them shop

    November 6, 20260 Views

    A controlled world for robot learning and evaluation

    November 6, 20260 Views

    Egyptian and Nigerian English join the Open ASR Leaderboard

    November 6, 20260 Views
    Facebook X (Twitter) Instagram Pinterest
    • Terms and Conditions
    • Privacy Policy
    • Contact Us
    • About Us
    © 2026 TechWave Dispatch. All Rights Reserved.

    Type above and press Enter to search. Press Esc to cancel.