Related papers: Discretizing $L_p$ norms and frame theory
This paper investigates the optimality conditions for characterizing the local minimizers of the constrained optimization problems involving an $\ell_p$ norm ($0<p<1$) of the variables, which may appear in either the objective or the…
State-of-the-art neural networks can be trained to become remarkable solutions to many problems. But while these architectures can express symbolic, perfect solutions, trained models often arrive at approximations instead. We show that the…
We consider the problem of minimizing an objective function that is the sum of a convex function and a group sparsity-inducing regularizer. Problems that integrate such regularizers arise in modern machine learning applications, often for…
This paper addresses the single-item single-stocking location non-stationary stochastic lot-sizing problem under a reorder point -- order quantity control strategy. The reorder points and order quantities are chosen at the beginning of the…
In this paper we study the sampling recovery problem for certain relevant multivariate function classes which are not compactly embedded into $L_\infty$. Recent tools relating the sampling numbers to the Kolmogorov widths in the uniform…
Discrete Determinantal Point Processes (DPPs) have a wide array of potential applications for subsampling datasets. They are however held back in some cases by the high cost of sampling. In the worst-case scenario, the sampling cost scales…
In this note, we develop fast and deterministic dimensionality reduction techniques for a family of subspace approximation problems. Let $P\subset \mathbbm{R}^N$ be a given set of $M$ points. The techniques developed herein find an $O(n…
The de Rham complex arises naturally when studying problems in electromagnetism and fluid mechanics. Stable numerical methods to solve these problems can be obtained by using a discrete de Rham complex that preserves the structure of the…
In the subspace sketch problem one is given an $n\times d$ matrix $A$ with $O(\log(nd))$ bit entries, and would like to compress it in an arbitrary way to build a small space data structure $Q_p$, so that for any given $x \in \mathbb{R}^d$,…
In this paper, we present a local information theoretic approach to explicitly learn probabilistic clustering of a discrete random variable. Our formulation yields a convex maximization problem for which it is NP-hard to find the global…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
We study the finite element approximation of the solid isotropic material with penalization method (SIMP) for the topology optimization problem of minimizing the compliance of a linearly elastic structure. To ensure the existence of a local…
We consider standard tracking-type, distributed elliptic optimal control problems with $L^2$ regularization, and their finite element discretization. We are investigating the $L^2$ error between the finite element approximation $u_{\varrho…
Sparsity is a highly desired feature in deep neural networks (DNNs) since it ensures numerical efficiency, improves the interpretability of models (due to the smaller number of relevant features), and robustness. For linear models, it is…
For $1\leq p<\infty$, we prove that the dense subspace $\mathcal{Y}_p$ of $\ell_p(\Gamma)$ comprising all elements $y$ such that $y \in \ell_q(\Gamma)$ for some $q \in (0,p)$ admits a $C^{\infty}$-smooth norm which locally depends on…
One of the main contributions of this paper is to illustrate how large deviation theory can be used to determine the equilibrium distribution of a basic droplet model that underlies a number of important models in material science and…
Determinantal Point Processes (DPPs) are probabilistic models that arise in quantum physics and random matrix theory and have recently found numerous applications in computer science. DPPs define distributions over subsets of a given ground…
We study in this paper nonlinear subdivision schemes in a multivariate setting allowing arbitrary dilation matrix. We investigate the convergence of such iterative process to some limit function. Our analysis is based on some conditions on…
In the context of positive infinite-dimensional linear systems, we systematically study $L^p$-admissible control and observation operators with respect to the limit-cases $p=\infty$ and $p=1$, respectively. This requires an in-depth…
A crucial problem in neural networks is to select the most appropriate number of hidden neurons and obtain tight statistical risk bounds. In this work, we present a new perspective towards the bias-variance tradeoff in neural networks. As…