Variation Brownian Kernel Ladders
- URL: http://arxiv.org/abs/2608.13882v1
- Date: Fri, 14 Aug 2026 02:15:08 GMT
- Title: Variation Brownian Kernel Ladders
- Abstract summary: We introduce the emphVariation Brownian Kernel Ladder (VBKL), a path-atomic function-space framework.<n>Starting from linear projections, each atom composes unit-ball profiles from the Brownian reproducing kernel Hilbert space.<n>The full VBKL space is then the signed-measure variation hull of the completed dictionary.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Claims about the benefit of depth depend on the complexity assigned to a representation. We introduce the \emph{Variation Brownian Kernel Ladder} (VBKL), a path-atomic function-space framework that separates nonlinear recursive dictionary construction from linear variation superposition. Starting from linear projections, each atom recursively composes unit-ball profiles from the Brownian reproducing kernel Hilbert space; the full VBKL space is then the signed-measure variation hull of the completed dictionary. We identify each recursive dictionary as a union of Brownian pullback RKHS balls and establish variation-controlled Hölder regularity, compactness and attainment, and strict growth with depth under a local non-degeneracy condition whose trace lies in the support of the input measure. For associated finite lower-support architectures, we derive Rademacher and generalization bounds through Brownian quadratic chaos, signed threshold traces, and VC entropy. We also construct two-stage approximants by discretizing the outer measure and the selected outer Brownian profiles, obtaining an $M^{-1/2}+m^{-1/2}$ error bound, a sharp interpolation constant $\sqrt{A/2}$, and at most $2M$ active outer-profile basis contributions per evaluation. Controlled experiments illustrate the approximation mechanisms and indicate a favorable limited-data accuracy--complexity trade-off.
Related papers
- A Provable Oracle-Free Quantum Algorithm for Nonlinear Dynamics on Hybrid Oscillator-Qubit Processors [14.814423713691623]
We develop a hybrid qubit-qumode algorithm for nonlinear ordinary differential equations of the form $dotmathbfx=mathbff(mathbfx)$ with warped degree$L$.<n>The algorithm propagates the state density and returns the trajectory as the peak of that density in the small-noise limit.
arXiv Detail & Related papers (2026-07-30T17:10:47Z) - A Deep Second-Order Stochastic Residual Method for Fully Nonlinear Parabolic PDEs [0.9023847175654603]
We introduce the Deep Second-Order Residual Method (D2SRM) for high-dimensional, Hessian-dependent fully nonlinear parabolic PDEs.<n>A single space-time network generates derivative-consistent approximations of the solution, gradient, and Hessian.<n>Experiments on a 100-dimensional manufactured benchmark compare terminal treatments, probe Hessian couplings inside and outside the proved small-gain range, and show decreasing errors as the time step decreases.
arXiv Detail & Related papers (2026-07-18T09:43:15Z) - Brownian Kernel Ladders [3.924521334514384]
We introduce Brownian kernel ladders (BKLs), a hierarchy of integral reproducing kernel Hilbert spaces.<n>We show that BKL spaces form quasi-Banach spaces, satisfy depth-dependent Hlder regularity estimates, and exhibit strict monotonicity with respect to depth.<n>Our results provide a mathematically tractable hierarchical function-space framework for studying compositional representations in deep learning.
arXiv Detail & Related papers (2026-06-14T13:27:28Z) - Near-Optimal Regret in Adversarial Kernel Bandits [50.68324062892194]
We study the adversarial kernel bandit problem, in which the loss at each round is induced by an arbitrary bounded element.<n>Our main result bounds the regret by $widetildeObig(sqrtT, d_*(),log|X|big)$, where $d_*()$ is a widely-adopted notion of effective dimension.
arXiv Detail & Related papers (2026-05-26T06:10:24Z) - Dimension-Independent Convergence of Underdamped Langevin Monte Carlo in KL Divergence [50.719298242863744]
Underdamped Langevin dynamics (ULD) is a widely-used sampler for Gibbs distributions $propto e-V$.<n>We prove the first dimension-free KL divergence bounds for discretized ULD.
arXiv Detail & Related papers (2026-03-02T22:14:38Z) - Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
arXiv Detail & Related papers (2026-02-26T15:27:53Z) - Provably Efficient Algorithms for S- and Non-Rectangular Robust MDPs with General Parameterization [85.91302339486673]
We study robust Markov decision processes (RMDPs) with general policy parameterization under s-rectangular and non-rectangular uncertainty sets.<n>We prove novel Lipschitz and Lipschitz-smoothness properties for general policy parameterizations that extends to infinite state spaces.<n>We design a projected gradient descent algorithm for s-rectangular uncertainty and a Frank-Wolfe algorithm for non-rectangular uncertainty.
arXiv Detail & Related papers (2026-02-11T21:44:20Z) - Theta-term in Russian Doll Model: phase structure, quantum metric and BPS multifractality [45.88028371034407]
We investigate the phase structure of the deterministic and disordered versions of the Russian Doll Model (RDM)<n>We find the pattern of phase transitions in the global charge $Q(theta,gamma)$, which arises from the BA equation.<n>We conjecture that the Hamiltonian of the RDM model describes the mixing in particular 2d-4d BPS sector of the Hilbert space.
arXiv Detail & Related papers (2025-10-23T17:25:01Z) - Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks.
In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
arXiv Detail & Related papers (2024-04-29T15:04:07Z) - Generative Modelling of L\'{e}vy Area for High Order SDE Simulation [5.9535699822923]
L'evyGAN is a deep-learning model for generating approximate samples of L'evy area conditional on a Brownian increment.
We show that L'evyGAN exhibits state-of-the-art performance across several metrics which measure both the joint and marginal distributions.
arXiv Detail & Related papers (2023-08-04T16:38:37Z) - Posterior Coreset Construction with Kernelized Stein Discrepancy for
Model-Based Reinforcement Learning [78.30395044401321]
We develop a novel model-based approach to reinforcement learning (MBRL)
It relaxes the assumptions on the target transition model to belong to a generic family of mixture models.
It can achieve up-to 50 percent reduction in wall clock time in some continuous control environments.
arXiv Detail & Related papers (2022-06-02T17:27:49Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.