no code implementations • 16 Apr 2024 • Saeid Pourmand, Wyatt D. Whiting, Alireza Aghasi, Nicholas F. Marshall
This paper studies the geometry of binary hyperdimensional computing (HDC), a computational scheme in which data are encoded using high-dimensional binary vectors.
1 code implementation • 26 Jan 2024 • Andy Zhang, Oscar Mickelin, Joe Kileel, Eric J. Verbeke, Nicholas F. Marshall, Marc Aurèle Gilles, Amit Singer
Further, we introduce a metric between a stack of projection images and a molecular structure, which is invariant to rotations and reflections and does not require performing 3-D reconstruction.
no code implementations • 17 Jan 2024 • Seth J. Alderman, Roan W. Luikart, Nicholas F. Marshall
This paper studies the effect of adding geometrically smoothed momentum to the randomized Kaczmarz algorithm, which is an instance of stochastic gradient descent on a linear least squares loss function.
1 code implementation • 27 Jul 2022 • Nicholas F. Marshall, Oscar Mickelin, Amit Singer
We present a fast and numerically accurate method for expanding digitized $L \times L$ images representing functions on $[-1, 1]^2$ supported on the disk $\{x \in \mathbb{R}^2 : |x|<1\}$ in the harmonics (Dirichlet Laplacian eigenfunctions) on the disk.
no code implementations • 24 Feb 2022 • Nicholas F. Marshall, Oscar Mickelin
We study how the learning rate affects the performance of a relaxed randomized Kaczmarz algorithm for solving $A x \approx b + \varepsilon$, where $A x =b$ is a consistent linear system and $\varepsilon$ has independent mean zero random entries.
1 code implementation • 30 Jul 2021 • Ronald R. Coifman, Nicholas F. Marshall, Stefan Steinerberger
Let $\mathcal{G} = \{G_1 = (V, E_1), \dots, G_m = (V, E_m)\}$ be a collection of $m$ graphs defined on a common set of vertices $V$ but with different edge sets $E_1, \dots, E_m$.
no code implementations • 19 Jan 2021 • Tamir Bendory, Ti-Yen Lan, Nicholas F. Marshall, Iris Rukshin, Amit Singer
We demonstrate that, regardless of the level of noise, our technique can be used to recover the target image when the measurement is sufficiently large.
no code implementations • 22 Oct 2019 • Nicholas F. Marshall, Ti-Yen Lan, Tamir Bendory, Amit Singer
We introduce a framework for recovering an image from its rotationally and translationally invariant features based on autocorrelation analysis.
no code implementations • 17 Nov 2017 • Nicholas F. Marshall, Ronald R. Coifman
In this paper we answer the following question: what is the infinitesimal generator of the diffusion process defined by a kernel that is normalized such that it is bi-stochastic with respect to a specified measure?