Transformation invariance in pattern recognition: Tangent distance and propagation

✍ Scribed by Patrice Y. Simard; Yann A. Le Cun; John S. Denker; Bernard Victorri

• Publisher: John Wiley and Sons
• Year: 2000
• Tongue: English
• Weight: 356 KB
• Volume: 11
• Category: Article
• ISSN: 0899-9457
• DOI: 10.1002/1098-1098(2000)11:3<181::aid-ima1003>3.0.co;2-e

✦ Synopsis

In pattern recognition, statistical modeling, or regression, the amount of data is a critical factor affecting the performance. If the amount of data and computational resources are unlimited, even trivial algorithms will converge to the optimal solution. However, in the practical case, given limited data and other resources, satisfactory performance requires sophisticated methods to regularize the problem by introducing a priori knowledge. Invariance of the output with respect to certain transformations of the input is a typical example of such a priori knowledge. We introduce the concept of tangent vectors, which compactly represent the essence of these transformation invariances, and two classes of algorithms, tangent distance and tangent propagation, which make use of these invariances to improve performance.