Elementary symmetric polynomials for optimal experimental design

Advances in Neural Information Processing Systems

Volumn 2017-December, Issue , 2017, Pages 2140-2149

  Mariet, Zelda ^a   Sra, Suvrit ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; OPTIMAL SYSTEMS; RELAXATION PROCESSES; STATISTICS;

A-OPTIMAL DESIGNS; CLASSICAL PROBLEMS; CONVEX RELAXATION; D-OPTIMAL DESIGNS; ELEMENTARY SYMMETRIC POLYNOMIAL; NEW MATHEMATICAL MODEL; OPTIMAL EXPERIMENTAL DESIGNS; PARTIAL VOLUMES;

POLYNOMIALS;

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

References (48)

1. A. Atkinson, A. Donev, and R. Tobias. Optimum Experimental Designs, With SAS. Oxford Statistical Science Series. OUP Oxford, 2007.
2. H. Avron and C. Boutsidis. Faster subset selection for matrices and applications. SIAM J. Matrix Analysis Applications, 34(4):1464-1499, 2013.
3. E. R. Barnes. An algorithm for separating patterns by ellipsoids. IBM Journal of Research and Development, 26:759-764, 1982.
4. H. H. Bauschke, O. Güler, A. S. Lewis, and H. S. Sendov. Hyperbolic polynomials and convex analysis. Canad. J. Math., 53(3):470-488, 2001.
5. R. Bhatia. Matrix Analysis. Springer, 1997.
6. R. Bhatia. Positive Definite Matrices. Princeton University Press, 2007.
7. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
8. K. Chaloner and I. Verdinelli. Bayesian experimental design: A review. Statistical Science, 10:273-304, 1995.
9. D. A. Cohn. Neural network exploration using optimal experiment design. In Neural Networks, pages 679-686. Morgan Kaufmann, 1994.
10. R. Cominetti, W. F. Mascarenhas, and P. J. S. Silva. A newton's method for the continuous quadratic knapsack problem. Mathematical Programming Computation, 6(2):151-169, 2014.
11. M. A. Davenport, A. K. Massimino, D. Needell, and T. Woolf. Constrained adaptive sensing. IEEE Transactions on Signal Processing, 64(20):5437-5449, 2016.
12. T. A. Davis, W. W. Hager, and J. T. Hungerford. An efficient hybrid algorithm for the separable convex quadratic knapsack problem. ACM Trans. Math. Softw., 42(3):22:1-22:25 2016.
13. H. Dette, V. B. Melas, and W. K. Wong. Locally d-optimal designs for exponential regression models. Statistica Sinica, 16(3):789-803, 2006.
14. A. N. Dolia, T. De Bie, C. J. Harris, J. Shawe-Taylor, and D. M. Titterington. The minimum volume covering ellipsoid estimation in kernel-defined feature spaces. In European Conference on Machine Learning, pages 630-637, 2006.
15. E. N. Dolia, N. M. White, and C. J. Harris. D-optimality for minimum volume ellipsoid with outliers. In In Proceedings of the Seventh International Conference on Signal/Image Processing and Pattern Recognition, pages 73-76, 2004.
16. G. Elfving. Optimum allocation in linear regression theory. Ann. Math. Statist., 23(2):255-262, 1952.
17. V. Fedorov. Theory of optimal experiments. Probability and mathematical statistics. Academic Press, 1972.
18. Y. Gu and Z. Jin. Neighborhood preserving d-optimal design for active learning and its application to terrain classification. Neural Computing and Applications, 23(7):2085-2092, 2013.
19. X. He. Laplacian regularized d-optimal design for active learning and its application to image retrieval. IEEE Trans. Image Processing, 19(1):254-263, 2010.
20. T. Horel, S. Ioannidis, and S. Muthukrishnan. Budget Feasible Mechanisms for Experimental Design, pages 719-730. Springer Berlin Heidelberg, 2014.
21. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1985.
22. D. A. Jackson and Y. Chen. Robust principal component analysis and outlier detection with ecological data. Environmetrics, 15(2):129-139, 2004.
23. T. Jain. Derivatives for antisymmetric tensor powers and perturbation bounds. Linear Algebra and its Applications, 435(5):1111-1121, 2011.
24. R. Jozsa and G. Mitchison. Symmetric polynomials in information theory: Entropy and subentropy. Journal of Mathematical Physics, 56(6), 2015.
25. A. I. Khuri, B. Mukherjee, B. K. Sinha, and M. Ghosh. Design issues for generalized linear models: A review. Statist. Sci., 21(3):376-399, 2006.
26. J. Kiefer. Optimal design: Variation in structure and performance under change of criterion. Biometrika, 62:277-288, 1975.
27. A. Krause, A. Singh, and C. Guestrin. Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies. Journal of Machine Learning Research, 9(Feb):235-284, 2008.
28. F. S. Lasheras, J. V. Vilán, P. G. Nieto, and J. del Coz Díaz. The use of design of experiments to improve a neural network model in order to predict the thickness of the chromium layer in a hard chromium plating process. Mathematical and Computer Modelling, 52(78):1169-1176, 2010.
29. A. S. Lewis. Derivatives of spectral functions. Math. Oper. Res., 21(3):576-588, 1996.
30. I. G. Macdonald. Symmetric functions and Hall polynomials. Oxford university press, 1998.
31. A. J. Miller and N.-K. Nguyen. A fedorov exchange algorithm for d-optimal design. Applied Statistics, 43:669-677, 1994.
32. W. W. Muir. Inequalities concerning the inverses of positive definite matrices. Proceedings of the Edinburgh Mathematical Society, 19(2):109113, 1974.
33. F. Pukelsheim. Optimal Design of Experiments. Society for Industrial and Applied Mathematics, 2006.
34. P. J. Rousseeuw and A. M. Leroy. Robust Regression and Outlier Detection. John Wiley & Sons, Inc., 1987.
35. G. Sagnol. Optimal design of experiments with application to the inference of traffic matrices in large networks: second order cone programming and submodularity. Theses, École Nationale Supérieure des Mines de Paris, 2010.
36. A. Schein and L. Ungar. A-Optimality for Active Learning of Logistic Regression Classifiers, 2004.
37. A. Shpilka and A. Wigderson. Depth-3 arithmetic circuits over fields of characteristic zero. computational complexity, 10(1):1-27, 2001.
38. S. Silvey, D. Titterington, and B. Torsney. An algorithm for optimal designs on a design space. Communications in Statistics - Theory and Methods, 7(14):1379-1389, 1978.
39. J. D. Smith and M. T. Thai. Breaking the bonds of submodularity: Empirical estimation of approximation ratios for monotone non-submodular greedy maximization. CoRR, abs/1702.07002, 2017.
40. S. Sra and R. Hosseini. Conic Geometric Optimization on the Manifold of Positive Definite Matrices. SIAM J. Optimization (SIOPT), 25(1):713-739, 2015.
41. P. Sun and R. M. Freund. Computation of minimum-volume covering ellipsoids. Operations Research, 52(5):690-706, 2004.
42. M. Todd. Minimum-Volume Ellipsoids. Society for Industrial and Applied Mathematics, 2016.
43. L. Vandenberghe, S. Boyd, and S.-P. Wu. Determinant maximization with linear matrix inequality constraints. SIAM J. Matrix Anal. Appl., 19(2):499-533, 1998.
44. Y. Wang, A. W. Yu, and A. Singh. On computationally tractable selection of experiments in regression models, 2016.
45. Z. Wang, B. Moran, X. Wang, and Q. Pan. Approximation for maximizing monotone non-decreasing set functions with a greedy method. J. Comb. Optim., 31(1):29-43, 2016.
46. T. C. Xygkis, G. N. Korres, and N. M. Manousakis. Fisher information based meter placement in distribution grids via the d-optimal experimental design. IEEE Transactions on Smart Grid, PP(99), 2016.
47. I.-C. Yeh. Modeling of strength of high-performance concrete using artificial neural networks. Cement and Concrete Research, 28(12):1797-1808, 1998.
48. Y. Yu. Monotonic convergence of a general algorithm for computing optimal designs. Ann. Statist., 38(3):1593-1606, 2010.