Multiscale semidefinite programming approach to positioning problems with pairwise structure

by   Yian Chen, et al.

We consider the optimization of pairwise objective functions, i.e., objective functions of the form H(𝐱) = H(x_1,…,x_N) = ∑_1≤ i<j ≤ N H_ij(x_i,x_j) for x_i in some continuous state spaces 𝒳_i. Global optimization in this setting is generally confounded by the possible existence of spurious local minima and the impossibility of global search due to the curse of dimensionality. In this paper, we approach such problems via convex relaxation of the marginal polytope considered in graphical modeling, proceeding in a multiscale fashion which exploits the smoothness of the cost function. We show theoretically that, compared with existing methods, such an approach is advantageous even in simple settings for sensor network localization (SNL). We successfully apply our method to SNL problems, particularly difficult instances with high noise. We also validate performance on the optimization of the Lennard-Jones potential, which is plagued by the existence of many near-optimal configurations. We demonstrate that in MMR allows us to effectively explore these configurations.



There are no comments yet.


page 1

page 2

page 3

page 4


IMO^3: Interactive Multi-Objective Off-Policy Optimization

Most real-world optimization problems have multiple objectives. A system...

Fighting the curse of dimensionality: A machine learning approach to finding global optima

Finding global optima in high-dimensional optimization problems is extre...

Semi-Empirical Objective Functions for MCMC Proposal Optimization

We introduce and demonstrate a semi-empirical procedure for determining ...

A cost function for similarity-based hierarchical clustering

The development of algorithms for hierarchical clustering has been hampe...

A Granular Sieving Algorithm for Deterministic Global Optimization

A gradient-free deterministic method is developed to solve global optimi...

Global Optimum Search in Quantum Deep Learning

This paper aims to solve machine learning optimization problem by using ...

Search for Common Minima in Joint Optimization of Multiple Cost Functions

We present a novel optimization method, named the Combined Optimization ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.