Aaron J. Havens

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Siddharth Garg

> Home > Persons > Aaron J. Havens

Publications

2024
[c10]
- view
  - electronic edition @ openreview.net (open access)
  - details & citations
- export record
  dblp key:
  - conf/iclr/PauliHAGKA024
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclr/PauliHAGKA024
Patricia Pauli, Aaron J. Havens, Alexandre Araujo, Siddharth Garg, Farshad Khorrami, Frank Allgöwer, Bin Hu:
Novel Quadratic Constraints for Extending LipSDP beyond Slope-Restricted Activations. ICLR 2024
[i10]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2401-14033
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2401-14033
Patricia Pauli, Aaron J. Havens, Alexandre Araujo, Siddharth Garg, Farshad Khorrami, Frank Allgöwer, Bin Hu:
Novel Quadratic Constraints for Extending LipSDP beyond Slope-Restricted Activations. CoRR abs/2401.14033 (2024)
2023
[c6]
- view
  - electronic edition @ nips.cc (open access)
  - details & citations
- export record
  dblp key:
  - conf/nips/HavensAGK023
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/HavensAGK023
Aaron J. Havens, Alexandre Araujo, Siddharth Garg, Farshad Khorrami, Bin Hu:
Exploiting Connections between Lipschitz Structures for Certifiably Robust Deep Equilibrium Models. NeurIPS 2023

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.