Tamás Sarlós

According to our database1, Tamás Sarlós authored at least 51 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries.
IACR Cryptol. ePrint Arch., 2024

2023
Hot PATE: Private Aggregation of Distributions for Diverse Task.
CoRR, 2023

SARA-RT: Scaling up Robotics Transformers with Self-Adaptive Robust Attention.
CoRR, 2023

Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products.
CoRR, 2023

Learning a Fourier Transform for Linear Relative Positional Encodings in Transformers.
CoRR, 2023

FAVOR#: Sharp Attention Kernel Approximations via New Classes of Positive Random Features.
CoRR, 2023

Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Dense-Exponential Random Features: Sharp Positive Estimators of the Gaussian Kernel.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Generalized Private Selection and Testing with High Confidence.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023


Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Chefs' Random Tables: Non-Trigonometric Random Features.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On the Robustness of CountSketch to Adaptive Inputs.
Proceedings of the International Conference on Machine Learning, 2022

From block-Toeplitz matrices to differential equations on graphs: towards a general theory for scalable masked Transformers.
Proceedings of the International Conference on Machine Learning, 2022

2021
ES-ENAS: Combining Evolution Strategies with Neural Architecture Search at No Extra Cost for Reinforcement Learning.
CoRR, 2021

Rethinking Attention with Performers.
Proceedings of the 9th International Conference on Learning Representations, 2021

Differentially Private Weighted Sampling.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Masked Language Modeling for Proteins via Linearly Scalable Long-Context Transformers.
CoRR, 2020

Stochastic Flows and Geometric Optimization on the Orthogonal Group.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Reinforcement Learning with Chromatic Networks.
CoRR, 2019

Tight Dimensionality Reduction for Sketching Low Degree Polynomial Kernels.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Matrix-Free Preconditioning in Online Learning.
Proceedings of the 36th International Conference on Machine Learning, 2019

Orthogonal Estimation of Wasserstein Distances.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Orienteering Algorithms for Generating Travel Itineraries.
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

Geometrically Coupled Monte Carlo Sampling.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

The Geometry of Random Features.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Linear Additive Markov Processes.
Proceedings of the 26th International Conference on World Wide Web, 2017

Caching with Dual Costs.
Proceedings of the 26th International Conference on World Wide Web Companion, 2017

Structured adaptive and random spinners for fast machine learning computations.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
TripleSpin - a generic compact paradigm for fast machine learning computations.
CoRR, 2016

On Sampling Nodes in a Network.
Proceedings of the 25th International Conference on World Wide Web, 2016

2014
Fastfood: Approximate Kernel Expansions in Loglinear Time.
CoRR, 2014

On estimating the average degree.
Proceedings of the 23rd International World Wide Web Conference, 2014

2013
Optimal hashing schemes for entity matching.
Proceedings of the 22nd International World Wide Web Conference, 2013

Fastfood - Computing Hilbert Space Expansions in loglinear time.
Proceedings of the 30th International Conference on Machine Learning, 2013

Permutation indexing: fast approximate retrieval from large corpora.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
Are web users really Markovian?
Proceedings of the 21st World Wide Web Conference 2012, 2012

2011
Faster least squares approximation.
Numerische Mathematik, 2011

On scheduling in map-reduce and flow-shops.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Mining tags using social endorsement networks.
Proceedings of the Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2011

Fast locality-sensitive hashing.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

2010
A sparse Johnson: Lindenstrauss transform.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2007
Web Spam Detection via Commercial Intent Analysis.
Proceedings of the AIRWeb 2007, 2007

2006
To randomize or not to randomize: space optimal summaries for hyperlink analysis.
Proceedings of the 15th international conference on World Wide Web, 2006

Improved Approximation Algorithms for Large Matrices via Random Projections.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Link-Based Similarity Search to Fight Web Spam.
Proceedings of the AIRWeb 2006, 2006

2005
Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments.
Internet Math., 2005

On the feasibility of low-rank approximation for personalized PageRank.
Proceedings of the 14th international conference on World Wide Web, 2005

SpamRank -- Fully Automatic Link Spam Detection.
Proceedings of the AIRWeb 2005, 2005

2003
Searching a Small National Domain - Preliminary Report.
Proceedings of the Twelfth International World Wide Web Conference - Posters, 2003


  Loading...