Sebastian Pokutta

According to our database1, Sebastian Pokutta authored at least 99 papers between 2009 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Accelerating domain propagation: An efficient GPU-parallel algorithm over sparse matrices.
Parallel Comput., 2022

New limits of treewidth-based tractability in optimization.
Math. Program., 2022

Restarting Frank-Wolfe: Faster Rates under Hölderian Error Bounds.
J. Optim. Theory Appl., 2022

Toward Sharing Brain Images: Differentially Private TOF-MRA Images With Segmentation Labels Using Generative Adversarial Networks.
Frontiers Artif. Intell., 2022

Merlin-Arthur Classifiers: Formal Interpretability with Interactive Black Boxes.
CoRR, 2022

Compression-aware Training of Neural Networks using Frank-Wolfe.
CoRR, 2022

Optimizing a low-dimensional convex function over a high-dimensional cube.
CoRR, 2022

The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights.
CoRR, 2022

Training Characteristic Functions with Reinforcement Learning: XAI-methods play Connect Four.
CoRR, 2022

Conditional Gradients for the Approximately Vanishing Ideal.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Complexity of linear minimization and projection on some sets.
Oper. Res. Lett., 2021

Linear Bandits on Uniformly Convex Sets.
J. Mach. Learn. Res., 2021

Structured Robust Submodular Maximization: Offline and Online Algorithms.
INFORMS J. Comput., 2021

Back to Basics: Efficient Network Compression via IMP.
CoRR, 2021

Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings.
CoRR, 2021

Efficient Online-Bandit Strategies for Minimax Learning Problems.
CoRR, 2021

Learning to Schedule Heuristics in Branch-and-Bound.
CoRR, 2021

Local and Global Uniform Convexity Conditions.
CoRR, 2021

Adversaries in Online Learning Revisited: with applications in Robust Optimization and Adversarial training.
CoRR, 2021

Learning to Schedule Heuristics in Branch and Bound.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Parameter-free Locally Accelerated Conditional Gradients.
Proceedings of the 38th International Conference on Machine Learning, 2021

An Algorithm-Independent Measure of Progress for Linear Constraint Propagation.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Projection-Free Optimization on Uniformly Convex Sets.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Deep Neural Network Training with Frank-Wolfe.
CoRR, 2020

Projection-Free Adaptive Gradients for Large-Scale Optimization.
CoRR, 2020

Second-order Conditional Gradients.
CoRR, 2020

Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness.
Proceedings of the 37th International Conference on Machine Learning, 2020

IPBoost - Non-Convex Boosting via Integer Programming.
Proceedings of the 37th International Conference on Machine Learning, 2020

Boosting Frank-Wolfe by Chasing Gradients.
Proceedings of the 37th International Conference on Machine Learning, 2020

Restarting Algorithms: Sometimes There Is Free Lunch.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

Locally Accelerated Conditional Gradients.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Affine reductions for LPs and SDPs.
Math. Program., 2019

No Small Linear Program Approximates Vertex Cover Within a Factor 2 - <i>ɛ</i>.
Math. Oper. Res., 2019

Lazifying Conditional Gradient Algorithms.
J. Mach. Learn. Res., 2019

Revisiting the Approximate Carathéodory Problem via the Frank-Wolfe Algorithm.
CoRR, 2019

Blended Matching Pursuit.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Blended Conditonal Gradients.
Proceedings of the 36th International Conference on Machine Learning, 2019

Restarting Frank-Wolfe.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Detecting almost symmetries of graphs.
Math. Program. Comput., 2018

Strong reductions for extended formulations.
Math. Program., 2018

Aggregation-based cutting-planes for packing and covering integer programs.
Math. Program., 2018

On the effect of model mismatch for sequential Info-Greedy Sensing.
EURASIP J. Adv. Signal Process., 2018

Solving MIPs via scaling-based augmentation.
Discret. Optim., 2018

An Online-Learning Approach to Inverse Optimization.
CoRR, 2018

Principled Deep Neural Network Training through Linear Programming.
CoRR, 2018

Efficient algorithms for robust submodular maximization under matroid constraints.
CoRR, 2018

Limits of Treewidth-based tractability in Optimization.
CoRR, 2018

Blended Conditional Gradients: the unconditioning of conditional gradients.
CoRR, 2018

