|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 20 occurrences of 17 keywords
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
280 | Ilias Diakonikolas, Prahladh Harsha, Adam R. Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan |
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 533-542, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
average sensitivity, boolean function, fourier analysis, noise sensitivity, polynomial threshold function |
51 | Raghu Meka, David Zuckerman |
Pseudorandom generators for polynomial threshold functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 427-436, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
invariance principles, polynomials, pseudorandom generators, branching programs, threshold functions, halfspaces |
36 | Ryan O'Donnell, Rocco A. Servedio |
New degree bounds for polynomial threshold functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 325-334, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
ptfs, learning, lower bounds, polynomials, duality, degree, formulas, polynomial threshold functions |
34 | Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Sihan Liu, Nikos Zarifis |
Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2404.00529, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
34 | Zander Kelley, Raghu Meka |
Random Restrictions and PRGs for PTFs in Gaussian Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 21:1-21:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
34 | Zander Kelley, Raghu Meka |
Random restrictions and PRGs for PTFs in Gaussian Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
34 | Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan, Daniel Kane 0001 |
Fooling Gaussian PTFs via Local Hyperconcentration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.07809, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
34 | Zander Kelley, Raghu Meka |
Random restrictions and PRGs for PTFs in Gaussian Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.14134, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
34 | Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan |
Fooling Gaussian PTFs via local hyperconcentration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pp. 1170-1183, 2020, ACM, 978-1-4503-6979-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
34 | Ilias Diakonikolas, Daniel M. Kane |
Degree-푑 chow parameters robustly determine degree-푑 PTFs (and algorithmic applications). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019., pp. 804-815, 2019, ACM, 978-1-4503-6705-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
34 | Ilias Diakonikolas, Daniel Kane 0001 |
Degree-$d$ Chow Parameters Robustly Determine Degree-$d$ PTFs (and Algorithmic Applications). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR18, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
34 | Ilias Diakonikolas, Daniel M. Kane |
Degree-d Chow Parameters Robustly Determine Degree-d PTFs (and Algorithmic Applications). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1811.03491, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
25 | Adam R. Klivans, Alexander A. Sherstov |
Unconditional lower bounds for learning intersections of halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 69(2-3), pp. 97-114, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Intersections of halfspaces, Halfspace learning, SQ learning, Lower bounds for learning, Harmonic sieve, PAC learning, Query learning, Statistical queries, Polynomial threshold functions |
25 | Adam R. Klivans, Alexander A. Sherstov |
Improved Lower Bounds for Learning Intersections of Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings, pp. 335-349, 2006, Springer, 3-540-35294-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Brian R. Murphy, Monica S. Lam |
Program Analysis with Partial Transfer Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the 2000 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '00), Boston, Massachusetts, USA, January 22-23, 2000, pp. 94-103, 2000, ACM, 1-58113-201-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|