Nir Ailon

Computer Science · Physical Sciences

26h-index3.6kcitations107works2.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Machine Learning and Algorithms(33), Complexity and Algorithms in Graphs(22), Sparse and Compressive Sensing Techniques(20), Optimization and Search Problems(17), Data Management and Algorithms(16)

Publications107 total

Puzzle: Distillation-Based NAS for Inference-Optimized LLMs
arXiv (Cornell University)·2024· 2 citedOpen Access
Efficient NTK using Dimensionality Reduction
arXiv (Cornell University)·2022Open Access
More Side Information, Better Pruning: Shared-Label Classification as a Case Study
2021
The complexity of computing (almost) orthogonal matrices with ε-copies of the Fourier transform
Information Processing Letters·2020Open Access
Sparse Linear Networks with a Fixed Butterfly Structure: Theory and Practice
arXiv (Cornell University)·2020· 5 citedOpen Access
Paraunitary matrices, entropy, algebraic condition number and Fourier computation
Theoretical Computer Science·2020· 2 citedOpen Access
Interesting Open Problem Related to Complexity of Computing the Fourier Transform and Group Theory
arXiv (Cornell University)·2019Open Access
Approximate Correlation Clustering Using Same-Cluster Queries
Lecture notes in computer science·2018· 2 citedOpen Access
Approximate Clustering with Same-Cluster Queries
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2018· 11 citedOpen Access
A New and Flexible Approach to the Analysis of Paired Comparison Data
Journal of Machine Learning Research·2018· 9 cited
Approximate Clustering with Same-Cluster Queries
arXiv (Cornell University)·2017· 6 citedOpen Access
Semi-supervised deep learning by metric embedding
arXiv (Cornell University)·2017· 5 citedOpen Access
Spatial contrasting for deep unsupervised learning
arXiv (Cornell University)·2016· 1 citedOpen Access
Semi-supervised deep learning by metric embedding
arXiv (Cornell University)·2016· 28 citedOpen Access
Deep unsupervised learning through spatial contrasting
arXiv (Cornell University)·2016· 14 citedOpen Access
Paraunitary Matrices, Entropy, Algebraic Condition Number and Fourier\n Computation
arXiv (Cornell University)·2016Open Access
Bandit online optimization over the permutahedron
Theoretical Computer Science·2016· 4 cited
Tight lower bound instances for k-means++ in two dimensions
Theoretical Computer Science·2016· 9 cited
The Complexity of Computing (Almost) Unitary Matrices With $\eps$-Copies of the Fourier Transform
arXiv (Cornell University)·2016Open Access
The Complexity of Computing a Fourier Perturbation.
arXiv (Cornell University)·2016Open Access
page 1 of 6Next →

Frequent Co-authors

Edo Liberty(10), Bernard Chazelle(9), C. Seshadhri(5), Moses Charikar(4), Ragesh Jaiswal(3), Elad Hoffer(3), Ding Liu(3), Yudong Chen(3), Huan Xu(3), Alantha Newman(2), Zohar Karnin(2), Mehryar Mohri(2), Ding Liu(2), Amit Singer(2), Noa Avigdor-Elgrabli(2), Anke van Zuylen(2), Ron Begleiter(2), Esther Ezra(2), Anup Bhattacharya(2), Claire Monteleoni(1)