Transformation Invariance in Pattern Recognition-Tangent Distance and Tangent Propagation

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. In this chapter, 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.

• Type: Conference
• Year: 1996
• Where: NIPS
• Authors: Patrice Simard, Yann LeCun, John S. Denker, Bernard Victorri
• Keywords: NIPS 1996, NIPS 2007, Priori Knowledge, Tangent, Trivial Algorithms