Related papers: An Algorithmic and a geometric characterization of…
We propose a multiscale approach for an elliptic multiscale setting with general unstructured diffusion coefficients that is able to achieve high-order convergence rates with respect to the mesh parameter and the polynomial degree. The…
Standard statistical mechanical or condensed matter arguments tell us that bulk properties of a physical system do not depend too much on boundary conditions. Random tilings of large regions provide counterexamples to such intuition, as…
Porous and heterogeneous materials are found in many applications from composites, membranes, chemical reactors, and other engineered materials to biological matter and natural subsurface structures. In this work we propose an integrated…
Inferring causal relationships from observational data is rarely straightforward, but the problem is especially difficult in high dimensions. For these applications, causal discovery algorithms typically require parametric restrictions or…
The Poisson distribution is the default choice of likelihood for probabilistic models of count data. However, due to the equidispersion contraint of the Poisson, such models may have predictive uncertainty that is artificially inflated.…
We present an approach to model-based hierarchical clustering by formulating an objective function based on a Bayesian analysis. This model organizes the data into a cluster hierarchy while specifying a complex feature-set partitioning that…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
We show how complexity theory can be introduced in machine learning to help bring together apparently disparate areas of current research. We show that this new approach requires less training data and is more generalizable as it shows…
Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic…
This paper explores the homogeneity of coefficients in high-dimensional regression, which extends the sparsity concept and is more general and suitable for many applications. Homogeneity arises when one expects regression coefficients…
We study the assignment problem of objects to agents with heterogeneous preferences under distributional constraints. Each agent is associated with a publicly known type and has a private ordinal ranking over objects. We are interested in…
When dealing with incomplete data in statistical learning, or incomplete observations in probabilistic inference, one needs to distinguish the fact that a certain event is observed from the fact that the observed event has happened. Since…
For high-dimensional classification, it is well known that naively performing the Fisher discriminant rule leads to poor results due to diverging spectra and noise accumulation. Therefore, researchers proposed independence rules to…
Chaos is an intriguing phenomenon that can be found in an immense variate of systems. Its detection and discrimination from its counterpart order poses an interesting challenge. To address it, we present a deep classifier capable of…
Cylindrical algebraic decomposition(CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. When using CAD, there is often a choice for the ordering placed on the variables.…
In this paper we develop a very general class of bivariate discrete distributions. The basic idea is very simple. The marginals are obtained by taking the random geometric sum of a baseline distribution function. The proposed class of…
Online Contention Resolution Schemes (OCRS's) represent a modern tool for selecting a subset of elements, subject to resource constraints, when the elements are presented to the algorithm sequentially. OCRS's have led to some of the…
The behaviour of elastic structures undergoing large deformations is the result of the competition between confining conditions, self-avoidance and elasticity. This combination of multiple phenomena creates a geometrical frustration that…
We consider the problem of PAC-learning decision trees, i.e., learning a decision tree over the n-dimensional hypercube from independent random labeled examples. Despite significant effort, no polynomial-time algorithm is known for learning…
Significant developments in the field of additive manufacturing (AM) allowed the fabrication of complex microarchitectured components with varying porosity across different scales. However, due to the high complexity of this process, the…