Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,878 papers · 148 categories

Trend · papers per month

3571106141 · Jun 202019922001200920172026
48 results for Haar convolution

Novel Haar-Laplacian for directed graphs enhances spectral graph applications.

problem Lack of suitable Laplacian for directed graphs in spectral graph theory.
method Inspired by Haar-like transformation, introduces a Hermitian matrix preserving direction and weight.
result HaarNet outperforms in weight prediction and denoising on directed graphs.

The abstract theorem extends a Lie group result to Lie groupoids.

problem Expressing functions on Lie groupoids as convolutions of two functions.
method Using a lemma from Dixmier-Malliavin, Lie algebroids, and exponential map.
result Every smooth, compactly-supported function on a Lie groupoid can be expressed as a finite sum of convolutions of two such functions.

Introduces new algebraic structures for relational groupoids and proves a reduction theorem.

problem Developing algebraic tools for relational groupoids.
method Introduces relational groupoids and convolution algebras, provides examples, and proves a reduction theorem.
result Establishes a reduction theorem recovering the usual convolution of Lie groupoids.

Paper introduces Laplace-HDC for better binary hyperdimensional computing.

problem Improving binary hyperdimensional computing for spatial information.
method Develops Laplace-HDC using the Laplace kernel and Haar convolutional features.
result Laplace-HDC outperforms previous methods in encoding spatial information.

This work proves the asymptotic freeness of layerwise Jacobians in MLPs with Haar orthogonal matrices.

problem Proving the asymptotic freeness of layerwise Jacobians in multilayer perceptrons (MLPs).
method Replacing each layer's parameter matrix with itself multiplied by a Haar orthogonal matrix, and using the invariance of the MLP.
result Proves the asymptotic freeness of layerwise Jacobians in MLPs with Haar orthogonal matrices.

We present a powerful new loss function and training scheme for learning binary hash functions. In particular, we demonstrate our method by creating for the first time a neural network that outperforms state-of-the-art Haar wavelets and color layout descriptors at the task of automated scene matching. By accurately rel…

2018-02-09abs ↗pdf ↗

This paper proposes a new methodology to compute Value at Risk (VaR) for quantifying losses in credit portfolios. We approximate the cumulative distribution of the loss function by a finite combination of Haar wavelets basis functions and calculate the coefficients of the approximation by inverting its Laplace transfor…

2009-04-29abs ↗pdf ↗

Let G be a real compact connected simple Lie group, and g its Lie algebra. We study the problem of determining, from root data, when a sum of adjoint orbits in g, or a product of conjugacy classes in G, contains an open set. Our general methods allow us to determine exactly which sums of adjoint orbits in su(m) and pro…

2009-10-09abs ↗pdf ↗

In this article we propose building general-purpose function approximators on top of Haar Scattering Networks. We advocate that this architecture enables a better comprehension of feature extraction, in addition to its implementation simplicity and low computational costs. We show its approximation and feature extracti…

2018-04-09abs ↗pdf ↗

Quantum neural networks converge to Gaussian processes as they grow.

problem Understanding the convergence of quantum neural networks to Gaussian processes.
method Analyzing Haar random unitary and orthogonal deep QNNs, considering input states, measurement observables, and non-independence of unitary matrix entries.
result Quantum neural networks outputs converge to Gaussian processes in the limit of large Hilbert space dimension.

This paper presents a basic property of region dividing of ReLU (rectified linear unit) deep learning when new layers are successively added, by which two new perspectives of interpreting deep learning are given. The first is related to decision trees and forests; we construct a deep learning structure equivalent to a …

2019-06-16abs ↗pdf ↗

Random representations of surface groups approach asymptotic freeness in large nn limit.

problem Asymptotic freeness of Haar unitary matrices for surface groups.
method Interplay between Dehn's work and classical invariant theory.
result Expected value of trace of a fixed non-identity element is bounded as non o\infty.

The paper reformulates U-Nets as wavelet-based models and applies this to hierarchical VAEs.

