Related papers: Polarization and Greedy Energy on the Sphere
Through solution of the multielectron, semi-relativistic, time-dependent Schr\"{o}dinger equation, we show that angular streaking produces strongly spin-polarized electrons in a noble gas. The degree of spin polarization increases with the…
We present a fast two-phase algorithm for super-resolution with strong theoretical guarantees. Given the low-frequency part of the spectrum of a sequence of impulses, Phase I consists of a greedy algorithm that roughly estimates the impulse…
A second-order block coordinate descent method is proposed for the unconstrained minimization of an objective function with a Lipschitz continuous Hessian. At each iteration, a block of variables is selected by means of a greedy…
We consider the minimum Riesz $s$-energy problem on the unit disk $\mathbb D:=\{(x_1,\ldots,x_d)\in\mathbb R^d: x_1=0, x_2^2+x_3^2+\ldots+x_d^2\leq 1\}$ in the Euclidean space $\mathbb R^d$, $d\geq 3$, immersed into a smooth rotationally…
We consider the exploration problem: an agent equipped with a depth sensor must map out a previously unknown environment using as few sensor measurements as possible. We propose an approach based on supervised learning of a greedy…
We study sets of $N$ points on the $d-$dimensional torus $\mathbb{T}^d$ minimizing interaction functionals of the type \[ \sum_{i, j =1 \atop i \neq j}^{N}{ f(x_i - x_j)}. \] The main result states that for a class of functions $f$ that…
$t$-spanners are used to approximate the pairwise distances between a set of points in a metric space. They have only a few edges compared to the total number of pairs and they provide a $t$-approximation on the distance of any two…
We investigate the greedy version of the $L^p$-optimal vector quantization problem for an $\mathbb{R}^d$-valued random vector $X\!\in L^p$. We show the existence of a sequence $(a_N)_{N\ge 1}$ such that $a_N$ minimizes $a\mapsto\big…
Kernel interpolation is a versatile tool for the approximation of functions from data, and it can be proven to have some optimality properties when used with kernels related to certain Sobolev spaces. In the context of interpolation, the…
The greedy spanner is the highest quality geometric spanner (in e.g. edge count and weight, both in theory and practice) known to be computable in polynomial time. Unfortunately, all known algorithms for computing it take Omega(n^2) time,…
We consider Riesz energy problems with radial external fields. We study the question of whether or not the equilibrium is the uniform distribution on a sphere. We develop general necessary as well as general sufficient conditions on the…
We investigate the continuous analogue of the Cholesky factorization, namely the pivoted Cholesky algorithm. Our analysis establishes quantitative convergence guarantees for kernels of minimal smoothness. We prove that for a symmetric…
We consider minimizing a smooth function subject to a summation constraint over its variables. By exploiting a connection between the greedy 2-coordinate update for this problem and equality-constrained steepest descent in the 1-norm, we…
The coupling of some types of oscillators requires the mediation of a physical link between them, rendering the distance between oscillators a critical factor to achieve synchronization. In this paper we propose and explore a greedy…
The realization that selfish interests need to be accounted for in the design of algorithms has produced many contributions in computer science under the umbrella of algorithmic mechanism design. Novel algorithmic properties and paradigms…
The initial value problem for the $L^{2}$ critical semilinear Schr\"odinger equation with periodic boundary data is considered. We show that the problem is globally well posed in $H^{s}({\Bbb T^{d}})$, for $s>4/9$ and $s>2/3$ in 1D and 2D…
Stochastic iterative algorithms have gained recent interest in machine learning and signal processing for solving large-scale systems of equations, $Ax=b$. One such example is the Randomized Kaczmarz (RK) algorithm, which acts only on…
We consider periodic energy problems in Euclidean space with a special emphasis on long-range potentials that cannot be defined through the usual infinite sum. One of our main results builds on more recent developments of Ewald summation to…
To provide a novel tool for the investigation of the energy landscape of the Edwards-Anderson spin-glass model we introduce an algorithm that allows an efficient execution of a greedy optimization based on data from a previously performed…
Motivated by Kleinberg's (2000) and subsequent work, we consider the performance of greedy routing on a directed ring of $n$ nodes augmented with long-range contacts. In this model, each node $u$ is given an additional $D_u$ edges, a degree…