Relationships between the Phase Retrieval Problem and Permutation Invariant Embeddings

06/21/2023
by   Radu Balan, et al.
0

This paper discusses the connection between the phase retrieval problem and permutation invariant embeddings. We show that the real phase retrieval problem for ℝ^d/O(1) is equivalent to Euclidean embeddings of the quotient space ℝ^2× d/S_2 performed by the sorting encoder introduced in an earlier work. In addition, this relationship provides us with inversion algorithms of the orbits induced by the group of permutation matrices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/19/2019

Almost Everywhere Generalized Phase Retrieval

The aim of generalized phase retrieval is to recover x∈F^d from the quad...
research
03/14/2022

Permutation Invariant Representations with Applications to Graph Deep Learning

This paper presents primarily two Euclidean embeddings of the quotient s...
research
11/02/2020

Classification of Periodic Variable Stars with Novel Cyclic-Permutation Invariant Neural Networks

Neural networks (NNs) have been shown to be competitive against state-of...
research
07/05/2023

Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns

We consider the problem of comparison-sorting an n-permutation S that av...
research
09/10/2017

Classifying Unordered Feature Sets with Convolutional Deep Averaging Networks

Unordered feature sets are a nonstandard data structure that traditional...
research
11/05/2018

Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputs

We consider a simple and overarching representation for permutation-inva...
research
03/03/2023

Learning Permutation-Invariant Embeddings for Description Logic Concepts

Concept learning deals with learning description logic concepts from a b...

Please sign up or login with your details

Forgot password? Click here to reset