معرفی
Mark Bun is an Assistant Professor in the Department of Computer Science at Boston University, affiliated with the College of Arts & Sciences. He specializes in theoretical computer science with a focus on data privacy, computational complexity, cryptography, and machine learning foundations. His work bridges discrete and continuous mathematical techniques, particularly using polynomial methods to analyze Boolean functions and develop privacy-preserving algorithms.
Education: PhD in Computer Science from Harvard University. Joined BU as a tenure-track faculty member in 2019 after a fellowship at UC Berkeley's Simons Institute for Theory of Computing.
Research Interests:
- Data privacy mechanisms (especially differential privacy)
- Computational complexity of privacy-preserving algorithms
- Connections between machine learning theory and privacy
- Boolean function analysis via polynomial approximations
Recent Work Trends: Focus on foundational limits of private learning, algorithmic frameworks for demographic fairness in data release, and memory-constrained statistical inference. Explores trade-offs between privacy guarantees, computational efficiency, and statistical accuracy across multiple domains.
Advising/Grants: No specific students/grants listed; research supported by theoretical CS funding streams.
Labs/Teams: Not explicitly mentioned, but collaborates widely in privacy theory and computational complexity communities.
