Sebastian Pokutta

Cristóbal Guzmán

IEEE Trans. Inf. Theory, July, 2024

Scalable Frank-Wolfe on Generalized Self-Concordant Functions via Simple Steps.

[BibT_eX]

[DOI]

SIAM J. Optim., 2024

Kissing Polytopes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

The complexity of geometric scaling.

[BibT_eX]

[DOI]

Antoine Deza

Lionel Pournin

Oper. Res. Lett., 2024

S-CFE: Simple Counterfactual Explanations.

[BibT_eX]

[DOI]

CoRR, 2024

The Good, the Bad and the Ugly: Watermarks, Transferable Attacks and Adversarial Defenses.

[BibT_eX]

[DOI]

CoRR, 2024

Neural Parameter Regression for Explicit Representations of PDE Solution Operators.

[BibT_eX]

[DOI]

Konrad Mundinger

CoRR, 2024

On the Byzantine-Resilience of Distillation-Based Federated Learning.

[BibT_eX]

[DOI]

CoRR, 2024

Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods.

[BibT_eX]

[DOI]

Deborah Hendrych

Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Estimating Canopy Height at Scale.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal Point.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Sparse Model Soups: A Recipe for Improved Pruning via Model Averaging.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Interpretability Guarantees with Merlin-Arthur Classifiers.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Data-Driven Distributionally Robust Optimization over Time.

[BibT_eX]

[DOI]

INFORMS J. Optim., October, 2023

Principled deep neural network training through linear programming.

[BibT_eX]

[DOI]

Daniel Bienstock

Gonzalo Muñoz

Discret. Optim., August, 2023

Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm.

[BibT_eX]

[DOI]

Math. Program., January, 2023

Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube.

[BibT_eX]

[DOI]

Christoph Hunkenschröder

Robert Weismantel

SIAM J. Optim., 2023

PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs.

[BibT_eX]

[DOI]

CoRR, 2023

Group-wise Sparse and Explainable Adversarial Attacks.

[BibT_eX]

[DOI]

Shpresim Sadiku

Moritz Wagner

CoRR, 2023

Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties.

[BibT_eX]

[DOI]

Christopher Criscitiello

CoRR, 2023

Learning Cuts via Enumeration Oracles.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

How I Learned to Stop Worrying and Love Retraining.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Approximate Vanishing Ideal Computations at Scale.

[BibT_eX]

[DOI]

Hiroshi Kera

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Online Learning for Scheduling MIP Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Acceleration of Frank-Wolfe Algorithms with Open-Loop Step-Sizes.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Fully Computer-Assisted Proofs in Extremal Combinatorics.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Accelerating domain propagation: An efficient GPU-parallel algorithm over sparse matrices.

[BibT_eX]

[DOI]

Boro Sofranac

Ambros M. Gleixner

Parallel Comput., 2022

New limits of treewidth-based tractability in optimization.

[BibT_eX]

[DOI]

Yuri Faenza

Gonzalo Muñoz

Math. Program., 2022

Restarting Frank-Wolfe: Faster Rates under Hölderian Error Bounds.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2022

FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

Toward Sharing Brain Images: Differentially Private TOF-MRA Images With Segmentation Labels Using Generative Adversarial Networks.

[BibT_eX]

[DOI]

Frontiers Artif. Intell., 2022

Convex integer optimization with Frank-Wolfe methods.

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

Compression-aware Training of Neural Networks using Frank-Wolfe.

[BibT_eX]

[DOI]

CoRR, 2022

Optimizing a low-dimensional convex function over a high-dimensional cube.

[BibT_eX]

[DOI]

Christoph Hunkenschröder

Robert Weismantel

CoRR, 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

An algorithm-independent measure of progress for linear constraint propagation.

[BibT_eX]

[DOI]

Boro Sofranac

Ambros M. Gleixner

Constraints An Int. J., 2022

Fast Algorithms for Packing Proportional Fairness and its Dual.

[BibT_eX]

[DOI]

Francisco Criado

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

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

[BibT_eX]

[DOI]

Stephan Wäldchen

Felix Huber

Proceedings of the International Conference on Machine Learning, 2022

Pairwise Conditional Gradients without Swap Steps and Sparser Kernel Herding.

[BibT_eX]

[DOI]

Kazuma Tsuji

Ken'ichiro Tanaka

Proceedings of the International Conference on Machine Learning, 2022

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

[BibT_eX]

[DOI]

