Zohar S. Karnin

Orcid: 0009-0009-0108-289X

Affiliations:
  • Amazon, New York, NY, USA
  • Yahoo Research, Haifa, Israel
  • Technion - Israel Institute of Technology, Computer Science Department, Haifa, Israel


According to our database1, Zohar S. Karnin authored at least 50 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Extended Conversion: Capturing Successful Interactions in Voice Shopping.
Proceedings of the 17th ACM Conference on Recommender Systems, 2023

2022
Relative Error Streaming Quantiles.
SIGMOD Rec., 2022

Streaming Quantiles Algorithms with Small Space and Update Time.
Sensors, 2022

2020
Amazon SageMaker Autopilot: a white box AutoML solution at scale.
CoRR, 2020

TabTransformer: Tabular Data Modeling Using Contextual Embeddings.
CoRR, 2020

Practical and sample efficient zero-shot HPO.
CoRR, 2020

PruneNet: Channel Pruning via Global Importance.
CoRR, 2020


Amazon SageMaker Autopilot: a white box AutoML solution at scale.
Proceedings of the Fourth Workshop on Data Management for End-To-End Machine Learning, 2020

schuBERT: Optimizing Elements of BERT.
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 2020

2019
Asymmetric Random Projections.
CoRR, 2019

DARC: Differentiable ARchitecture Compression.
CoRR, 2019

Discrepancy, Coresets, and Sketches in Machine Learning.
Proceedings of the Conference on Learning Theory, 2019

2017
Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP.
Proceedings of the 34th International Conference on Machine Learning, 2017

Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Volumetric Spanners: An Efficient Exploration Basis for Learning.
J. Mach. Learn. Res., 2016

Almost Optimal Streaming Quantiles Algorithms.
CoRR, 2016

How Many Folders Do You Really Need?
CoRR, 2016

One-Shot Session Recommendation Systems with Combinatorial Items.
CoRR, 2016

You've got Mail, and Here is What you Could do With It!: Analyzing and Predicting Actions on Email Messages.
Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, 2016

Optimal Dynamic Distributed MIS.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Multi-armed Bandits: Competing with Optimal Sequences.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Verification Based Solution for Structured MAB Problems.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Optimal Quantile Approximation in Streams.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Instance-dependent Regret Bounds for Dueling Bandits.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
You Will Get Mail!Predicting the Arrival of Future Email.
Proceedings of the 24th International Conference on World Wide Web Companion, 2015

Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design.
Proceedings of the 24th International Conference on World Wide Web, 2015

Online Principal Components Analysis.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Copeland Dueling Bandits.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Online with Spectral Bounds.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Hard-Margin Active Linear Regression.
Proceedings of the 31th International Conference on Machine Learning, 2014

Reducing Dueling Bandits to Cardinal Bandits.
Proceedings of the 31th International Conference on Machine Learning, 2014

Volumetric Spanners: an Efficient Exploration Basis for Learning.
Proceedings of The 27th Conference on Learning Theory, 2014

How Many Folders Do You Really Need?: Classifying Email into a Handful of Categories.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

2013
Volumetric Spanners and their Applications to Machine Learning.
CoRR, 2013

Threading machine generated email.
Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

Distributed Exploration in Multi-Armed Bandits.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Near-Optimal Entrywise Sampling for Data Matrices.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Almost Optimal Exploration in Multi-Armed Bandits.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity
CoRR, 2012

A Polylog Pivot Steps Simplex Algorithm for 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

Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem.
Proceedings of the COLT 2012, 2012

2011
derandomization of algebraic and geometric problems in theoretical computer science.
PhD thesis, 2011

Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in.
Comb., 2011

Deterministic construction of a high dimensional l<sub>p</sub> section in l<sub>1</sub><sup>n</sup> for any <i>p</i><2.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010
Deterministic Construction of a high dimensional l<sub>p</sub> section in l<sub>1</sub><sup>n</sup> for any p<2.
Electron. Colloquium Comput. Complex., 2010

2009
Explicit Dimension Reduction and Its Applications.
Electron. Colloquium Comput. Complex., 2009

Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in.
Electron. Colloquium Comput. Complex., 2009

Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2007
Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in.
Electron. Colloquium Comput. Complex., 2007


  Loading...