Scaling Methods for Discrete and Continuous Optimization

An Accelerated Newton-Dinkelbach Method and its Application to Two Variables Per Inequality Systems

Autori: Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A.
Pubblicato in: 29th Annual European Symposium on Algorithms (ESA 2021), Numero 36, 2021, Pagina/e 1-15
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.48550/arxiv.2004.08634

Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals

Autori: Ishan Bansal; Joseph Cheriyan; Logan Grout; Sharat Ibrahimpur
Pubblicato in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023), 2023, Pagina/e 14:1--14:14, ISBN 978-3-95977-296-9
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.approx/random.2023.14

On complete classes of valuated matroids

Autori: Husić, Edin; Loho, Georg; Smith, Ben; Végh, László A.
Pubblicato in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Pagina/e 945-962
Editore: SIAM
DOI: 10.1137/1.9781611977073.41

A Faster Interior-Point Method for Sum-Of-Squares Optimization

Autori: Jiang, Shunhua ; Natura, Bento ; Weinstein, Omri
Pubblicato in: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Numero 79, 2022, Pagina/e 1-20
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.icalp.2022.79

Efficient Caching with Reserves via Marking

Autori: Sharat Ibrahimpur; Manish Purohit; Zoya Svitkina; Erik Vee; Joshua R. Wang
Pubblicato in: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), 2023, Pagina/e 80:1--80:20, ISBN 978-3-95977-278-5
Editore: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2023.80

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees

Autori: Koh, Zhuan Khye; Loho, Georg
Pubblicato in: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)., Numero 63, 2022, Pagina/e 1-15
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.mfcs.2022.63

Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopes

Autori: Haase, Christian; Hertrich, Christoph; Loho, Georg
Pubblicato in: ICLR2023, Numero 16, 2023
Editore: OpenReview.net
DOI: 10.48550/arxiv.2302.12553

On the Correlation Gap of Matroids

Autori: Edin Husić; Zhuan Khye Koh; Georg Loho; László A. Végh
Pubblicato in: Integer Programming and Combinatorial Optimization. IPCO 2023. Lecture Notes in Computer Science, Numero vol. 13904, 2023, ISSN 0302-9743
Editore: Springer
DOI: 10.1007/978-3-031-32726-1_15

An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem

Autori: Satoru Fujishige; Tomonari Kitahara; László A. Végh
Pubblicato in: Integer Programming and Combinatorial Optimization. IPCO 2023. Lecture Notes in Computer Science, Numero vol 13904, 2023, ISSN 0302-9743
Editore: Springer
DOI: 10.1007/978-3-031-32726-1_11

Approximating Nash Social Welfare by Matching and Local Search

Autori: Garg, Jugal; Husić, Edin; Li, Wenzheng; Végh, László A.; Vondrák, Jan
Pubblicato in: STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Numero 30, 2023, Pagina/e 1298-1310, ISBN 978-1-4503-9913-5
Editore: Association for Computing Machinery
DOI: 10.1145/3564246.3585255

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions

Autori: Ishan Bansal; Joseph Cheriyan; Logan Grout; Sharat Ibrahimpur
Pubblicato in: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), 2023, Pagina/e 15:1--15:19, ISBN 978-3-95977-278-5
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2023.15

Chaos of Learning Beyond Zero-sum and Coordination via Game Decompositions

Autori: Cheung, Yun Kuen; Tao, Yixin
Pubblicato in: ICLR 2021, 2021
Editore: ICLR

The Evolution of Uncertainty of Learning in Games

Autori: Cheung, Yun Kuen; Piliouras, Georgios; Tao, Yixin
Pubblicato in: ICLR 2022, 2022
Editore: ICLR

A strongly polynomial algorithm for linear exchange markets

Autori: Jugal Garg, László A. Végh
Pubblicato in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Pagina/e 54-65, ISBN 9781-450367059
Editore: ACM Press
DOI: 10.1145/3313276.3316340

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Autori: Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
Pubblicato in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Pagina/e 761-774, ISBN 9781-450369794
Editore: ACM
DOI: 10.1145/3357713.3384326?cid=81100084130

Signed Tropical Convexity

