Softassign versus Softmax: Benchmarks in Combinatorial Optimization

NIPS 1995: Proceedings of the 8th International Conference on Neural Information Processing Systems

Volumn , Issue , 1995, Pages 626-632

  Gold, Steven ^a   Rangarajan, Anand ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH THEORY; ISING MODEL; RECURRENT NEURAL NETWORKS; STATISTICAL PHYSICS;

ALGORITHMICS; COMBINATORIAL OPTIMIZATION PROBLEMS; ENERGY FUNCTIONS; GRAPH PARTITIONING; OPTIMIZATION PROBLEMS; PENALTY TERM; SOFTASSIGN; STATISTICAL PHYSICS; TWO WAYS; WINNER-TAKE-ALL;

TRAVELING SALESMAN PROBLEM;

EID: 85156248430     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Gold, S. (1995). Matching and Learning Structural and Spatial Representations with Neural Networks. PhD thesis, Yale University.
2. Gold, S., Lu, C. P., Rangarajan, A., Pappu, S., and Mjolsness, E. (1995). New algorithms for 2-D and 3-D point matching: pose estimation and correspondence. In Tesauro, G., Touretzky, D. S., and Leen, T. K., editors, Advances in Neural Information Processing Systems 7, pages 957-964. MIT Press, Cambridge, MA.
3. Gold, S., Mjolsness, E., and Rangarajan, A. (1994). Clustering with a domain specific distance measure. In Cowan, J., Tesauro, G., and Alspector, J., editors, Advances in Neural Information Processing Systems 6, pages 96-103. Morgan Kaufmann, San Francisco, CA.
4. Gold, S. and Rangarajan, A. (1996). A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, (in press).
5. Gold, S., Rangarajan, A., and Mjolsness, E. (1996). Learning with preknowledge: clustering with point and graph matching distance measures. Neural Computation, (in press).
6. Hopfield, J. J. and Tank, D. (1985). 'Neural' computation of decisions in optimization problems. Biological Cybernetics, 52:141-152.
7. Kosowsky, J. J. and Yuille, A. L. (1994). The invisible hand algorithm: Solving the assignment problem with statistical physics. Neural Networks, 7 (3):477-490.
8. Lawler, E. L., Lenstra, J. K., Kan, A. H. G. R., and Shmoys, D. B., editors (1985). The Traveling Salesman Problem. John Wiley and Sons, Chichester.
9. Peterson, C. and Soderberg, B. (1989). A new method for mapping optimization problems onto neural networks. Intl. Journal of Neural Systems, l (l):3-22.
10. Rumelhart, D. and McClelland, J. L. (1986). Parallel Distributed Processing, volume 1. MIT Press, Cambridge, MA.
11. Sinkhorn, R. (1964). A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statist., 35:876-879.
12. Van den Bout, D. E. and Miller III, T. K. (1990). Graph partitioning using annealed networks. IEEE Trans. Neural Networks, 1 (2):192-203.
13. Yuille, A. L. and Kosowsky, J. J. (1994). Statistical physics algorithms that converge. Neural Computation, 6 (3):341-356.