How to Explore or Contact the Polo Club of Data Science

Updated

The Polo Club of Data Science is a research group at Georgia Tech, and its official site is hosted at poloclub.github.io. You can use that page as your single entry point: it links to current members and alumni, lists research thrusts, and tracks recent publications and awards under a "Latest News" section. If you want to follow the lab's output, start with Latest News and the "More news ›" link; if you want to understand what they work on, read the four research sections described below. The site lists a location of Atlanta, GA 30332, United States, but no contact email, phone number, or office address appears in the available page content, so plan to reach out through the channels the site itself provides rather than expecting a direct contact block.

What the lab is

The Polo Club of Data Science at Georgia Tech describes its mission as building scalable, interactive, and interpretable tools that help people understand and interact with billion-scale data and machine learning models. Its stated research thrusts are:

  • Human-centered AI — interpretable, fair, and safe AI; adversarial machine learning
  • Large graph visualization and mining
  • Cybersecurity
  • Social good — health and energy applications

The site's own section headings mirror this structure: Human-Centered AI, Large Network Visualization, Scalable Graph Mining, and Cyber Security & Fraud.

How to track news and achievements

The Latest News section is the fastest way to see what the group has published or won. Entries in the available content include:

Date Item
2026 Dec Alec's Flow Reasoning Models paper accepted to NeurIPS'26 DiffuLM Workshop
2026 Dec Alec's Time Conditioning Optional for Flow Matching paper accepted to NeurIPS'26
2026 Nov Aeree's UNIPO won IEEE VIS'26 Best Short Paper, Honorable Mention
2026 Oct Polo was an invited participant at the Atlantic Council roundtable on identity security and national resilience
2026 Aug Anthony's RECAP paper accepted to EMNLP'26 main conference
2026 Aug Matthew's ComplicitSplat paper accepted to BMVC Main Conference
2026 Jun Polo gave a keynote, "Realistic Simulation as a Lens into Computer Vision Vulnerabilities," at the CVPR'26 SPAR-3D Workshop
2026 May Seongmin defended her CS PhD thesis
2026 Apr Austin won the CoC Outstanding Doctoral Dissertation Award
2026 Apr Grace and Sri both won the Donald V. Jackson Fellowship

A "More news ›" link follows the list, which is where you should go for anything older than the items shown.

How to see who is in the lab

The page lists current members and recent alumni together, with role labels. From the available content:

  • Current/recent members named: Seongmin (CS PhD), Ben (ML PhD), Anthony (CS PhD), Matthew (ML PhD), Alec (ML PhD), Mansi (CS PhD), Aeree (ML PhD), Alex (CS PhD), Alex (CSE PhD), Sri (CS Undergrad), Aishwarya (CS Undergrad), Rahul (CS Undergrad), Kunal (CS MS), Elliott (CS Undergrad), and Polo (professor).
  • Alumni destinations shown: Haekyu (Machine Learning Engineer, Stripe), Jay (Member of Technical Staff, OpenAI), Austin (Professor, Cal Poly), Sivapriya (AI Research, JPMorgan Chase), Harsha (Deep Learning Engineer, Toyon Research Corporation), Omar (CS PhD, Stanford), Megan (CS MS, Stanford), Alexander (CS PhD), Kevin (ML PhD, CMU), Pratham (Software Engineer, Figma), David (Machine Learning Engineer, Apple), Justin (Software Engineer, Meta), and Grace (CS PhD, MIT).

A "See all alum" link is provided for the full list. This is useful if you are checking whether a specific person was affiliated with the lab, or where graduates have gone.

How to understand the research projects

Each research thrust links to specific projects. The Human-Centered AI section, for example, points to:

  • UNIPO — visualizing how GRPO, DAPO, and other RL algorithms fine-tune LLMs, token by token (VIS Best Short Paper, Honorable Mention, VIS'26)
  • Flow Reasoning Models — turning flows into efficient recurrent reasoners (IBM, DiffuLM @ NeurIPS'26)
  • "What Time Is It?" — how data geometry makes time conditioning optional for flow matching (IBM, NeurIPS'26)
  • RECAP — RL post-training that teaches reasoning models to override flawed thinking (Meta, IBM, EMNLP'26 Main)
  • UMAP kNN Graph — making sense of dimensionality reduction through the lens of network science (deployed at Apple, TopoInVis@VIS'26)
  • ComplicitSplat — a 3D-related project (BMVC'26)

Reading the project titles alongside their venue labels is the quickest way to judge whether the lab's current direction matches your interest — for instance, if you care about LLM fine-tuning visualization, UNIPO and RECAP are the closest entry points.

Practical steps to explore or make contact

  1. Open poloclub.github.io and scan the four research sections to find the thrust closest to your interest.
  2. Check Latest News for recent papers; follow "More news ›" for the archive.
  3. Look at the member and alumni lists to identify who works on what, and use "See all alum" for the complete roster.
  4. For contact: the available page content does not include an email address, phone number, or office location beyond "Atlanta, GA 30332, United States." Since the site is hosted on GitHub Pages, the repository behind poloclub.github.io is a reasonable place to look for maintainer or contact information if the page itself does not surface it.

Common sticking points

  • No direct contact details on the page. Do not assume an email exists just because the lab is at a university; the content here only confirms the Atlanta, GA 30332 location.
  • Member list mixes current and recent. The page presents "Current Polo Club members and recent alum" together, so a name appearing there does not guarantee that person is still active in the lab.
  • News dates run ahead of the present. The entries shown are dated 2026, so treat them as the site's own published timeline rather than a live feed you can assume is current to today.
  • Project names are shorthand. Titles like "UNIPO" or "RECAP" are internal project names; use the linked pages and venue labels to understand what each one actually does.