中文
相关论文

相关论文: Construction of E(s^2)-optimal supersaturated desi…

200 篇论文

Tight $2 s$-designs are the $2 s$-$(v, k, \lambda)$ designs whose sizes achieve the Fisher type lower bound ${v \choose s}$. Symmetric $2$-designs, the Witt $4$-$(23, 7, 1)$ design and the Witt $4$-$(23, 16, 52)$ design are tight designs.…

组合数学 · 数学 2023-12-25 Ziqing Xiang

This work provides performance guarantees for the greedy solution of experimental design problems. In particular, it focuses on A- and E-optimal designs, for which typical guarantees do not apply since the mean-square error and the maximum…

机器学习 · 计算机科学 2018-02-01 Luiz F. O. Chamon , Alejandro Ribeiro

We propose a novel two-stage subsampling algorithm based on optimal design principles. In the first stage, we use a density-based clustering algorithm to identify an approximating design space for the predictors from an initial subsample.…

统计方法学 · 统计学 2024-03-20 Subhadra Dasgupta , Holger Dette

Bayesian optimal experimental design (OED) provides a principled framework for selecting observations or experiments. We introduce new Bayesian design criteria based on the expected Wasserstein-$p$ distance between the prior and posterior…

统计方法学 · 统计学 2026-05-28 Tapio Helin , Youssef Marzouk , Jose Rodrigo Rojo-Garcia

Laws of electrodynamics constrain scattering cross-sections of resonant objects. Nevertheless, a fundamental bound that expresses how larger that scattering cross-section can be is yet to be found. Approaches based on cascading multiple…

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

度量几何 · 数学 2015-09-28 P. G. Boyvalenkov , P. D. Dragnev , D. P. Hardin , E. B. Saff , M. M. Stoyanova

A method for computing lower bounds on capacities of 2-dimensional constraints having a symmetric presentation in either the horizontal or the vertical direction is presented. The method is a generalization of the method of Calkin and Wilf…

信息论 · 计算机科学 2009-03-11 Erez Louidor , Brian Marcus

Arrangements of lines and pseudolines are fundamental objects in discrete and computational geometry. They also appear in other areas of computer science, such as the study of sorting networks. Let $B_n$ be the number of nonisomorphic…

组合数学 · 数学 2018-12-10 Adrian Dumitrescu , Ritankar Mandal

A general framework for determining fundamental bounds in nanophotonics is introduced in this paper. The theory is based on convex optimization of dual problems constructed from operators generated by electromagnetic integral equations. The…

光学 · 物理学 2021-06-23 M. Gustafsson , K. Schab , L. Jelinek , M. Capek

Physical design problems, such as photonic inverse design, are typically solved using local optimization methods. These methods often produce what appear to be good or very good designs when compared to classical design methods, but it is…

光学 · 物理学 2020-05-20 Guillermo Angeris , Jelena Vuckovic , Stephen Boyd

To avoid multicollinearity in regression analysis, Ye and Zhou(2013) proposed $K-$optimality criterion. By far the most popular models for modeling the response of a mixture experiment are the Scheff\'{e} models. However, there have been no…

统计理论 · 数学 2022-10-17 Hao-sheng Jiang , Jia-li Chen , Chong-qi Zhang

Chen and Cheng [Ann. Statist. 34 (2006) 546--558] discussed the method of doubling for constructing two-level fractional factorial designs. They showed that for $9N/32\le n\le 5N/16$, all minimum aberration designs with $N$ runs and $n$…

统计理论 · 数学 2008-12-18 Hongquan Xu , Ching-Shui Cheng

Twin-width is a width parameter introduced by Bonnet, Kim, Thomass\'e and Watrigant [FOCS'20, JACM'22], which has many structural and algorithmic applications. We prove that the twin-width of every graph embeddable in a surface of Euler…

组合数学 · 数学 2024-02-12 Daniel Kráľ , Kristýna Pekárková , Kenny Štorgel

We show that there is no $2^{o(k^2)} n^{O(1)}$ time algorithm for Independent Set on $n$-vertex graphs with rank-width $k$, unless the Exponential Time Hypothesis (ETH) fails. Our lower bound matches the $2^{O(k^2)} n^{O(1)}$ time algorithm…

数据结构与算法 · 计算机科学 2022-12-09 Benjamin Bergougnoux , Tuukka Korhonen , Jesper Nederlof

We develop $D$-optimal designs for linear models with first-order interactions on a subset of the $2^K$ full factorial design region, when both the number of factors set to the higher level and the number of factors set to the lower level…

统计理论 · 数学 2019-05-14 Fritjof Freise , Rainer Schwabe

In this paper, the 3-rank of the incidence matrices of 2-designs supported by the minimum weight codewords in a family of ternary linear codes considered in [C. Ding, C. Li, Infinite families of 2-designs and 3-designs from linear codes,…

信息论 · 计算机科学 2019-07-31 Cunsheng Ding , Chunming Tang , Vladimir D. Tonchev

Conditional lower bounds based on $P\neq NP$, the Exponential-Time Hypothesis (ETH), or similar complexity assumptions can provide very useful information about what type of algorithms are likely to be possible. Ideally, such lower bounds…

计算复杂性 · 计算机科学 2022-03-16 Dániel Marx

A lower bound is an important tool for predicting the performance that an estimator can achieve under a particular statistical model. Bayesian bounds are a kind of such bounds which not only utilizes the observation statistics but also…

统计理论 · 数学 2023-03-02 Shuo Tang , Gerald LaMountain , Tales Imbiriba , Pau Closas

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…

统计理论 · 数学 2009-08-14 Holger Dette , Stefanie Titoff

The conventional method using low energy theorems [3] does not seem to lead to an explicit unitarity limit in the scattering processes of longitudinally polarized gauge bosons for the high energy case in the extra U(1) superstring inspired…

高能物理 - 唯象学 · 物理学 2008-11-26 N. K. Sharma , Pranav Saxena , Prachi Parashar , Ashok K. Nagawat , Sardar Singh