← Search

John Lygeros

17 accepted papers

2026

Beyond Domain Randomization: Safety Certificates for Reinforcement Learning

ICRA 2026poster

With the growing acceptance of robotics in daily life there is a growing need for certifiably safe control policies. While simulation provides a safe training environment, policies often fail in sim-to-real transfer. We propose a data-driven certification framework for reinforcement learning based o…

Cited by 0Scholar
2026

Guided Multi-Fidelity Bayesian Optimization for Data-driven Controller Tuning with Digital Twins

RA-L 2026

We propose a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">guided multi-fidelity Bayesian optimization</i> framework for data-efficient controller tuning that integrates corrected digital twin simulations with real-world measurements. The method ta

Cited by 1SourceScholar
2026

Loss-aware distributionally robust optimization via trainable optimal transport ambiguity sets

ICML 2026spotlight

Optimal-transport distributionally robust optimization (OT-DRO) robustifies data-driven decision-making under uncertainty by capturing the sampling-induced statistical error via optimal transport ambiguity sets. The standard OT-DRO pipeline consists of a two-step procedure, where the ambiguity set i…

Cited by 0SourceScholar
2026

Pinet: Optimizing hard-constrained neural networks with orthogonal projection layers

ICLR 2026oral

We introduce an output layer for neural networks that ensures satisfaction of convex constraints. Our approach, $\Pi$net, leverages operator splitting for rapid and reliable projections in the forward pass, and the implicit function theorem for backpropagation. We deploy $\Pi$net as a feasible-by-de…

Cited by 0SourcecodeScholar
2025

Contractivity and linear convergence in bilinear saddle-point problems: An operator-theoretic approach

AISTATS 2025poster

We study the convex-concave bilinear saddle-point problem $\min_x \max_y f(x) + y^\top Ax - g(y)$, where both, only one, or none of the functions $f$ and $g$ are strongly convex, and suitable rank conditions on the matrix $A$ hold. The solution of this problem is at the core of many machine learning…

Cited by 0SourceScholar
2025

Optimizing Social Network Interventions via Hypergradient-Based Recommender System Design

ICML 2025poster

Although social networks have expanded the range of ideas and information accessible to users, they are also criticized for amplifying the polarization of user opinions. Given the inherent complexity of these phenomena, existing approaches to counteract these effects typically rely on handcrafted al…

Cited by 0SourcePDFScholar
2025

Wasserstein Distributionally Robust Bayesian Optimization with Continuous Context

AISTATS 2025poster

We address the challenge of sequential data-driven decision-making under context distributional uncertainty. This problem arises in numerous real-world scenarios where the learner optimizes black-box objective functions in the presence of uncontrollable contextual variables. We consider the setting…

Cited by 0SourcecodeScholar
2024

Predictive Linear Online Tracking for Unknown Targets

ICML 2024spotlight

In this paper, we study the problem of online tracking in linear control systems, where the objective is to follow a moving target. Unlike classical tracking control, the target is unknown, non-stationary, and its state is revealed sequentially, thus, fitting the framework of online non-stochastic c…

Cited by 7SourcePDFScholar
2024

Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces

NeurIPS 2024poster

This work studies discrete-time discounted Markov decision processes with continuous state and action spaces and addresses the inverse problem of inferring a cost function from observed optimal behavior. We first consider the case in which we have access to the entire expert policy and characterize…

2024

Safe Time-Varying Optimization based on Gaussian Processes with Spatio-Temporal Kernel

NeurIPS 2024poster

Ensuring safety is a key aspect in sequential decision making problems, such as robotics or process control. The complexity of the underlying systems often makes finding the optimal decision challenging, especially when the safety-critical system is time-varying. Overcoming the problem of optimizing…

Cited by 2SourcePDFScholar
2022

Advanced Manufacturing Configuration by Sample-Efficient Batch Bayesian Optimization

RA-L 2022

We propose a framework for the configuration and operation of expensive-to-evaluate advanced manufacturing methods, based on Bayesian optimization. The framework unifies a tailored acquisition function, a parallel acquisition procedure, and the integration of process information providing context to

Cited by 11SourceScholar
2022

PAGE-PG: A Simple and Loopless Variance-Reduced Policy Gradient Method with Probabilistic Gradient Estimation

ICML 2022spotlight

Despite their success, policy gradient methods suffer from high variance of the gradient estimator, which can result in unsatisfactory sample complexity. Recently, numerous variance-reduced extensions of policy gradient methods with provably better sample complexity and competitive numerical perform…

Cited by 20SourcePDFScholar
2021

Decentralized Trajectory Optimization for Multi-Agent Ergodic Exploration

RA-L 2021

Autonomous exploration is an application of growing importance in robotics. A promising strategy is ergodic trajectory planning, whereby an agent spends in each area a fraction of time which is proportional to its probability information density function. In this letter, a decentralized ergodic mult

Cited by 9SourceScholar
2021

Efficient Performance Bounds for Primal-Dual Reinforcement Learning from Demonstrations

ICML 2021spotlight

We consider large-scale Markov decision processes with an unknown cost function and address the problem of learning a policy from a finite set of expert demonstrations. We assume that the learner is not allowed to interact with the expert and has no access to reinforcement signal of any kind.…

Cited by 12SourcePDFScholar
2021

Learning from Simulation, Racing in Reality

ICRA 2021poster

We present a reinforcement learning-based solution to autonomously race on a miniature race car platform. We show that a policy that is trained purely in simulation using a relatively simple vehicle model, including model randomization, can be successfully transferred to the real robotic setup. We a…

Cited by 42SourceScholar
2021

Safe and Efficient Model-free Adaptive Control via Bayesian Optimization

ICRA 2021poster

Adaptive control approaches yield high-performance controllers when a precise system model or suitable parametrizations of the controller are available. Existing data-driven approaches for adaptive control mostly augment standard model-based methods with additional information about uncertainties in…

Cited by 52SourceScholar
2020

Optimization-Based Hierarchical Motion Planning for Autonomous Racing

IROS 2020poster

In this paper we propose a hierarchical controller for autonomous racing where the same vehicle model is used in a two level optimization framework for motion planning. The high-level controller computes a trajectory that minimizes the lap time, and the low-level nonlinear model predictive path foll…

Cited by 87SourceScholar