AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

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

Julianus Pfeuffer, Oliver Serang

JMLR 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank approximation theory · 10 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use fast numerical (affine piecewise) max-convolution instead of naive exact max-convolutionViterbi path in HMM with additive transitions · U.S. unemployment from S&P 500 HMM (k=512)runtime (seconds): 292.3 -> 141.4 secondsImproved
increase the number of vector elements k_m from 3 to 7 in worst-case bound of the projection estimateNull space projection (r=2) · t(k_m) lower bound (Mathematica)minimum of t(k_m): 0.935537 -> 0.85343Hurt
sample unconstrained vectors versus worst-case form (1,a,b,...,b) at length 1024Null space projection (r=2) · t(k_m) bound by random sampling (k_m=1024)minimum of t(k_m): 0.81858283 -> 0.71695386Mixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy