English

Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices

Combinatorics 2013-05-20 v1 Computational Complexity Discrete Mathematics Optimization and Control
Authors: LeRoy Beasely , Troy Lee , Hartmut Klauck , Dirk Oliver Theis
View on arXiv ↗ PDF ↗

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 13082 "Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices", held in February 2013 at Dagstuhl Castle.

Keywords

communication complexity linear optimization nonnegative rank lower bounds matrices dagstuhl seminar

Cite

@article{arxiv.1305.4147,
  title  = {Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices},
  author = {LeRoy Beasely and Troy Lee and Hartmut Klauck and Dirk Oliver Theis},
  journal= {arXiv preprint arXiv:1305.4147},
  year   = {2013}
}

Related papers

View all related →
Computational Complexity · Computer Science
Communication Complexity (for Algorithm Designers)
Tim Roughgarden
2015-09-22
Distributed, Parallel, and Cluster Computing · Computer Science
Communication lower bounds for nested bilinear algorithms via rank expansion of Kronecker products
Caleb Ju, Yifan Zhang, Edgar Solomonik
2023-09-29
Distributed, Parallel, and Cluster Computing · Computer Science
Resiliency in Numerical Algorithm Design for Extreme Scale Simulations
Emmanuel Agullo, Mirco Altenbernd, Hartwig Anzt, Leonardo Bautista-Gomez +32
2020-10-27
Computational Complexity · Computer Science
The Communication Complexity of Approximating Matrix Rank
Alexander A. Sherstov, Andrey A. Storozhenko
2024-10-29
Information Retrieval · Computer Science
Conversational Search -- A Report from Dagstuhl Seminar 19461
Avishek Anand, Lawrence Cavedon, Matthias Hagen, Hideo Joho +2
2020-05-19
Logic in Computer Science · Computer Science
Topological Complexity of omega-Powers : Extended Abstract
Olivier Finkel, Dominique Lecomte
2008-09-11
Databases · Computer Science
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151)
Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu +17
2017-02-01
Computational Complexity · Computer Science
An approximation algorithm for approximation rank
Troy Lee, Adi Shraibman
2021-03-09
Data Structures and Algorithms · Computer Science
The Communication Complexity of Optimization
Santosh S. Vempala, Ruosong Wang, David P. Woodruff
2019-11-01
Computational Complexity · Computer Science
Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank
Nathaniel Harms, Viktor Zamaraev
2023-07-11
Data Structures and Algorithms · Computer Science
Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication
Omri Weinstein, Huacheng Yu
2016-04-12
Data Structures and Algorithms · Computer Science
Improving the Bit Complexity of Communication for Distributed Convex Optimization
Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth +2
2024-03-29
Machine Learning · Computer Science
Communication Lower Bounds for Distributed Convex Optimization: Partition Data on Features
Zihao Chen, Luo Luo, Zhihua Zhang
2016-12-05
Distributed, Parallel, and Cluster Computing · Computer Science
Roadmap for Edge AI: A Dagstuhl Perspective
Aaron Yi Ding, Ella Peltonen, Tobias Meuser, Atakan Aral +15
2025-05-23
Computational Complexity · Computer Science
Structure in Communication Complexity and Constant-Cost Complexity Classes
Hamed Hatami, Pooya Hatami
2024-01-29
Numerical Analysis · Mathematics
Challenges in computing matrix functions
Massimiliano Fasi, Stéphane Gaudreault, Kathryn Lund, Marcel Schweitzer
2024-01-30
Logic in Computer Science · Computer Science
Proceedings Third International Workshop on Linearity
Sandra Alves, Iliano Cervesato
2015-02-17
Machine Learning · Computer Science
GT-STORM: Taming Sample, Communication, and Memory Complexities in Decentralized Non-Convex Learning
Xin Zhang, Jia Liu, Zhengyuan Zhu, Elizabeth S. Bentley
2021-05-20
Distributed, Parallel, and Cluster Computing · Computer Science
Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds
Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar +1
2022-05-27
Formal Languages and Automata Theory · Computer Science
Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems
Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe
2010-02-23
Optimization and Control · Mathematics
Recent theoretical advances in decentralized distributed convex optimization
Eduard Gorbunov, Alexander Rogozin, Aleksandr Beznosikov, Darina Dvinskikh +1
2022-08-23
Optimization and Control · Mathematics
Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization
Haochuan Li, Yi Tian, Jingzhao Zhang, Ali Jadbabaie
2021-04-20
Data Structures and Algorithms · Computer Science
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz +1
2012-11-30
Computation and Language · Computer Science
DIMSUM: Discourse in Mathematical Reasoning as a Supervision Module
Krish Sharma, Niyar R Barman, Akshay Chaturvedi, Nicholas Asher
2025-03-10
Computation and Language · Computer Science
Dialogue Act Classification in Group Chats with DAG-LSTMs
Ozan İrsoy, Rakesh Gosangi, Haimin Zhang, Mu-Hsin Wei +5
2019-08-07