English
Related papers

Related papers: Interleaved lattice-based maximin distance designs

200 papers

We propose a new method for estimating the intrinsic dimension of a dataset by applying the principle of regularized maximum likelihood to the distances between close neighbors. We propose a regularization scheme which is motivated by…

Machine Learning · Computer Science 2012-03-19 Mithun Das Gupta , Thomas S. Huang

The two-layer computer simulators are commonly used to mimic multi-physics phenomena or systems. Usually, the outputs of the first-layer simulator (also called the inner simulator) are partial inputs of the second-layer simulator (also…

Methodology · Statistics 2023-05-23 Yan Wang , Dianpeng Wang , Xiaowei Yue

An optimization method for the design of multi-lattice structures satisfying local buckling constraints is proposed in this paper. First, the concept of free material optimization is introduced to find an optimal elastic tensor distribution…

Computational Geometry · Computer Science 2021-11-10 Xingtong Yang , Xinzhuo Hu , Liangchao Zhu , Ming Li

We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…

We investigate the use of Minimax distances to extract in a nonparametric way the features that capture the unknown underlying patterns and structures in the data. We develop a general-purpose and computationally efficient framework to…

Machine Learning · Computer Science 2023-01-02 Morteza Haghir Chehreghani

Accurate estimation of evolutionary distances between taxa is important for many phylogenetic reconstruction methods. In the case of bacteria, distances can be estimated using a range of different evolutionary models, from single nucleotide…

Populations and Evolution · Quantitative Biology 2017-04-17 Stuart Serdoz , Attila Egri-Nagy , Jeremy Sumner , Barbara R. Holland , Peter D. Jarvis , Mark M. Tanaka , Andrew R. Francis

In this paper we construct constant dimension space codes with prescribed minimum distance. There is an increased interest in space codes since a paper by Koetter and Kschischang were they gave an application in network coding. There is…

Information Theory · Computer Science 2009-01-13 Axel Kohnert , Sascha Kurz

We consider experiments for comparing treatments using units that are ordered linearly over time or space within blocks. In addition to the block effect, we assume that a trend effect influences the response. The latter is modeled as a…

Statistics Theory · Mathematics 2008-12-18 Dibyen Majumdar , John Stufken

We consider a facility location problem, where the objective is to ``disperse'' a number of facilities, i.e., select a given number k of locations from a discrete set of n candidates, such that the average distance between selected…

Data Structures and Algorithms · Computer Science 2007-05-23 Sandor P. Fekete , Henk Meijer

In this paper we investigate measures over bounded lattices, extending and giving a unifying treatment to previous works. In particular, we prove that the measures of an arbitrary bounded lattice can be represented as measures over a…

Commutative Algebra · Mathematics 2021-09-20 C. Massri , F. Holik

This paper presents a multiscale approach to efficiently compute approximate optimal transport plans between point sets. It is particularly well-suited for point sets that are in high-dimensions, but are close to being intrinsically…

Machine Learning · Computer Science 2021-04-13 Samuel Gerber , Mauro Maggioni

Nested space-filling designs are nested designs with attractive low-dimensional stratification. Such designs are gaining popularity in statistics, applied mathematics and engineering. Their applications include multi-fidelity computer…

Methodology · Statistics 2014-08-29 Fasheng Sun , Min-Qian Liu , Peter Z. G. Qian

We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even).…

Machine Learning · Computer Science 2012-03-19 Ping Li , Michael W. Mahoney , Yiyuan She

We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost…

Information Theory · Computer Science 2018-01-31 Maiara F. Bollauf , Vinay A. Vaishampayan , Sueli I. R. Costa

A common challenge in computer experiments and related fields is to efficiently explore the input space using a small number of samples, i.e., the experimental design problem. Much of the recent focus in the computer experiment literature,…

Methodology · Statistics 2019-07-01 Boya Zhang , D. Austin Cole , Robert B. Gramacy

This paper investigates the structure-property relations of thin-walled lattices under dynamic longitudinal compression, characterized by their cross-sections and heights. These relations elucidate the interactions of different geometric…

Machine Learning · Computer Science 2022-12-22 Junyan He , Shashank Kushwaha , Diab Abueidda , Iwona Jasiuk

Lattice structures have been widely used in various applications of additive manufacturing due to its superior physical properties. If modeled by triangular meshes, a lattice structure with huge number of struts would consume massive…

Computational Geometry · Computer Science 2021-02-02 Shengjun Liu , Tao Liu , Qiang Zou , Weiming Wang , Eugeni L. Doubrovski , Charlie C. L. Wang

Performing interferometry in an optical lattice formed by standing waves of light offers potential advantages over its free-space equivalents since the atoms can be confined and manipulated by the optical potential. We demonstrate such an…

Minimax distance measure extracts the underlying patterns and manifolds in an unsupervised manner. The existing methods require a quadratic memory with respect to the number of objects. In this paper, we investigate efficient sampling…

Machine Learning · Computer Science 2020-05-27 Fazeleh Sadat Hoseini , Morteza Haghir Chehreghani

The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…