English
Related papers

Related papers: Polarization and Greedy Energy on the Sphere

200 papers

The aim of this note is to compare the averaged optimal coplanar transfer towards circular orbits when the costs are the transfer time transfer and the energy consumption. While the energy case leads to analyze a 2D Riemannian metric using…

Optimization and Control · Mathematics 2015-08-25 Bernard Bonnard , Helen Henninger , Jana Nemcova , Jean-Baptiste Pomet

A shorter processing time is desirable for quantum computation to minimize the effects of noise. We propose a simple procedure to variationally determine a set of parameters in the transverse-field Ising model for quantum annealing appended…

Quantum Physics · Physics 2022-12-09 Tadashi Kadowaki , Hidetoshi Nishimori

The greedy strategy is an approximation algorithm to solve optimization problems arising in decision making with multiple actions. How good is the greedy strategy compared to the optimal solution? In this survey, we mainly consider two…

Optimization and Control · Mathematics 2019-05-10 Yajing Liu , Edwin K. P. Chong , Ali Pezeshki , Zhenliang Zhang

We study sparse approximate solutions to convex optimization problems. It is known that in many engineering applications researchers are interested in an approximate solution of an optimization problem as a linear combination of elements…

Machine Learning · Statistics 2012-06-05 V. N. Temlyakov

Recent work on exploration in reinforcement learning (RL) has led to a series of increasingly complex solutions to the problem. This increase in complexity often comes at the expense of generality. Recent empirical studies suggest that,…

Machine Learning · Computer Science 2020-06-03 Will Dabney , Georg Ostrovski , André Barreto

We consider the stochastic heat equation driven by a multiplicative Gaussian noise that is white in time and spatially homogeneous in space. Assuming that the spatial correlation function is given by a Riesz kernel of order $\alpha \in…

Probability · Mathematics 2024-11-12 Carsten Chong

We present a hydrodynamic theory of polar active smectics, for systems both with and without number conservation. For the latter, we find quasi long-ranged smectic order in d=2 and long-ranged smectic order in d=3. In d=2 there is a…

Soft Condensed Matter · Physics 2015-06-12 Leiming Chen , John Toner

Motivated by an application to resource sharing network modelling, we consider a problem of greedy maximization (i.e., maximization of the consecutive minima) of a vector in $R^n$, with the admissible set indexed by the time parameter. The…

Optimization and Control · Mathematics 2019-02-05 Lukasz Kruk

In this paper, we derive the formula for the Casimir interaction energy between a sphere and a plate in $(D+1)$-dimensional Minkowski spacetime. It is assumed that the scalar field satisfies the Dirichlet or Neumann boundary conditions on…

High Energy Physics - Theory · Physics 2015-06-18 L. P. Teo

We study fixed-cardinality maximization of the inverse-matrix Solow--Polasky diversity, equivalently finite metric magnitude for the exponential kernel, on one-dimensional and ordered metric sets. The analysis starts from the known…

Optimization and Control · Mathematics 2026-05-22 Michael T. M. Emmerich , Mahboubeh Nezhadmoghaddam , Jesús Guillermo Falcón Cardona

A greedy algorithm is proposed for sparse-sensor selection in reduced-order sensing that contains correlated noise in measurement. The sensor selection is carried out by maximizing the determinant of the Fisher information matrix in a…

Optimization and Control · Mathematics 2021-04-28 Keigo Yamada , Yuji Saito , Koki Nankai , Taku Nonomura , Keisuke Asai , Daisuke Tsubakino

A $t$-spanner of a graph is a subgraph that $t$-approximates pairwise distances. The greedy algorithm is one of the simplest and most well-studied algorithms for constructing a sparse spanner: it computes a $t$-spanner with $n^{1+O(1/t)}$…

Data Structures and Algorithms · Computer Science 2023-08-03 Bernhard Haeupler , D Ellis Hershkowitz , Zihan Tan

This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a quantitative study of new types of greedy-like bases that have recently arisen in the context of nonlinear $m$-term approximation in Banach…

Functional Analysis · Mathematics 2022-05-20 Fernando Albiac , Jose L. Ansorena , Miguel Berasategui

We study sparse approximation by greedy algorithms. Our contribution is two-fold. First, we prove exact recovery with high probability of random $K$-sparse signals within $\lceil K(1+\e)\rceil$ iterations of the Orthogonal Matching Pursuit…

Numerical Analysis · Mathematics 2013-04-03 Eugene Livshitz , Vladimir Temlyakov

Given a set of $n$ vectors in $\mathbb{R}^d$, the goal of the \emph{determinant maximization} problem is to pick $k$ vectors with the maximum volume. Determinant maximization is the MAP-inference task for determinantal point processes (DPP)…

Data Structures and Algorithms · Computer Science 2023-09-28 Siddharth Gollapudi , Sepideh Mahabadi , Varun Sivashankar

This paper presents a numerical application of a self-consistent theory of partial redistribution in non-LTE conditions, developed in previous papers of the series. The code was described in a previous paper of this series. However, in that…

Solar and Stellar Astrophysics · Physics 2021-01-04 V. Bommier

We study a physical system of $N$ interacting particles in $\mathbb{R}^d$, $d\geq1$, subject to pair repulsion and confined by an external field. We establish a large deviations principle for their empirical distribution as $N$ tends to…

Probability · Mathematics 2014-09-09 Djalil Chafaï , Nathael Gozlan , Pierre-André Zitt

We derive the complete asymptotic expansion in terms of powers of $N$ for the geodesic $f$-energy of $N$ equally spaced points on a rectifiable simple closed curve $\Gamma$ in ${\mathbb R}^p$, $p\geq2$, as $N \to \infty$. For $f$ decreasing…

Mathematical Physics · Physics 2014-02-17 J. S. Brauchart , D. P. Hardin , E. B. Saff

There are many ways to upsample functions from multivariate scattered data locally, using only a few neighbouring data points of the evaluation point. The position and number of the actually used data points is not trivial, and many cases…

Numerical Analysis · Mathematics 2024-07-30 Robert Schaback

The advances in cold atom experiments have allowed construction of confining traps in the form of curved surfaces. This opens up the possibility of studying quantum gases in curved manifolds. On closed surfaces, many fundamental processes…

Quantum Gases · Physics 2018-05-25 Jian Zhang , Tin-Lun Ho
‹ Prev 1 8 9 10 Next ›