Query complexity of Derivative-Free Optimization

Advances in Neural Information Processing Systems

Volumn 4, Issue , 2012, Pages 2672-2680

  Jamieson, Kevin G ^a   Nowak, Robert D ^a   Recht, Benjamin ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE RATES; CONVEX OBJECTIVES; DERIVATIVE-FREE OPTIMIZATION; DERIVATIVEFREE OPTIMIZATIONS (DFO); HUMAN SUBJECTS; PAIRED COMPARISON; PERFORMANCE OF ALGORITHM; QUERY COMPLEXITY;

ALGORITHMS; OPTIMIZATION;

FUNCTION EVALUATION;

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

References (24)

1. T. Eitrich and B. Lang. Efficient optimization of support vector machine learning parameters for unbalanced datasets. Journal of computational and applied mathematics, 196(2):425-436, 2006.
2. R. Oeuvray and M. Bierlaire. A new derivative-free algorithm for the medical image registration problem. International Journal of Modelling and Simulation, 27(2):115-124, 2007.
3. A.R. Conn, K. Scheinberg, and L.N. Vicente. Introduction to derivative-free optimization, volume 8. Society for Industrial Mathematics, 2009.
4. Warren B. Powell and Ilya O. Ryzhov. Optimal Learning. John Wiley and Sons, 2012.
5. Y. Nesterov. Random gradient-free minimization of convex functions. CORE Discussion Papers, 2011.
6. N. Srinivas, A. Krause, S.M. Kakade, and M. Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. Arxiv preprint arXiv:0912.3995, 2009.
7. R. Storn and K. Price. Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. Journal of global optimization, 11(4):341-359, 1997.
8. A. Agarwal, D.P. Foster, D. Hsu, S.M. Kakade, and A. Rakhlin. Stochastic convex optimization with bandit feedback. Arxiv preprint arXiv:1107.1744, 2011.
9. A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro. Robust stochastic approximation approach to stochastic programming. SIAM Journal on Optimization, 19(4):1574, 2009.
10. V. Protasov. Algorithms for approximate calculation of the minimum of a convex function from its values. Mathematical Notes, 59:69-74, 1996. 10.1007/BF02312467.
11. M. Raginsky and A. Rakhlin. Information-based complexity, feedback, and dynamics in convex programming. Information Theory, IEEE Transactions on, (99):1-1, 2011.
12. L.L. Thurstone. A law of comparative judgment. Psychological Review; Psychological Review, 34(4):273, 1927.
13. Y. Yue, J. Broder, R. Kleinberg, and T. Joachims. The k-armed dueling bandits problem. Journal of Computer and System Sciences, 2012.
14. K.G. Jamieson and R.D. Nowak. Active ranking using pairwise comparisons. Neural Information Processing Systems (NIPS), 2011.
15. A.S. Nemirovsky and D.B. Yudin. Problem complexity and method efficiency in optimization. 1983.
16. A. Agarwal, D.P. Foster, D. Hsu, S.M. Kakade, and A. Rakhlin. Stochastic convex optimization with bandit feedback. Arxiv preprint arXiv:1107.1744, 2011.
17. A. Agarwal, P.L. Bartlett, P. Ravikumar, and M.J. Wainwright. Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization. Information Theory, IEEE Transactions on, (99):1-1, 2010.
18. A. Agarwal, O. Dekel, and L. Xiao. Optimal algorithms for online convex optimization with multi-point bandit feedback. In Conference on Learning Theory (COLT), 2010.
19. S. Ghadimi and G. Lan. Stochastic first-and zeroth-order methods for nonconvex stochastic programming. 2012.
20. A.B. Tsybakov. Introduction to nonparametric estimation. Springer Verlag, 2009.
21. R.M. Castro and R.D. Nowak. Minimax bounds for active learning. Information Theory, IEEE Transactions on, 54(5):2339-2353, 2008.
22. S.P. Boyd and L. Vandenberghe. Convex optimization. Cambridge Univ Pr, 2004.
23. R.P. Brent. Algorithms for minimization without derivatives. Dover Pubns, 2002.
24. M. Kääriäinen. Active learning in the non-realizable case. In Algorithmic Learning Theory, pages 63-77. Springer, 2006.