Concept

Euclidean group

Related publications (42)

Mean value theorems for collections of lattices with a prescribed group of symmetries

Euclidean lattices are mathematical objects of increasing interest in the fields of cryptography and error-correcting codes. This doctoral thesis is a study on high-dimensional lattices with the motivation to understand how efficient they are in terms of b ...

EPFL2024

Conception et dimensionnement durable : Étude comparative et conception multi-matériaux

Flavien Dumont

Les émissions de CO2 émises par le secteur de la construction représentent 11% des émissions globales de l’humanité (2019). En raison de l’urgence climatique, il est nécessaire de les réduire. Dans ce contexte et selon les conclusions données par la pré-é ...

2023

Localizing Unsynchronized Sensors With Unknown Sources

Ivan Dokmanic, Dalia Salem Hassan Fahmy El Badawy

We propose a method for sensor array self-localization using a set of sources at unknown locations. The sources produce signals whose times of arrival are registered at the sensors. We look at the general case where neither the emission times of the source ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Equivariant Diffusion for Molecule Generation in 3D

Clément Arthur Yvon Vignac

This work introduces a diffusion model for molecule generation in 3D that is equivariant to Euclidean transformations. Our E(3) Equivariant Diffusion Model (EDM) learns to denoise a diffusion process with an equivariant network that jointly operates on bot ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Un vocabulaire architectural sensible et bio-inspiré. Démonstration dans un pavillon à la Jetée de la Compagnie

L’architecture prend souvent le parti élitiste de s’adresser à la mince frange de population ayant fait le choix de s’éduquer pour en saisir les subtils secrets, laissant les autres hors-circuit, alors qu’ils en seront pourtant les usagers majoritaires. Da ...

2020

UCLID-Net: Single View Reconstruction in Object Space

Pascal Fua, Benoît Alain René Guillard, Edoardo Remelli

Most state-of-the-art deep geometric learning single-view reconstruction approaches rely on encoder-decoder architectures that output either shape parametrizations or implicit representations. However, these representations rarely preserve the Euclidean st ...

2020

An Improved Analysis of Local Search for Max-Sum Diversification

Friedrich Eisenbrand, Rico Zenklusen, Alfonso Bolívar Cevallos Manzano

We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...

INFORMS2019

Improved Bounds for Discretization of Langevin Diffusions: Near-Optimal Rates without Convexity

Nicolas Henri Bernard Flammarion

We consider minimizing a nonconvex, smooth function

f

on a Riemannian manifold

\mathcal{M}

. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle point ...

2019

Escaping from saddle points on Riemannian manifolds

Nicolas Henri Bernard Flammarion, Yue Sun

We consider minimizing a nonconvex, smooth function f on a Riemannian manifold M. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle points on the manif ...

2019

3D Steerable CNNs: Learning Rotationally Equivariant Features in Volumetric Data

Mario Geiger

We present a convolutional network that is equivariant to rigid body motions. The model uses scalar-, vector-, and tensor fields over 3D Euclidean space to represent data, and equivariant convolutions to map between such representations. These SE(3)-equiva ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2018

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Improved Bounds for Discretization of Langevin Diffusions: Near-Optimal Rates without Convexity

Nicolas Henri Bernard Flammarion

We consider minimizing a nonconvex, smooth function

f

on a Riemannian manifold

\mathcal{M}

. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle point ...

2019