activity
20162023
most citedRecursive Decomposition for Nonconvex Optimization

26 citations · 80 across the 11 of their papers we have counts for

collaborators

11 papers

cs.LG2023

Knowledge Transfer from Teachers to Learners in Growing-Batch Reinforcement Learning

Patrick Emedom-Nnamdi, Abram L. Friesen, Bobak Shahriari +2

Standard approaches to sequential decision-making exploit an agent's ability to continually interact with its environment and improve its control policy. However, due to safety, et…

cs.LG2022

Multi-step Planning for Automated Hyperparameter Optimization with OptFormer

Lucio M. Dery, Abram L. Friesen, Nando De Freitas +2

As machine learning permeates more industries and models become more expensive and time consuming to train, the need for efficient automated hyperparameter optimization (HPO) has n…

cs.LG2022

Revisiting Gaussian mixture critics in off-policy reinforcement learning: a sample-based approach

Bobak Shahriari, Abbas Abdolmaleki, Arunkumar Byravan +6

Actor-critic algorithms that make use of distributional policy evaluation have frequently been shown to outperform their non-distributional counterparts on many challenging control…

cs.LG2022★ 6 cited

Retrieval-Augmented Reinforcement Learning

Anirudh Goyal, Abram L. Friesen, Andrea Banino +13

Most deep reinforcement learning (RL) algorithms distill experience into parametric behavior policies or value functions via gradient updates. While effective, this approach has se…

cs.LG2021

Model-Value Inconsistency as a Signal for Epistemic Uncertainty

Angelos Filos, Eszter Vértes, Zita Marinho +7

Using a model of the environment and a value function, an agent can construct many estimates of a state's value, by unrolling the model for different lengths and bootstrapping with…

cs.LG2021

Introducing Symmetries to Black Box Meta Reinforcement Learning

Louis Kirsch, Sebastian Flennerhag, Hado van Hasselt +3

Meta reinforcement learning (RL) attempts to discover new RL algorithms automatically from environment interaction. In so-called black-box approaches, the policy and the learning a…

cs.AI2020★ 15 cited

On the role of planning in model-based deep reinforcement learning

Jessica B. Hamrick, Abram L. Friesen, Feryal Behbahani +7

Model-based planning is often thought to be necessary for deep, careful reasoning and generalization in artificial agents. While recent successes of model-based reinforcement learn…

cs.LG2019★ 8 cited

Modular Meta-Learning with Shrinkage

Yutian Chen, Abram L. Friesen, Feryal Behbahani +4

Many real-world problems, including multi-speaker text-to-speech synthesis, can greatly benefit from the ability to meta-learn large models with only a few task-specific components…

cs.LG2017★ 17 cited

Deep Learning as a Mixed Convex-Combinatorial Optimization Problem

Abram L. Friesen, Pedro Domingos

As neural networks grow deeper and wider, learning networks with hard-threshold activations is becoming increasingly important, both for network quantization, which can drastically…

cs.LG2016★ 8 cited

The Sum-Product Theorem: A Foundation for Learning Tractable Models

Abram L. Friesen, Pedro Domingos

Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep…

cs.AI2016★ 26 cited

Recursive Decomposition for Nonconvex Optimization

Abram L. Friesen, Pedro Domingos

Continuous optimization is an important problem in many areas of AI, including vision, robotics, probabilistic inference, and machine learning. Unfortunately, most real-world optim…