activity
20082026
most citedA tale of many cities: universal patterns in human urban mobility

639 citations · 2.9k across the 94 of their papers we have counts for

collaborators
Showing 2018Show all

9 papers · 1 filter

stat.ML2018

Taking Advantage of Multitask Learning for Fair Classification

Luca Oneto, Michele Donini, Amon Elders +1

A central goal of algorithmic fairness is to reduce bias in automated decision making. An unavoidable tension exists between accuracy gains obtained by using sensitive information…

cs.RO2018★ 73 cited

Fast and Continuous Foothold Adaptation for Dynamic Locomotion through CNNs

Octavio Villarreal, Victor Barasuol, Marco Camurri +5

Legged robots can outperform wheeled machines for most navigation tasks across unknown and rough terrains. For such tasks, visual feedback is a fundamental asset to provide robots…

stat.ML2018★ 105 cited

Bilevel Programming for Hyperparameter Optimization and Meta-Learning

Luca Franceschi, Paolo Frasconi, Saverio Salzo +2

We introduce a framework based on bilevel programming that unifies gradient-based hyperparameter optimization and meta-learning. We show that an approximate version of the bilevel…

cs.MS2018

Far-HO: A Bilevel Programming Package for Hyperparameter Optimization and Meta-Learning

Luca Franceschi, Riccardo Grazzi, Massimiliano Pontil +2

In (Franceschi et al., 2018) we proposed a unified mathematical framework, grounded on bilevel programming, that encompasses gradient-based hyperparameter optimization and meta-lea…

stat.ML2018★ 70 cited

Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distance

Giulia Luise, Alessandro Rudi, Massimiliano Pontil +1

Applications of optimal transport have recently gained remarkable attention thanks to the computational advantages of entropic regularization. However, in most situations the Sinkh…

quant-ph2018★ 5 cited

Approximating Hamiltonian dynamics with the Nyström method

Alessandro Rudi, Leonard Wossnig, Carlo Ciliberto +3

Simulating the time-evolution of quantum mechanical systems is BQP-hard and expected to be one of the foremost applications of quantum computers. We consider classical algorithms f…