Pith. sign in

REVIEW 2 cited by

Freedman's inequality for matrix martingales

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1101.3039 v1 pith:URTGVQOG submitted 2011-01-16 math.PR

Freedman's inequality for matrix martingales

classification math.PR
keywords inequalityfreedmanmatrixmartingaleboundsmartingalestailadapted
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Freedman's inequality is a martingale counterpart to Bernstein's inequality. This result shows that the large-deviation behavior of a martingale is controlled by the predictable quadratic variation and a uniform upper bound for the martingale difference sequence. Oliveira has recently established a natural extension of Freedman's inequality that provides tail bounds for the maximum singular value of a matrix-valued martingale. This note describes a different proof of the matrix Freedman inequality that depends on a deep theorem of Lieb from matrix analysis. This argument delivers sharp constants in the matrix Freedman inequality, and it also yields tail bounds for other types of matrix martingales. The new techniques are adapted from recent work by the present author.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Should Demand Models Incorporate Competitor Prices? Oblivious Learning and Algorithmic Collusion

    cs.GT 2026-06 unverdicted novelty 7.0

    In stylized competitive markets with noisy demand and iterated least squares learning, oblivious demand models yield transient collusive patterns that dissipate under sufficient exploration, informed sellers strictly ...

  2. Improved large-scale graph learning through ridge spectral sparsification

    cs.LG 2026-04 unverdicted novelty 5.0

    GSQUEAK produces spectrally accurate sparsifiers for graph Laplacians in a single-pass distributed streaming setting.