default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNir Ailon
Person information
- affiliation: Technion Israel Institute of Technology, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i30]Nir Ailon, Supratim Shit:
Efficient NTK using Dimensionality Reduction. CoRR abs/2210.04807 (2022)- 2021
- [j28]Nir Ailon, Gal Yehuda:
The complexity of computing (almost) orthogonal matrices with ε-copies of the Fourier transform. Inf. Process. Lett. 165: 106024 (2021) - [c36]Nir Ailon, Omer Leibovitch, Vineet Nair:
Sparse linear networks with a fixed butterfly structure: theory and practice. UAI 2021: 1174-1184 - 2020
- [j27]Nir Ailon:
Paraunitary matrices, entropy, algebraic condition number and Fourier computation. Theor. Comput. Sci. 814: 234-248 (2020) - [i29]Nir Ailon, Omer Leibovitch, Vineet Nair:
Sparse Linear Networks with a Fixed Butterfly Structure: Theory and Practice. CoRR abs/2007.08864 (2020)
2010 – 2019
- 2019
- [i28]Nir Ailon:
Interesting Open Problem Related to Complexity of Computing the Fourier Transform and Group Theory. CoRR abs/1907.07471 (2019) - 2018
- [j26]Ivo F. D. Oliveira, Nir Ailon, Ori Davidov:
A New and Flexible Approach to the Analysis of Paired Comparison Data. J. Mach. Learn. Res. 19: 60:1-60:29 (2018) - [c35]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal
, Amit Kumar:
Approximate Clustering with Same-Cluster Queries. ITCS 2018: 40:1-40:21 - [c34]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal:
Approximate Correlation Clustering Using Same-Cluster Queries. LATIN 2018: 14-27 - 2017
- [c33]Elad Hoffer, Nir Ailon:
Semi-supervised deep learning by metric embedding. ICLR (Workshop) 2017 - [i27]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Approximate Clustering with Same-Cluster Queries. CoRR abs/1704.01862 (2017) - [i26]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal:
Approximate Correlation Clustering Using Same-Cluster Queries. CoRR abs/1712.06865 (2017) - 2016
- [j25]Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
Tight lower bound instances for k-means++ in two dimensions. Theor. Comput. Sci. 634: 55-66 (2016) - [j24]Nir Ailon, Kohei Hatano, Eiji Takimoto:
Bandit online optimization over the permutahedron. Theor. Comput. Sci. 650: 92-108 (2016) - [j23]Nir Ailon:
An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model. ACM Trans. Comput. Theory 8(1): 4:1-4:14 (2016) - [i25]Nir Ailon, Gal Yehuda:
The Complexity of Computing a Fourier Perturbation. CoRR abs/1604.02557 (2016) - [i24]Nir Ailon:
Paraunitary Matrices, Entropy, Algebraic Condition Number and Fourier Computation. CoRR abs/1609.03278 (2016) - [i23]Elad Hoffer, Itay Hubara, Nir Ailon:
Deep unsupervised learning through spatial contrasting. CoRR abs/1610.00243 (2016) - [i22]Elad Hoffer, Nir Ailon:
Semi-supervised deep learning by metric embedding. CoRR abs/1611.01449 (2016) - [i21]Elad Hoffer, Itay Hubara, Nir Ailon:
Spatial contrasting for deep unsupervised learning. CoRR abs/1611.06996 (2016) - 2015
- [j22]Nir Ailon, Yudong Chen, Huan Xu:
Iterative and active graph clustering using trace norm minimization without cluster size constraints. J. Mach. Learn. Res. 16: 455-490 (2015) - [c32]Nir Ailon:
Tighter Fourier Transform Lower Bounds. ICALP (1) 2015: 14-25 - [c31]Elad Hoffer, Nir Ailon:
Deep Metric Learning Using Triplet Network. SIMBAD 2015: 84-92 - [c30]Elad Hoffer, Nir Ailon:
Deep metric learning using Triplet network. ICLR (Workshop) 2015 - 2014
- [j21]Nir Ailon, Holger Rauhut:
Fast and RIP-Optimal Transforms. Discret. Comput. Geom. 52(4): 780-798 (2014) - [j20]Nir Ailon, Ron Begleiter, Esther Ezra:
Active learning using smooth relative regret approximations with applications. J. Mach. Learn. Res. 15(1): 885-920 (2014) - [c29]Nir Ailon:
Improved Bounds for Online Learning Over the Permutahedron and Other Ranking Polytopes. AISTATS 2014: 29-37 - [c28]Nir Ailon, Kohei Hatano, Eiji Takimoto:
Bandit Online Optimization over the Permutahedron. ALT 2014: 215-229 - [c27]Nir Ailon, Zohar Shay Karnin, Thorsten Joachims:
Reducing Dueling Bandits to Cardinal Bandits. ICML 2014: 856-864 - [c26]Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
A Tight Lower Bound Instance for k-means++ in Constant Dimension. TAMC 2014: 7-22 - [i20]Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
A tight lower bound instance for k-means++ in constant dimension. CoRR abs/1401.2912 (2014) - [i19]Nir Ailon:
An n\log n Lower Bound for Fourier Transform Computation in the Well Conditioned Model. CoRR abs/1403.1307 (2014) - [i18]Nir Ailon:
A Tighter Lower Bound For Fourier Transform in the Well Conditioned Model. CoRR abs/1404.1741 (2014) - [i17]Nir Ailon, Thorsten Joachims, Zohar Shay Karnin:
Reducing Dueling Bandits to Cardinal Bandits. CoRR abs/1405.3396 (2014) - 2013
- [j19]Nir Ailon:
A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy. Chic. J. Theor. Comput. Sci. 2013 (2013) - [j18]Nir Ailon, Edo Liberty:
An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. ACM Trans. Algorithms 9(3): 21:1-21:12 (2013) - [c25]Nir Ailon:
Learning and Optimizing with Preferences. ALT 2013: 13-21 - [c24]Nir Ailon, Yudong Chen, Huan Xu:
Breaking the Small Cluster Barrier of Graph Clustering. ICML (3) 2013: 995-1003 - [c23]Nir Ailon, Zohar Shay Karnin, Edo Liberty, Yoelle Maarek:
Threading machine generated email. WSDM 2013: 405-414 - [i16]Nir Ailon, Holger Rauhut:
Fast and RIP-optimal transforms. CoRR abs/1301.0878 (2013) - [i15]Nir Ailon, Yudong Chen, Huan Xu:
Breaking the Small Cluster Barrier of Graph Clustering. CoRR abs/1302.4549 (2013) - [i14]Nir Ailon:
A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy. CoRR abs/1305.4745 (2013) - [i13]Nir Ailon:
Online Ranking: Discrete Choice, Spearman Correlation and Other Feedback. CoRR abs/1308.6797 (2013) - [i12]Nir Ailon:
Bandit Online Optimization Over the Permutahedron. CoRR abs/1312.1530 (2013) - 2012
- [j17]Nir Ailon:
An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity. J. Mach. Learn. Res. 13: 137-164 (2012) - [j16]Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen:
Improved Approximation Algorithms for Bipartite Correlation Clustering. SIAM J. Comput. 41(5): 1110-1121 (2012) - [c22]Nir Ailon, Ron Begleiter, Esther Ezra:
Active Learning Using Smooth Relative Regret Approximations with Applications. COLT 2012: 19.1-19.20 - [i11]Nir Ailon, Ron Begleiter:
Active Learning of Custering with Side Information Using $\eps$-Smooth Relative Regret Approximations. CoRR abs/1201.6462 (2012) - [i10]Nir Ailon, Zohar Shay Karnin:
A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity. CoRR abs/1204.6588 (2012) - 2011
- [j15]Edo Liberty, Nir Ailon, Amit Singer:
Dense Fast Random Projections and Lean Walsh Transforms. Discret. Comput. Geom. 45(1): 34-44 (2011) - [j14]Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms. SIAM J. Comput. 40(2): 350-375 (2011) - [j13]Nir Ailon, Moses Charikar:
Fitting Tree Metrics: Hierarchical Clustering and Phylogeny. SIAM J. Comput. 40(5): 1275-1291 (2011) - [c21]Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen:
Improved Approximation Algorithms for Bipartite Correlation Clustering. ESA 2011: 25-36 - [c20]Nir Ailon:
Active Learning Ranking from Pairwise Preferences with Almost Optimal Query Complexity. NIPS 2011: 810-818 - [c19]Nir Ailon, Edo Liberty:
An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. SODA 2011: 185-191 - [c18]Kira Radinsky, Nir Ailon:
Ranking from pairs and triplets: information quality, evaluation methods and query complexity. WSDM 2011: 105-114 - [i9]Nir Ailon, Ron Begleiter, Esther Ezra:
A New Active Learning Scheme with Applications to Learning to Rank from Pairwise Preferences. CoRR abs/1110.2136 (2011) - 2010
- [j12]Nir Ailon:
Aggregation of Partial Rankings, p-Ratings and Top-m Lists. Algorithmica 57(2): 284-300 (2010) - [j11]Nir Ailon, Bernard Chazelle:
Faster dimension reduction. Commun. ACM 53(2): 97-104 (2010) - [j10]Nir Ailon, Mehryar Mohri:
Preference-based learning to rank. Mach. Learn. 80(2-3): 189-211 (2010) - [i8]Nir Ailon, Edo Liberty:
Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. CoRR abs/1005.5513 (2010) - [i7]Nir Ailon:
Query Efficient PTAS for Minimum Feedback Arc-Set in Tournaments. CoRR abs/1011.0108 (2010) - [i6]Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty:
An Improved Algorithm for Bipartite Correlation Clustering. CoRR abs/1012.3011 (2010)
2000 – 2009
- 2009
- [j9]Nir Ailon, Edo Liberty:
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. Discret. Comput. Geom. 42(4): 615-630 (2009) - [j8]Nir Ailon, Bernard Chazelle:
The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors. SIAM J. Comput. 39(1): 302-322 (2009) - [c17]Nir Ailon:
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables. ECIR 2009: 685-690 - [c16]Nir Ailon, Edo Liberty:
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems. ICALP (1) 2009: 24-36 - [c15]Nir Ailon, Ragesh Jaiswal, Claire Monteleoni:
Streaming k-means approximation. NIPS 2009: 10-18 - [i5]Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms. CoRR abs/0907.0884 (2009) - 2008
- [j7]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Property-Preserving Data Reconstruction. Algorithmica 51(2): 160-182 (2008) - [j6]Nir Ailon, Moses Charikar, Alantha Newman:
Aggregating inconsistent information: Ranking and clustering. J. ACM 55(5): 23:1-23:27 (2008) - [j5]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:
Theory research at Google. SIGACT News 39(2): 10-28 (2008) - [c14]Edo Liberty, Nir Ailon, Amit Singer:
Dense Fast Random Projections and Lean Walsh Transforms. APPROX-RANDOM 2008: 512-522 - [c13]Nir Ailon, Mehryar Mohri:
An Efficient Reduction of Ranking to Classification. COLT 2008: 87-98 - [c12]Nir Ailon:
Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking. NIPS 2008: 25-32 - [c11]Nir Ailon, Edo Liberty:
Fast dimension reduction using Rademacher series on dual BCH codes. SODA 2008: 1-9 - [i4]Nir Ailon:
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables. CoRR abs/0810.2764 (2008) - 2007
- [j4]Nir Ailon, Noga Alon:
Hardness of fully dense problems. Inf. Comput. 205(8): 1117-1129 (2007) - [j3]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Estimating the distance to a monotone function. Random Struct. Algorithms 31(3): 371-383 (2007) - [c10]Nir Ailon:
Aggregation of partial rankings, p-ratings and top-m lists. SODA 2007: 415-424 - [i3]Nir Ailon, Mehryar Mohri:
An efficient reduction of ranking to classification. CoRR abs/0710.2889 (2007) - [i2]Nir Ailon, Edo Liberty:
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j2]Nir Ailon, Bernard Chazelle:
Information theory in property testing and monotonicity testing in higher dimension. Inf. Comput. 204(11): 1704-1717 (2006) - [c9]Nir Ailon, Steve Chien, Cynthia Dwork:
On Clusters in Markov Chains. LATIN 2006: 43-55 - [c8]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Self-improving algorithms. SODA 2006: 261-270 - [c7]Nir Ailon, Bernard Chazelle:
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. STOC 2006: 557-563 - 2005
- [j1]Nir Ailon, Bernard Chazelle:
Lower bounds for linear degeneracy testing. J. ACM 52(2): 157-171 (2005) - [c6]Nir Ailon, Moses Charikar:
Fitting tree metrics: Hierarchical clustering and Phylogeny. FOCS 2005: 73-82 - [c5]Nir Ailon, Bernard Chazelle:
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. STACS 2005: 434-447 - [c4]Nir Ailon, Moses Charikar, Alantha Newman:
Aggregating inconsistent information: ranking and clustering. STOC 2005: 684-693 - 2004
- [c3]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Estimating the Distance to a Monotone Function. APPROX-RANDOM 2004: 229-236 - [c2]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Property-Preserving Data Reconstruction. ISAAC 2004: 16-27 - [c1]Nir Ailon, Bernard Chazelle:
Lower bounds for linear degeneracy testing. STOC 2004: 554-560 - [i1]Nir Ailon, Bernard Chazelle:
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. Electron. Colloquium Comput. Complex. TR04 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
