Concept

Théorème de plongement de Nash

Publications associées (24)

Hybrid Quadratic Programming - Pullback Bundle Dynamical Systems Control

Dynamical System (DS)-based closed-loop control is a simple and effective way to generate reactive motion policies that well generalize to the robotic workspace, while retaining stability guarantees. Lately the formalism has been expanded in order to handl ...

SPRINGER INTERNATIONAL PUBLISHING AG2023

Energy Bounds For A Fourth-Order Equation In Low Dimensions Related To Wave Maps

Tobias Johannes Schmid

For compact, isometrically embedded Riemannian manifolds N -> R-L, we introduce a fourth-order version of the wave maps equation. By energy estimates, we prove an a priori estimate for smooth local solutions in the energy subcritical dimension n = 1, 2. Th ...

AMER MATHEMATICAL SOC2022

Linearization and Identification of Multiple-Attractor Dynamical Systems through Laplacian Eigenmaps

Aude Billard, Bernardo Fichera

Dynamical Systems (DS) are fundamental to the modeling and understanding time evolving phenomena, and have application in physics, biology and control. As determining an analytical description of the dynamics is often difficult, data-driven approaches are ...

MICROTOME PUBL2022

Adaptive Gradient Descent without Descent

Konstantin Mishchenko

We present a strikingly simple proof that two rules are sufficient to automate gradient descent: 1) don’t increase the stepsize too fast and 2) don’t overstep the local curvature. No need for functional values, no line search, no information about the func ...

2020

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

Aris Filos Ratsikas

We resolve the computational complexity of two problems known as NECKLACE-SPLITTING and DISCRETE HAM SANDWICH, showing that they are PPA-complete. For NECKLACE SPLITTING, this result is specific to the important special case in which two thieves share the ...

ACM2019

Steady Three-Dimensional Rotational Flows: An Approach Via Two Stream Functions And Nash-Moser Iteration

Boris Buffoni

We consider the stationary flow of an inviscid and incompressible fluid of constant density in the region D = (0, L) x R-2. We are concerned with flows that are periodic in the second and third variables and that have prescribed flux through each point of ...

MATHEMATICAL SCIENCE PUBL2019

A Fourier dimensionality reduction model for big data interferometric imaging

Jean-Philippe Thiran, Yves Wiaux, Rafael Eduardo Carrillo Rangel, Vijay Kartik

Data dimensionality reduction in radio interferometry can provide savings of computational resources for image reconstruction through reduced memory footprints and lighter computations per iteration, which is important for the scalability of imaging method ...

Oxford Univ Press2017

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Space lower bounds for low-stretch greedy embeddings

Christos Kalaitzis

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

Elsevier Science Bv2016

Dynamics of particles with anisotropic mass depending on time and position

Tudor Ratiu

Representations of solutions of equations describing the diffusion and quantum dynamics of particles in a Riemannian manifold are discussed under the assumption that the mass of particles is anisotropic and depends on both time and position. These equation ...

Springer Verlag2015

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search