default search action
Tobias Sutter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Niklas Schmid
, Marta Fochesato
Joint Chance Constrained Optimal Control via Linear Programming. IEEE Control. Syst. Lett. 8: 736-741 (2024) - [j12]Tobias Sutter
A Pareto Dominance Principle for Data-Driven Optimization. Oper. Res. 72(5): 1976-1999 (2024) - [c12]Peter Schmitt-Förster, Tobias Sutter:
Regularized Q-learning through Robust Averaging. ICML 2024 - [c11]Udo Schlegel, Daniel A. Keim, Tobias Sutter:
Finding the DeepDream for Time Series: Activation Maximization for Univariate Time Series. TempXAI@PKDD/ECML 2024: 12-27 - [i24]Niklas Schmid
Joint Chance Constrained Optimal Control via Linear Programming. CoRR abs/2402.19360 (2024) - [i23]Peter Schmitt-Förster, Tobias Sutter:
Regularized Q-learning through Robust Averaging. CoRR abs/2405.02201 (2024) - [i22]Angeliki Kamoutsi, Peter Schmitt-Förster, Tobias Sutter, Volkan Cevher, John Lygeros:
Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces. CoRR abs/2405.15509 (2024) - [i21]David Boetius, Stefan Leue, Tobias Sutter:
Probabilistic Verification of Neural Networks using Branch and Bound. CoRR abs/2405.17556 (2024) - [i20]Udo Schlegel, Daniel A. Keim, Tobias Sutter:
Finding the DeepDream for Time Series: Activation Maximization for Univariate Time Series. CoRR abs/2408.10628 (2024) - 2023
- [j11]Wouter Jongeneel
Efficient Learning of a Linear Dynamical System With Stability Guarantees. IEEE Trans. Autom. Control. 68(5): 2790-2804 (2023) - [c10]Felix Petersen, Tobias Sutter, Christian Borgelt, Dongsung Huh, Hilde Kuehne, Yuekai Sun, Oliver Deussen:
ISAAC Newton: Input-based Approximate Curvature for Newton's Method. ICLR 2023 - [c9]David Boetius, Stefan Leue, Tobias Sutter:
A Robust Optimisation Perspective on Counterexample-Guided Repair of Neural Networks. ICML 2023: 2712-2737 - [c8]Yves Rychener, Daniel Kuhn, Tobias Sutter:
End-to-End Learning for Stochastic Optimization: A Bayesian Perspective. ICML 2023: 29455-29472 - [i19]David Boetius
A Robust Optimisation Perspective on Counterexample-Guided Repair of Neural Networks. CoRR abs/2301.11342 (2023) - [i18]Felix Petersen, Tobias Sutter, Christian Borgelt, Dongsung Huh, Hilde Kuehne
ISAAC Newton: Input-based Approximate Curvature for Newton's Method. CoRR abs/2305.00604 (2023) - [i17]Mengmeng Li, Tobias Sutter, Daniel Kuhn:
Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets. CoRR abs/2305.19004 (2023) - [i16]Yves Rychener, Daniel Kuhn, Tobias Sutter:
End-to-End Learning for Stochastic Optimization: A Bayesian Perspective. CoRR abs/2306.04174 (2023) - [i15]Niklas Schmid
Computing Optimal Joint Chance Constrained Control Policies. CoRR abs/2312.10495 (2023) - 2022
- [j10]Wouter Jongeneel
Topological Linear System Identification via Moderate Deviations Theory. IEEE Control. Syst. Lett. 6: 307-312 (2022) - 2021
- [c7]Mengmeng Li, Tobias Sutter, Daniel Kuhn:
Distributionally Robust Optimization with Markovian Data. ICML 2021: 6493-6503 - [c6]Tobias Sutter, Andreas Krause, Daniel Kuhn:
Robust Generalization despite Distribution Shift via Minimum Discriminating Information. NeurIPS 2021: 29754-29767 - [i14]Wouter Jongeneel, Tobias Sutter, Daniel Kuhn:
Efficient Learning of a Linear Dynamical System with Stability Guarantees. CoRR abs/2102.03664 (2021) - [i13]Tobias Sutter, Andreas Krause, Daniel Kuhn:
Robust Generalization despite Distribution Shift via Minimum Discriminating Information. CoRR abs/2106.04443 (2021) - [i12]Mengmeng Li, Tobias Sutter, Daniel Kuhn:
Distributionally Robust Optimization with Markovian Data. CoRR abs/2106.06741 (2021) - 2020
- [i11]David Sutter, Giacomo Nannicini, Tobias Sutter
Quantum Legendre-Fenchel Transform. CoRR abs/2006.04823 (2020)
2010 – 2019
- 2019
- [j9]Tobias Sutter, David Sutter
Generalized Maximum Entropy Estimation. J. Mach. Learn. Res. 20: 138:1-138:29 (2019) - 2018
- [j8]Peyman Mohajerin Esfahani
From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming. SIAM J. Optim. 28(3): 1968-1998 (2018) - 2017
- [j7]Tobias Sutter
Capacity of random channels with large alphabets. Adv. Math. Commun. 11(4): 813-835 (2017) - [j6]Angeliki Kamoutsi
On Infinite Linear Programming and the Moment Approach to Deterministic Infinite Horizon Discounted Optimal Control Problems. IEEE Control. Syst. Lett. 1(1): 134-139 (2017) - [c5]Tobias Sutter, Angeliki Kamoutsi, Peyman Mohajerin Esfahani
Data-driven approximate dynamic programming: A linear programming approach. CDC 2017: 5174-5179 - [i10]Peyman Mohajerin Esfahani, Tobias Sutter, Daniel Kuhn, John Lygeros:
From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming. CoRR abs/1701.06379 (2017) - [i9]Angeliki Kamoutsi, Tobias Sutter, Peyman Mohajerin Esfahani, John Lygeros:
On Infinite Linear Programming and the Moment Approach to Deterministic Infinite Horizon Discounted Optimal Control Problems. CoRR abs/1703.09005 (2017) - [i8]Tobias Sutter
Generalized maximum entropy estimation. CoRR abs/1708.07311 (2017) - [i7]Tobias Sutter:
Convex programming in optimal control and information theory. CoRR abs/1712.04677 (2017) - 2016
- [j5]Tobias Sutter, Arnab Ganguly, Heinz Koeppl:
A Variational Approach to Path Estimation and Parameter Inference of Hidden Diffusion Processes. J. Mach. Learn. Res. 17: 190:1-190:37 (2016) - [j4]David Sutter
Efficient Approximation of Quantum Channel Capacities. IEEE Trans. Inf. Theory 62(1): 578-598 (2016) - 2015
- [j3]Peyman Mohajerin Esfahani
Performance Bounds for the Scenario Approach and an Extension to a Class of Non-Convex Programs. IEEE Trans. Autom. Control. 60(1): 46-58 (2015) - [j2]Tobias Sutter
Efficient Approximation of Channel Capacities. IEEE Trans. Inf. Theory 61(4): 1649-1666 (2015) - [i6]Tobias Sutter
Asymptotic Capacity of a Random Channel. CoRR abs/1503.04108 (2015) - [i5]Tobias Sutter
A variational approach to path estimation and parameter inference of hidden diffusion processes. CoRR abs/1508.00506 (2015) - 2014
- [c4]Tobias Sutter, David Sutter
Asymptotic capacity of a random channel. Allerton 2014: 771-778 - [c3]Tobias Sutter, Peyman Mohajerin Esfahani
Approximation of constrained average cost Marks. CDC 2014: 6597-6602 - [c2]David Sutter
Efficient approximation of discrete memoryless channel capacities. ISIT 2014: 2904-2908 - [c1]Tobias Sutter, Peyman Mohajerin Esfahani
Capacity approximation of memoryless channels with countable output alphabets. ISIT 2014: 2909-2913 - [i4]Tobias Sutter, David Sutter, Peyman Mohajerin Esfahani, John Lygeros:
Efficient Approximation of Channel Capacities. CoRR abs/1407.7629 (2014) - [i3]David Sutter, Tobias Sutter, Peyman Mohajerin Esfahani, Renato Renner:
Efficient Approximation of Quantum Channel Capacities. CoRR abs/1407.8202 (2014) - 2013
- [j1]Tobias Sutter
Isospectral flows on a class of finite-dimensional Jacobi matrices. Syst. Control. Lett. 62(5): 388-394 (2013) - [i2]Peyman Mohajerin Esfahani, Tobias Sutter, John Lygeros:
Performance Bounds for the Scenario Approach and an Extension to a Class of Non-convex Programs. CoRR abs/1307.0345 (2013) - 2012
- [i1]Tobias Sutter, Debasish Chatterjee, Federico Ramponi, John Lygeros:
Isospectral flows on a class of finite-dimensional Jacobi matrices. CoRR abs/1202.1618 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 20:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: