DeepAI

# A Bounded p-norm Approximation of Max-Convolution for Sub-Quadratic Bayesian Inference on Additive Factors

Max-convolution is an important problem closely resembling standard convolution; as such, max-convolution occurs frequently across many fields. Here we extend the method with fastest known worst-case runtime, which can be applied to nonnegative vectors by numerically approximating the Chebyshev norm ·_∞, and use this approach to derive two numerically stable methods based on the idea of computing p-norms via fast convolution: The first method proposed, with runtime in O( k (k) ((k)) ) (which is less than 18 k (k) for any vectors that can be practically realized), uses the p-norm as a direct approximation of the Chebyshev norm. The second approach proposed, with runtime in O( k (k) ) (although in practice both perform similarly), uses a novel null space projection method, which extracts information from a sequence of p-norms to estimate the maximum value in the vector (this is equivalent to querying a small number of moments from a distribution of bounded support in order to estimate the maximum). The p-norm approaches are compared to one another and are shown to compute an approximation of the Viterbi path in a hidden Markov model where the transition matrix is a Toeplitz matrix; the runtime of approximating the Viterbi path is thus reduced from O( n k^2 ) steps to O( n k (k)) steps in practice, and is demonstrated by inferring the U.S. unemployment rate from the S&P 500 stock index.

• 1 publication
• 13 publications
01/12/2015

### A fast numerical method for max-convolution and the application to efficient max-product inference in Bayesian networks

Observations depending on sums of random variables are common throughout...
10/18/2012

### Matrix reconstruction with the local max norm

We introduce a new family of matrix norms, the "local max" norms, genera...
05/30/2022

### Fast Distance Oracles for Any Symmetric Norm

In the Distance Oracle problem, the goal is to preprocess n vectors x_1,...
03/04/2020

### Runge-Kutta approximation for C_0-semigroups in the graph norm with applications to time domain boundary integral equations

We consider the approximation to an abstract evolution problem with inho...
10/26/2019

### Selection on X_1+X_2+... + X_m with layer-ordered heaps

Selection on X_1+X_2+... + X_m is an important problem with many applica...
12/27/2015

### New Perspectives on k-Support and Cluster Norms

We study a regularizer which is defined as a parameterized infimum of qu...
12/06/2020

### FPRAS Approximation of the Matrix Permanent in Practice

The matrix permanent belongs to the complexity class #P-Complete. It is ...