Related papers: On optimality of designs with three distinct eigen…
Correlation matrices are omnipresent in multivariate data analysis. When the number d of variables is large, the sample estimates of correlation matrices are typically noisy and conceal underlying dependence patterns. We consider the case…
An incidence structure consists simply of a set P of points and a set B of blocks, with a relation of incidence between points and blocks.A symmetric (v,k,\lambda) block design is the subject of this paper. The symmetric (n^2+n+1, n+1,1)…
We consider revenue-optimal mechanism design in the interdimensional setting, where one dimension is the 'value' of the buyer, and one is a 'type' that captures some auxiliary information. One setting is the FedEx Problem, for which FGKK…
Distributed systems store data objects redundantly to balance the data access load over multiple nodes. Load balancing performance depends mainly on 1) the level of storage redundancy and 2) the assignment of data objects to storage nodes.…
Motivated by customer loyalty plans and scholarship programs, we study tie-breaker designs which are hybrids of randomized controlled trials (RCTs) and regression discontinuity designs (RDDs). We quantify the statistical efficiency of a…
Optimal input design is an important step of the identification process in order to reduce the model variance. In this work a D-optimal input design method for finite-impulse-response-type nonlinear systems is presented. The optimization of…
We propose a novel methodology to solve a key eigenvalue optimization problem which arises in the contractivity analysis of neural ODEs. When looking at contractivity properties of a one layer weight-tied neural ODE…
In this paper we study two design problems in frame theory: on the one hand, given a fixed finite frame $\cF$ for $\hil\cong\C^d$ we compute those dual frames $\cG$ of $\cF$ that are optimal perturbations of the canonical dual frame for…
Alphabetic optimality criteria, such as the $D$, $A$, and $I$ criteria, require specifying a model to select optimal designs. They are not model free and the optimal designs selected by them are not robust to model uncertainty. Recently,…
Modern neural networks of the transformer family require the practitioner to decide, before training begins, how many attention heads to use, how deep the network should be, and how wide each component should be. These decisions are made…
Maximally recoverable codes are codes designed for distributed storage which combine quick recovery from single node failure and optimal recovery from catastrophic failure. Gopalan et al [SODA 2017] studied the alphabet size needed for such…
To investigate solutions of (near-)optimal control problems, we extend and exploit a notion of homogeneity recently proposed in the literature for discrete-time systems. Assuming the plant dynamics is homogeneous, we first derive a scaling…
Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…
We consider three matroids defined by Kalai in 1985: the symmetric completion matroid $\mathcal{S}_d$ on the edge set of a looped complete graph; the hyperconnectivity matroid $\mathcal{H}_d$ on the edge set of a complete graph; and the…
Let $D(G)$ be the distance matrix of a simple connected graph $G$. The Hadamard product $D(G)~\circ~ D(G)$ is called the squared distance matrix of $G$, and is denoted by $\Delta(G)$. A simple connected graph is called a starlike block…
Let $A\in\mathbb C^{n\times n}$ and let $\mathcal X\subset \mathbb C^n$ be an $A$-invariant subspace with $\dim \mathcal X=d\geq 1$, corresponding to exterior eigenvalues of $A$. Given an initial subspace $\mathcal V\subset \mathbb C^n$…
A \textbf{double-change covering design} (DCCD) is a $v$-set $V$ and an ordered list $\mathcal{L}$ of $b$ blocks of size $k$ where every pair from $V$ must occur in at least one block and each pair of consecutive blocks differs by exactly…
In this paper we study optimality aspects of a certain type of designs in a multi-way heterogeneity setting. These are ``duals" of plans orthogonal through the block factor (POTB). Here by the dual of a main effect plan (say $\rho$) we mean…
For an $n$-by-$n$ complex matrix $A$, we define its zero-dilation index $d(A)$ as the largest size of a zero matrix which can be dilated to $A$. This is the same as the maximum $k$ ($\ge 1$) for which 0 is in the rank-$k$ numerical range of…
Traditionally, networks such as datacenter interconnects are designed to optimize worst-case performance under arbitrary traffic patterns. Such network designs can however be far from optimal when considering the actual workloads and…