English
Related papers

Related papers: Approximations of Lovasz extensions and their indu…

200 papers

We introduce the concept of quasi-Lov\'asz extension as being a mapping $f\colon I^n\to\R$ defined on a nonempty real interval $I$ containing the origin and which can be factorized as $f(x_1,...,x_n)=L(\phi(x_1),...,\phi(x_n))$, where $L$…

Functional Analysis · Mathematics 2011-11-30 Miguel Couceiro , Jean-Luc Marichal

The Banzhaf power and interaction indexes for a pseudo-Boolean function (or a cooperative game) appear naturally as leading coefficients in the standard least squares approximation of the function by a pseudo-Boolean function of a specified…

Optimization and Control · Mathematics 2014-11-27 Jean-Luc Marichal , Pierre Mathonet

We consider a class of sparsity-inducing regularization terms based on submodular functions. While previous work has focused on non-decreasing functions, we explore symmetric submodular functions and their \lova extensions. We show that the…

Machine Learning · Computer Science 2011-06-13 Francis Bach

In this paper we consider the minimization of a novel class of fractional linear growth functionals involving the Riesz fractional gradient. These functionals lack the coercivity properties in the fractional Sobolev spaces needed to apply…

Analysis of PDEs · Mathematics 2023-02-28 Hidde Schönberger

Three important properties in aggregation theory are investigated, namely horizontal min-additivity, horizontal max-additivity, and comonotonic additivity, which are defined by certain relaxations of the Cauchy functional equation in…

Functional Analysis · Mathematics 2011-08-01 Miguel Couceiro , Jean-Luc Marichal

We present here a new method for approximating functions defined on superreflexive Banach spaces by differentiable functions with $\alpha$-H\"older derivatives (for some $0<\alpha\leq 1$). The smooth approximation is given by means of an…

Functional Analysis · Mathematics 2016-09-07 Manuel Cepedello Boiso

In complete metric measure spaces equipped with a doubling measure and supporting a weak Poincar\'e inequality, we investigate when a given Banach-valued Sobolev function defined on a subset satisfying a measure-density condition is the…

Functional Analysis · Mathematics 2022-11-02 Miguel García-Bravo , Toni Ikonen , Zheng Zhu

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

Computational Complexity · Computer Science 2009-10-21 Ilias Diakonikolas , Rocco A. Servedio

One means of fitting functions to high-dimensional data is by providing smoothness constraints. Recently, the following smooth function approximation problem was proposed: given a finite set $E \subset \mathbb{R}^d$ and a function $f: E…

Machine Learning · Statistics 2018-04-02 Adam Gustafson , Matthew Hirn , Kitty Mohammed , Hariharan Narayanan , Jason Xu

We investigate the problem of approximating the matrix function $f(A)$ by $r(A)$, with $f$ a Markov function, $r$ a rational interpolant of $f$, and $A$ a symmetric Toeplitz matrix. In a first step, we obtain a new upper bound for the…

Numerical Analysis · Mathematics 2022-01-19 Bernhard Beckermann , Joanna Bisch , Robert Luce

Using polarity, we give an outer polyhedral approximation for the epigraph of set functions. For a submodular function, we prove that the corresponding polar relaxation is exact; hence, it is equivalent to the Lov\'asz extension. The polar…

Optimization and Control · Mathematics 2020-12-09 Alper Atamturk , Vishnu Narayanan

The Fourier-Walsh expansion of a Boolean function $f \colon \{0,1\}^n \rightarrow \{0,1\}$ is its unique representation as a multilinear polynomial. The Kindler-Safra theorem (2002) asserts that if in the expansion of $f$, the total weight…

Combinatorics · Mathematics 2019-01-28 Nathan Keller , Ohad Klein

In this paper we consider skew bisubmodular functions as introduced in [9]. We construct a convex extension of a skew bisubmodular function which we call Lov\'asz extension in correspondence to the submodular case. We use this extension to…

Computational Complexity · Computer Science 2013-08-30 Anna Huber , Andrei Krokhin

We consider the well-known method of least squares on an equidistant grid with $N+1$ nodes on the interval $[-1,1]$. We investigate the following problem: For which ratio $N/n$ and which functions, do we have pointwise convergence of the…

Numerical Analysis · Mathematics 2016-10-24 René Goertz , Philipp Öffner

For an analytic and univalent function $f$ in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$, the logarithmic coefficients $\gamma_n$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

Complex Variables · Mathematics 2016-10-03 Md Firoz Ali , D. K. Thomas , A. Vasudevarao

This paper deals with extensions of vector-valued functions on finite graphs fulfilling distinguished minimality properties. We show that so-called lex and L-lex minimal extensions are actually the same and call them minimal Lipschitz…

Numerical Analysis · Mathematics 2019-03-13 Miroslav Bačák , Johannes Hertrich , Sebastian Neumayer , Gabriele Steidl

The classical Hahn-Banach theorem is based on a successive point-by-point procedure of extending bounded linear functionals. In the setting of a general metric domain, the conditions are less restrictive and the extension is only required…

General Topology · Mathematics 2020-02-19 Valentin Gutev

The logarithmic Sobolev inequality for the Hamming cube {0,1}^n states that for any real-valued function f on the cube holds E(f,f) \ge 2 Ent(f^2), where E(f,f) is the appropriate Dirichlet form (also known as "sum of influences"). We show…

Combinatorics · Mathematics 2008-07-11 Alex Samorodnitsky

To each weakly holomorphic modular function $f\not \equiv 0$ for $\mathrm{SL}(2,\mathbb{Z})$, which is non-negative on the geodesic arc $\{e^{it} : \pi/3\leq t\leq 2\pi/3\}$, we attach a $\mathrm{GL}(2,\mathbb{Z})$-invariant map…

Number Theory · Mathematics 2025-03-21 Paloma Bengoechea , Sebastián Herrero , Özlem Imamoglu

The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…

Computational Complexity · Computer Science 2017-03-20 Mark Bun , Justin Thaler
‹ Prev 1 2 3 10 Next ›