Memory-Efficient Sampling for Minimax Distance Measures

05/26/2020
by   Fazeleh Sadat Hoseini, et al.
0

Minimax distance measure extracts the underlying patterns and manifolds in an unsupervised manner. The existing methods require a quadratic memory with respect to the number of objects. In this paper, we investigate efficient sampling schemes in order to reduce the memory requirement and provide a linear space complexity. In particular, we propose a novel sampling technique that adapts well with Minimax distances. We evaluate the methods on real-world datasets from different domains and analyze the results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2019

Nonparametric feature extraction based on Minimax distance

We investigate the use of Minimax distances to extract in a nonparametri...
research
07/19/2023

Memory Efficient And Minimax Distribution Estimation Under Wasserstein Distance Using Bayesian Histograms

We study Bayesian histograms for distribution estimation on [0,1]^d unde...
research
07/01/2019

Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory

We note that known methods achieving the optimal oracle complexity for f...
research
02/13/2022

Minimax in Geodesic Metric Spaces: Sion's Theorem and Algorithms

Determining whether saddle points exist or are approximable for nonconve...
research
11/03/2020

Memory-Efficient RkNN Retrieval by Nonlinear k-Distance Approximation

The reverse k-nearest neighbor (RkNN) query is an established query type...
research
11/19/2018

Stackelberg GAN: Towards Provable Minimax Equilibrium via Multi-Generator Architectures

We study the problem of alleviating the instability issue in the GAN tra...

Please sign up or login with your details

Forgot password? Click here to reset