English
Related papers

Related papers: Removal of the points that do not support an E-opt…

200 papers

We improve the inequality used in Pronzato [2003. Removing non-optimal support points in D-optimum design algorithms. Statist. Probab. Lett. 63, 223-228] to remove points from the design space during the search for a $D$-optimum design. Let…

Statistics Theory · Mathematics 2007-07-02 Radoslav Harman , Luc Pronzato

Linear regression models are among the models most used in practice, although the practitioners are often not sure whether their assumed linear regression model is at least approximately true. In such situations, only designs for which the…

Statistics Theory · Mathematics 2007-06-13 Wolfgang Bischoff , Frank Miller

We investigate the possibility of extending some results of Pazman and Pronzato (2014) to a larger set of optimality criteria. Namely, in a linear regression model the problem of computing D-, A-, E_k-optimal designs, of combining these…

Computation · Statistics 2015-04-24 Katarina Burclova , Andrej Pazman

Among the major difficulties that one may encounter when estimating parameters in a nonlinear regression model are the nonuniqueness of the estimator, its instability with respect to small perturbations of the observations and the presence…

Statistics Theory · Mathematics 2014-08-29 Andrej Pázman , Luc Pronzato

The paper extends the result of Harman and Pronzato [Stat. & Prob. Lett., 77:90--94, 2007], which corresponds to $p=0$, to all strictly concave criteria in Kiefer's $\phi_p$-class. Let $\xi$ be any design on a compact set…

Statistics Theory · Mathematics 2013-09-11 Luc Pronzato

For a broad class of nonlinear regression models we investigate the local E- and c-optimal design problem. It is demonstrated that in many cases the optimal designs with respect to these optimality criteria are supported at the Chebyshev…

Statistics Theory · Mathematics 2007-06-13 Holger Dette , Viatcheslav B. Melas , Andrey Pepelyshev

One of the most common problems in statistical experimentation is computing D-optimal designs on large finite candidate sets. While optimal approximate (i.e., infinite-sample) designs can be efficiently computed using convex methods,…

Computation · Statistics 2026-01-12 Radoslav Harman , Samuel Rosa

We consider optimal non-sequential designs for a large class of (linear and nonlinear) regression models involving polynomials and rational functions with heteroscedastic noise also given by a polynomial or rational weight function. The…

Computation · Statistics 2011-08-30 Dávid Papp

We consider the problem of constructing optimal designs for model discrimination between competing regression models. Various new properties of optimal designs with respect to the popular $T$-optimality criterion are derived, which in many…

Statistics Theory · Mathematics 2009-08-14 Holger Dette , Stefanie Titoff

We extend the approach in [Ann. Statist. 38 (2010) 2499-2524] for identifying locally optimal designs for nonlinear models. Conceptually the extension is relatively simple, but the consequences in terms of applications are profound. As we…

Statistics Theory · Mathematics 2012-10-04 Min Yang , John Stufken

Modeling real processes often results in several suitable models. In order to be able to distinguish, or discriminate, which model best represents a phenomenon, one is interested, e.g., in so-called T-optimal designs. These consist of the…

Optimization and Control · Mathematics 2022-08-30 David Mogalle , Philipp Seufert , Jan Schwientek , Michael Bortz , Karl-Heinz Küfer

In optimal experimental design, the objective is to select a limited set of experiments that maximizes information about unknown model parameters based on factor levels. This work addresses the generalized D-optimal design problem, allowing…

Data Structures and Algorithms · Computer Science 2024-11-05 Aditya Pillai , Gabriel Ponte , Marcia Fampa , Jon Lee , and Mohit Singh , Weijun Xie

We consider T-optimal experiment design problems for discriminating multi-factor polynomial regression models where the design space is defined by polynomial inequalities and the regression parameters are constrained to given convex sets.…

Computation · Statistics 2020-02-04 Yuguang Yue , Lieven Vandenberghe , Weng Kee Wong

Consider an experiment with a finite set of design points representing permissible trial conditions. Suppose that each trial is associated with a cost that depends on the selected design point. In this paper, we study the problem of…

Computation · Statistics 2014-08-13 Radoslav Harman , Eva Benková

We develop adaptive discretization algorithms for locally optimal experimental design of nonlinear prediction models. With these algorithms, we refine and improve a pertinent state-of-the-art algorithm in various respects. We establish…

Optimization and Control · Mathematics 2024-06-04 Jochen Schmid , Philipp Seufert , Michael Bortz

This paper discusses the problem of determining optimal designs for regression models, when the observations are dependent and taken on an interval. A complete solution of this challenging optimal design problem is given for a broad class…

Methodology · Statistics 2015-02-25 Holger Dette , Andrey Pepelyshev , Anatoly Zhigljavsky

The experimental design problem concerns the selection of k points from a potentially large design pool of p-dimensional vectors, so as to maximize the statistical efficiency regressed on the selected k design points. Statistical efficiency…

Machine Learning · Statistics 2017-11-15 Zeyuan Allen-Zhu , Yuanzhi Li , Aarti Singh , Yining Wang

Deriving optimal designs for nonlinear models is in general challenging. One crucial step is to determine the number of support points needed. Current tools handle this on a case-by-case basis. Each combination of model, optimality…

Methodology · Statistics 2009-12-22 Min Yang

A computer model can be used for predicting an output only after specifying the values of some unknown physical constants known as calibration parameters. The unknown calibration parameters can be estimated from real data by conducting…

Methodology · Statistics 2021-06-18 Arvind Krishna , V. Roshan Joseph , Shan Ba , William A. Brenneman , William R. Myers

Discrete-time robust optimal control problems generally take a min-max structure over continuous variable spaces, which can be difficult to solve in practice. In this paper, we extend the class of such problems that can be solved through a…

Optimization and Control · Mathematics 2024-04-30 Jad Wehbeh , Eric C. Kerrigan
‹ Prev 1 2 3 10 Next ›