A 2-Dimensional Binary Search for Integer Pareto Frontiers

11/11/2021
by   Yotam gafni, et al.
0

For finite integer squares, we consider the problem of learning a classification I that respects Pareto domination. The setup is natural in dynamic programming settings. We show that a generalization of the binary search algorithm achieves an optimal θ(n) worst-case run time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2018

Do Outliers Ruin Collaboration?

We consider the problem of learning a binary classifier from n different...
research
02/23/2018

A Quantum-Search-Aided Dynamic Programming Framework for Pareto Optimal Routing in Wireless Multihop Networks

Wireless Multihop Networks (WMHNs) have to strike a trade-off among dive...
research
04/05/2018

Quantum-aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming

Pareto optimality is capable of striking the optimal trade-off amongst t...
research
10/08/2020

Learning the Pareto Front with Hypernetworks

Multi-objective optimization problems are prevalent in machine learning....
research
09/18/2020

Quantum Search with Prior Knowledge

Search-base algorithms have widespread applications in different scenari...
research
06/07/2019

Exponential-Binary State-Space Search

Iterative deepening search is used in applications where the best cost b...
research
08/29/2023

When Can You Tile an Integer Rectangle with Integer Squares?

This paper characterizes when an m × n rectangle, where m and n are inte...

Please sign up or login with your details

Forgot password? Click here to reset