OAI/Combinatorics/EditApproximation/Binary/BinaryOptimizerWork.lean

GitHub source file

9 declarations, 0 contain sorry, 0 declared as axioms

Total bit operations of the executed Boolean-fraction optimizer. The bound includes logarithm sums, gradient materialization, scored vertex search and every coordinate update, with no unit-cost rational primitive.

  1. theorem OAI.EditApproximation.BinaryFraction.maximizerWithWork_mem line 14
  2. theorem OAI.EditApproximation.BinaryFraction.gradientStorageBudget_mono line 26
  3. theorem OAI.EditApproximation.BinaryFraction.gradientWithWork_width line 36
  4. theorem OAI.EditApproximation.BinaryFraction.gradientWithWork_abs line 47
  5. def OAI.EditApproximation.BinaryFraction.optimizerPointWordBudget line 70
  6. def OAI.EditApproximation.BinaryFraction.optimizerGradientWordBudget line 73
  7. def OAI.EditApproximation.BinaryFraction.optimizerRoundBitBudget line 76
  8. def OAI.EditApproximation.BinaryFraction.optimizerBitBudget line 83
  9. theorem OAI.EditApproximation.BinaryFraction.finiteOptimizerWithWork_cost line 86