We stand with Ukraine

We stand with Ukraine

Nir Ailon

Affiliations:

Technion Israel Institute of Technology, Israel

According to our database¹, Nir Ailon authored at least 65 papers between 2004 and 2022.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2022

Efficient NTK using Dimensionality Reduction.

[BibT_eX]

[DOI]

,

CoRR, 2022

2021

The complexity of computing (almost) orthogonal matrices with <i>ε</i>-copies of the Fourier transform.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2021

Sparse linear networks with a fixed butterfly structure: theory and practice.

[BibT_eX]

[DOI]

,

Omer Leibovitch

,

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

2020

Paraunitary matrices, entropy, algebraic condition number and Fourier computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

2019

Interesting Open Problem Related to Complexity of Computing the Fourier Transform and Group Theory.

[BibT_eX]

[DOI]

CoRR, 2019

2018

A New and Flexible Approach to the Analysis of Paired Comparison Data.

[BibT_eX]

[DOI]

Ivo F. D. Oliveira

,

,

J. Mach. Learn. Res., 2018

Approximate Correlation Clustering Using Same-Cluster Queries.

[BibT_eX]

[DOI]

,

Anup Bhattacharya

,

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Approximate Clustering with Same-Cluster Queries.

[BibT_eX]

[DOI]

,

Anup Bhattacharya

,

,

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Semi-supervised deep learning by metric embedding.

[BibT_eX]

[DOI]

,

Proceedings of the 5th International Conference on Learning Representations, 2017

2016

An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2016

Tight lower bound instances for k-means++ in two dimensions.

[BibT_eX]

[DOI]

Anup Bhattacharya

,

,

Theor. Comput. Sci., 2016

Bandit online optimization over the permutahedron.

[BibT_eX]

[DOI]

,

,

Theor. Comput. Sci., 2016

Spatial contrasting for deep unsupervised learning.

[BibT_eX]

[DOI]

,

,

CoRR, 2016

Deep unsupervised learning through spatial contrasting.

[BibT_eX]

[DOI]

,

,

CoRR, 2016

The Complexity of Computing a Fourier Perturbation.

[BibT_eX]

[DOI]

,

CoRR, 2016

2015

Iterative and active graph clustering using trace norm minimization without cluster size constraints.

[BibT_eX]

[DOI]

,

,

J. Mach. Learn. Res., 2015

Deep metric learning using Triplet network.

[BibT_eX]

[DOI]

,

Proceedings of the 3rd International Conference on Learning Representations, 2015

Tighter Fourier Transform Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Fast and RIP-Optimal Transforms.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 2014

A Tighter Lower Bound For Fourier Transform in the Well Conditioned Model.

[BibT_eX]

[DOI]

CoRR, 2014

An n\log n Lower Bound for Fourier Transform Computation in the Well Conditioned Model.

[BibT_eX]

[DOI]

CoRR, 2014

A Tight Lower Bound Instance for k-means++ in Constant Dimension.

[BibT_eX]

[DOI]

Anup Bhattacharya

,

,

Proceedings of the Theory and Applications of Models of Computation, 2014

Reducing Dueling Bandits to Cardinal Bandits.

[BibT_eX]

[DOI]

,

Zohar Shay Karnin

,

Thorsten Joachims

Proceedings of the 31th International Conference on Machine Learning, 2014

Improved Bounds for Online Learning Over the Permutahedron and Other Ranking Polytopes.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014

2013

An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform.

[BibT_eX]

[DOI]

,

ACM Trans. Algorithms, 2013

Bandit Online Optimization Over the Permutahedron.

[BibT_eX]

[DOI]

CoRR, 2013

Online Ranking: Discrete Choice, Spearman Correlation and Other Feedback.

[BibT_eX]

[DOI]

CoRR, 2013

A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2013

Threading machine generated email.

[BibT_eX]

[DOI]

,

Zohar Shay Karnin

,

,

Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

Breaking the Small Cluster Barrier of Graph Clustering.

[BibT_eX]

[DOI]

,

,

Proceedings of the 30th International Conference on Machine Learning, 2013

Learning and Optimizing with Preferences.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

2012

Improved Approximation Algorithms for Bipartite Correlation Clustering.

[BibT_eX]

[DOI]

,

Noa Avigdor-Elgrabli

,

