Concept

Horizon des particules

Publications associées (61)

Fast Mean Estimation with Sub-Gaussian Rates

We present an improved analysis of the Euler-Maruyama discretization of the Langevin diffusion. Our analysis does not require global contractivity, and yields polynomial dependence on the time horizon. Compared to existing approaches, we make an additional ...

2019

Trajectory Optimization for Legged Robots With Slipping Motions

Marco Hutter

The dynamics of legged systems are characterized by under-actuation, instability, and contact state switching. We present a trajectory optimization method for generating physically consistent motions under these conditions. By integrating a custom solver f ...

2019

Time-projection control to recover inter-sample disturbances, application to bipedal walking control

Auke Ijspeert, Philippe Müllhaupt, Salman Faraji

We present a new walking controller based on 3LP, a 3D model of bipedal walking that is composed of three pendulums to simulate falling, swing and torso dynamics. Taking advantage of linear equations and closed-form solutions of 3LP, the proposed controlle ...

2018

Let’s be honest: An optimal no-regret framework for zero-sum games

Volkan Cevher, Ya-Ping Hsieh, Mehmet Fatih Sahin, Ehsan Asadi Kangarshahi

We revisit the problem of solving two-player zero- sum games in the decentralized setting. We pro- pose a simple algorithmic framework that simulta- neously achieves the best rates for honest regret as well as adversarial regret, and in addition resolves t ...

2018

Robust Real-Time Control of Power Grids in the Presence of Communication Network Non-Idealities

Jean-Yves Le Boudec, Mario Paolone, Lorenzo Enrique Reyes Chamorro, Wajeb Saab, Roman Rudnik

Deploying a power grid controller in the field makes it susceptible to message losses caused by the inherent uncertainties and non-idealities of communication networks, especially when the control action is taken at a sub-second time-scale. We consider a c ...

2018

Robust Real-Time Control of Power Grids in the Presence of Communication Network Non-Idealities

Jean-Yves Le Boudec, Mario Paolone, Lorenzo Enrique Reyes Chamorro, Wajeb Saab, Roman Rudnik

IEEE2018

On the Use of Transfer Entropy to Investigate the Time Horizon of Causal Influences between Signals

Olivier Sauter, Ambrogio Fasoli, Basil Duval, Stefano Coda, Jonathan Graves, Yves Martin, Duccio Testa, Patrick Blanchard, Alessandro Pau, Cristian Sommariva, Henri Weisen, Richard Pitts, Yann Camenen, Jan Horacek, Javier García Hernández, Marco Wischmeier, Nicola Vianello, Mikhail Maslov, Federico Nespoli, Yao Zhou, David Pfefferlé, Davide Galassi, Antonio José Pereira de Figueiredo, Jonathan Marc Philippe Faustin, Liang Yao, Dalziel Joseph Wilson, Hamish William Patten, Samuel Lanthaler, Bernhard Sieglin, Otto Asunta

Understanding the details of the correlation between time series is an essential step on the route to assessing the causal relation between systems. Traditional statistical indicators, such as the Pearson correlation coefficient and the mutual information, ...

2018

Polarised black holes in ABJM

We numerically construct asymptotically AdS(4) solutions to Einstein-Maxwell-dilaton theory. These have a dipolar electrostatic potential turned on at the conformal boundary S-2 x R-t. We find two classes of geometries: AdS soliton solutions that encode th ...

Springer Nature2017

Time-Varying Gaussian Process Bandit Optimization

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

We consider the sequential Bayesian optimization problem with bandit feedback, adopting a formulation that allows for the reward function to vary with time. We model the reward function using a Gaussian process whose evolution obeys a simple Markov model. ...

2016

Global Optimization on an Interval

Thomas Alois Weber

This paper provides expressions for the largest and smallest solution of a global optimization problem using an adjoint variable which represents the available one-sided improvements up to the interval “horizon”. Interpreting the problem in terms of optima ...

2016

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