Jan MacDonald

Proceedings of the International Conference on Machine Learning, 2022

Conditional Gradients for the Approximately Vanishing Ideal.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Complexity of linear minimization and projection on some sets.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Linear Bandits on Uniformly Convex Sets.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2021

Structured Robust Submodular Maximization: Offline and Online Algorithms.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2021

Efficient Online-Bandit Strategies for Minimax Learning Problems.

[BibT_eX]

[DOI]

CoRR, 2021

Local and Global Uniform Convexity Conditions.

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

Huan Xu

CoRR, 2021

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

[BibT_eX]

[DOI]

Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track, 2021

Learning to Schedule Heuristics in Branch and Bound.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Projection-Free Optimization on Uniformly Convex Sets.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Deep Neural Network Training with Frank-Wolfe.

[BibT_eX]

[DOI]

CoRR, 2020

Projection-Free Adaptive Gradients for Large-Scale Optimization.

[BibT_eX]

[DOI]

CoRR, 2020

Second-order Conditional Gradients.

[BibT_eX]

[DOI]

CoRR, 2020

Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization.

[BibT_eX]

[DOI]

Hassan Mortagy

Swati Gupta

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.

[BibT_eX]

[DOI]

Mohit Singh

Alfredo Torrico

Proceedings of the 37th International Conference on Machine Learning, 2020

IPBoost - Non-Convex Boosting via Integer Programming.

[BibT_eX]

[DOI]

Marc E. Pfetsch

Proceedings of the 37th International Conference on Machine Learning, 2020

Boosting Frank-Wolfe by Chasing Gradients.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Restarting Algorithms: Sometimes There Is Free Lunch.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

Locally Accelerated Conditional Gradients.

[BibT_eX]

[DOI]

Jelena Diakonikolas

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Affine reductions for LPs and SDPs.

[BibT_eX]

[DOI]

Math. Program., 2019

No Small Linear Program Approximates Vertex Cover Within a Factor 2 - <i>ɛ</i>.

[BibT_eX]

[DOI]

Math. Oper. Res., 2019

Lazifying Conditional Gradient Algorithms.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2019

Blended Matching Pursuit.

[BibT_eX]

[DOI]

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

Blended Conditonal Gradients.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Restarting Frank-Wolfe.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018

Detecting almost symmetries of graphs.

[BibT_eX]

[DOI]

Ben Knueven

Jim Ostrowski

Math. Program. Comput., 2018

Strong reductions for extended formulations.

[BibT_eX]

[DOI]

Aurko Roy

Math. Program., 2018

Aggregation-based cutting-planes for packing and covering integer programs.

[BibT_eX]

[DOI]

Math. Program., 2018

On the effect of model mismatch for sequential Info-Greedy Sensing.

[BibT_eX]

[DOI]

Ruiyang Song

EURASIP J. Adv. Signal Process., 2018

Solving MIPs via scaling-based augmentation.

[BibT_eX]

[DOI]

Pierre Le Bodic

Jeffrey William Pavelka

Marc E. Pfetsch

Discret. Optim., 2018

An Online-Learning Approach to Inverse Optimization.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient algorithms for robust submodular maximization under matroid constraints.

[BibT_eX]

[DOI]

Mohit Singh

Alfredo Torrico

CoRR, 2018

Limits of Treewidth-based tractability in Optimization.

[BibT_eX]

[DOI]

Yuri Faenza

Gonzalo Muñoz

CoRR, 2018

Blended Conditional Gradients: the unconditioning of conditional gradients.

[BibT_eX]

[DOI]

CoRR, 2018

Continuous simulation Optimization with Model mismatch using Gaussian Process Regression.

[BibT_eX]

[DOI]

Proceedings of the 2018 Winter Simulation Conference, 2018

2017

Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory.

[BibT_eX]

[DOI]

Cristóbal Guzmán

IEEE Trans. Inf. Theory, 2017

The matching problem has no small symmetric SDP.

[BibT_eX]

[DOI]

Math. Program., 2017

Pricing and clearing combinatorial markets with singleton and swap orders.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2017

Hierarchical Clustering via Spreading Metrics.

[BibT_eX]

[DOI]

Aurko Roy

J. Mach. Learn. Res., 2017

Approximation and online algorithms for multidimensional bin packing: A survey.

[BibT_eX]

[DOI]

Henrik I. Christensen

Arindam Khan

Prasad Tetali

Comput. Sci. Rev., 2017

