Tobias Sutter

Orcid: 0000-0003-1226-6845

According to our database1, Tobias Sutter authored at least 26 papers between 2013 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
Joint Chance Constrained Optimal Control via Linear Programming.
CoRR, 2024

2023
Efficient Learning of a Linear Dynamical System With Stability Guarantees.
IEEE Trans. Autom. Control., May, 2023

Computing Optimal Joint Chance Constrained Control Policies.
CoRR, 2023

Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets.
CoRR, 2023

End-to-End Learning for Stochastic Optimization: A Bayesian Perspective.
Proceedings of the International Conference on Machine Learning, 2023

A Robust Optimisation Perspective on Counterexample-Guided Repair of Neural Networks.
Proceedings of the International Conference on Machine Learning, 2023

ISAAC Newton: Input-based Approximate Curvature for Newton's Method.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Topological Linear System Identification via Moderate Deviations Theory.
IEEE Control. Syst. Lett., 2022

2021
Robust Generalization despite Distribution Shift via Minimum Discriminating Information.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Distributionally Robust Optimization with Markovian Data.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Quantum Legendre-Fenchel Transform.
CoRR, 2020

2019
Generalized Maximum Entropy Estimation.
J. Mach. Learn. Res., 2019

2018
From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming.
SIAM J. Optim., 2018

2017
On Infinite Linear Programming and the Moment Approach to Deterministic Infinite Horizon Discounted Optimal Control Problems.
IEEE Control. Syst. Lett., 2017

Convex programming in optimal control and information theory.
CoRR, 2017

Capacity of random channels with large alphabets.
Adv. Math. Commun., 2017

Data-driven approximate dynamic programming: A linear programming approach.
Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017

2016
Efficient Approximation of Quantum Channel Capacities.
IEEE Trans. Inf. Theory, 2016

A Variational Approach to Path Estimation and Parameter Inference of Hidden Diffusion Processes.
J. Mach. Learn. Res., 2016

2015
Efficient Approximation of Channel Capacities.
IEEE Trans. Inf. Theory, 2015

Performance Bounds for the Scenario Approach and an Extension to a Class of Non-Convex Programs.
IEEE Trans. Autom. Control., 2015

2014
Capacity approximation of memoryless channels with countable output alphabets.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Efficient approximation of discrete memoryless channel capacities.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Approximation of constrained average cost Marks.
Proceedings of the 53rd IEEE Conference on Decision and Control, 2014

Asymptotic capacity of a random channel.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Isospectral flows on a class of finite-dimensional Jacobi matrices.
Syst. Control. Lett., 2013


  Loading...