2 citations · 3 across the 7 of their papers we have counts for
8 papers
Graph Coarsening Enables Escaping Local Optima in Compute-Constrained Nonconvex MAX-CUT
M. Harper Langston, Pierre-David Letourneau, Dalton Jones +7
Because its binary optimization landscape contains exponentially many local optima, MAX-CUT is highly sensitive to initialization. We study Particle Polynomial Relaxation (PPR), a…
PADRe: A Unifying Polynomial Attention Drop-in Replacement for Efficient Vision Transformer
Pierre-David Letourneau, Manish Kumar Singh, Hsin-Pai Cheng +6
We present Polynomial Attention Drop-in Replacement (PADRe), a novel and unifying framework designed to replace the conventional self-attention mechanism in transformer models. Not…
An Efficient Framework for Global Non-Convex Polynomial Optimization with Algebraic Constraints
Mitchell Tong Harris, Pierre-David Letourneau, Dalton Jones +1
We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of…
A Sparse Fast Chebyshev Transform for High-Dimensional Approximation
Dalton Jones, Pierre-David Letourneau, Matthew J. Morse +1
We present the Fast Chebyshev Transform (FCT), a fast, randomized algorithm to compute a Chebyshev approximation of functions in high-dimensions from the knowledge of the location…
An Efficient Framework for Global Non-Convex Polynomial Optimization over the Hypercube
Pierre-David Letourneau, Dalton Jones, Matthew Morse +1
We present a novel efficient theoretical and numerical framework for solving global non-convex polynomial optimization problems. We analytically demonstrate that such problems can…
HACCLE: Metaprogramming for Secure Multi-Party Computation -- Extended Version
Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik +17
Cryptographic techniques have the potential to enable distrusting parties to collaborate in fundamentally new ways, but their practical implementation poses numerous challenges. An…
A sparse multidimensional FFT for real positive vectors
Pierre-David Letourneau, Harper Langston, Benoit Meister +1
We present a sparse multidimensional FFT (sMFFT) randomized algorithm for real positive vectors. The algorithm works in any fixed dimension, requires (O(R log(R) log(N)) ) samples…
Huygens-Fresnel wavefront tracing in non-uniform media
F. A. Volpe, P. -D. Letourneau, A. Zhao
We present preliminary results on a novel numerical method describing wave propagation in non-uniform media. Following Huygens-Fresnel' principle, we model the wavefront as an arra…