The final project in the course will involve reading a research-level paper and either summarizing it or giving a short presentation, depending on the amount of students that will take the course for credit. This may include linking out to related open research directions and making some progress along them.
Papers for Final Project
- Inductive proof Majority is Stablest
- AND Testing
- Hypercontractivity on the symmetric group
- Gaussian Noise Sensitivity and Fourier Tails
- Gaussian Bounds for Noise Correlation of Functions
- Testing Juntas
- Degree vs. Approximate Degree and Quantum Implications of Huang’s Sensitivity Theorem
- Polynomial bounds for decoupling, with applications
- Local Chernoff
- Towards a Proof of the Fourier–Entropy Conjecture?
- Quadratic Goldreich-Levin Theorems
- Reed-Muller Codes Achieve Capacity on Erasure Channels
- Noise sensitivity on the p-biased hypercube
- XOR Lemmas for Resilient Functions Against Polynomials
- Decision list compression by mild random restrictions
- Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions
- On the structure of subsets of the discrete cube with small edge boundary
- On the Fourier tails of bounded functions over the discrete cube
- A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs
- Reverse hypercontractivity and applications
- Decision trees and influences
- Fourier entropy for classes of functions
- Group mixing
- Pseudorandom Generators for Read-Once Branching Programs, in any Order
- Fooling Gaussian PTFs via Local Hyperconcentration
- The Correct Exponent for the Gotsman-Linial Conjecture
- Improved lower bounds for embeddings into L1
- Concentration on the Boolean hypercube via pathwise stochastic analysis
- Second-order bounds on correlations between increasing families
