Talks

Talks:

Daniel M. Kane Ak Testing of Distributions FODSI Workshop on Sublinear Algorithms, August 2022, USC Prob/Stat Seminar 2022, UW-Madison Theory Seminar November 2022.
Daniel M. Kane Non-Gaussian Component Analysis via Lattice Basis Reduction COLT June 2022.
Daniel M. Kane The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals Talk for UCSD theory seminar, May 2022.
Daniel M. Kane SQ Lower Bounds for Learning Halfspaces with Massart Noise Talk for Simons Institute Workshop on Rigorous Evidence for Information-Computation Trade-offs, September 2021.
Daniel M. Kane Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models Talk for the SoS+TCS Reading group, March 2021.
Daniel M. Kane Point Location and Active Learning: Learning Halfspaces Almost Optimally One World Mathematics of INformation, Data, and Signals (1W-MINDS) Seminar January 2021, University of Texas at Austin Theory Seminar, March 2021.
Daniel M. Kane Robust Learning of Mixtures of Gaussians SODA January 2021.
Daniel M. Kane Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models FOCS October 2020, Simons Institute workshop on learning and testing in high dimensions, December 2020.
Daniel M. Kane STOC 2019 Tutorial on Recent Advances in High-Dimensional Robust Statistics Learning Gaussian Covariance Robustly, Robust Sparse Statistics, Robust List Decoding and Utilizing High Degree Moments, June 2019.
Daniel M. Kane Robust List Decoding of Spherical Gaussians Simons Institute Robust and High Dimensional Statistics Workshop, October 2018.
Daniel M. Kane Quantum Money From Modular Forms Open questions in number theory and cryptography conference, September 2018.
Daniel M. Kane List Decoding via Filters, TTIC Robust Statistics Workshop, August 2018.
Daniel M. Kane Statistical Query Lower Bounds for Robust Statistics Problems, TTIC Robust Statistics Workshop, August 2018.
Daniel M. Kane Learning Gaussian Covariance Robustly, TTIC Robust Statistics Workshop, August 2018.
Daniel M. Kane Sample Complexity and Good Sets, TTIC Robust Statistics Workshop, August 2018.
Daniel M. Kane Fooling Fourier Shapes, Oxford Complexity Theory Workshop, July 2018.
Daniel M. Kane List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussians, Symposium on the Theory Of Computation (STOC), June 2018.
Invited to give a talk at Open questions in number theory and cryptography conference in celebration of Alice Silverberg's 60th birthday.
Invited to give a talk at HALG 2018
Daniel M. Kane Recent Advances in High Dimensional Robust Statistics Institute for Advanced Study, December 2017.
Daniel M. Kane Recent Results on The Queen Packing Problem UC Berkeley Combinatorics seminar, February 2017.
Daniel M. Kane A New Approach to Distribution Testing, UCSD CS Theory Seminar, October 2015; Harvard CS Theory Seminar, August 2016; Banff Center Complexity Theory Workshop, September 2016.
Daniel M. Kane Average Phi-Selmer of Elliptic Curves, Arithmetic Statistics and Cohen Lenstra Heuristics Workshop at Warwick, June 2016.
Daniel M. Kane A Polylogarithmic PRG for Degree-2 PTFs in the Gaussian Setting, Conference on Computational Complexity, June 2015.
Daniel M. Kane Connection Regions on a Randomly Colored Board given at the awards ceremony for the UCSD honors math contest, May 2015.
Daniel M. Kane On a Problem Related to the ABC Conjecture given at Southern California Number Theory Day, October 2014.
Daniel M. Kane The Average Sensitivity of an Intersection of Halfspaces, Symposium on the Theory of Computation, June 2014.
Daniel M. Kane On a Problem Related to the ABC Conjecture given at CMU March 2014.
Daniel M. Kane An Optimal Algorithm for the Distinct Elements Problem (joint work with Jelani Nelson and David Woodruff) given at UCSD February 2014; UW-Madison March 2014.
Daniel M. Kane A Pseudorandom Generator for Polynomial Threshold Functions with Subpolynomial Seed Length MIT Algorithms and Complexity Seminar, November 2013; UCSD CS Theory Seminar, October 2014; short version given at Conference on Computational Complexity, June 2014.
Daniel M. Kane Dropping Lowest Grades Stanford math undergraduate colloquium, October 2013; UCSD Math 196 (undergrad colloquium) talk, October 2014.
Daniel M. Kane, Raghu Meka, A PRG for Lipchitz Functions of Polynomials with Applications to Sparest Cut, Symposium on the Theory Of Computation, June 2013.
Daniel M. Kane The Correct Exponent for the Gotsman-Linial Conjecture, Conference on Computational Complexity, June 2013; Longer, informal talk at the Microsoft Research/MIT Theory Reading Group, May 2013; Stanford theory lunch, June 2014.
Daniel M. Kane Bounds on the Independence Required for Cuckoo Hashing (joint work with Jeffery Cohen) CMU Seminar on Algorithms, Combinatorics, and Optimization, April 2013.
Daniel M. Kane The Asymptotics of Partitions without k-Sequences (joint work with Robert Rhoades) American Mathematical Society Special Session on The Influence of Ramanujan on His 125th Birthday, Joint Mathematics Meetings, San Diego, CA, January 2013. Longer version, given at Bay Area Discrete Math Day (BAD Math Day), April 2013.
Daniel M. Kane Diffuse Decompositions of Polynomials, Symposium on the Analysis of Boolean Functions: New Directions and Applications, St. John Virgin Islands, February 2012; MIT Probability Seminar, Cambridge MA, March 2012; San Jose State University Mathematics Colloquium, San Jose CA, November 2012; short version at Symposium on the Foundations of Computer Science (FOCS), New Brunswick NJ, October 2012; Stanford University Probability Seminar, Stanford, CA, December 2012; IAS Computer Science/Discrete Math Seminar April, 2013; Columbia CS Theory Seminar, April 2013; University of Wisconsin-Madison Number Theory-Representation Theory Seminar November 2013; Courant Institute December 2013; UCSD January 2014; CMU March 2014; University of Edinburgh, November 2014; UCLA Analysis and PDE Seminar January 2017.
Daniel M. Kane The Number of Ways of Expressing a Number as a Binomial Coefficient, Stanford University Mathematical Organization talk, Stanford CA, October 2011.
Daniel M. Kane A Small PRG for Polynomial Threshold Functions of Gaussians, Symposium on the Foundations Of Computer Science (FOCS), Palm Springs CA, October 2011.
Daniel M. Kane Noise Sensitivity of Polynomial Threshold Functions, MSRI Workshop on Quantitative Geometry, Berkeley CA, August 2011.
Daniel M. Kane k-Independence Fools Polynomial Threshold Functions of Gaussians, Conference on Computational Complexity (CCC), San Jose CA, June 2011.
Daniel M. Kane Ranks of 2-Selmer of Twists of an Elliptic Curve, South Eastern Regional Meeting on Numbers (SERMON), Savannah GA, April 2011; Workshop on Arithmetic of Abelian Varieties in Families at Centre Interfacultaire Bernoulli (CIB), Lausanne Switzerland, November 2012; UCLA Number Theory Seminar, December 2013; Stanford Number Theory Seminar, January 2014; Longer version given at the Quebec-Vermont Number Theory Seminar, Montreal, January 2014.
Daniel M. Kane The FT-Mollification Method, Workshop on Analysis and Geometry of Polynomial Threshold Functions, Princeton NJ, October 2010.
Daniel M. Kane The ABC Conjecture Microsoft Research, Cambridge, MA, July 2010.
Daniel Kane The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions, Conference on Computational Complexity (CCC), Cambridge MA, June 2010; China Theory Week, Beijing China, September 2010.
Dan Gulotta, Daniel Kane, and Andrew Spann, Electoral Redistricting with Moment of Inertia and Diminishing Halves Models SIAM meeting, San Diego CA, July 2008.
Daniel M. Kane The Number of Ways of Expressing t as a Binomial Coefficient Joint Mathematics Meetings, January 2007.
Daniel M. Kane On Solving Games Constructed Using Both Shortened and Continued Conjunctive Sums Joint Mathematics Meetings, New Orleans LA, January 2006.
Daniel M. Kane Ergodic Properties of Group Extensions of Rank 1 Transformations Part II Mathfest, Providence RI, August 2004.