Fetching the paper…
Reading the bibliography…
The problem of piecewise affine (PWA) regression and planning is of foundational importance to the study of online learning, control, and robotics, where it provides a theoretically and empirically tractable setting to study systems undergoing sharp changes in the dynamics.
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Nick Littlestone · 1988
Earlier work this paper cites.
Policy gradient methods for reinforcement learning with function approximation
Richard S Sutton, David McAllester, Satinder Singh, and Yishay Mansour · 1999
Earlier work this paper cites.
Mechanics of robotic manipulation
Matthew T Mason · 2001
Earlier work this paper cites.
The min pfs problem and piecewise linear model estimation
Edoardo Amaldi and Marco Mattavelli · 2002
Earlier work this paper cites.
A clustering technique for the identification of piecewise affine systems
Giancarlo Ferrari-Trecate, Marco Muselli, Diego Liberati, and Manfred Morari · 2003
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A Spielman and Shang-Hua Teng · 2004
Earlier work this paper cites.
Efficient algorithms for online decision problems
Adam Kalai and Santosh Vempala · 2005
Earlier work this paper cites.
Prediction, learning, and games
Nicolo Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
Identification of hybrid systems a tutorial
Simone Paoletti, Aleksandar Lj Juloski, Giancarlo Ferrari-Trecate, and René Vidal · 2007
Earlier work this paper cites.
An introduction to hybrid dynamical systems , volume 251
Arjan J Van Der Schaft and Hans Schumacher · 2007
Earlier work this paper cites.
Hardness of learning halfspaces with noise
Venkatesan Guruswami and Prasad Raghavendra · 2009
Earlier work this paper cites.
Efficient learning algorithms for changing environments
Elad Hazan and Comandur Seshadhri · 2009
Earlier work this paper cites.
Approximate explicit mpc using bilevel optimization
Colin N Jones and Manfred Morari · 2009
Earlier work this paper cites.
Improved algorithms for linear stochastic bandits
Yasin Abbasi-Yadkori, Dávid Pál, and Csaba Szepesvári · 2011
Earlier work this paper cites.
Online learning: Stochastic, constrained, and smoothed adversaries
Alexander Rakhlin, Karthik Sridharan, and Ambuj Tewari · 2011
Cited alongside, same era.
A survey on switched and piecewise affine system identification
Andrea Garulli, Simone Paoletti, and Antonio Vicino · 2012
Cited alongside, same era.
Geometric measure theory
Herbert Federer · 2014
Cited alongside, same era.
A direct method for trajectory optimization of rigid bodies through contact
Michael Posa, Cecilia Cantu, and Russ Tedrake · 2014
Cited alongside, same era.
Model predictive path integral control using covariance variable importance sampling
Grady Williams, Andrew Aldrich, and Evangelos Theodorou · 2015
Cited alongside, same era.
Deep learning
Ian Goodfellow, Yoshua Bengio, and Aaron Courville · 2016
On the sample complexity of the linear quadratic regulator
Sarah Dean, Horia Mania, Nikolai Matni, Benjamin Recht, and Stephen Tu · 2020
Later among the works it cites.
Smoothed analysis of online and differentially private learning
Nika Haghtalab, Tim Roughgarden, and Abhishek Shetty · 2020
Later among the works it cites.
Naive exploration is optimal for online lqr
Max Simchowitz and Dylan Foster · 2020
Later among the works it cites.
Improper learning for non-stochastic control
Max Simchowitz, Karan Singh, and Elad Hazan · 2020
Later among the works it cites.
How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design
Maria-Florina Balcan, Dan DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, and Ellen Vitercik · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
The computational power of optimization in online learning
Elad Hazan and Tomer Koren · 2016
Cited alongside, same era.
Introduction to online convex optimization
Elad Hazan et al · 2016
Cited alongside, same era.
Predictive control for linear and hybrid systems
Francesco Borrelli, Alberto Bemporad, and Manfred Morari · 2017
Cited alongside, same era.
Dispersion for data-driven algorithm design, online learning, and private optimization
Maria-Florina Balcan, Travis Dick, and Ellen Vitercik · 2018
Cited alongside, same era.
Learning without mixing: Towards a sharp analysis of linear system identification
Max Simchowitz, Horia Mania, Stephen Tu, Michael I Jordan, and Benjamin Recht · 2018
Cited alongside, same era.
Mixed-integer formulations for optimal control of piecewise-affine systems
Tobia Marcucci and Russ Tedrake · 2019
Cited alongside, same era.
Nika Haghtalab, Tim Roughgarden, and Abhishek Shetty · 2021
Later among the works it cites.
Efficient and near-optimal smoothed online learning for generalized linear functions
Adam Block and Max Simchowitz · 2022
Later among the works it cites.
Smoothed online learning is as easy as statistical learning
Adam Block, Yuval Dagan, Noah Golowich, and Alexander Rakhlin · 2022
Later among the works it cites.
Oracle-efficient online learning for beyond worst-case adversaries
Nika Haghtalab, Yanjun Han, Abhishek Shetty, and Kunhe Yang · 2022
Later among the works it cites.
Learning linear complementarity systems
Wanxin Jin, Alp Aydinoglu, Mathew Halm, and Michael Posa · 2022
Later among the works it cites.
Leveraging randomized smoothing for optimal control of nonsmooth dynamical systems
Quentin Le Lidec, Louis Montaut, Cordelia Schmid, Ivan Laptev, and Justin Carpentier · 2022
Later among the works it cites.
Global planning for contact-rich manipulation via local smoothing of quasi-dynamic contact models
Tao Pang, HJ Suh, Lujie Yang, and Russ Tedrake · 2022
Later among the works it cites.
Adam Block and Yury Polyanskiy · 2023
Closest in time.