Circuit Complexity
Circuit complexity studies the resources (size and depth) required to compute functions using Boolean circuits, a fundamental model in computer science. Current research focuses on analyzing the circuit complexity of neural network architectures like transformers and graph neural networks, relating their expressive power to formal language classes and logical formalisms, and investigating the representation complexity of reinforcement learning algorithms. These investigations provide insights into the limitations and capabilities of various computational models, impacting the design of efficient algorithms and the understanding of learnability in machine learning.
Papers
November 12, 2024
November 8, 2024
October 31, 2024
October 7, 2024
August 22, 2024
December 6, 2023
October 5, 2023
October 3, 2023
June 25, 2023
April 17, 2023
March 8, 2023
February 28, 2023
May 17, 2022
April 13, 2022
February 7, 2022