problem Theoretical understanding and regularization properties of U-Nets and their relationship to wavelets.
method Formulating a multi-resolution framework to identify U-Nets as finite-dimensional truncations of infinite-dimensional models, proving average pooling corresponds to projection, and identifying HVAEs as discretizations of multi-resolution diffusion processes.
result HVAEs learn a time representation allowing for improved parameter efficiency through weight-sharing.

Pairs of elements in quaternionic hyperbolic space have zero measure of being strongly doubly reversible.

problem Characterizing pairs of elements in quaternionic hyperbolic space that are strongly doubly reversible.
method Analyzing conjugacy conditions and using Haar measure.
result The set of strongly doubly reversible pairs has Haar measure zero in $\PSp(n,1) imes \PSp(n,1)$.

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result for graphs with fins. As a corollary we obtain pattern rigidity for free groups w…

2018-06-21abs ↗pdf ↗

Study proves existence of regions minimizing perimeter in specific geometric structures.

problem Existence of isoperimetric regions in sub-Finsler nilpotent groups.
method Analyzes nilpotent Lie groups with a bracket-generating distribution and asymmetric norms.
result Proves existence of minimizers of perimeter under volume constraint.

Develops new e-processes and confidence sequences for Gaussian means with unknown variance.

problem Constructing valid t-tests and confidence sequences for Gaussian means with unknown variance.
method Explores generalized nonintegrable martingales and extended Ville's inequality, developing two new e-processes and confidence sequences.
result Analyzes the width of resulting confidence sequences with a polynomial dependence on error probability, proving it to be unavoidable and even better than classical fixed-sample t-tests.

Deep neural networks' Jacobian spectrum becomes well-conditioned with orthogonal weights.

problem Understanding and handling the Jacobian spectrum of deep neural networks.
method Applying free probability theory to show almost sure asymptotic freeness of Jacobians in the wide limit.
result Layer-wise Jacobians of deep neural networks with orthogonal weights are almost surely asymptotically free.

We perform wavelet decomposition of high frequency financial time series into large and small time scale components. Taking the FTSE100 index as a case study, and working with the Haar basis, it turns out that the small scale component defined by most (\simeq 99.6%) of the wavelet coefficients can be neglected for th…

2011-03-18abs ↗pdf ↗

The paper improves on existing algorithms for minimizing different types of regret in online learning.

problem Minimizing external, internal, and swap regret in online learning with multiple experts.
method Develops a single algorithm using φ-regret minimization and Haar-wavelet-inspired matrix features to achieve optimal bounds in various scenarios.
result Achieves optimal bounds for external, internal, and swap regrets in different expert scenarios.

New MHSNs extract multiscale features from complex data for robust classification.

problem Signal classification and domain classification on complex data.
method Layered structure with multiscale basis dictionaries, pooling operations, and invariant features.
result High-accuracy classification with fewer parameters than traditional graph neural networks.

The paper proves a unique conformal measure for Anosov groups and shows local mixing.

problem Proving the uniqueness of conformal measures for Anosov groups.
method Analogue of Sullivan's theorem for Anosov subgroups of semisimple groups.
result Uniqueness of conformal measures and local mixing for Anosov groups.

Orthogonal random features approximate a Bessel kernel, offering sharper bounds than random Fourier features.

problem Approximating Gaussian kernel efficiently for large datasets.
method Use of Haar orthogonal matrices to construct orthogonal random features and analyze their bias and variance.
result Orthogonal random features approximate a Bessel kernel, not the Gaussian kernel, with sharper bounds.

We show that for any positive integer nn, the maps xCn{x,zi2}i=14nR4nx \in \mathbb{C}^n \mapsto \{\left|\langle x, z_i \rangle \right|^2\}_{i=1}^{4n} \in \mathbb{R}^{4n}, where ziz_i are the columns of four n×nn\times n unitary matrices, are generically injective modulo multiplication by a global phase factor, yielding a family of emb…

2013-06-05abs ↗pdf ↗