English
Related papers

Related papers: Solving Optimal Experimental Design with Sequentia…

200 papers

In statistics, experimental designs are methods for making efficient experiments. E-optimal designs are the multisets of experimental conditions which minimize the maximum axis of the confidence ellipsoid of estimators. The aim of this…

Statistics Theory · Mathematics 2013-03-20 Takuma Takeuchi , Hiroto Sekido

We develop a fast method for optimally designing experiments in the context of statistical seismic source inversion. In particular, we efficiently compute the optimal number and locations of the receivers or seismographs. The seismic source…

Computation · Statistics 2023-07-19 Quan Long , Mohammad Motamed , Raul Tempone

We develop efficient numerical integration methods for computing an integral whose integrand is a product of a smooth function and the Gaussian function with a small standard deviation. Traditional numerical integration methods applied to…

Numerical Analysis · Mathematics 2018-04-12 Yunyun Ma , Yuesheng Xu

Image resizing is a basic tool in image processing and in literature we have many methods, based on different approaches, which are often specialized in only upscaling or downscaling. In this paper, independently of the (reduced or…

Numerical Analysis · Mathematics 2021-09-09 Donatella Occorsio , Giuliana Ramella , Woula Themistoclakis

A classic problem is the estimation of a set of parameters from measurements collected by only a few sensors. The number of sensors is often limited by physical or economical constraints and their placement is of fundamental importance to…

Information Theory · Computer Science 2015-06-16 Juri Ranieri , Amina Chebira , Martin Vetterli

Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for a given set of…

Machine Learning · Statistics 2017-12-15 Kshiteej Sheth , Dinesh Garg , Anirban Dasgupta

An algorithm is proposed, analyzed, and tested experimentally for solving stochastic optimization problems in which the decision variables are constrained to satisfy equations defined by deterministic, smooth, and nonlinear functions. It is…

Optimization and Control · Mathematics 2021-07-09 Frank E. Curtis , Daniel P. Robinson , Baoyu Zhou

This letter presents a method for synthesizing equiripple MIMO transmit beampatterns using Chebyshev approximation. The MIMO beampattern is represented as a non-negative real-valued trigonometric polynomial where the $\ell^{\text{th}}$…

Signal Processing · Electrical Eng. & Systems 2025-06-05 David A. Hague , David G. Felton

We consider the geometric optics problem of finding a system of two reflectors that transform a spherical wavefront into a beam of parallel rays with prescribed intensity distribution. Using techniques from optimal transportation theory, it…

Numerical Analysis · Mathematics 2011-11-08 Tilmann Glimm , Nick Henscheid

A numerical method is developed to solve linear semi-infinite programming problem (LSIP) in which the iterates produced by the algorithm are feasible for the original problem. This is achieved by constructing a sequence of standard linear…

Optimization and Control · Mathematics 2021-01-26 Shuxiong Wang

This document introduces a strategy to solve linear optimization problems. The strategy is based on the bounding condition each constraint produces on each one of the problem's dimension. The solution of a linear optimization problem is…

Optimization and Control · Mathematics 2018-09-24 Gerardo L. Febres

We consider finite-dimensional Bayesian linear inverse problems with Gaussian priors and additive Gaussian noise models. The goal of this note is to present a simple derivation of the well-known fact that solving the Bayesian D-optimal…

Statistics Theory · Mathematics 2023-12-27 Alen Alexanderian

We study the problem of approximately recovering a probability distribution given noisy measurements of its Chebyshev polynomial moments. This problem arises broadly across algorithms, statistics, and machine learning. By leveraging a…

Data Structures and Algorithms · Computer Science 2026-05-20 Cameron Musco , Christopher Musco , Lucas Rosenblatt , Apoorv Vikram Singh

In this paper, we study high-dimensional sparse Quadratic Discriminant Analysis (QDA) and aim to establish the optimal convergence rates for the classification error. Minimax lower bounds are established to demonstrate the necessity of…

Methodology · Statistics 2019-12-09 T. Tony Cai , Linjun Zhang

In this paper we present an algorithm to fit data via exponentials when the error is measured using the max-norm. We prove the necesssary results to show that the algorithm will converge to the best approximation no matter the dataset.

Inferring the causal structure of a system typically requires interventional data, rather than just observational data. Since interventional experiments can be costly, it is preferable to select interventions that yield the maximum amount…

Methodology · Statistics 2021-03-30 Michele Zemplenyi , Jeffrey W. Miller

This article focuses on the estimation and design aspects of a bivariate collocated cokriging experiment. For a large class of covariance matrices, a linear dependency criterion is identified, which allows the best linear unbiased estimator…

Methodology · Statistics 2022-03-15 Subhadra Dasgupta , Siuli Mukhopadhyay , Jonathan Keith

The electrical impedance tomography (EIT) problem of estimating the unknown conductivity distribution inside a domain from boundary current or voltage measurements requires the solution of a nonlinear inverse problem. Sparsity promoting…

Numerical Analysis · Mathematics 2024-05-27 Daniela Calvetti , Monica Pragliola , Erkki Somersalo

We study Bayesian methods for large-scale linear inverse problems, focusing on the challenging task of hyperparameter estimation. Typical hierarchical Bayesian formulations that follow a Markov Chain Monte Carlo approach are possible for…

Numerical Analysis · Mathematics 2024-01-05 Khalil A Hall-Hooper , Arvind K Saibaba , Julianne Chung , Scot M Miller

We study the problem of causal structure learning over a set of random variables when the experimenter is allowed to perform at most $M$ experiments in a non-adaptive manner. We consider the optimal learning strategy in terms of minimizing…

Machine Learning · Computer Science 2017-03-01 AmirEmad Ghassami , Saber Salehkaleybar , Negar Kiyavash
‹ Prev 1 3 4 5 6 7 10 Next ›