activity
20182026
most citedLipschitz constant estimation of Neural Networks via sparse polynomial optimization

28 citations · 33 across the 5 of their papers we have counts for

collaborators
Showing cs.LGShow all

7 papers · 1 filter

cs.LG20221 cited

Identifiability and generalizability from multiple experts in Inverse Reinforcement Learning

Paul Rolland, Luca Viano, Norman Schuerhoff +2

While Reinforcement Learning (RL) aims to train an agent from a reward function in a given environment, Inverse Reinforcement Learning (IRL) seeks to recover the reward function fr…

cs.LG20222 cited

Score matching enables causal discovery of nonlinear additive noise models

Paul Rolland, Volkan Cevher, Matthäus Kleindessner +4

This paper demonstrates how to recover causal graphs from the score of the data distribution in non-linear additive (Gaussian) noise models. Using score matching algorithms as a bu…

cs.LG20201 cited

Efficient Proximal Mapping of the 1-path-norm of Shallow Networks

Fabian Latorre, Paul Rolland, Nadav Hallak +1

We demonstrate two new important properties of the 1-path-norm of shallow neural networks. First, despite its non-smoothness and non-convexity it allows a closed form proximal oper…

cs.LG202028 cited

Lipschitz constant estimation of Neural Networks via sparse polynomial optimization

Fabian Latorre, Paul Rolland, Volkan Cevher

We introduce LiPopt, a polynomial optimization framework for computing increasingly tighter upper bounds on the Lipschitz constant of neural networks. The underlying optimization p…

cs.LG2020

Robust Reinforcement Learning via Adversarial training with Langevin Dynamics

Parameswaran Kamalaruban, Yu-Ting Huang, Ya-Ping Hsieh +3

We introduce a sampling perspective to tackle the challenging task of training robust Reinforcement Learning (RL) agents. Leveraging the powerful Stochastic Gradient Langevin Dynam…

cs.LG2018

Efficient learning of smooth probability functions from Bernoulli tests with guarantees

Paul Rolland, Ali Kavis, Alex Immer +2

We study the fundamental problem of learning an unknown, smooth probability function via pointwise Bernoulli tests. We provide a scalable algorithm for efficiently solving this pro…