paper-with-me

홈 › Papers

Chernoff Bounds for Tensor Expanders on Riemannian Manifolds Using Graph Laplacian Approximation

2024-08-21 · Shih-Yu Chang

This paper addresses the advancement of probability tail bound analysis, a crucial statistical tool for assessing the probability of large deviations of random variables from their expected values. Traditional tail bounds, such as Markov's, Chebyshev's, and Chernoff bounds, have proven valuable across numerous scientific and engineering fields. However, as data complexity grows, there is a pressing need to extend tail bound estimation from scalar variables to high-dimensional random objects. Existing studies often rely on the assumption of independence among high-dimensional random objects, an assumption that may not always be valid. Building on the work of researchers like Garg et al. and Chang, who employed random walks to model high-dimensional ensembles, this study introduces a more generalized approach by exploring random walks over manifolds. To address the challenges of constructing an appropriate underlying graph for a manifold, we propose a novel method that enhances random walks on graphs approximating the manifold. This approach ensures spectral similarity between the original manifold and the approximated graph, including matching eigenvalues, eigenvectors, and eigenfunctions. Leveraging graph approximation technique proposed by Burago et al. for manifolds, we derive the tensor Chernoff bound and establish its range for random walks on a Riemannian manifold according to the underlying manifold's spectral characteristics.

📄 PDF Abstract BibTeX arXiv:2408.11276

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Deterministic Bounds and Random Estimates of Metric Tensors on Neuromanifolds

2025-05-19 · Ke Sun

The high dimensional parameter space of modern deep neural networks -- the neuromanifold -- is endowed with a unique metric tensor defined by the Fisher information, estimating which is crucial for both theory and practi…

Automatic differentiation for Riemannian optimization on low-rank matrix and tensor-train manifolds

2021-03-27 · Alexander Novikov, Maxim Rakhuba, Ivan Oseledets

In scientific computing and machine learning applications, matrices and more general multidimensional arrays (tensors) can often be approximated with the help of low-rank decompositions. Since matrices and tensors of fix…

Riemannian optimization

No-regret Online Learning over Riemannian Manifolds

2021-12-01 · NeurIPS 2021 12 · Xi Wang, Zhipeng Tu, Yiguang Hong, Yingyi Wu 외

We consider online optimization over Riemannian manifolds, where a learner attempts to minimize a sequence of time-varying loss functions defined on Riemannian manifolds. Though many Euclidean online convex optimization …

TensorFlow RiemOpt: a library for optimization on Riemannian manifolds

2021-05-27 · Oleg Smirnov

The adoption of neural networks and deep learning in non-Euclidean domains has been hindered until recently by the lack of scalable and efficient learning frameworks. Existing toolboxes in this space were mainly motivate…

BIG-bench Machine Learning

Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds

2026-06-01 · Phone Thiha Kyaw, Jonathan Kelly arxiv

Informed sampling techniques accelerate sampling-based motion planners by focusing the search on promising regions of the state space, yet most existing methods rely on Euclidean heuristics that become inadmissible under…