E
Eric Blais
Researcher at University of Waterloo
Publications - 79
Citations - 1689
Eric Blais is an academic researcher from University of Waterloo. The author has contributed to research in topics: Boolean function & Property testing. The author has an hindex of 18, co-authored 77 publications receiving 1515 citations. Previous affiliations of Eric Blais include McGill University & Autodesk.
Papers
More filters
Proceedings ArticleDOI
Lower Bounds for Testing Properties of Functions over Hypergrid Domains
TL;DR: In this paper, the communication complexity method was used to prove lower bounds on the number of queries required to test properties of functions with non-hypercube domains, such as monotonicity, the Lipschitz property, separate convexity, convexness, and monotoneity of higher-order derivatives.
Proceedings ArticleDOI
Lower Bounds for Testing Function Isomorphism
Eric Blais,Ryan O'Donnell +1 more
TL;DR: New lower bounds in the area of property testing of boolean functions are proved, showing that any non-adaptive algorithm for testing isomorphism to a function that ``strongly'' depends on $k$ variables requires $\log k - O(1)$ queries (assuming $k/n$ is bounded away from 1).
Proceedings Article
Polynomial Regression under Arbitrary Product Distributions.
TL;DR: In this article, the authors showed that the L 1 polynomial regression algorithm yields agnostic (tolerant to arbitrary noise) learning algorithms with respect to the class of threshold functions under certain restricted instance distributions.
Book ChapterDOI
Testing Boolean function isomorphism
Noga Alon,Eric Blais +1 more
TL;DR: This work considers the problem of testing whether two functions are isomorphic or far from being isomorphic with as few queries as possible and shows that the lower bound of Ω(n) queries for testing isomorphism to g holds for almost all functions g.
Book ChapterDOI
Tight Bounds for Testing k -Linearity
Eric Blais,Daniel M. Kane +1 more
TL;DR: Strong lower bounds on the query complexity for testing whether a function is k-linear are introduced and it is shown that for any \(k \le \frac n2\), at least k − o(k) queries are required to test k- linearity, and this lower bound is nearly tight.