Goto

Collaborating Authors

 schulman





CoresetforLine-SetsClustering

Neural Information Processing Systems

A natural generalization is to replace this input setP of n points by a setP of n sets inX. The distance from such an input setP P to a setC of centers can then be defined as the distance between the closest point-center pair. This problem is calledk-mean for sets; see e.g.





LifelongPolicyGradientLearning ofFactoredPolicies forFasterTrainingWithoutForgetting

Neural Information Processing Systems

We provide a novel method for lifelong policy gradient learning that trains lifelong function approximators directly via policygradients, allowing the agent to benefit from accumulated knowledge throughout the entire training process.