Karl Wimmer
Karl Wimmer
Associate Professor of Mathematics, Duquesne University
Verified email at - Homepage
Cited by
Cited by
Testing Fourier dimensionality and sparsity
P Gopalan, R O'Donnell, RA Servedio, A Shpilka, K Wimmer
SIAM Journal on Computing 40 (4), 1075-1100, 2011
KKL, Kruskal--Katona, and monotone nets
R O'Donnell, K Wimmer
SIAM Journal on Computing 42 (6), 2375-2399, 2013
Polynomial regression under arbitrary product distributions
E Blais, R O’Donnell, K Wimmer
Machine learning 80 (2), 273-294, 2010
Approximation by DNF: examples and counterexamples
R O’Donnell, K Wimmer
International Colloquium on Automata, Languages, and Programming, 195-206, 2007
Invariance principle on the slice
Y Filmus, G Kindler, E Mossel, K Wimmer
ACM Transactions on Computation Theory (TOCT) 10 (3), 1-37, 2018
Approximate resilience, monotonicity, and the complexity of agnostic learning
D Dachman-Soled, V Feldman, LY Tan, A Wan, K Wimmer
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
Optimal query complexity for estimating the trace of a matrix
K Wimmer, Y Wu, P Zhang
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
Real analysis in computer science: A collection of open problems
Y Filmus, H Hatami, S Heilman, E Mossel, R O’Donnell, S Sachdeva, ...
Preprint available at https://simons. berkeley. edu/sites/default/files …, 2014
AC0∘ MOD2 lower bounds for the Boolean Inner Product
M Cheraghchi, E Grigorescu, B Juba, K Wimmer, N Xie
Journal of Computer and System Sciences 97, 45-59, 2018
Testing -Monotonicity
CL Canonne, E Grigorescu, S Guo, A Kumar, K Wimmer
arXiv preprint arXiv:1609.00265, 2016
Low influence functions over slices of the Boolean hypercube depend on few coordinates
K Wimmer
2014 IEEE 29th Conference on Computational Complexity (CCC), 120-131, 2014
Sharpness of KKL on Schreier graphs
R O'Donnell, K Wimmer
Testing linear-invariant function isomorphism
K Wimmer, Y Yoshida
International Colloquium on Automata, Languages, and Programming, 840-850, 2013
Agnostically learning under permutation invariant distributions
K Wimmer
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 113-122, 2010
Testing -Monotonicity: The Rise and Fall of Boolean Functions
CL Canonne, E Grigorescu, S Guo, A Kumar, K Wimmer
Theory of Computing 15 (1), 1-55, 2019
New results for random walk learning.
JC Jackson, K Wimmer
J. Mach. Learn. Res. 15 (1), 3635-3666, 2014
Testing data binnings
CL Canonne, K Wimmer
arXiv preprint arXiv:2004.12893, 2020
Tight lower bounds for testing linear isomorphism
E Grigorescu, K Wimmer, N Xie
International Workshop on Approximation Algorithms for Combinatorial …, 2013
Hardness of maximum likelihood learning of DPPs
E Grigorescu, B Juba, K Wimmer, N Xie
Conference on Learning Theory, 3800-3819, 2022
Flipping Out with Many Flips: Hardness of Testing -Monotonicity
E Grigorescu, A Kumar, K Wimmer
SIAM Journal on Discrete Mathematics 33 (4), 2111-2125, 2019
The system can't perform the operation now. Try again later.
Articles 1–20