English
Related papers

Related papers: D(Maximum)=P(Argmaximum)

200 papers

In this work, approximations for real two variables function $f$ which has continuous partial $(n-1)$-derivatives $(n \ge 1)$ and has the $n$--th partial derivative of bounded bivariation or absolutely continuous are established. Explicit…

Classical Analysis and ODEs · Mathematics 2016-11-08 Mohammad W. Alomari

For a rational matrix function $\Phi$ with poles outside the unit circle, we estimate the degree of the unique superoptimal approximation $\A\Phi$ by matrix functions analytic in the unit disk. We obtain sharp estimates in the case of…

Functional Analysis · Mathematics 2007-05-23 V. V. Peller , V. I. Vasyunin

In this paper, we show that while almost all functions require exponential size branching programs to compute, for all functions $f$ there is a branching program computing a doubly exponential number of copies of $f$ which has linear size…

Computational Complexity · Computer Science 2017-02-23 Aaron Potechin

As a new technique it is shown how general pseudo-differential operators can be estimated at arbitrary points in Euclidean space when acting on functions $u$ with compact spectra. The estimate is a factorisation inequality, in which one…

Analysis of PDEs · Mathematics 2016-09-26 Jon Johnsen

Suppose $f(x,y) + \frac{\kappa}{2} \|x\|^2 - \frac{\sigma}{2}\|y\|^2$ is convex where $\sigma>0$, and the argmin function $\gamma(x) = \{ \gamma : \inf_y f(x,y) = f(x,\gamma)\}$ exists and is single valued. We will prove $\gamma$ is…

Analysis of PDEs · Mathematics 2019-05-31 Julius Ross , David Witt Nyström

In this note we prove the following good-$\lambda$ inequality, for $r>2$, all $\lambda > 0$, $\delta \in \big(0, \frac{1}{2} \big)$ \[ \nu\big\{ V_r(f) > 3 \lambda ; \mathcal{M}(f) \leq \delta \lambda\big\} \leq 4 \nu\{s(f) > \delta…

Classical Analysis and ODEs · Mathematics 2015-09-22 Kevin Hughes , Ben Krause , Bartosz Trojan

We investigate the question of how well points on a nondegenerate $k$-dimensional submanifold $M \subseteq \mathbb R^d$ can be approximated by rationals also lying on $M$, establishing an upper bound on the "intrinsic Dirichlet exponent"…

Number Theory · Mathematics 2018-01-23 Lior Fishman , Dmitry Kleinbock , Keith Merrill , David Simmons

This paper introduces a version of the argmax continuous mapping theorem that applies to M-estimation problems in which the objective functions converge to a limiting process with multiple maximizers. The concept of the smallest maximizer…

Statistics Theory · Mathematics 2011-05-09 Emilio Seijo , Bodhisattva Sen

In this paper, we perform sensitivity analysis for the maximal value function which is the optimal value function for a parametric maximization problem. Our aim is to study various subdifferentials for the maximal value function. We obtain…

Optimization and Control · Mathematics 2023-03-03 L. Guo , J. J. Ye , J. Zhang

Let $\Delta_m$ be the standard $m$-dimensional simplex of non-negative $m+1$ tuples that sum to unity and let $S$ be a nonempty subset of $\Delta_m$. A real valued function $h$ defined on a convex subset of a real vector space is $S$-almost…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…

Optimization and Control · Mathematics 2011-05-13 Jean B. Lasserre

In reinforcement learning, different reward functions can be equivalent in terms of the optimal policies they induce. A particularly well-known and important example is potential shaping, a class of functions that can be added to any reward…

Machine Learning · Computer Science 2022-12-06 Erik Jenner , Herke van Hoof , Adam Gleave

Let $A_tf(x)=\int f(x+ty)d\sigma(y)$ denote the spherical means in $\Bbb R^d$ ($d\sigma$ is surface measure on $S^{d-1}$, normalized to $1$). We prove sharp estimates for the maximal function $M_E f(x)=\sup_{t\in E}|A_tf(x)|$ where $E$ is a…

Functional Analysis · Mathematics 2016-09-06 Andreas Seeger , Stephen Wainger , James Wright

A functional distance ${\mathbb H}$, based on the Hausdorff metric between the function hypographs, is proposed for the space ${\mathcal E}$ of non-negative real upper semicontinuous functions on a compact interval. The main goal of the…

Statistics Theory · Mathematics 2015-09-17 Alejandro Cholaquidis , Antonio Cuevas , Ricardo Fraiman

Unlike polynomials, rational functions can represent functions having poles or branch cuts with root-exponential convergence and no Runge phenomenon. Recent developments of the AAA and greedy Thiele algorithms have sparked renewed interest…

Numerical Analysis · Mathematics 2025-12-09 Tobin A. Driscoll

Computations in high-dimensional spaces can often be realized only approximately, using a certain number of projections onto lower dimensional subspaces or sampling from distributions. In this paper, we are interested in pairs of…

Numerical Analysis · Mathematics 2025-02-26 Nicolaj Rux , Michael Quellmalz , Gabriele Steidl

An efficient approach for the construction of separable approximations of optimal value functions from interconnected optimal control problems is presented. The approach is based on assuming decaying sensitivities between subsystems,…

Optimization and Control · Mathematics 2025-01-16 Mario Sperl , Luca Saluzzi , Lars Grüne , Dante Kalise

Let $D$ be a domain in the complex plane, $M$ be an extended real function on $D$. If $f$ is a non-zero holomorphic function on $D$ with an upper constraint $|f|\leq \exp M$ on this domain $D$, then it is natural to expect that there must…

Complex Variables · Mathematics 2020-12-24 B. N. Khabibullin , F. B. Khabibullin

We investigate a more generalized form of submodular maximization, referred to as $k$-submodular maximization, with applications across social networks and machine learning domains. In this work, we propose the multilinear extension of…

Data Structures and Algorithms · Computer Science 2023-09-13 Lingxiao Huang , Baoxiang Wang , Huanjian Zhou

In the Max $k$-Weight SAT (aka Max SAT with Cardinality Constraint) problem, we are given a CNF formula with $n$ variables and $m$ clauses together with a positive integer $k$. The goal is to find an assignment where at most $k$ variables…

Data Structures and Algorithms · Computer Science 2024-06-05 Pasin Manurangsi