This paper outlines techniques for optimization of filter coefficients in a spectral framework for anomalous subgraph detection. Restricting the scope to the detection of a known signal in i.i.d. noise, the optimal coefficients for maximizing the signal's power are shown to be found via a rank-1 tensor approximation of the subgraph's dynamic topology. While this technique optimizes our power metric, a filter based on average degree is shown in simulation to work nearly as well in terms of power maximization and detection performance, and better separates the signal from the noise in the eigenspace.