English
Related papers

Related papers: Polarization and Greedy Energy on the Sphere

200 papers

In this article we prove that the minimum-degree greedy algorithm, with adversarial tie-breaking, is a $(2/3)$-approximation for the Maximum Independent Set problem on interval graphs. We show that this is tight, even on unit interval…

Data Structures and Algorithms · Computer Science 2024-03-19 Steven Chaplick , Martin Frohn , Steven Kelk , Johann Lottermoser , Matus Mihalak

The submodular maximization problem is widely applicable in many engineering problems where objectives exhibit diminishing returns. While this problem is known to be NP-hard for certain subclasses of objective functions, there is a greedy…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-01 Haoyuan Sun , David Grimsman , Jason R Marden

We consider parametrized linear-quadratic optimal control problems and provide their online-efficient solutions by combining greedy reduced basis methods and machine learning algorithms. To this end, we first extend the greedy control…

Optimization and Control · Mathematics 2023-07-31 Hendrik Kleikamp , Martin Lazar , Cesare Molinari

In a standard NP-complete optimization problem we introduce an interpolating algorithm between the quick decrease along the gradient (greedy dynamics) and a slow decrease close to the level curves (reluctant dynamics). We find that for a…

Mathematical Physics · Physics 2007-05-23 P. Contucci , C. Giardina' , C. Giberti , F. Unguendoli , C. Vernia

We study the Schr\"odinger-Poisson system on the unit sphere $\SS^2$ of $\RR^3$, modeling the quantum transport of charged particles confined on a sphere by an external potential. Our first results concern the Cauchy problem for this…

Analysis of PDEs · Mathematics 2010-11-05 Patrick Gérard , Florian Méhats

This paper focuses on the development of novel greedy techniques for distributed learning under sparsity constraints. Greedy techniques have widely been used in centralized systems due to their low computational requirements and at the same…

Information Theory · Computer Science 2015-06-23 Symeon Chouvardas , Gerasimos Mileounis , Nicholas Kalouptsidis , Sergios Theodoridis

We define a determinantal point process on the complex projective space that reduces to the so-called spherical ensemble for complex dimension 1 under identification of the 2-sphere with the Riemann sphere. Through this determinantal point…

Classical Analysis and ODEs · Mathematics 2017-03-02 Carlos Beltrán , Ujué Etayo

We study the Riesz and logarithmic energies on the Grassmannian $\operatorname{Gr}_{2,4}$ of $2$-dimensional subspaces of $\mathbb{R}^4$. We prove that the continuous Riesz and logarithmic energies are uniquely minimized by the uniform…

Classical Analysis and ODEs · Mathematics 2025-01-03 Ujué Etayo , Pedro R. López-Gómez

Given the proximity of many wireless users and their diversity in consuming local resources (e.g., data-plans, computation and energy resources), device-to-device (D2D) resource sharing is a promising approach towards realizing a sharing…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-23 Shuqin Gao , Costas A. Courcoubetis , Lingjie Duan

We analyze task orderings in continual learning for linear regression, assuming joint realizability of training data. We focus on orderings that greedily maximize dissimilarity between consecutive tasks, a concept briefly explored in prior…

Machine Learning · Computer Science 2025-10-24 Matan Tsipory , Ran Levinstein , Itay Evron , Mark Kong , Deanna Needell , Daniel Soudry

Consider the Hitting Set problem where, for a given universe $\mathcal{X} = \left\{ 1, ... , n \right\}$ and a collection of subsets $\mathcal{S}_1, ... , \mathcal{S}_m$, one seeks to identify the smallest subset of $\mathcal{X}$ which has…

Probability · Mathematics 2023-05-10 Gabriel Arpino , Daniil Dmitriev , Nicolo Grometto

We investigate the performance of m-th order consensus systems with stochastic external perturbations, where a subset of leader nodes incorporates absolute information into their control laws. The system performance is measured by its…

Optimization and Control · Mathematics 2019-06-13 Erika Mackin , Stacy Patterson

We investigate minimum weak $\alpha$-Riesz energy problems with external fields in both the unconstrained and constrained settings for generalized condensers $(A_1,A_2)$ such that the closures of $A_1$ and $A_2$ in $\mathbb R^n$ are allowed…

Classical Analysis and ODEs · Mathematics 2018-10-19 Bent Fuglede , Natalia Zorii

The aim of this paper is to develop fast second-order accurate difference schemes for solving one- and two-dimensional time distributed-order and Riesz space fractional diffusion equations. We adopt the same measures for one- and…

Numerical Analysis · Mathematics 2019-07-12 Huan-Yan Jian , Ting-Zhu Huang , Xi-Le Zhao , Yong-Liang Zhao

We propose a new greedy algorithm for the maximum cardinality matching problem. We give experimental evidence that this algorithm is likely to find a maximum matching in random graphs with constant expected degree c>0, independent of the…

Data Structures and Algorithms · Computer Science 2012-03-20 Martin Dietzfelbinger , Hendrik Peilke , Michael Rink

In this paper, we study the asymptotic behavior of the first, second, and so on rows of stochastically decaying partitions. We establish that, with appropriate scaling in time and length, the sequence of rows converges to the Airy$_2$ line…

Probability · Mathematics 2016-11-10 In-Jee Jeong , Sasha Sodin

We study the problem of causal structure learning when the experimenter is limited to perform at most $k$ non-adaptive experiments of size $1$. We formulate the problem of finding the best intervention target set as an optimization problem,…

Machine Learning · Computer Science 2018-08-03 AmirEmad Ghassami , Saber Salehkaleybar , Negar Kiyavash , Elias Bareinboim

We study the constrained minimum energy problem with an external field relative to the $\alpha$-Riesz kernel $|x-y|^{\alpha-n}$ of order $\alpha\in(0,n)$ for a generalized condenser $\mathbf A=(A_i)_{i\in I}$ in $\mathbb R^n$, $n\geqslant…

Classical Analysis and ODEs · Mathematics 2018-05-01 P. D. Dragnev , B. Fuglede , D. P. Hardin , E. B. Saff , N. Zorii

We present a simple greedy procedure to compute an $(\alpha,\beta)$-spanner for a graph $G$. We then show that this procedure is useful for building fault-tolerant spanners, as well as spanners for weighted graphs. Our first main result is…

Data Structures and Algorithms · Computer Science 2026-03-19 Elizaveta Popova , Elad Tzalik

The task of allocating preventative resources to a computer network in order to protect against the spread of viruses is addressed. Virus spreading dynamics are described by a linearized SIS model and protection is framed by an optimization…

Social and Information Networks · Computer Science 2014-01-23 Michael Zargham , Victor M. Preciado