Ying Feng
Hi!
I am a third-year PhD student at MIT, where I am fortunate to be advised by Piotr Indyk. Before that, I was an undergrad at CMU.
My research is on the algorithm design for high-dimensional data. Recently, I’m interested in questions arising from efficient computation in machine learning systems.
Email: yingggfeng(at)gmail.com
Manuscripts
-
Attention under Bounded Key-Query Similarity: Space Complexity and Transformer Anisotropy
-
-
Ultra-Fast Deterministic Approximate Near Neighbor Search in High Dimensions
-
Condition-Number-Independent Sparse Linear Regression on Random Supports
Publications
2026
-
-
Fast Approximate Lp Chamfer Distance via Lopsided Embeddings and Structured JLTo appear in NeurIPS 2026
-
2025
-
On Differential Privacy for Adaptively Solving Search Problems via SketchingIn ICML 2025 (Selected for Oral Presentation)
-
2024
2023
-
-
A Fast Rescheduling Algorithm for Real-Time Multi-Robot Coordination (Extended Abstract)In SoCS 2023