Nir Ailon - RankMe

98 papers A* 12A 8B 5C 1Journal 61Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Extending Puzzle for Mixture-of-Experts Reasoning Models with Application to GPT-OSS Acceleration. CoRR Akhiad Bercovich, Nir Ailon, Vladimir Anisimov, Tomer Asida, Nave Assaf, Mohammad Dabbah, Ido Galil, Amnon Geifman, Yonatan Geifman, Izhak Golan, Roi Koren, Itay Levy, Zach Moshe, Pavlo Molchanov, Najeeb Nabwani, Mostofa Patwari, Omri Puny, Tomer Ronen, Itamar Schen, Elad Segal, Ido Shahaf, Oren Tropp, Ran Zilberstein, Ran El-Yaniv
2025	J	`jnl`	Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNs. CoRR Nir Ailon, Akhiad Bercovich, Omri Weinstein
2025	A*	`conf`	Puzzle: Distillation-Based NAS for Inference-Optimized LLMs. ICML Akhiad Bercovich, Tomer Ronen, Talor Abramovich, Nir Ailon, Nave Assaf, Mohammad Dabbah, Ido Galil, Amnon Geifman, Yonatan Geifman, Izhak Golan, Netanel Haber, Ehud Karpas, Roi Koren, Itay Levy, Pavlo Molchanov, Shahar Mor, Zach Moshe, Najeeb Nabwani, Omri Puny, Ran Rubin, Itamar Schen, Ido Shahaf, Oren Tropp, Omer Ullman Argov, Ran Zilberstein, Ran El-Yaniv
2024	J	`jnl`	Puzzle: Distillation-Based NAS for Inference-Optimized LLMs. CoRR Akhiad Bercovich, Tomer Ronen, Talor Abramovich, Nir Ailon, Nave Assaf, Mohammad Dabbah, Ido Galil, Amnon Geifman, Yonatan Geifman, Izhak Golan, Netanel Haber, Ehud Karpas, Roi Koren, Itay Levy, Pavlo Molchanov, Shahar Mor, Zach Moshe, Najeeb Nabwani, Omri Puny, Ran Rubin, Itamar Schen, Ido Shahaf, Oren Tropp, Omer Ullman Argov, Ran Zilberstein, Ran El-Yaniv
2022	J	`jnl`	Efficient NTK using Dimensionality Reduction. CoRR Nir Ailon, Supratim Shit
2021	A	`conf`	Sparse linear networks with a fixed butterfly structure: theory and practice. UAI Nir Ailon, Omer Leibovitch, Vineet Nair
2021	J	`jnl`	The complexity of computing (almost) orthogonal matrices with Inf. Process. Lett. Nir Ailon, Gal Yehuda
2020	J	`jnl`	Paraunitary matrices, entropy, algebraic condition number and Fourier computation. Theor. Comput. Sci. Nir Ailon
2020	J	`jnl`	Sparse Linear Networks with a Fixed Butterfly Structure: Theory and Practice. CoRR Nir Ailon, Omer Leibovitch, Vineet Nair
2019	J	`jnl`	Interesting Open Problem Related to Complexity of Computing the Fourier Transform and Group Theory. CoRR Nir Ailon
2018	J	`jnl`	A New and Flexible Approach to the Analysis of Paired Comparison Data. J. Mach. Learn. Res. Ivo F. D. Oliveira, Nir Ailon, Ori Davidov
2018	A	`conf`	Approximate Clustering with Same-Cluster Queries. ITCS Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2018	B	`conf`	Approximate Correlation Clustering Using Same-Cluster Queries. LATIN Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal
2017	J	`jnl`	Approximate Clustering with Same-Cluster Queries. CoRR Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2017	J	`jnl`	Approximate Correlation Clustering Using Same-Cluster Queries. CoRR Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal
2017	—	`conf`	Semi-supervised deep learning by metric embedding. ICLR (Workshop) Elad Hoffer, Nir Ailon
2016	J	`jnl`	An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model. ACM Trans. Comput. Theory Nir Ailon
2016	J	`jnl`	Bandit online optimization over the permutahedron. Theor. Comput. Sci. Nir Ailon, Kohei Hatano, Eiji Takimoto
2016	J	`jnl`	Deep unsupervised learning through spatial contrasting. CoRR Elad Hoffer, Itay Hubara, Nir Ailon
2016	J	`jnl`	Paraunitary Matrices, Entropy, Algebraic Condition Number and Fourier Computation. CoRR Nir Ailon
2016	J	`jnl`	Semi-supervised deep learning by metric embedding. CoRR Elad Hoffer, Nir Ailon
2016	J	`jnl`	Spatial contrasting for deep unsupervised learning. CoRR Elad Hoffer, Itay Hubara, Nir Ailon
2016	J	`jnl`	The Complexity of Computing a Fourier Perturbation. CoRR Nir Ailon, Gal Yehuda
2016	J	`jnl`	Tight lower bound instances for k-means++ in two dimensions. Theor. Comput. Sci. Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon
2015	—	`conf`	Deep Metric Learning Using Triplet Network. SIMBAD Elad Hoffer, Nir Ailon
2015	—	`conf`	Deep metric learning using Triplet network. ICLR (Workshop) Elad Hoffer, Nir Ailon
2015	J	`jnl`	Iterative and active graph clustering using trace norm minimization without cluster size constraints. J. Mach. Learn. Res. Nir Ailon, Yudong Chen, Huan Xu
2015	—	`conf`	Tighter Fourier Transform Lower Bounds. ICALP (1) Nir Ailon
2014	C	`conf`	A Tight Lower Bound Instance for k-means++ in Constant Dimension. TAMC Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon
2014	J	`jnl`	A Tighter Lower Bound For Fourier Transform in the Well Conditioned Model. CoRR Nir Ailon
2014	J	`jnl`	A tight lower bound instance for k-means++ in constant dimension. CoRR Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon
2014	J	`jnl`	Active learning using smooth relative regret approximations with applications. J. Mach. Learn. Res. Nir Ailon, Ron Begleiter, Esther Ezra
2014	J	`jnl`	An n\log n Lower Bound for Fourier Transform Computation in the Well Conditioned Model. CoRR Nir Ailon
2014	B	`conf`	Bandit Online Optimization over the Permutahedron. ALT Nir Ailon, Kohei Hatano, Eiji Takimoto
2014	J	`jnl`	Fast and RIP-Optimal Transforms. Discret. Comput. Geom. Nir Ailon, Holger Rauhut
2014	A	`conf`	Improved Bounds for Online Learning Over the Permutahedron and Other Ranking Polytopes. AISTATS Nir Ailon
2014	A*	`conf`	Reducing Dueling Bandits to Cardinal Bandits. ICML Nir Ailon, Zohar Shay Karnin, Thorsten Joachims
2014	J	`jnl`	Reducing Dueling Bandits to Cardinal Bandits. CoRR Nir Ailon, Thorsten Joachims, Zohar Shay Karnin
2013	J	`jnl`	A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy CoRR Nir Ailon
2013	J	`jnl`	A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy. Chic. J. Theor. Comput. Sci. Nir Ailon
2013	J	`jnl`	An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. ACM Trans. Algorithms Nir Ailon, Edo Liberty
2013	J	`jnl`	Bandit Online Optimization Over the Permutahedron. CoRR Nir Ailon
2013	J	`jnl`	Breaking the Small Cluster Barrier of Graph Clustering CoRR Nir Ailon, Yudong Chen, Huan Xu
2013	—	`conf`	Breaking the Small Cluster Barrier of Graph Clustering. ICML (3) Nir Ailon, Yudong Chen, Huan Xu
2013	J	`jnl`	Fast and RIP-optimal transforms CoRR Nir Ailon, Holger Rauhut
2013	B	`conf`	Learning and Optimizing with Preferences. ALT Nir Ailon
2013	J	`jnl`	Online Ranking: Discrete Choice, Spearman Correlation and Other Feedback. CoRR Nir Ailon
2013	A	`conf`	Threading machine generated email. WSDM Nir Ailon, Zohar Shay Karnin, Edo Liberty, Yoelle Maarek
2012	J	`jnl`	A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity CoRR Nir Ailon, Zohar Shay Karnin
2012	A*	`conf`	Active Learning Using Smooth Relative Regret Approximations with Applications. COLT Nir Ailon, Ron Begleiter, Esther Ezra
2012	J	`jnl`	Active Learning of Custering with Side Information Using $\eps$-Smooth Relative Regret Approximations CoRR Nir Ailon, Ron Begleiter
2012	J	`jnl`	An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity. J. Mach. Learn. Res. Nir Ailon
2012	J	`jnl`	Improved Approximation Algorithms for Bipartite Correlation Clustering. SIAM J. Comput. Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen
2011	J	`jnl`	A New Active Learning Scheme with Applications to Learning to Rank from Pairwise Preferences CoRR Nir Ailon, Ron Begleiter, Esther Ezra
2011	—	`conf`	Active Learning Ranking from Pairwise Preferences with Almost Optimal Query Complexity. NIPS Nir Ailon
2011	A*	`conf`	An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. SODA Nir Ailon, Edo Liberty
2011	J	`jnl`	Dense Fast Random Projections and Lean Walsh Transforms. Discret. Comput. Geom. Edo Liberty, Nir Ailon, Amit Singer
2011	J	`jnl`	Fitting Tree Metrics: Hierarchical Clustering and Phylogeny. SIAM J. Comput. Nir Ailon, Moses Charikar
2011	A	`conf`	Improved Approximation Algorithms for Bipartite Correlation Clustering. ESA Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen
2011	A	`conf`	Ranking from pairs and triplets: information quality, evaluation methods and query complexity. WSDM Kira Radinsky, Nir Ailon
2011	J	`jnl`	Self-Improving Algorithms. SIAM J. Comput. Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri
2010	J	`jnl`	Aggregation of Partial Rankings, Algorithmica Nir Ailon
2010	J	`jnl`	Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform CoRR Nir Ailon, Edo Liberty
2010	J	`jnl`	An Improved Algorithm for Bipartite Correlation Clustering CoRR Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty
2010	J	`jnl`	Faster dimension reduction. Commun. ACM Nir Ailon, Bernard Chazelle
2010	J	`jnl`	Preference-based learning to rank. Mach. Learn. Nir Ailon, Mehryar Mohri
2010	J	`jnl`	Query Efficient PTAS for Minimum Feedback Arc-Set in Tournaments CoRR Nir Ailon
2009	A	`conf`	A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables. ECIR Nir Ailon
2009	—	`conf`	Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems. ICALP (1) Nir Ailon, Edo Liberty
2009	J	`jnl`	Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. Discret. Comput. Geom. Nir Ailon, Edo Liberty
2009	J	`jnl`	Self-Improving Algorithms CoRR Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri
2009	—	`conf`	Streaming k-means approximation. NIPS Nir Ailon, Ragesh Jaiswal, Claire Monteleoni
2009	J	`jnl`	The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors. SIAM J. Comput. Nir Ailon, Bernard Chazelle
2008	J	`jnl`	A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables CoRR Nir Ailon
2008	J	`jnl`	Aggregating inconsistent information: Ranking and clustering. J. ACM Nir Ailon, Moses Charikar, Alantha Newman
2008	A*	`conf`	An Efficient Reduction of Ranking to Classification. COLT Nir Ailon, Mehryar Mohri
2008	—	`conf`	Dense Fast Random Projections and Lean Walsh Transforms. APPROX-RANDOM Edo Liberty, Nir Ailon, Amit Singer
2008	A*	`conf`	Fast dimension reduction using Rademacher series on dual BCH codes. SODA Nir Ailon, Edo Liberty
2008	J	`jnl`	Property-Preserving Data Reconstruction. Algorithmica Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
2008	—	`conf`	Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking. NIPS Nir Ailon
2008	J	`jnl`	Theory research at Google. SIGACT News Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos
2007	A*	`conf`	Aggregation of partial rankings, SODA Nir Ailon
2007	J	`jnl`	An efficient reduction of ranking to classification CoRR Nir Ailon, Mehryar Mohri
2007	J	`jnl`	Estimating the distance to a monotone function. Random Struct. Algorithms Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
2007	J	`jnl`	Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. Electron. Colloquium Comput. Complex. Nir Ailon, Edo Liberty
2007	J	`jnl`	Hardness of fully dense problems. Inf. Comput. Nir Ailon, Noga Alon
2006	A*	`conf`	Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. STOC Nir Ailon, Bernard Chazelle
2006	J	`jnl`	Information theory in property testing and monotonicity testing in higher dimension. Inf. Comput. Nir Ailon, Bernard Chazelle
2006	B	`conf`	On Clusters in Markov Chains. LATIN Nir Ailon, Steve Chien, Cynthia Dwork
2006	A*	`conf`	Self-improving algorithms. SODA Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
2005	A*	`conf`	Aggregating inconsistent information: ranking and clustering. STOC Nir Ailon, Moses Charikar, Alantha Newman
2005	A*	`conf`	Fitting tree metrics: Hierarchical clustering and Phylogeny. FOCS Nir Ailon, Moses Charikar
2005	A	`conf`	Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. STACS Nir Ailon, Bernard Chazelle
2005	J	`jnl`	Lower bounds for linear degeneracy testing. J. ACM Nir Ailon, Bernard Chazelle
2004	—	`conf`	Estimating the Distance to a Monotone Function. APPROX-RANDOM Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
2004	J	`jnl`	Information Theory in Property Testing and Monotonicity Testing in Higher Dimension Electron. Colloquium Comput. Complex. Nir Ailon, Bernard Chazelle
2004	A*	`conf`	Lower bounds for linear degeneracy testing. STOC Nir Ailon, Bernard Chazelle
2004	B	`conf`	Property-Preserving Data Reconstruction. ISAAC Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu