Related papers: An Approximate Approach to E-optimal Designs for W…
We present a novel approach for designing complex approximate arithmetic circuits that trade correctness for power consumption and play important role in many energy-aware applications. Our approach integrates in a unique way formal methods…
This note presents an online pseudospectral method for system identification using Chebyshev polynomial basis under aperiodic sampling. The system dynamics are approximated piecewise by introducing a sliding time window. The number of…
The paper outlines novel variational technique for finding microstructures of optimal multimaterial composites, bounds of composites properties, and multimaterial optimal designs. The translation method that is used for the exact…
We consider the utilization of a computational model to guide the optimal acquisition of experimental data to inform the stochastic description of model input parameters. Our formulation is based on the recently developed consistent…
Suppose that $K\subset\C$ is compact and that $z_0\in\C\backslash K$ is an external point. An optimal prediction measure for regression by polynomials of degree at most $n,$ is one for which the variance of the prediction at $z_0$ is as…
The theory of Chebyshev (uniform) approximation for univariate polynomial and piecewise polynomial functions has been studied for decades. The optimality conditions are based on the notion of alternating sequence. However, the extension the…
In the field of uncertainty quantification, sparse polynomial chaos (PC) expansions are commonly used by researchers for a variety of purposes, such as surrogate modeling. Ideas from compressed sensing may be employed to exploit this…
In this paper, we derive optimal designs for the Rasch Poisson counts model and the Rasch Poisson-Gamma counts model incorporating several binary predictors for the difficulty parameter. To efficiently estimate the regression coefficients…
This paper addresses the analysis and design of quadratic neural networks, which have been recently introduced in the literature, and their applications to regression, classification, system identification and control of dynamical systems.…
We consider the non-parametric Poisson regression problem where the integer valued response $Y$ is the realization of a Poisson random variable with parameter $\lambda(X)$. The aim is to estimate the functional parameter $\lambda$ from…
Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…
We present an algorithm to obtain the maximum likelihood estimates of the correlation parameters of elliptical copulas. Previously existing methods for this task were either fast but only approximate or exact but very time-consuming,…
Best subset selection in linear regression is well known to be nonconvex and computationally challenging to solve, as the number of possible subsets grows rapidly with increasing dimensionality of the problem. As a result, finding the…
We introduce a new concept of approximation applicable to decision problems and functions, inspired by Bayesian probability. From the perspective of a Bayesian reasoner with limited computational resources, the answer to a problem that…
We study active sampling algorithms for linear regression, which aim to query only a few entries of a target vector $b\in\mathbb R^n$ and output a near minimizer to $\min_{x\in\mathbb R^d} \|Ax-b\|$, for a design matrix $A\in\mathbb R^{n…
We consider a discrete best approximation problem formulated in the framework of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. Given a set of samples of input and output of…
We present a review of methods for optimal experimental design (OED) for Bayesian inverse problems governed by partial differential equations with infinite-dimensional parameters. The focus is on problems where one seeks to optimize the…
In this paper, optimal convergence for an adaptive finite element algorithm for elastoplasticity is considered. To this end, the proposed adaptive algorithm is established within the abstract framework of the axioms of adaptivity [Comput.…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
Certain Petrov-Galerkin schemes are inherently stable formulations of variational problems on a given mesh. This stability is primarily obtained by computing an optimal test basis for a given approximation space. Furthermore, these…