no code implementations • 23 Aug 2023 • Aaron Mahler, Tyrus Berry, Tom Stephens, Harbir Antil, Michael Merritt, Jeanie Schreiber, Ioannis Kevrekidis
We use these tools to obtain adversarial examples that reside on a class manifold, yet fool a classifier.
1 code implementation • 12 May 2023 • Andrew Draganov, Jakob Rødsgaard Jørgensen, Katrine Scheel Nellemann, Davide Mottin, Ira Assent, Tyrus Berry, Cigdem Aslay
tSNE and UMAP are popular dimensionality reduction algorithms due to their speed and interpretable low-dimensional embeddings.
1 code implementation • 20 Jun 2022 • Andrew Draganov, Tyrus Berry, Jakob Rødsgaard Jørgensen, Katrine Scheel Nellemann, Ira Assent, Davide Mottin
In this work, we show that this is indeed possible by combining the two approaches into a single method.
no code implementations • 31 Aug 2018 • Tyrus Berry, Steven Schluchter
The algorithm developed gives a meaningful description of the embedding as a piecewise linear structure, which is obtained from combinatorial data by projecting points in the point cloud into estimates of tangent planes.
Numerical Analysis
4 code implementations • 7 Jun 2016 • Tyrus Berry, Timothy Sauer
Finally, we conjecture that CkNN is topologically consistent, meaning that the homology of the Vietoris-Rips complex (implied by the graph Laplacian) converges to the homology of the underlying manifold (implied by the Laplace-de Rham operators) in the limit of large data.
Classical Analysis and ODEs