20 citations · 42 across the 28 of their papers we have counts for
34 papers
From Chunks to Functional Evidence: Function-Aware Retrieval for EDA Documentation QA
Xiaotian Qiu, Kairui Liu, Shi Chenyi +3
Retrieval-Augmented Generation (RAG) is widely used to ground answers in documents. For complex technical documentation, however, the primary bottleneck is often not model reasonin…
Sharper Bounds for the Complex Grothendieck Constant
Steven Heilman, Chris Jones, Giulio Malavolta
We show that , where is the complex Grothendieck constant. The upper bound improves on Haagerup's bound of $1.40490913\ldots…
Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT
Steven Heilman
Assuming the Unique Games Conjecture, we show it is NP-hard to approximate MAX-3-CUT within a multiplicative factor of for every , where is th…
On the Convergence of Adam, Revisited
Steven Heilman, Sampad Mohanty
We show that projected Adam for online optimization with arbitrary moment decay parameters can have average regret bounded away from zero. A similar result of Red…
An Upper Bound on Grothendieck's Constant
Steven Heilman
We show that Grothendieck's real constant can be upper bounded by projecting vectors onto a random plane through the origin and thresholding a degree five Hermite polynomial.…
Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools
Alina Du, Steven Heilman, Greta Panova
We give new examples of graphs and trees with dominating set sequences that are not log-concave. These examples were generated by PatternBoost, a transformer-based reinforcement le…