YoVDO

Finding Adversarial Inputs for Heuristics Using Multi-level Optimization

Offered By: USENIX via YouTube

Tags

Heuristics Courses Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a cutting-edge research presentation on finding adversarial inputs for heuristics using multi-level optimization. Delve into the development and application of MetaOpt, a system designed to analyze heuristics in production environments. Learn how MetaOpt efficiently encodes heuristics and optimal solutions for solver analysis, revealing performance gaps and corresponding adversarial inputs. Discover the system's built-in optimizations that enable it to scale to practical problem sizes. Examine case studies across three domains: traffic engineering, vector bin packing, and packet scheduling. Gain insights into how MetaOpt uncovered a 30% capacity inefficiency in a production traffic engineering heuristic and how researchers used these findings to reduce the performance gap by 12.5 times. Understand the implications of adversarial inputs in vector bin packing heuristics and the resulting new lower bound on performance. This 17-minute presentation from USENIX's NSDI '24 conference offers valuable knowledge for practitioners and researchers interested in optimizing heuristic algorithms and improving system performance.

Syllabus

NSDI '24 - Finding Adversarial Inputs for Heuristics using Multi-level Optimization


Taught by

USENIX

Related Courses

Ser más creativos
Universidad Nacional Autónoma de México via Coursera
Advanced Data Structures in Java
University of California, San Diego via Coursera
Programmation objet immersive en Pharo
Inria (French Institute for Research in Computer Science and Automation) via France Université Numerique
Methods for Solving Problems
University of Colorado Boulder via Coursera
Interpersonal, Developmental, and Evolutionary Perspectives of the Mind
University of Colorado Boulder via Coursera