No article text was recorded for this version.
spectral analysis of Boolean functions
Version 1 of 168 papers84 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Testing Odd-Cycle-Freeness in Boolean Functions
- Blog: A class of functions with low-valued Walsh spectrum
- Blog: Detecting controlling nodes of boolean regulatory networks
- Blog: Several new classes of (balanced) Boolean functions with few Walsh transform values
- Blog: Special Issue on Analysis of Boolean Functions: Guest Editors' Foreword
- Blog: Reinforcement learning for constructing low density sign representations of Boolean functions
- Blog: A Query Algorithm for Agnostically Learning DNF?
- Blog: A Note on the Entropy/Influence Conjecture
- Blog: An Improved Upper Bound for the Most Informative Boolean Function Conjecture
- Blog: A generalization of a theorem of Rothschild and van Lint
- Blog: The Query Complexity of Mastermind with lp Distances
- Blog: Synthetic Combinations: A Causal Inference Framework for Combinatorial Interventions
- Blog: On Robust Concepts and Small Neural Nets
- Blog: Hyperparameter optimization: a spectral approach
- Blog: Approximate polymorphisms
- Blog: Hypercontractivity of Spherical Averages in Hamming Space
- Blog: Bipartite perfect matching as a real polynomial
- Blog: Minimum Distance between Bent and 1-resilient Boolean Functions
- Blog: On the correlation of increasing families
- Blog: Learning to Reason with Neural Networks: Generalization, Unseen Data and Boolean Measures
- Blog: Toward the Impossibility of Perfect Complete Quantum PKE from OWFs
- Blog: Tight Bounds for the Subspace Sketch Problem with Applications
- Blog: Learning DNF Expressions from Fourier Spectrum
- Blog: An improved upper bound for the most informative boolean function conjecture
- Blog: A Generalization of a Theorem of Rothschild and van Lint
- Blog: Epistatic Net allows the sparse spectral regularization of deep neural networks for inferring fitness functions
- Blog: Pseudorandomness Properties of Random Reversible Circuits
- Blog: Harmonic Analysis of Boolean Networks: Determinative Power and Perturbations
- Blog: Sum-of-Squares Hierarchies for Binary Polynomial Optimization
- Blog: Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
- Blog: The Need for Structure in Quantum Speedups
- Blog: Probabilistic Factorial Experimental Design for Combinatorial Interventions
- Blog: Learning Coverage Functions
- Blog: Low Bias Low Variance Gradient Estimates for Boolean Stochastic Networks
- Blog: Junta correlation is testable
- Blog: Heuristic algorithms for obtaining Polynomial Threshold Functions with low densities.
- Blog: Generalization on the Unseen, Logic Reasoning and Degree Curriculum
- Blog: Quantum Advantage in Non-Interactive Source Simulation
- Blog: When do neural networks learn world models?
- Blog: SPEX: Scaling Feature Interaction Explanations for LLMs
- Blog: Towards the Pseudorandomness of Expander Random Walks for Read-Once ACC0 circuits
- Blog: Distributed Source Simulation With No Communication
- Blog: Sharper bounds on the Fourier concentration of DNFs
- Blog: Two Dictator Functions Maximize Mutual Information
- Blog: Majority dynamics and aggregation of information in social networks
- Blog: Coin flipping from a cosmic source: On error correction of truly random bits
- Blog: Dictatorship is the Most Informative Balanced Function at the Extremes
- Blog: Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371)
- Blog: Idempotents in the Neighbourhood of Patterson-Wiedemann Functions having Walsh Spectra Zeros
- Blog: Sketching Approximability of (Weak) Monarchy Predicates
- Blog: Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions
- Blog: Sum-Of-Squares Bounds via Boolean Function Analysis
- Blog: Neural Computing with Small Weights
- Blog: On Non-Interactive Simulation of Distributed Sources with Finite Alphabets
- Blog: Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 24381)
- Blog: On the Sub-Optimality of Single-Letter Coding Over Networks
- Blog: Expressivity of Variational Quantum Machine Learning on the Boolean Cube
- Blog: Computing with Almost Optimal Size Neural Networks
- Blog: Testing Linear-Invariant Non-Linear Properties
- Blog: Pseudorandomness for Regular Branching Programs via Fourier Analysis
Showing 60 of 68 papers.
History & citation
Current · Permanent link
- Fourier Analysis of Boolean Functions merged into this direction (57% overlap)
- Min-Degree Bias in Neural Network Generalization merged into this direction (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_spectral_analysis_of_boolean_functions_ebd56917,
title = {spectral analysis of Boolean functions},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/spectral-analysis-of-boolean-functions/rdr_ebd56917bcc74b4e929a39e884ee9869},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_spectral_analysis_of_boolean_functions_ebd56917_v1,
title = {spectral analysis of Boolean functions},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/spectral-analysis-of-boolean-functions/rdr_ebd56917bcc74b4e929a39e884ee9869/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}