Continuous simulation Optimization with Model mismatch using Gaussian Process Regression.
Proceedings of the 2018 Winter Simulation Conference, 2018

2017
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory.
IEEE Trans. Inf. Theory, 2017

The matching problem has no small symmetric SDP.
Math. Program., 2017

Pricing and clearing combinatorial markets with singleton and swap orders.
Math. Methods Oper. Res., 2017

Hierarchical Clustering via Spreading Metrics.
J. Mach. Learn. Res., 2017

Approximation and online algorithms for multidimensional bin packing: A survey.
Comput. Sci. Rev., 2017

Robust Submodular Maximization: Offline and Online Algorithms.
CoRR, 2017

Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.
Comput. Manag. Sci., 2017

Information-theoretic approximations of the nonnegative rank.
Comput. Complex., 2017

Reinforcement Learning under Model Mismatch.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Conditional Accelerated Lazy Stochastic Gradient Descent.
Proceedings of the 34th International Conference on Machine Learning, 2017

Emulating the Expert: Inverse Optimization through Online Learning.
Proceedings of the 34th International Conference on Machine Learning, 2017

Modulation recognition using side information and hybrid learning.
Proceedings of the 2017 IEEE International Symposium on Dynamic Spectrum Access Networks, 2017

2016
A Polyhedral Characterization of Border Bases.
SIAM J. Discret. Math., 2016

Average case polyhedral complexity of the maximum stable set problem.
Math. Program., 2016

Toward a Science of Autonomy for Physical Systems: Transportation.
CoRR, 2016

An efficient high-probability algorithm for Linear Bandits.
CoRR, 2016

Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.
Comput. Manag. Sci., 2016

Common Information and Unique Disjointness.
Algorithmica, 2016

2015
The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes.
IEEE Trans. Inf. Theory, 2015

On the existence of 0/1 polytopes with high semidefinite extension complexity.
Math. Program., 2015

Approximation Limits of Linear Programs (Beyond Hierarchies).
Math. Oper. Res., 2015

Info-Greedy Sequential Adaptive Compressed Sensing.
IEEE J. Sel. Top. Signal Process., 2015

Exponential Lower Bounds for Polytopes in Combinatorial Optimization.
J. ACM, 2015

Sequential Information Guided Sensing.
CoRR, 2015

An information diffusion Fano inequality.
CoRR, 2015

No Small Linear Program Approximates Vertex Cover within a Factor 2-ε.
CoRR, 2015

Inapproximability of Combinatorial Problems via Small LPs and SDPs.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

The matching polytope does not admit fully-polynomial size relaxation schemes.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Sequential sensing with model mismatch.
Proceedings of the IEEE International Symposium on Information Theory, 2015

No Small Linear Program Approximates Vertex Cover within a Factor 2 - e.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Information theory and polyhedral combinatorics.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set.
Oper. Res. Lett., 2014

Strict linear prices in non-convex European day-ahead electricity markets.
Optim. Methods Softw., 2014

Design and verify: a new scheme for generating cutting-planes.
Math. Program., 2014

Symmetry-exploiting cuts for a class of mixed-0/1 second-order cone programs.
Discret. Optim., 2014

LP and SDP inapproximability of combinatorial problems.
CoRR, 2014

2013
A note on the extension complexity of the knapsack polytope.
Oper. Res. Lett., 2013

2012
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

An Algebraic Approach to Symmetric Extended Formulations.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank.
Oper. Res. Lett., 2011

Lower bounds for the Chvátal-Gomory rank in the 0/1 cube.
Oper. Res. Lett., 2011

On the membership problem for the {0, 1/2}-closure.
Oper. Res. Lett., 2011

Random half-integral polytopes.
Oper. Res. Lett., 2011

2010
Cutting-planes for weakly-coupled 0/1 second order cone programs.
Electron. Notes Discret. Math., 2010

Rank of random half-integral polytopes - extended abstract -.
Electron. Notes Discret. Math., 2010

On the Rank of Cutting-Plane Proof Systems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
France Telecom workforce scheduling problem: a challenge.
RAIRO Oper. Res., 2009

Approximate computation of zero-dimensional polynomial ideals.
J. Symb. Comput., 2009


  Loading...