Tal Wagner

According to our database1, Tal Wagner authored at least 34 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Erratum: Multitasking Capacity: Hardness Results and Improved Constructions.
SIAM J. Discret. Math., 2024

2023
Learning Space Partitions for Nearest Neighbor Search.
IEEE Data Eng. Bull., 2023

Fast Private Kernel Density Estimation via Locality Sensitive Quantization.
Proceedings of the International Conference on Machine Learning, 2023

Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees.
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022
Optimal (Euclidean) Metric Compression.
SIAM J. Comput., 2022

Budget-Constrained Bounds for Mini-Batch Estimation of Optimal Transport.
CoRR, 2022

Unveiling Transformers with LEGO: a synthetic reasoning task.
CoRR, 2022

Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Streaming Algorithms for Support-Aware Histograms.
Proceedings of the International Conference on Machine Learning, 2022

Triangle and Four Cycle Counting with Predictions in Graph Streams.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Generalization Bounds for Data-Driven Numerical Linear Algebra.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Few-Shot Data-Driven Algorithms for Low Rank Approximation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Faster Kernel Matrix Algebra via Density Estimation.
Proceedings of the 38th International Conference on Machine Learning, 2021

Learning-based Support Estimation in Sublinear Time.
Proceedings of the 9th International Conference on Learning Representations, 2021

2020
Multitasking Capacity: Hardness Results and Improved Constructions.
SIAM J. Discret. Math., 2020

Scalable Nearest Neighbor Search for Optimal Transport.
Proceedings of the 37th International Conference on Machine Learning, 2020

Eccentricity Heuristics through Sublinear Analysis Lenses.
Proceedings of the 1st Symposium on Algorithmic Principles of Computer Systems, 2020

2019
Scalable Nearest Neighbor Search for Optimal Transport.
CoRR, 2019

Learning Sublinear-Time Indexing for Nearest Neighbor Search.
CoRR, 2019

Eccentricities via Parallel Set Cover (Brief Announcement).
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Space and Time Efficient Kernel Density Estimation in High Dimensions.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Scalable Fair Clustering.
Proceedings of the 36th International Conference on Machine Learning, 2019

Sample-Optimal Low-Rank Approximation of Distance Matrices.
Proceedings of the Conference on Learning Theory, 2019

2018
Semi-Supervised Learning on Data Streams via Temporal Label Propagation.
Proceedings of the 35th International Conference on Machine Learning, 2018

Approximate Nearest Neighbors in Limited Space.
Proceedings of the Conference On Learning Theory, 2018

2017
Near-Optimal (Euclidean) Metric Compression.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Practical Data-Dependent Metric Compression with Provable Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

A graph-theoretic approach to multitasking.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
Cheeger-Type Approximation for Sparsest <i>st</i>-Cut.
ACM Trans. Algorithms, 2016

A Graph-Theoretic Approach to Multitasking.
CoRR, 2016

A sampling-based approach to accelerating queries in log management systems.
Proceedings of the Companion Proceedings of the 2016 ACM SIGPLAN International Conference on Systems, 2016

2015
Towards Resistance Sparsifiers.
Proceedings of the Approximation, 2015

2014
Cheeger-type approximation for sparsest $st$-cut.
CoRR, 2014

2012
Volume Regularization for Binary Classification.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012


  Loading...