Concept

Bellman equation

Publications associées (182)

Neural controlled differential equations for crop classification

Accurate and scalable crop classification is important for food security and sustainable resources management. The temporal development of crops, i.e., their phenology, is a continuous phenomena that if properly captured, can help to discern them. The nove ...

2021

Sifting through the Noise: Universal First-Order Methods for Stochastic Variational Inequalities

Volkan Cevher, Kimon Antonakopoulos, Thomas Michaelsen Pethick, Ali Kavis

We examine a flexible algorithmic framework for solving monotone variational inequalities in the presence of randomness and uncertainty. The proposed template encompasses a wide range of popular first-order methods, including dual averaging, dual extrapola ...

2021

Stabilization of city-scale road traffic networks via macroscopic fundamental diagram-based model predictive perimeter control

Nikolaos Geroliminis, Isik Ilber Sirmatel

Traffic control for large-scale urban road networks remains a challenging problem. Aggregated dynamical models of city-scale traffic, based on the macroscopic fundamental diagram (MFD), enable development of model-based perimeter control methods. Involving ...

2021

A new regret analysis for Adam-type algorithms

Volkan Cevher, Ahmet Alacaoglu

In this paper, we focus on a theory-practice gap for Adam and its variants (AMSgrad, AdamNC, etc.). In practice, these algorithms are used with a constant first-order moment parameter 1 (typically between 0:9 and 0:99). In theory, regret guarantees for onl ...

2020

Optimal spanwise-periodic control for recirculation length in a backward-facing step flow

François Gallaire, Edouard Boujo, Eunok Yim

Three-dimensional control is considered in the flow past a backward-facing step (BFS). The BFS flow at Reynolds number Re = 500 (defined with the step height and the maximum inlet velocity) is two-dimensional and linearly stable but increasingly receptive ...

AMER PHYSICAL SOC2020

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Shaul Nadav Hallak

This paper introduces a method for computing points satisfying the second-order necessary optimality conditions for nonconvex minimization problems subject to a closed and convex constraint set. The method comprises two independent steps corresponding to t ...

SPRINGER/PLENUM PUBLISHERS2020

Computational pipeline to probe NaV1.7 gain-of-function variants in neuropathic painful syndromes

Stefano Zamuner, Margherita Marchi

Applications of machine learning and graph theory techniques to neuroscience have witnessed an increased interest in the last decade due to the large data availability and unprecedented technology developments. Their employment to investigate the effect of ...

NATURE RESEARCH2020

Dynamic Credit-Collections Optimization

Thomas Alois Weber

Based on a dynamic model of the stochastic repayment behavior exhibited by delinquent credit-card accounts as a self-exciting point process, a bank can control the arrival intensity of repayments using costly account-treatment actions. A semi-analytic solu ...

2019

The Foldable Drone: A Morphing Quadrotor That Can Squeeze and Fly

Dario Floreano, Stefano Mintchev, Davide Scaramuzza

The recent advances in state estimation, perception, and navigation algorithms have significantly contributed to the ubiquitous use of quadrotors for inspection, mapping, and aerial imaging. To further increase the versatility of quadrotors, recent works i ...

2019

A saddle point approach to an optimal boundary control problem for steady Navier-Stokes equations

Alfio Quarteroni, Andrea Manzoni

In this paper we propose a saddle point approach to solve boundary control problems for the steady Navier-Stokes equations with mixed Dirichlet-Neumann boundary conditions, both in two and three dimensions. We provide a comprehensive theoretical framework ...

AMER INST MATHEMATICAL SCIENCES-AIMS2019

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