Autori: Georg Loho, László A. Végh
Pubblicato in: Proceedings of the 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Numero 24, 2020, Pagina/e 1-35
Editore: LIPIcs–Leibniz International Proceedings in Informatics
DOI: 10.4230/lipics.itcs.2020.24

Directed Shortest Paths via Approximate Cost Balancing

Autori: James B. Orlin, László A. Végh
Pubblicato in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Pagina/e 235-254, ISBN 978-1-61197-646-5
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.16

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and their Applications

Autori: Jugal Garg, Edin Husić, László A. Végh
Pubblicato in: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)., Numero 33, 2021, Pagina/e 1-19
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing
DOI: 10.4230/lipics.stacs.2021.33

On finding exact solutions of linear programs in the oracle model

Autori: Dadush, Daniel; Végh, László A.; Zambelli, Giacomo
Pubblicato in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Pagina/e 2700-2722
Editore: SIAM
DOI: 10.1137/1.9781611977073.106

Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets

Autori: Jugal Garg, Yixin Tao, László A. Végh
Pubblicato in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Pagina/e 2269-2284
Editore: SIAM
DOI: 10.1137/1.9781611977073.91

Mode Connectivity in Auction Design

Autori: Christoph Hertrich; Yixin Tao; László A. Végh
Pubblicato in: Advances in Neural Information Processing Systems (NeurIPS 2023), Numero 36, 2023
Editore: NeurIPS
DOI: 10.48550/arxiv.2305.11005

ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation

Autori: Christoph Hertrich; Leon Sering
Pubblicato in: Integer Programming and Combinatorial Optimization. IPCO 2023. Lecture Notes in Computer Science, Numero vol. 13904, 2023, ISSN 0302-9743
Editore: Springer
DOI: 10.1007/978-3-031-32726-1_14

On Circuit Diameter Bounds via Circuit Imbalances

Autori: Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A.
Pubblicato in: IPCO 2022: Integer Programming and Combinatorial Optimization, 2022, Pagina/e 140-153
Editore: Springer
DOI: 10.1007/978-3-031-06901-7_11

Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers

Autori: Daniel Dadush, Bento Natura, László A. Végh
Pubblicato in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Pagina/e 931-942
Editore: IEEE
DOI: 10.1109/focs46700.2020.00091

The Pareto Cover Problem

Autori: Natura, Bento; Neuwohner, Meike; Weltge, Stefan
Pubblicato in: 30th Annual European Symposium on Algorithms (ESA 2022), Numero 80, 2022, Pagina/e 1-12
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.esa.2022.80

Approximating Nash Social Welfare under Rado Valuations

Autori: Jugal Garg, Edin Husic, László A. Végh
Pubblicato in: STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Pagina/e 1412-1425
Editore: ACM SIGACT
DOI: 10.1145/3406325.3451031

Interior point methods are not worse than Simplex

Autori: Allamigeon, Xavier; Dadush, Daniel; Loho, Georg; Natura, Bento; Végh, László A.
Pubblicato in: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022
Editore: IEEE
DOI: 10.1109/focs54457.2022.00032

Nash welfare, valuated matroids, and gross substitutes

Autori: Husić, Edin
Pubblicato in: 2021
Editore: LSE
DOI: 10.21953/lse.00004335

Exact linear programming circuits, curvature, and diameter

Autori: Natura, Bento
Pubblicato in: 2022
Editore: LSE
DOI: 10.21953/lse.00004448

On linear, fractional, and submodular optimization

Autori: Koh, Zhuan Khye
Pubblicato in: 2023
Editore: LSE
DOI: 10.21953/lse.00004463

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Autori: Daniel Dadush; Sophie Huiberts; Bento Natura; László A. Végh
Pubblicato in: Mathematical Programming, 2023, ISSN 0025-5610
Editore: Springer Verlag
DOI: 10.1007/s10107-023-01956-2

An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems

Autori: Daniel Dadush; Zhuan Khye Koh; Bento Natura; László A. Végh
Pubblicato in: Mathematics of Operations Research, Numero articles in advance, 2022, Pagina/e 1-25, ISSN 0364-765X
Editore: Institute for Operations Research and the Management Sciences
DOI: 10.1287/moor.2022.1326

