AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Higher-Order Total Variation Classes on Grids: Minimax Theory and Trend Filtering Methods

Veeranjaneyulu Sadhanala, Yu-Xiang Wang, James L Sharpnack, Ryan J Tibshirani

NeurIPS 2017 · Learning theory and algorithms › Sample complexity · approach: Distributed estimation under communication limits · 13 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 Kronecker trend filtering (KTF) penalty instead of graph trend filtering (GTF) penalty on 2d gridstrend filtering on 2d grid graphs · 2d grids, minimax theoryestimation error rate (MSE upper bound order)No clear effect
Use Kronecker trend filtering (KTF) penalty instead of graph trend filtering (GTF) penaltytrend filtering on d-dimensional grids · Holder smooth signalsadaptation to Holder rate n^{-(k+1)/(k+2)} for d=2Improved
Set penalty order k=0 (TV denoising, lambda ~ log n) instead of higher-order trend filteringGTF / TV denoising on 2d grids · 2d grids, minimax theoryMSE upper bound orderNo clear effect
Use the GTF penalty instead of KTF penalty (discrete derivatives at grid boundary)GTF class containment of discretized Holder class · discretized Holder classcontainment of Holder class in classHurt

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