Search Results for author:
Found 6 papers, 4 papers with code
The beltway problem over orthogonal groups
The classical beltway problem entails recovering a set of points from their unordered pairwise distances on the circle.
Moment-based metrics for molecules computable from cryo-EM images
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.
Fast expansion into harmonics on the disk: a steerable basis with fast radial convolutions
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.
An optimal scheduled learning rate for a randomized Kaczmarz algorithm
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.
Multi-resolution Low-rank Tensor Formats
We describe a simple, black-box compression format for tensors with a multiscale structure.
Numerical Analysis Numerical Analysis 65F99, 15A69
Tensor ring decomposition
Tensor decompositions such as the canonical format and the tensor train format have been widely utilized to reduce storage costs and operational complexities for high-dimensional data, achieving linear scaling with the input dimension instead of exponential scaling.
Numerical Analysis Numerical Analysis 65F99, 15A23, 15A69
