Lior Kamma

According to our database, Lior Kamma authored at least 13 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Sparse Dimensionality Reduction Revisited.

Mikael Møller Høgsgaard, Lior Kamma, Kasper Green Larsen, Jelani Nelson, Chris Schwiegelshohn

CoRR, 2023

2020

Margins are Insufficient for Explaining Gradient Boosting.

Allan Grønlund, Lior Kamma, Kasper Green Larsen

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Near-Tight Margin-Based Generalization Bounds for Support Vector Machines.

Allan Grønlund, Lior Kamma, Kasper Green Larsen

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

2019

Margin-Based Generalization Lower Bounds for Boosted Classifiers.

Allan Grønlund, Lior Kamma, Kasper Green Larsen, Alexander Mathiasen, Jelani Nelson

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

Lower Bounds for Multiplication via Network Coding.

Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Batch Sparse Recovery, or How to Leverage the Average Sparsity.

Alexandr Andoni, Lior Kamma, Robert Krauthgamer, Eric Price

CoRR, 2018

Nearly Optimal Time Bounds for kPath in Hypergraphs.

Lior Kamma, Ohad Trabelsi

CoRR, 2018

Tight cell probe bounds for succinct Boolean matrix-vector multiplication.

Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Fully Understanding The Hashing Trick.

Lior Kamma, Casper Benjamin Freksen, Kasper Green Larsen

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017

Metric Decompositions of Path-Separable Graphs.

Lior Kamma, Robert Krauthgamer

Algorithmica, 2017

2016

Tight Bounds for Gomory-Hu-like Cut Counting.

Rajesh Chitnis, Lior Kamma, Robert Krauthgamer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2015

Cutting Corners Cheaply, or How to Remove Steiner Points.

Lior Kamma, Robert Krauthgamer, Huy L. Nguyen

SIAM J. Comput., 2015

2012

Approximating survivable networks with minimum number of steiner points.

Lior Kamma, Zeev Nutov

Networks, 2012