A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
- Univ. of Texas, Austin, TX (United States)
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze the effects of polynomial-space-bounded learning on runtime complexity of backtrack search. One space-bounded learning scheme records only those constraints with limited size, and another records arbitrarily large constraints but deletes those that become irrelevant to the portion of the search space being explored. We find that relevance-bounded learning allows better runtime bounds than size-bounded learning on structurally restricted constraint satisfaction problems. Even when restricted to linear space, our relevance-bounded learning algorithm has runtime complexity near that of unrestricted (exponential space-consuming) learning schemes.
- OSTI ID:
- 430671
- Report Number(s):
- CONF-960876-; TRN: 96:006521-0046
- Resource Relation:
- Conference: 13. National conference on artifical intelligence and the 8. Innovative applications of artificial intelligence conference, Portland, OR (United States), 4-8 Aug 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the thirteenth national conference on artificial intelligence and the eighth innovative applications of artificial intelligence conference. Volume 1 and 2; PB: 1626 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Constraint satisfaction using a hybrid evolutionary hill-climbing algorithm that performs opportunistic arc and path revision
Multi-View Budgeted Learning under Label and Feature Constraints Using Label-Guided Graph-Based Regularization