Max Simchowitz

Orcid: 0000-0001-9900-1238

According to our database1, Max Simchowitz authored at least 62 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Exploration and Incentives in Reinforcement Learning.
Oper. Res., 2024

Diffusion Policy Policy Optimization.
CoRR, 2024

Diffusion Forcing: Next-token Prediction Meets Full-Sequence Diffusion.
CoRR, 2024

Constrained Bimanual Planning with Analytic Inverse Kinematics.
Proceedings of the IEEE International Conference on Robotics and Automation, 2024

Robot Fleet Learning via Policy Merging.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregression.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Fleet Policy Learning via Weight Merging and An Application to Robotic Tool-Use.
CoRR, 2023

Imitating Complex Trajectories: Bridging Low-Level Stability and High-Level Behavior.
CoRR, 2023

Non-Euclidean Motion Planning with Graphs of Geodesically-Convex Sets.
Proceedings of the Robotics: Science and Systems XIX, Daegu, 2023

RePo: Resilient Model-Based Reinforcement Learning by Regularizing Posterior Predictability.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Smoothed Online Learning for Prediction in Piecewise Affine Systems.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Provable Guarantees for Generative Behavior Cloning: Bridging Low-Level Stability and High-Level Behavior.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Statistical Learning under Heterogenous Distribution Shift.
Proceedings of the International Conference on Machine Learning, 2023

The Power of Learned Locally Linear Models for Nonlinear Policy Optimization.
Proceedings of the International Conference on Machine Learning, 2023

Learning to Extrapolate: A Transductive Approach.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Tackling Combinatorial Distribution Shift: A Matrix Completion Perspective.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Oracle-Efficient Smoothed Online Learning for Piecewise Continuous Decision Making.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Globally Convergent Policy Search over Dynamic Filters for Output Estimation.
CoRR, 2022

Do Differentiable Simulators Give Better Policy Gradients?
CoRR, 2022

Globally Convergent Policy Search for Output Estimation.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions.
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

Do Differentiable Simulators Give Better Policy Gradients?
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

2021
Statistical Complexity and Regret in Linear Control.
PhD thesis, 2021

A Successive-Elimination Approach to Adaptive Robotic Source Seeking.
IEEE Trans. Robotics, 2021

Bayesian decision-making under misspecified priors with applications to meta-learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Stabilizing Dynamical Systems via Policy Gradient Methods.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Online Control of Unknown Time-Varying Dynamical Systems.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

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

Towards a Dimension-Free Understanding of Adaptive Linear Control.
Proceedings of the Conference on Learning Theory, 2021

Corruption-robust exploration in episodic reinforcement learning.
Proceedings of the Conference on Learning Theory, 2021

On the Stability of Nonlinear Receding Horizon Control: A Geometric Perspective.
Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

2020
Making Non-Stochastic Control (Almost) as Easy as Stochastic.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Learning the Linear Quadratic Regulator from Nonlinear Observations.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Constrained episodic reinforcement learning in concave-convex and knapsack settings.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Naive Exploration is Optimal for Online LQR.
Proceedings of the 37th International Conference on Machine Learning, 2020

Balancing Competing Objectives with Noisy Data: Score-Based Classifiers for Welfare-Aware Machine Learning.
Proceedings of the 37th International Conference on Machine Learning, 2020

Reward-Free Exploration for Reinforcement Learning.
Proceedings of the 37th International Conference on Machine Learning, 2020

Logarithmic Regret for Adversarial Online Control.
Proceedings of the 37th International Conference on Machine Learning, 2020

Improper Learning for Non-Stochastic Control.
Proceedings of the Conference on Learning Theory, 2020

The Gradient Complexity of Linear Regression.
Proceedings of the Conference on Learning Theory, 2020

2019
First-order methods almost always avoid strict saddle points.
Math. Program., 2019

Non-Asymptotic Gap-Dependent Regret Bounds for Tabular MDPs.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

The Implicit Fairness Criterion of Unconstrained Learning.
Proceedings of the 36th International Conference on Machine Learning, 2019

Learning Linear Dynamical Systems with Semi-Parametric Least Squares.
Proceedings of the Conference on Learning Theory, 2019

2018
A Successive-Elimination Approach to Adaptive Robotic Sensing.
CoRR, 2018

Group calibration is a byproduct of unconstrained learning.
CoRR, 2018

Adaptive Sampling for Convex Regression.
CoRR, 2018

On the Randomized Complexity of Minimizing a Convex Quadratic Function.
CoRR, 2018

Tight query complexity lower bounds for PCA via finite sample deformed wigner law.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Delayed Impact of Fair Machine Learning.
Proceedings of the 35th International Conference on Machine Learning, 2018

Learning Without Mixing: Towards A Sharp Analysis of Linear System Identification.
Proceedings of the Conference On Learning Theory, 2018

Approximate ranking from pairwise comparisons.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
First-order Methods Almost Always Avoid Saddle Points.
CoRR, 2017

On the Gap Between Strict-Saddles and True Convexity: An Omega(log d) Lower Bound for Eigenvector Approximation.
CoRR, 2017

The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
Gradient Descent Converges to Minimizers.
CoRR, 2016

Low-rank Solutions of Linear Matrix Equations via Procrustes Flow.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Best-of-K-bandits.
Proceedings of the 29th Conference on Learning Theory, 2016

Gradient Descent Only Converges to Minimizers.
Proceedings of the 29th Conference on Learning Theory, 2016


  Loading...