Dyadic spike blocks yield counterexamples where lacunary averages diverge to infinity a.e. for mean-zero functions in all L^q and for L^p functions, resolving Erdős problems #995 and #996 negatively.
Improved algorithms for linear stochastic bandits
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
years
2026 5verdicts
UNVERDICTED 5representative citing papers
Orbital integrals on unitary groups over local fields in positive characteristic converge absolutely.
Establishes boundedness for the regularized bilinear cone multiplier on R^2 x R^2 via square function decomposition, maximal function estimates, and geometric methods from Córdoba and Carbery.
Reduced cross-sectional algebra of an approximation-property Fell bundle over an inverse semigroup is exact iff its unit fiber is exact.
The thesis compiles work on graph bandits (spectral smoothness, side observations, influence maximization) and structured bandits (kernel, polymatroid, function optimization with unknown smoothness, infinite arms) to improve practicality.
citing papers explorer
-
Counterexamples for lacunary dilates via dyadic spike blocks
Dyadic spike blocks yield counterexamples where lacunary averages diverge to infinity a.e. for mean-zero functions in all L^q and for L^p functions, resolving Erdős problems #995 and #996 negatively.
-
Convergence of orbital integrals on unitary groups in positive characteristic
Orbital integrals on unitary groups over local fields in positive characteristic converge absolutely.
-
The bilinear cone multiplier on $\mathbb{R}^2\times \mathbb{R}^2$
Establishes boundedness for the regularized bilinear cone multiplier on R^2 x R^2 via square function decomposition, maximal function estimates, and geometric methods from Córdoba and Carbery.
-
Exactness and Fell bundles with the approximation property over inverse semigroups
Reduced cross-sectional algebra of an approximation-property Fell bundle over an inverse semigroup is exact iff its unit fiber is exact.
-
Bandits on graphs and structures
The thesis compiles work on graph bandits (spectral smoothness, side observations, influence maximization) and structured bandits (kernel, polymatroid, function optimization with unknown smoothness, infinite arms) to improve practicality.