Sign inSign in

Separation oracle

An oracle that, given a point, either confirms it is in the convex set or returns a separating hyperplane.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    An algorithm used to check if a point satisfies a set of constraints and, if not, to return a violated hyperplane.
    • 31:55The Semidefinite Programming Relaxation for Max-Cut
    • 0:15Solving the Max-Cut SDP
  • Santosh Vempala

    Georgia Institute of Technology · Research

    An oracle that determines if a point is in a convex body and, if not, returns a separating hyperplane.
    • 8:38A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies

Connections

8

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.