Simulated Annealing in Convex Bodies and an O ( n 4 ) Volume Algorithm
By László Lovász, Santosh Srinivas Vempala. 2007
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Battista Biggio
- Blaine Nelson
- Nicolas Papernot
- Bo Li
- Ling Huang
- Fabio Roli
- H. Brendan McMahan
- Benjamin I. P. Rubinstein
Citations in the corpus
- Query Strategies for Evading Convex-Inducing Classifiers (2010, methodology): “4 The RoundingBody algorithm described by Lov´asz and Vempala (2003) uses O ∗ D membership queries to transforms the convex body into a near-isotropic position.”
- Online convex optimization in the bandit setting: gradient descent without a gradient (2004, background): “Even in the (oblivious) adversarial setting a one-point estimate of the gradient is sufficient to make gradient descent work.”