Robust Submodular Maximization: Offline and Online Algorithms.

[BibT_eX]

[DOI]

CoRR, 2017

Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.

[BibT_eX]

[DOI]

Comput. Manag. Sci., 2017

Information-theoretic approximations of the nonnegative rank.

[BibT_eX]

[DOI]

Comput. Complex., 2017

Reinforcement Learning under Model Mismatch.

[BibT_eX]

[DOI]

Aurko Roy

Huan Xu

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.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

Emulating the Expert: Inverse Optimization through Online Learning.

[BibT_eX]

[DOI]

Andreas Bärmann

Keerthi Suria Kumar Arumugam

Oskar Schneider

Proceedings of the 34th International Conference on Machine Learning, 2017

Modulation recognition using side information and hybrid learning.

[BibT_eX]

[DOI]

Ishaque Ashar Kadampot

Proceedings of the 2017 IEEE International Symposium on Dynamic Spectrum Access Networks, 2017

2016

A Polyhedral Characterization of Border Bases.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Average case polyhedral complexity of the maximum stable set problem.

[BibT_eX]

[DOI]

Samuel Fiorini

Math. Program., 2016

Toward a Science of Autonomy for Physical Systems: Transportation.

[BibT_eX]

[DOI]

Daniel Lee

CoRR, 2016

An efficient high-probability algorithm for Linear Bandits.

[BibT_eX]

[DOI]

CoRR, 2016

Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.

[BibT_eX]

[DOI]

Comput. Manag. Sci., 2016

2015

The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

On the existence of 0/1 polytopes with high semidefinite extension complexity.

[BibT_eX]

[DOI]

Jop Briët

Daniel Dadush

Math. Program., 2015

Approximation Limits of Linear Programs (Beyond Hierarchies).

[BibT_eX]

[DOI]

Math. Oper. Res., 2015

Info-Greedy Sequential Adaptive Compressed Sensing.

[BibT_eX]

[DOI]

IEEE J. Sel. Top. Signal Process., 2015

Exponential Lower Bounds for Polytopes in Combinatorial Optimization.

[BibT_eX]

[DOI]

J. ACM, 2015

Sequential Information Guided Sensing.

[BibT_eX]

[DOI]

Ruiyang Song

CoRR, 2015

An information diffusion Fano inequality.

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

Inapproximability of Combinatorial Problems via Small LPs and SDPs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Sequential sensing with model mismatch.

[BibT_eX]

[DOI]

Ruiyang Song

Proceedings of the IEEE International Symposium on Information Theory, 2015

No Small Linear Program Approximates Vertex Cover within a Factor 2 - e.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Information theory and polyhedral combinatorics.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

Strict linear prices in non-convex European day-ahead electricity markets.

[BibT_eX]

[DOI]

Alexander Martin

Johannes C. Müller

Optim. Methods Softw., 2014

Design and verify: a new scheme for generating cutting-planes.

[BibT_eX]

[DOI]

Santanu S. Dey

Math. Program., 2014

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

[BibT_eX]

[DOI]

Sarah Drewes

Discret. Optim., 2014

LP and SDP inapproximability of combinatorial problems.

[BibT_eX]

[DOI]

CoRR, 2014

2013

A note on the extension complexity of the knapsack polytope.

[BibT_eX]

[DOI]

Mathieu Van Vyve

Oper. Res. Lett., 2013

Common information and unique disjointness.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

2012

Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

An Algebraic Approach to Symmetric Extended Formulations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank.

[BibT_eX]

[DOI]

Andreas S. Schulz

Oper. Res. Lett., 2011

Lower bounds for the Chvátal-Gomory rank in the 0/1 cube.

[BibT_eX]

[DOI]

Gautier Stauffer

Oper. Res. Lett., 2011

On the membership problem for the {0, 1/2}-closure.

[BibT_eX]

[DOI]

Adam N. Letchford

Andreas S. Schulz

Oper. Res. Lett., 2011

Random half-integral polytopes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

2010

Cutting-planes for weakly-coupled 0/1 second order cone programs.

[BibT_eX]

[DOI]

Sarah Drewes

Electron. Notes Discret. Math., 2010

Rank of random half-integral polytopes - extended abstract -.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

On the Rank of Cutting-Plane Proof Systems.

[BibT_eX]

[DOI]

Andreas S. Schulz

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

France Telecom workforce scheduling problem: a challenge.

[BibT_eX]

[DOI]