DeepBern-Nets: Taming the Complexity of Certifying Neural Networks Using Bernstein Polynomial Activations and Precise Bound Propagation

Cite

Text

Khedr and Shoukry. "DeepBern-Nets: Taming the Complexity of Certifying Neural Networks Using Bernstein Polynomial Activations and Precise Bound Propagation." AAAI Conference on Artificial Intelligence, 2024. doi:10.1609/AAAI.V38I19.30117

Markdown

[Khedr and Shoukry. "DeepBern-Nets: Taming the Complexity of Certifying Neural Networks Using Bernstein Polynomial Activations and Precise Bound Propagation." AAAI Conference on Artificial Intelligence, 2024.](https://mlanthology.org/aaai/2024/khedr2024aaai-deepbern/) doi:10.1609/AAAI.V38I19.30117

BibTeX

@inproceedings{khedr2024aaai-deepbern,
  title     = {{DeepBern-Nets: Taming the Complexity of Certifying Neural Networks Using Bernstein Polynomial Activations and Precise Bound Propagation}},
  author    = {Khedr, Haitham and Shoukry, Yasser},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2024},
  pages     = {21232-21240},
  doi       = {10.1609/AAAI.V38I19.30117},
  url       = {https://mlanthology.org/aaai/2024/khedr2024aaai-deepbern/}
}