Gábor Braun

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 25

Top Topics

Polynomial Size

Top Venues

IEEE Trans. Inf. Theory

Publications

Gábor Braun, Cristóbal Guzmán, Sebastian Pokutta
Corrections to "Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory". IEEE Trans. Inf. Theory 70 (7) (2024)
Gábor Braun, Sebastian Pokutta, Daniel Zink
Lazifying Conditional Gradient Algorithms. J. Mach. Learn. Res. 20 (2019)
Gábor Braun, Sebastian Pokutta, Dan Tu, Stephen J. Wright
Blended Conditonal Gradients. ICML (2019)
Gábor Braun, Sebastian Pokutta, Daniel Zink
Affine reductions for LPs and SDPs. Math. Program. 173 (1-2) (2019)
Gábor Braun, Sebastian Pokutta, Dan Tu, Stephen J. Wright
Blended Conditional Gradients: the unconditioning of conditional gradients. CoRR (2018)
Gábor Braun, Sebastian Pokutta, Aurko Roy
Strong reductions for extended formulations. Math. Program. 172 (1-2) (2018)
Gábor Braun, Cristobal Guzman, Sebastian Pokutta
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory. IEEE Trans. Inf. Theory 63 (7) (2017)
Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta
Information-theoretic approximations of the nonnegative rank. Comput. Complex. 26 (1) (2017)
Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink
The matching problem has no small symmetric SDP. Math. Program. 165 (2) (2017)
Gábor Braun, Sebastian Pokutta, Daniel Zink
Lazifying Conditional Gradient Algorithms. ICML (2017)
Gábor Braun, Sebastian Pokutta, Aurko Roy
Strong Reductions for Extended Formulations. IPCO (2016)
Gábor Braun, Sebastian Pokutta, Daniel Zink
Lazifying Conditional Gradient Algorithms. CoRR (2016)
Gábor Braun, Samuel Fiorini, Sebastian Pokutta
Average case polyhedral complexity of the maximum stable set problem. Math. Program. 160 (1-2) (2016)
Gábor Braun, Sebastian Pokutta
Common Information and Unique Disjointness. Algorithmica 76 (3) (2016)
Gábor Braun, Sebastian Pokutta
A Polyhedral Characterization of Border Bases. SIAM J. Discret. Math. 30 (1) (2016)
Gábor Braun, Sebastian Pokutta
An efficient high-probability algorithm for Linear Bandits. CoRR (2016)
Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink
The matching problem has no small symmetric SDP. SODA (2016)
Gábor Braun, Sebastian Pokutta, Daniel Zink
Inapproximability of Combinatorial Problems via Small LPs and SDPs. STOC (2015)
Gábor Braun, Sebastian Pokutta
The matching polytope does not admit fully-polynomial size relaxation schemes. SODA (2015)
Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink
The matching problem has no small symmetric SDP. CoRR (2015)
Gábor Braun, Sebastian Pokutta
The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes. IEEE Trans. Inf. Theory 61 (10) (2015)
Gábor Braun, Sebastian Pokutta, Yao Xie
Info-Greedy Sequential Adaptive Compressed Sensing. IEEE J. Sel. Top. Signal Process. 9 (4) (2015)
Gábor Braun, Sebastian Pokutta, Aurko Roy
Strong reductions for extended formulations. CoRR (2015)
Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer
Approximation Limits of Linear Programs (Beyond Hierarchies). Math. Oper. Res. 40 (3) (2015)
Gábor Braun, Sebastian Pokutta
An information diffusion Fano inequality. CoRR (2015)
Gábor Braun, Samuel Fiorini, Sebastian Pokutta
Average Case Polyhedral Complexity of the Maximum Stable Set Problem. APPROX-RANDOM (2014)
Gábor Braun, Sebastian Pokutta
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set. Oper. Res. Lett. 42 (5) (2014)
Gábor Braun, Sebastian Pokutta, Daniel Zink
LP and SDP inapproximability of combinatorial problems. CoRR (2014)
Gábor Braun, Sebastian Pokutta, Yao Xie
Info-greedy sequential adaptive compressed sensing. Allerton (2014)
Gábor Braun, Sebastian Pokutta
The matching polytope does not admit fully-polynomial size relaxation schemes. CoRR (2014)
Gábor Braun, Sebastian Pokutta, Yao Xie
Info-Greedy sequential adaptive compressed sensing. CoRR (2014)
Gábor Braun, Cristobal Guzman, Sebastian Pokutta
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory. CoRR (2014)
Gábor Braun, Sebastian Pokutta
Common Information and Unique Disjointness. FOCS (2013)
Gábor Braun, Sebastian Pokutta
Common information and unique disjointness. Electron. Colloquium Comput. Complex. 20 (2013)
Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta
Information-theoretic approximations of the nonnegative rank. Electron. Colloquium Comput. Complex. 20 (2013)
Gábor Braun, Samuel Fiorini, Sebastian Pokutta
Average case polyhedral complexity of the maximum stable set problem. CoRR (2013)
Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer
Approximation Limits of Linear Programs (Beyond Hierarchies) CoRR (2012)
Gábor Braun, Sebastian Pokutta
An algebraic approach to symmetric extended formulations CoRR (2012)
Gábor Braun, Sebastian Pokutta
A short proof for the polyhedrality of the Chvátal--Gomory closure of a compact convex set CoRR (2012)
Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer
Approximation Limits of Linear Programs (Beyond Hierarchies). FOCS (2012)
Gábor Braun, Sebastian Pokutta
An Algebraic Approach to Symmetric Extended Formulations. ISCO (2012)
Gábor Braun, Sebastian Pokutta
Random half-integral polytopes. Oper. Res. Lett. 39 (3) (2011)
Gábor Braun, Lutz Strüngmann
Breaking up Finite Automata Presentable torsion-Free Abelian Groups. Int. J. Algebra Comput. 21 (8) (2011)
Gábor Braun, Sebastian Pokutta
Rank of random half-integral polytopes - extended abstract -. Electron. Notes Discret. Math. 36 (2010)
Andreas Blass, Gábor Braun
Random Orders and Gambler's Ruin. Electron. J. Comb. 12 (2005)