On the boundedness of an iterative procedure for solving a system of linear inequalities

By H. Block, Simon A. Levin. 1970

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Yoshua Bengio
2. Ruslan Salakhutdinov
3. Sergey Levine
4. Trevor Darrell
5. Sebastian Nowozin
6. Andrea Vedaldi
7. Dacheng Tao
8. Bernt Schiele

Citations in the corpus

• Super-Samples from Kernel Herding (2010, background): “It is also related to the perceptron cycling theorem [Block and Levin, 1970] where X is assumed to have finite cardinality but which guarantees convergence even when ρ̄ = 0.”
• Advanced Structured Prediction (2014, background): “The Perceptron Cycling Theorem is a classic result due to (Minsky and Papert, 1969; Block and Levin, 1970), which states: Theorem 1.”
• On Herding and the Perceptron Cycling Theorem (2010, background): “We first review the perceptron cycling theorem that was initially introduced in [11] with a gap in the proof that was fixed in [2].”