Publications related to A mean field approach for optimization in discrete time

Dynamic Credit-Collections Optimization

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

Unified Approach to Convex Robust Distributed Control Given Arbitrary Information Structures

Maryam Kamgarpour, Luca Furieri

We consider the problem of computing optimal linear control policies for linear systems in finite-horizon. The states and the inputs are required to remain inside prespecified safety sets at all times despite unknown disturbances. In this technical note, w ...

2019

From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming

Daniel Kuhn, John Lygeros, Peyman Mohajerin Esfahani, Tobias Sutter

We consider linear programming (LP) problems in infinite dimensional spaces that are in general computationally intractable. Under suitable assumptions, we develop an approximation bridge from the infinite-dimensional LP to tractable finite convex programs ...

2018

Population-Level Intervention and Information Collection in Dynamic Healthcare Policy

Thomas Alois Weber

We develop a general framework for optimal health policy design in a dynamic setting. We consider a hypothetical medical intervention for a cohort of patients where one parameter varies across cohorts with imperfectly observable linear dynamics. We seek to ...

2018

The cost of omnidirectionality: extracting and labelling the echoes

Julien Olivier Thierry Rüegg

This report explains all theoretical and practical aspects of a 2D room re- construction algorithm based on euclidean geometry. Detailed theoretical explanations about the procedure are given in the first part. In the second part, a precise description of ...

2017

Convergence rates of moment-sum-of-squares hierarchies for optimal control problems

Colin Neil Jones, Milan Korda

We study the convergence rate of the moment-sum-of-squares hierarchy of semidefinite programs for optimal control problems with polynomial data. It is known that this hierarchy generates polynomial under-approximations to the value function of the optimal ...

Elsevier Science Bv2017

Time-Projection control on 3LP, a simple idea to deal with intermittent pushes online

Auke Ijspeert, Salman Faraji

In this article, we propose a new controller for recovering intermittent pushes during bipedal locomotion. We use 3LP as a template model which can provide closed-form solutions for state evolution. The idea behind our controller is to project the perturbe ...

2016

Medial axis transformation as a solid modeling representation method for computer aided design software

Paul Xirouchakis, Mihai-Bogdan Lazar, Ian Anthony Stroud, Florian Barras, Guillaume Goualard

A method for achieving a representation of an object within a data structure for a Computer Aided Design system employing a Medial Axis Transformation (MAT), the representation of the object comprising a set of adjacent bounded surface elements called MAT ...

2016

Partial Recovery Bounds for the Sparse Stochastic Block Model

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we study the information-theoretic limits of community detection in the symmetric two-community stochastic block model, with intra-community and inter-community edge probabilities

\frac{a}{n}

and

\frac{b}{n}

respectively. We consider the ...

Ieee2016

Measuring and Synthesizing Systems in Probabilistic Environments

Barbara Jobstmann, Rishabh Singh

The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under ...

Assoc Computing Machinery2015

A mean field approach for optimization in discrete time

Graph Chatbot

Chat with Graph Search

Dynamic Credit-Collections Optimization

Unified Approach to Convex Robust Distributed Control Given Arbitrary Information Structures

From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming

Population-Level Intervention and Information Collection in Dynamic Healthcare Policy

The cost of omnidirectionality: extracting and labelling the echoes

Convergence rates of moment-sum-of-squares hierarchies for optimal control problems

Time-Projection control on 3LP, a simple idea to deal with intermittent pushes online

Medial axis transformation as a solid modeling representation method for computer aided design software

Partial Recovery Bounds for the Sparse Stochastic Block Model

Measuring and Synthesizing Systems in Probabilistic Environments

The cost of omnidirectionality: extracting and labelling the echoes

Unified Approach to Convex Robust Distributed Control Given Arbitrary Information Structures

Medial axis transformation as a solid modeling representation method for computer aided design software

Measuring and Synthesizing Systems in Probabilistic Environments

Dynamic Credit-Collections Optimization

Population-Level Intervention and Information Collection in Dynamic Healthcare Policy

Partial Recovery Bounds for the Sparse Stochastic Block Model

From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming

Convergence rates of moment-sum-of-squares hierarchies for optimal control problems

Time-Projection control on 3LP, a simple idea to deal with intermittent pushes online