Experimental Design for Any p-Norm

05/03/2023
by   Lap Chi Lau, et al.
0

We consider a general p-norm objective for experimental design problems that captures some well-studied objectives (D/A/E-design) as special cases. We prove that a randomized local search approach provides a unified algorithm to solve this problem for all p. This provides the first approximation algorithm for the general p-norm objective, and a nice interpolation of the best known bounds of the special cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2018

A unified framework for designing EPTAS's for load balancing on parallel machines

We consider a general load balancing problem on parallel machines. Our m...
research
10/29/2020

A Local Search Framework for Experimental Design

We present a local search framework to design and analyze both combinato...
research
06/30/2015

Framework for Multi-task Multiple Kernel Learning and Applications in Genome Analysis

We present a general regularization-based framework for Multi-task learn...
research
08/07/2020

Generalization error of minimum weighted norm and kernel interpolation

We study the generalization error of functions that interpolate prescrib...
research
02/24/2020

Optimal Advertising for Information Products

When selling information, sometimes the seller can increase the revenue ...
research
01/02/2018

Secretary problem: graphs, matroids and greedoids

In the paper the generalisation of the well known "secretary problem" is...
research
10/03/2019

Extensions of the Algorithmic Lovasz Local Lemma

We consider recent formulations of the algorithmic Lovasz Local Lemma by...

Please sign up or login with your details

Forgot password? Click here to reset