相关论文: Majorization framework for balanced lattice design…

This paper proposes the matrix-weighted consensus algorithm, which is a generalization of the consensus algorithm in the literature. Given a networked dynamical system where the interconnections between agents are weighted by nonnegative…

In this paper, we present a unified analysis of matrix completion under general low-dimensional structural constraints induced by {\em any} norm regularization. We consider two estimators for the general problem of structured matrix…

The purpose of this work is two-fold. First, we introduce an efficient homogenization-based approach to perform topology optimization of coated structures with orthotropic infill material. By making use of the relaxed design space, we can…

Matching Logic is a framework for specifying programming language semantics and reasoning about programs. Its formulas are called patterns and are built with variables, symbols, connectives and quantifiers. A pattern is a combination of…

Classification is a fundamental task in machine learning. While conventional methods-such as binary, multiclass, and multi-label classification-are effective for simpler problems, they may not adequately address the complexities of some…

We study a randomized quadrature algorithm to approximate the integral of periodic functions defined over the high-dimensional unit cube. Recent work by Kritzer, Kuo, Nuyens and Ullrich (2019) shows that rank-1 lattice rules with a randomly…

We propose a test of fairness in score-based ranking systems called matched pair calibration. Our approach constructs a set of matched item pairs with minimal confounding differences between subgroups before computing an appropriate measure…

This work presents a computational method for the design of architected truss lattice materials where each strut can be made of one of a set of available materials. We design the lattices to extremize effective properties. As customary in…

The basic disentanglement theorem established by the present authors states that estimates on a weighted geometric mean over (convex) families of functions can be disentangled into quantitatively linked estimates on each family separately.…

We analyze different re-ranking algorithms for diversification and show that majority of them are based on maximizing submodular/modular functions from the class of parameterized concave/linear over modular functions. We study the…

When machine learning supports decision-making in safety-critical systems, it is important to verify and understand the reasons why a particular output is produced. Although feature importance calculation approaches assist in…

We introduce and study several measures of complexity of functions from the convex hull of a given base class. These complexity measures take into account the sparsity of the weights of a convex combination as well as certain clustering…

Recent advancements in building domain-specific large language models (LLMs) have shown remarkable success, especially in tasks requiring reasoning abilities like logical inference over complex relationships and multi-step problem solving.…

We present some optimal criteria to evaluate model-robustness of non-regular two-level fractional factorial designs. Our method is based on minimizing the sum of squares of all the off-diagonal elements in the information matrix, and…

This paper focuses on size effects in periodic mechanical metamaterials driven by reversible pattern transformations due to local elastic buckling instabilities in their microstructure. Two distinct loading cases are studied: compression…

A series of integral lattices parametrised by integers $k,m,n$ are introduced and investigated, where $n$ is the rank of the lattice, including the root lattices described in a uniform way and unimodular lattices such as the Niemeier…

We seek shifted lattice rules that are good for high dimensional integration over the unit cube in the setting of an unanchored weighted Sobolev space of functions with square-integrable mixed first derivatives. Many existing studies rely…

The problem of matrix factorization motivated by diffraction or elasticity is studied. A powerful tool for analyzing its solutions is introduced, namely analytical continuation formulae are derived. Necessary condition for commutative…

This paper examines the potential role of unit consistency as a system design principle. Unit-consistent generalized matrix inverses and unit-invariant matrix decompositions are derived in support of this principle. Applications of the…

In the paper, frameworks for electronic shopping of composite (modular) products are described: (a) multicriteria selection (product is considered as a whole system, it is a traditional approach), (b) combinatorial synthesis (composition)…