Fourier analysis perspective for sufficient dimension reduction problem

08/19/2018
by   Rustem Takhanov, et al.
0

A theory of sufficient dimension reduction (SDR) is developed from an optimizational perspective. In our formulation of the problem, instead of dealing with raw data, we assume that our ground truth includes a mapping f: R^n→ R^m and a probability distribution function p over R^n, both given analytically. We formulate SDR as a problem of finding a function g: R^k→ R^m and a matrix P∈ R^k× n such that E_ x∼ p( x)| f( x) - g(P x)|^2 is minimal. It turns out that the latter problem allows a reformulation in the dual space, i.e. instead of searching for g(P x) we suggest searching for its Fourier transform. First, we characterize all tempered distributions that can serve as the Fourier transform of such functions. The reformulation in the dual space can be interpreted as a problem of finding a k-dimensional linear subspace S and a tempered distribution t supported in S such that t is "close" in a certain sense to the Fourier transform of f. Instead of optimizing over generalized functions with a k-dimensional support, we suggest minimizing over ordinary functions but with an additional term R that penalizes a strong distortion of the support from any k-dimensional linear subspace. For a specific case of R, we develop an algorithm that can be formulated for functions given in the initial form as well as for their Fourier transforms. Eventually, we report results of numerical experiments with a discretized version of the latter algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2019

Dimension reduction as an optimization problem over a set of generalized functions

Classical dimension reduction problem can be loosely formulated as a pro...
research
02/24/2022

Numerical reconstruction from the Fourier transform on the ball using prolate spheroidal wave functions

We implement numerically formulas of [Isaev, Novikov, arXiv:2107.07882] ...
research
01/15/2023

Efficiently Computing Sparse Fourier Transforms of q-ary Functions

Fourier transformations of pseudo-Boolean functions are popular tools fo...
research
08/05/2020

A fast algorithm for the electromagnetic scattering from a large rectangular cavity in three dimensions

The paper is concerned with the three-dimensional electromagnetic scatte...
research
02/27/2023

Signal communication and modular theory

We propose a conceptual frame to interpret the prolate differential oper...
research
07/29/2022

NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform

The non-equidistant fast Fourier transform (NFFT) is an extension of the...

Please sign up or login with your details

Forgot password? Click here to reset