English
Related papers

Related papers: The smoothest average and some extremal problems f…

200 papers

The embedding constants of the Sobolev spaces $\mathring{W}^n_2[0;1] \hookrightarrow \mathring{W}^k_\infty[0; 1]$ ($0\leqslant k \leqslant n-1$) are studied. A relation of the embedding constants with the norms of the functionals $f\mapsto…

Functional Analysis · Mathematics 2020-01-03 Igor Sheipak , Tatiana Garmanova

We study the problem of sampling from a distribution $\mu$ with density $\propto e^{-V}$ for some potential function $V:\mathbb R^d\to \mathbb R$ with query access to $V$ and $\nabla V$. We start with the following standard assumptions: (1)…

Data Structures and Algorithms · Computer Science 2026-02-10 Yuchen He , Zhehan Lei , Jianan Shao , Chihao Zhang

We consider entire solutions to $L u= f(u)$ in $\RR^2$, where $L$ is a general nonlocal operator with kernel $K(y)$. Under certain natural assumtions on the operator $L$, we show that any stable solution is a 1D solution. In particular, our…

Analysis of PDEs · Mathematics 2015-05-27 Xavier Ros-Oton , Yannick Sire

There is a large body of work on convergence rates either in passive or active learning. Here we first outline some of the main results that have been obtained, more specifically in a nonparametric setting under assumptions about the…

Machine Learning · Computer Science 2020-07-14 Boris Ndjia Njike , Xavier Siebert

We examine the elliptic system given by \begin{eqnarray*} \qquad \left\{ \begin{array}{lcl} -\Delta u =\lambda f(v) \quad \mbox{ in } \Omega -\Delta v =\gamma f(u) \quad \mbox{ in } \Omega, u=v =0, \quad \mbox{ on } \pOm \end{array}\right.…

Analysis of PDEs · Mathematics 2017-07-24 A. Aghajani , C. Cowan

The usual approach to developing and analyzing first-order methods for smooth convex optimization assumes that the gradient of the objective function is uniformly smooth with some Lipschitz constant $L$. However, in many settings the…

Optimization and Control · Mathematics 2017-10-11 Haihao Lu , Robert M. Freund , Yurii Nesterov

The problem of minimization of the least squares functional with a smooth, lower semi-continuous, convex regularizer $J(\cdot)$ is considered to be solved. Over some compact and convex subset $\Omega$ of the Hilbert space $\mathcal{H},$ the…

Numerical Analysis · Mathematics 2015-09-04 Erdem Altuntac

We examine the regularity of the extremal solution of the nonlinear eigenvalue problem $\Delta^2 u = \lambda f(u)$ on a general bounded domain $\Omega$ in $ \IR^N$, with the Navier boundary condition $ u=\Delta u =0 $ on $ \pOm$. Here $…

Analysis of PDEs · Mathematics 2010-03-22 Craig Cowan , Pierpaolo Esposito , Nassif Ghoussoub

We study the behavior of stochastic gradient descent applied to $\|Ax -b \|_2^2 \rightarrow \min$ for invertible $A \in \mathbb{R}^{n \times n}$. We show that there is an explicit constant $c_{A}$ depending (mildly) on $A$ such that $$…

Numerical Analysis · Mathematics 2020-09-03 Stefan Steinerberger

We consider the problem of establishing nonlinear smoothing as a general feature of nonlinear dispersive equations, i.e. the improved regularity of the integral term in Duhamel's formula, with respect to the initial data and the…

Analysis of PDEs · Mathematics 2023-02-08 Simão Correia , Filipe Oliveira , Jorge Drumond Silva

Nonparametric tests via kernel embedding of distributions have witnessed a great deal of practical successes in recent years. However, statistical properties of these tests are largely unknown beyond consistency against a fixed alternative.…

Statistics Theory · Mathematics 2019-09-10 Tong Li , Ming Yuan

This paper considers the development of spatially adaptive smoothing splines for the estimation of a regression function with non-homogeneous smoothness across the domain. Two challenging issues that arise in this context are the evaluation…

Statistics Theory · Mathematics 2013-06-11 Xiao Wang , Pang Du , Jinglai Shen

We give nearly matching upper and lower bounds on the oracle complexity of finding $\epsilon$-stationary points ($\| \nabla F(x) \| \leq\epsilon$) in stochastic convex optimization. We jointly analyze the oracle complexity in both the local…

Machine Learning · Computer Science 2019-02-15 Dylan J. Foster , Ayush Sekhari , Ohad Shamir , Nathan Srebro , Karthik Sridharan , Blake Woodworth

The Euclidean k-means problem is arguably the most widely-studied clustering problem in machine learning. While the k-means objective is NP-hard in the worst-case, practitioners have enjoyed remarkable success in applying heuristics like…

Machine Learning · Computer Science 2017-12-05 Abhratanu Dutta , Aravindan Vijayaraghavan , Alex Wang

Low-rank approximation of kernels is a fundamental mathematical problem with widespread algorithmic applications. Often the kernel is restricted to an algebraic variety, e.g., in problems involving sparse or low-rank data. We show that…

Machine Learning · Computer Science 2023-10-02 Jason M. Altschuler , Pablo A. Parrilo

Let (M,g) be a smooth compact Riemannian manifold without boundary of dimension n>=6. We prove that {align*} \|u\|_{L^{2^*}(M,g)}^2 \le K^2\int_M\{|\nabla_g u|^2+c(n)R_gu^2\}dv_g +A\|u\|_{L^{2n/(n+2)}(M,g)}^2, {align*} for all u\in H^1(M),…

Analysis of PDEs · Mathematics 2007-05-23 YanYan Li , Tonia Ricciardi

I prove that the average number of comparisons for median-of-$k$ Quicksort (with fat-pivot a.k.a. three-way partitioning) is asymptotically only a constant $\alpha_k$ times worse than the lower bound for sorting random multisets with…

Data Structures and Algorithms · Computer Science 2019-05-07 Sebastian Wild

We investigate the uniform approximation provided by least squares polynomials on the unit Euclidean sphere $\mathbb{S}^q$ in $\mathbb{R}^{q+1}$, with $q\ge 2$. Like any other polynomial projection, the study concerns the growth, as the…

Numerical Analysis · Mathematics 2018-08-13 Woula Themistoclakis , Marc Van Barel

We study the regularity of the viscosity solution $u$ of the $\sigma_k$-Loewner-Nirenberg problem on a bounded smooth domain $\Omega \subset \mathbb{R}^n$ for $k \geq 2$. It was known that $u$ is locally Lipschitz in $\Omega$. We prove…

Analysis of PDEs · Mathematics 2023-10-18 YanYan Li , Luc Nguyen , Jingang Xiong

The Polyak-{\L}ojasiewicz (P{\L}) condition is often invoked in nonconvex optimization because it allows fast convergence of algorithms beyond strong convexity. A function $f \colon \mathcal{M} \to \mathbb{R}$ on a Riemannian manifold…

Optimization and Control · Mathematics 2026-04-10 Nicolas Boumal , Christopher Criscitiello , Quentin Rebjock