Currently

General Interest

  • Algorithms & Complexity.
  • Intersection of discrete and continuous math.
  • Trustworthy machine learning.
  • Functional programming between math discovery and computing practice.

With emphasis on theoretical foundations and provably guaranteed frameworks using proof and logic techniques.

Particular Curiousity

  • The internet revolutionized humanity’s connectivity, AI revolutionized information flow, but rarely do we cooperate. Socialists have ambitions for Collective Intelligence, A paradigm of AI which enables coherent cooperation among the crowd, but no technical progress of practical relevance is witnessed. In the same way Shafi and Silvio’s zero-knowledge proofs enabled a new kind of secure communication, collective intelligence could lead to a new kind of economic interaction. See Generative Social Choice.
  • Combinatorics is rooted in algorithmic toolboxes, but in the data driven world, statistics, algebra, analysis and topology are the mathematical underpinnings. Topological Combinatorics within the math community studies connections between Topology and Combinatorics. Spreer’s works are ambitious. Can we use Topological Combinatorics to reduce discrete algorithms to continuous ones, or to understand continuous algorithms through our combinatorial toolbox?
  • AI safety and understanding machine learning became very critical after their unexpected advancement. Moitra aims for understanding machine learning by its algorithmic aspects; Learning-augmented algorithms retains robustness of algorithms when predictions are inaccurate; Neuro-symbolic designs a hybrid of data-driven and symbolic-proven components. Nonetheless, Theory and logic are not catching up with the rapid progress of practitioners. Are there near-term intermediate approaches to bridge theory and practice?
  • Functional programming is a language that enables correct coding by definition. It is closer to a logician than a computer scientist who is used to machinery in Turing machines. Attempts like Lean and Terry Tao’s project explore how CS and LLM could contribute to mathematical discovery. Starth and Type Theory forall investigate math contributing to computing. Nowadays it is believed natural language is the future of computing, but what about formal languages?

Philosophy.

A CS theory is supposed to be abstract from specific applications, and yet explains or influences computing practice. CS theory may not solve useful problems but the conceptual idea and concepts are necessarily motivated by practice. Solutions tied to specific concrete problems loses the potential and power of abstraction. CS theory irrelevant to practice may advance math but then it won’t be a theory for computing. Tim’s beyond the worst-case analysis is inspiring. I will always be remembering Oded and Avi’s 1996 essay.

I care about humanity’s future and economic growth by means of leadership. Science’s intellectual progress is a social endeavour, and hence it is natural for a theorist to care about people, teaching, and communication.

Community.

I do moderate TCS’s awesome list, Getting the chance to meet students from all over the world.

Good Memories.

Family.

Mum & Dad (Lawyer), Brother (Athlete Coach), Sister (Passed out aged 14).