,

Anke van Zuylen

SIAM J. Comput., 2012

Active Learning Using Smooth Relative Regret Approximations with Applications.

[BibT_eX]

[DOI]

,

,

Proceedings of the COLT 2012, 2012

An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2012

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

[BibT_eX]

[DOI]

,

Zohar Shay Karnin

CoRR, 2012

Active Learning of Custering with Side Information Using $\eps$-Smooth Relative Regret Approximations

[BibT_eX]

[DOI]

,

CoRR, 2012

2011

Self-Improving Algorithms.

[BibT_eX]

[DOI]

,

Bernard Chazelle

,

Kenneth L. Clarkson

,

,

Wolfgang Mulzer

,

SIAM J. Comput., 2011

Fitting Tree Metrics: Hierarchical Clustering and Phylogeny.

[BibT_eX]

[DOI]

,

SIAM J. Comput., 2011

Dense Fast Random Projections and Lean Walsh Transforms.

[BibT_eX]

[DOI]

,

,

Discret. Comput. Geom., 2011

A New Active Learning Scheme with Applications to Learning to Rank from Pairwise Preferences

[BibT_eX]

[DOI]

,

,

CoRR, 2011

Ranking from pairs and triplets: information quality, evaluation methods and query complexity.

[BibT_eX]

[DOI]

,

Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Active Learning Ranking from Pairwise Preferences with Almost Optimal Query Complexity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2010

Preference-based learning to rank.

[BibT_eX]

[DOI]

,

Mach. Learn., 2010

An Improved Algorithm for Bipartite Correlation Clustering

[BibT_eX]

[DOI]

,

Noa Avigdor-Elgrabli

,

CoRR, 2010

Query Efficient PTAS for Minimum Feedback Arc-Set in Tournaments

[BibT_eX]

[DOI]

CoRR, 2010

Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform

[BibT_eX]

[DOI]

,

CoRR, 2010

Faster dimension reduction.

[BibT_eX]

[DOI]

,

Bernard Chazelle

Commun. ACM, 2010

Aggregation of Partial Rankings, <i>p</i>-Ratings and Top-<i>m</i> Lists.

[BibT_eX]

[DOI]

Algorithmica, 2010

2009

The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors.

[BibT_eX]

[DOI]

,

Bernard Chazelle

SIAM J. Comput., 2009

Streaming k-means approximation.

[BibT_eX]

[DOI]

,

,

Claire Monteleoni

Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems.

[BibT_eX]

[DOI]

,

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information Retrieval, 2009

2008

Theory research at Google.

[BibT_eX]

[DOI]

,

,

Florin Constantin

,

,

,

Gereon Frahling

,

Monika Rauch Henzinger

,

S. Muthukrishnan

,

,

,

,

Anastasios Sidiropoulos

SIGACT News, 2008

Aggregating inconsistent information: Ranking and clustering.

[BibT_eX]

[DOI]

,

,

J. ACM, 2008

Property-Preserving Data Reconstruction.

[BibT_eX]

[DOI]

,

Bernard Chazelle

,

Seshadhri Comandur

,

Algorithmica, 2008

Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 21, 2008

An Efficient Reduction of Ranking to Classification.

[BibT_eX]

[DOI]

,

Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007

Estimating the distance to a monotone function.

[BibT_eX]

[DOI]

,

Bernard Chazelle

,

Seshadhri Comandur

,

Random Struct. Algorithms, 2007

Hardness of fully dense problems.

[BibT_eX]

[DOI]

,

Inf. Comput., 2007

Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes.

[BibT_eX]

[DOI]

,

Electron. Colloquium Comput. Complex., 2007

2006

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform.

[BibT_eX]

[DOI]

,

Bernard Chazelle

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Self-improving algorithms.

[BibT_eX]

[DOI]

,

Bernard Chazelle

,

Seshadhri Comandur

,

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

On Clusters in Markov Chains.

[BibT_eX]

[DOI]

,

,

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Lower bounds for linear degeneracy testing.

[BibT_eX]

[DOI]

,

Bernard Chazelle

J. ACM, 2005

2004

Information Theory in Property Testing and Monotonicity Testing in Higher Dimension

[BibT_eX]

[DOI]

,

Bernard Chazelle

Electron. Colloquium Comput. Complex., 2004

Loading...