HC-search: Learning heuristics and cost functions for structured prediction

Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013

Volumn , Issue , 2013, Pages 253-259

  Doppa, Janardhan Rao ^a   Fern, Alan ^a   Tadepalli, Prasad ^a  

^a Oregon State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DOMAINS; HIGH QUALITY; IMITATION LEARNING; SEARCH PROCEDURES; SEARCH-BASED; STATE-OF-THE-ART METHODS; STRUCTURED PREDICTION;

ARTIFICIAL INTELLIGENCE; COST FUNCTIONS;

FORECASTING;

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

References (26)

1. Agarwal, S., and Roth, D. 2005. Learnability of bipartite ranking functions. In COLT, 16-31.
2. Collins, M. 2000. Discriminative reranking for natural language parsing. In ICML, 175-182.
3. Crammer, K.; Dekel, O.; Keshet, J.; Shalev-Shwartz, S.; and Singer, Y. 2006. Online passive-aggressive algorithms. JMLR 7:551-585.
4. Dietterich, T. G.; Hild, H.; and Bakiri, G. 1995. A comparison of ID3 and backpropagation for english text-to-speech mapping. MLJ 18(1):51-80.
5. Doppa, J. R.; Fern, A.; and Tadepalli, P. 2012. Output space search for structured prediction. In ICML.
6. Felzenszwalb, P. F., and McAllester, D. A. 2007. The generalized A* architecture. JAIR 29:153-190.
7. Fern, A.; Yoon, S. W.; and Givan, R. 2006. Approximate policy iteration with a policy language bias: Solving relational Markov decision processes. JAIR 25:75-118.
8. Fern, A. 2010. Speedup learning. In Encyclopedia of Machine Learning. 907-911.
9. Grubb, A., and Bagnell, D. 2012. Speedboost: Anytime prediction with uniform near-optimality. JMLR Proceedings Track 22:458-466.
10. Hal Daumé III; Langford, J.; and Marcu, D. 2009. Searchbased structured prediction. MLJ 75(3):297-325.
11. Hoffgen, K.-U.; Simon, H.-U.; and Horn, K. S. V. 1995. Robust trainability of single neurons. Journal of Computer and System Sciences 50(1):114-125.
12. Jiang, J.; Teichert, A.; Daumé III, H.; and Eisner, J. 2012. Learned prioritization for trading off accuracy and speed. In NIPS, 1340-1348.
13. Khardon, R. 1999. Learning to take actions. Machine Learning 35(1):57-90.
14. Lafferty, J.; McCallum, A.; and Pereira, F. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML, 441-448.
15. Mohan, A.; Chen, Z.; and Weinberger, K. Q. 2011. Websearch ranking with initialized gradient boosted regression trees. JMLR Proceedings Track 14:77-89.
16. Ross, S., and Bagnell, D. 2010. Efficient reductions for imitation learning. In AISTATS, 661-668.
17. Ross, S.; Gordon, G.; and Bagnell, D. 2011. A reduction of imitation learning and structured prediction to no-regret online learning. In AISTATS, 627-635.
18. Taskar, B.; Guestrin, C.; and Koller, D. 2003. Max-margin markov networks. In NIPS.
19. Tsochantaridis, I.; Hofmann, T.; Joachims, T.; and Altun, Y. 2004. Support vector machine learning for interdependent and structured output spaces. In ICML.
20. Vogel, J., and Schiele, B. 2007. Semantic modeling of natural scenes for content-based image retrieval. IJCV 72(2):133-157.
21. Weiss, D., and Taskar, B. 2010. Structured prediction cascades. In AISTATS, 916-923.
22. Weiss, D.; Sapp, B.; and Taskar, B. 2010. Sidestepping intractable inference with structured ensemble cascades. In NIPS, 2415-2423.
23. Wick, M. L.; Rohanimanesh, K.; Singh, S.; and McCallum, A. 2009. Training factor graphs with reinforcement learning for efficient map inference. In NIPS, 2044-2052.
24. Wick, M. L.; Rohanimanesh, K.; Bellare, K.; Culotta, A.; and McCallum, A. 2011. Samplerank: Training factor graphs with atomic gradients. In ICML, 777-784.
25. Xu, Y.; Fern, A.; and Yoon, S. 2009. Learning linear ranking functions for beam search with application to planning. JMLR 10:1571-1610.
26. Xu, Z.; Weinberger, K.; and Chapelle, O. 2012. The greedy miser: Learning under test-time budgets. In ICML.