Skip to content
AI News HubLIVE
Original source2 min read

Chebyshev Polynomial Zonotope Abstractions for Certified Reachability of Learning-Enabled Systems

Summary

This paper proposes Chebyshev polynomial zonotope abstractions to replace Taylor expansions for certified reachability of learning-enabled nonlinear systems. The authors prove that Taylor expansions have a set-width cap due to complex-plane singularities, while Chebyshev abstractions have no such cap and gain width geometrically with degree. Experiments on closed-loop control and MNIST classifiers show certificates survive where Taylor ones diverge, flipping specifications from unknown to proven.

SourcearXiv Machine LearningAuthor: Peng Xie, Amr Alanwar
Chebyshev Polynomial Zonotope Abstractions for Certified Reachability of Learning-Enabled Systems
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 4 Sep 2026]

Title:Chebyshev Polynomial Zonotope Abstractions for Certified Reachability of Learning-Enabled Systems

View a PDF of the paper titled Chebyshev Polynomial Zonotope Abstractions for Certified Reachability of Learning-Enabled Systems, by Peng Xie and 1 other authors

View PDF HTML (experimental)

Abstract:Nearly all current methods for computing reachable sets of nonlinear dynamics propagate them with truncated Taylor expansions plus rigorous remainders. The expansion is pointwise: once its argument is a whole set rather than a point, one polynomial must stay accurate across that set, and it reaches only as far as its disc of convergence. The limit binds hardest on the rational terms and sigmoid gates of modern controllers: smooth as these look on the real line, in the complex plane they blow up at points just off the real axis, closer as a gate sharpens, and those points cap the set width a Taylor expansion can cover, most tightly on the switching surface where the controller decides. We prove a dichotomy: no Taylor degree certifies sets wider than that cap, while a Chebyshev abstraction of equal degree, anchored to the whole set in the same polynomial-zonotope pipeline, has no cap and gains width at a geometric rate in degree. Measured walls match the formulas to between 89 and 94 percent. We give closed-form rigorous remainders, among them the first polynomial softmax transformer; existing sound treatments are linear relaxations. On closed loops, certificates survive where the Taylor ones diverge, and specifications flip from unknown to proven; on trained classifiers up to real MNIST digits, the Chebyshev frontier certifies input territory the Taylor basis surrenders. Every certified claim passed large Monte-Carlo harnesses with zero violations, and an applicability map states in advance where the basis provably cannot matter.

Subjects:

Machine Learning (cs.LG); Systems and Control (eess.SY)

Cite as: arXiv:2611.23246 [cs.LG]

(or arXiv:2611.23246v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2611.23246

arXiv-issued DOI via DataCite

Submission history

From: Peng Xie [view email] [v1] Fri, 4 Sep 2026 16:30:05 UTC (4,119 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Chebyshev Polynomial Zonotope Abstractions for Certified Reachability of Learning-Enabled Systems, by Peng Xie and 1 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.LG

new | recent | 2026-11

Change to browse by:

cs cs.SY eess eess.SY

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Taylor expansions for reachable set computation are fundamentally limited by a set-width cap arising from singularities in the complex plane, especially for sigmoid gates and rational terms.
  • Chebyshev abstractions of equal degree have no width cap and gain width geometrically with degree, with predicted walls matching measurements to 89–94%.
  • The paper provides closed-form rigorous remainders, including the first polynomial softmax transformer treatment, and shows existing sound methods are linear relaxations.
  • In closed loops and on real MNIST classifiers, Chebyshev certificates survive where Taylor ones diverge, turning unknown specifications into proven ones with zero Monte-Carlo violations.

Highlights and analysis are generated automatically and may contain errors. Check the original source.