Proves a theorem for Assouad dimension with applications to distance sets and radial projections.
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.
Trend · papers per month
We prove the dimension of any asymptotic cone over a metric space X does not exceed the asymptotic Assouad-Nagata dimension of X. This improves a result of Dranishnikov and Smith who showed that dim(Y) does not exceed asymptotic Assouad-Nagata dimension of X for all separable subsets Y of special asymptotic cones of X …
Paper determines Assouad-Nagata dimension for all minor-closed metrics.
In this work we study two problems about Assouad-Nagata dimension: 1) Is there a metric space of non zero Assouad-Nagata dimension such that all of its asymptotic cones are of Assouad-Nagata dimension zero? (Dydak and Higes) 2) Suppose is a locally finite group with a proper left invariant metric . If $\dim_{A…
In the first part of the paper we show how to relate several dimension theories (asymptotic dimension with Higson property, asymptotic dimension of Gromov, and capacity dimension of Buyalo \cite{Buyalo1}) to Nagata-Assouad dimension. This is done by applying two functors on the Lipschitz category of metric spaces: micr…
We prove that the asymptotic Assouad-Nagata dimension of a connected Lie group equipped with a left-invariant Riemannian metric coincides with its topological dimension of where is a maximal compact subgroup. To prove it we will compute the Assouad-Nagata dimension of connected solvable Lie groups and sem…
Optimizes Lipschitz estimates for partitions of unity and characterizes spaces with Assouad-Nagata dimension.
We study the Assouad dimension and the Nagata dimension of metric spaces. As a general result, we prove that the Nagata dimension of a metric space is always bounded from above by the Assouad dimension. Most of the paper is devoted to the study of when these metric dimensions of a metric space are locally given by the …
Given a metric space of finite asymptotic dimension, we consider a quasi-isometric invariant of the space called dimension function. The space is said to have asymptotic Assouad-Nagata dimension less or equal if there is a linear dimension function in this dimension. We prove that if is a tree-graded space …
Consider the wreath product , where is finite and is finitely generated. We show that the Assouad-Nagata dimension of depends on the growth of as follows: If the growth of is not bounded by a linear function, then , otherwise $\dim_{AN}…
Paper studies asymptotic dimension and Assouad-Nagata dimension of graphs and surfaces.
We discuss a variation of Gromov's notion of asymptotic dimension that was introduced and named Nagata dimension by Assouad. The Nagata dimension turns out to be a quasisymmetry invariant of metric spaces. The class of metric spaces with finite Nagata dimension includes in particular all doubling spaces, metric trees, …
The paper extends statistical estimation techniques under differential privacy.
For a large class of metric space X including discrete groups we prove that the asymptotic Assouad-Nagata dimension AN-asdim X of X coincides with the covering dimension of the Higson corona of X with respect to the sublinear coarse structure on X. Then we apply this fact to prove the equality AN-asdim(X …
Given a function of metric spaces, its {\it asymptotic dimension} $\asdim(f)$ is the supremum of $\asdim(A)$ such that and $\asdim(f(A))=0$. Our main result is \begin{Thm} \label{ThmAInAbstract} $\asdim(X)\leq \asdim(f)+\asdim(Y)$ for any large scale uniform function . \end…
New lower bounds for private covariance estimation of Gaussian distributions are proven.
We present the first tree-based regressor whose convergence rate depends only on the intrinsic dimension of the data, namely its Assouad dimension. The regressor uses the RPtree partitioning procedure, a simple randomized variant of k-d trees.
We prove that the universal cover of any graph manifold quasi-isometrically embeds into a product of three trees. In particular we show that the Assouad-Nagata dimension of the universal cover of any closed graph manifold is 3, proving a conjecture of Smirnov.
Suppose is a countable, not necessarily finitely generated, group. We show admits a proper, left-invariant metric such that the Assouad-Nagata dimension of is infinite, provided the center of is not locally finite. As a corollary we solve two problems of A.Dranishnikov.
Unified framework for lower bounds in interactive decision making.
Developing a singular dimension descent method for positive scalar curvature obstructions
We relate generalized Lebesgue decompositions of measures in terms of curve fragments (Alberti representations) and Weaver derivations. This correspondence leads to a geometric characterization of the local norm on the Weaver cotangent bundle of a metric measure space : the local norm of a form sees how fas…
We prove the equivalence between a relative bottleneck property and being quasi-isometric to a tree-graded space. As a consequence, we deduce that the quasi-trees of spaces defined axiomatically by Bestvina-Bromberg-Fujiwara are quasi-isometric to tree-graded spaces. Using this we prove that mapping class groups quasi-…
Study minimax regret in bilateral trade with heavy-tailed valuations.
Locally private mechanisms' output divergence bounds derived.
Consistency of k-NN rule proven in sigma-finite dimensional metric spaces.
String graphs are closely related to planar graphs in terms of distances.
The purpose of the paper is to characterize the dimension of sublinear Higson corona of in terms of Lipschitz extensions of functions: Theorem: Suppose is a proper metric space. The dimension of the sublinear Higson corona of is the smallest integer with the following property…
Optimizes budgeted evaluations of LLMs by allocating queries to judges efficiently.
Establish a unified framework for negative results in Fourier analysis.
Improved iterative methods for risk parity portfolio weights.
We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems. Our method has only one parameter (a step size), and is radically simpler than o…
A new method combines Laplace and Variational Bayes for scalable inference.
Unified framework for model explanation methods based on feature removal.
This work reviews and evaluates methods for predicting prediction intervals in regression problems.
Derives kernel PCA with Nyström method for scalability.
In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …
New method combines spectral and sparse methods for Gaussian processes.
Simple stochastic Newton and cubic Newton methods with fast convergence.
A comprehensive benchmark of 15 scRNA-seq imputation methods across various datasets and analyses.
New methods using natural gradient for structured optimization.
Recently, {\it stochastic momentum} methods have been widely adopted in training deep neural networks. However, their convergence analysis is still underexplored at the moment, in particular for non-convex optimization. This paper fills the gap between practice and theory by developing a basic convergence analysis of t…
We investigate methods for pricing American options under the variance gamma model. The variance gamma process is a pure jump process which is constructed by replacing the calendar time by the gamma time in a Brownian motion with drift, which makes it a time-changed Brownian motion. In general, the finite difference me…
A new method speeds up deep neural network training.
We propose a new stochastic dual coordinate ascent technique that can be applied to a wide range of regularized learning problems. Our method is based on Alternating Direction Multiplier Method (ADMM) to deal with complex regularization functions such as structured regularizations. Although the original ADMM is a batch…
NCG methods improve shape optimization efficiency.
Geometric methods study 3-manifold splittings.
We propose two localized Radial Basis Function (RBF) methods, the Radial Basis Function Partition of Unity method (RBF-PUM) and the Radial Basis Function generated Finite Differences method (RBF-FD), for solving financial derivative pricing problems arising from market models with multiple stochastic factors. We demons…