Andrew J. Wagenmaker

Orcid: 0000-0001-7253-304X

Affiliations:
  • University of Washington, Seattle, WA, USA
  • University of Michigan, Ann Arbor, USA (former)


According to our database1, Andrew J. Wagenmaker authored at least 24 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Overcoming the Sim-to-Real Gap: Leveraging Simulation to Learn to Explore for Real-World RL.
CoRR, 2024

Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification.
CoRR, 2024

Humor in AI: Massive Scale Crowd-Sourced Preferences and Benchmarks for Cartoon Captioning.
CoRR, 2024

Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning.
CoRR, 2024

ASID: Active Exploration for System Identification in Robotic Manipulation.
CoRR, 2024

ASID: Active Exploration for System Identification in Robotic Manipulation.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Fair Active Learning in Low-Data Regimes.
CoRR, 2023

Optimal Exploration for Model-Based RL in Nonlinear Systems.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Leveraging Offline Data in Online Reinforcement Learning.
Proceedings of the International Conference on Machine Learning, 2023

Instance-Optimality in Interactive Decision Making: Toward a Non-Asymptotic Theory.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Active Learning with Safety Constraints.
CoRR, 2022

Instance-Dependent Near-Optimal Policy Identification in Linear MDPs via Online Experiment Design.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Active Learning with Safety Constraints.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes.
Proceedings of the International Conference on Machine Learning, 2022

First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach.
Proceedings of the International Conference on Machine Learning, 2022

Beyond No Regret: Instance-Dependent PAC Reinforcement Learning.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Best Arm Identification with Safety Constraints.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Task-Optimal Exploration in Linear Dynamical Systems.
Proceedings of the 38th International Conference on Machine Learning, 2021

Experimental Design for Regret Minimization in Linear Bandits.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Active Learning for Identification of Linear Dynamical Systems.
Proceedings of the Conference on Learning Theory, 2020

2019
Robust Photometric Stereo via Dictionary Learning.
IEEE Trans. Computational Imaging, 2019

2017
Robust photometric stereo using learned image and gradient dictionaries.
Proceedings of the 2017 IEEE International Conference on Image Processing, 2017

Robust surface reconstruction from gradients via adaptive dictionary regularization.
Proceedings of the 2017 IEEE International Conference on Image Processing, 2017

2016
A bisimulation-like algorithm for abstracting control systems.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016


  Loading...