Patchworking Oriented Matroids

Autori: Marcel Celaya, Georg Loho, Chi Ho Yuen
Pubblicato in: Journal of the London Mathematical Society, Numero (2) 2022, 2022, Pagina/e 1-32, ISSN 1469-7750
Editore: London Mathematical Society
DOI: 10.1112/jlms.12667

An Auction Algorithm for Market Equilibrium with Weak Gross Substitute Demands

Autori: Jugal Garg; Edin Husić; László A. Végh
Pubblicato in: ACM Transactions on Economics and Computation, 2023, ISSN 2167-8375
Editore: Association for Computing Machinery
DOI: 10.1145/3624558

Rescaling Algorithms for Linear Conic Feasibility

Autori: Daniel Dadush, László A. Végh, Giacomo Zambelli
Pubblicato in: Mathematics of Operations Research, Numero 45/2, 2020, Pagina/e 732-754, ISSN 0364-765X
Editore: Institute for Operations Research and the Management Sciences
DOI: 10.1287/moor.2019.1011

Geometric Rescaling Algorithms for Submodular Function Minimization

Autori: Daniel Dadush, László A. Végh, Giacomo Zambelli
Pubblicato in: Mathematics of Operations Research, Numero (accepted), 2020, ISSN 0364-765X
Editore: Institute for Operations Research and the Management Sciences

A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization

Autori: Neil Olver, László A. Végh
Pubblicato in: Journal of the ACM, Numero 67/2, 2020, Pagina/e 1-26, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3383454

A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

Autori: Ola Svensson, Jakub Tarnawski, László A. Végh
Pubblicato in: Journal of the ACM, Numero 67/6, 2020, Pagina/e 1-53, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3424306

A Faster Interior-Point Method for Sum-of-Squares Optimization

Autori: Shunhua Jiang; Bento Natura; Omri Weinstein
Pubblicato in: Algorithmica, Numero 85, 2023, Pagina/e 2843–2884, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-023-01112-4

Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size

Autori: Christoph Hertrich; Martin Skutella
Pubblicato in: INFORMS Journal on Computing, Numero ahead of print, 2023, ISSN 1091-9856
Editore: Institute for Operations Research and the Management Sciences
DOI: 10.1287/ijoc.2021.0225

Tropical Ehrhart Theory and Tropical Volume

Autori: Georg Loho, Matthias Schymura
Pubblicato in: Research in the Mathematical Sciences, Numero 7, 2020, ISSN 2197-9847
Editore: Springer
DOI: 10.1007/s40687-020-00228-1

Face posets of tropical polyhedra and monomial ideals

Autori: Georg Loho, Ben Smith
Pubblicato in: arxiv report, journal submission in progress, 2019
Editore: arxiv

Tropical Carathéodory with Matroids

Autori: Georg Loho and Raman Sanyal
Pubblicato in: arxiv report, journal submission in progress, 2019
Editore: arxiv

Oriented Matroids from Triangulations of Products of Simplices

Autori: Marcel Celaya, Georg Loho, Chi Ho Yuen
Pubblicato in: arxiv report, submission in progress, 2020
Editore: arxiv

Selecting a Match: Exploration vs Decision

Autori: Agarwal, Ishan; Cole, Richard; Tao, Yixin
Pubblicato in: manuscript, submission in progress, Numero 1, 2021
Editore: arxiv
DOI: 10.48550/arxiv.2106.08033

Training Fully Connected Neural Networks is ∃ℝ-Complete

Autori: Bertschinger, Daniel; Hertrich, Christoph; Jungeblut, Paul; Miltzow, Tillmann; Weber, Simon
Pubblicato in: To appear in the proceedings of NeurIPS 2023, 2023
Editore: arxiv
DOI: 10.48550/arxiv.2204.01368

Circuit imbalance measures and linear programming

Autori: Ekbatani, Farbod; Natura, Bento; Végh, László A.
Pubblicato in: Surveys in Combinatorics 2022, Numero 8, 2022
Editore: Cambridge University Press
DOI: 10.1017/9781009093927.004

Risultati finali

Pubblicazioni

Condividi questa pagina

Scarica