The square root velocity framework is a method in shape analysis to define a distance between curves and functional data. Identifying two curves if they differ by a reparametrisation leads to the quotient space of unparametrised curves. In this paper we study analytical and topological aspects of this construction for …
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “square-root velocity function”
Transforms curves and surfaces for efficient geometric analysis.
problem Efficiently analyzing and comparing curves and surfaces.
method Square root velocity transformation for curves and intrinsic comparison for surfaces.
result Fundamental geometric properties of curves under the transformation.
A novel method classifies shapes by their square-root velocity function.
problem Classifying shapes in infinite-dimensional, curved spaces.
method Square-root velocity function, tangent spaces, principal components, combining pairwise classifiers.
result Improves classification accuracy by separating shapes and reducing dimensionality.
The chapter reviews metrics for comparing curves, focusing on quotient elastic and square root velocity metrics.
problem Comparing and analyzing shapes of curves.
method Construction and theoretical properties of quotient elastic metrics, special case of square root velocity metric, numerical approaches for estimation.
result Simplified expression for the square root velocity metric distance.
In this paper we study the shape space of curves with values in a homogeneous space , where is a Lie group and is a compact Lie subgroup. We generalize the square root velocity framework to obtain a reparametrization invariant metric on the space of curves in . By identifying curves in with thei…
A classical result in Riemannian geometry states that the absolutely continuous curves into a (finite-dimensional) Riemannian manifold form an infinite-dimensional manifold. In the present paper this construction and related results are generalised to absolutely continuous curves with values in a strong Riemannian mani…
The square root velocity function (SRVF), introduced by Srivastava et al, has proved to be an effective way to compare absolutely continuous curves in modulo reparametrization. Several computational papers have been published based on this method. In this paper, we carefully establish the theoretical foundations …
In this paper we are concerned with the approach to shape analysis based on the so called Square Root Velocity Transform (SRVT). We propose a generalisation of the SRVT from Euclidean spaces to shape spaces of curves on Lie groups and on homogeneous manifolds. The main idea behind our approach is to exploit the geometr…
Of concern is the study of the space of curves in homogeneous spaces. Motivated by applications in shape analysis we identify two curves if they only differ by their parametrization and/or a rigid motion. For curves in Euclidean space the Square-Root-Velocity-Function (SRVF) allows to define and efficiently compute a d…
SrvfNet aligns multiple functional data to templates without supervision.
problem Aligning large collections of functional data to templates without labeled data.
method Generative deep learning framework using SRVF and fully-connected layers.
result Framework achieves alignment and optimal template prediction without supervision.
We reconsider the problem of optimal trading in the presence of linear and quadratic costs, for arbitrary linear costs but in the limit where quadratic costs are small. Using matched asymptotic expansion techniques, we find that the trading speed vanishes inside a band that is narrower than in the absence of quadratic …
Shape analysis is ubiquitous in problems of pattern and object recognition and has developed considerably in the last decade. The use of shapes is natural in applications where one wants to compare curves independently of their parametrisation. One computationally efficient approach to shape analysis is based on the Sq…
Guarantees uniform convergence for square-root Lipschitz losses.
problem Uniform convergence guarantees for square-root Lipschitz losses.
method Using Rademacher complexity and square root of scalar loss function Lipschitz constant.
result Generalizes previous results and handles non-smooth loss functions.
This paper focuses on the study of open curves in a manifold M, and proposes a reparameterization invariant metric on the space of such paths. We use the square root velocity function (SRVF) introduced by Srivastava et al. in [11] to define a reparameterization invariant metric on the space of immersions M' = Imm([0,1]…
This paper focuses on the study of open curves in a Riemannian manifold M, and proposes a reparametrization invariant metric on the space of such paths. We use the square root velocity function (SRVF) introduced by Srivastava et al. to define a Riemannian metric on the space of immersions M'=Imm([0,1],M) by pullback of…
New method distinguishes cause from effect using causal velocity.
problem Inferring causal direction from bivariate data.
method Parametrization of bivariate SCMs in terms of causal velocity, using tools from measure transport.
result Method extends beyond known model classes and requires no assumptions on noise distributions.
Study finds price impact follows a 'double' square-root law, suggesting mechanical origin.
problem Understanding the origin of price impact in markets.
method Detailed dataset of Tokyo Stock Exchange orders, analyzing single and metaorders.
result Price impact follows a 'double' square-root law, indicating mechanical origin rather than information.
New method estimates velocity fields for minimizing -divergences without overfitting.
problem Minimizing statistical discrepancies between target and particle distributions.
method Directly estimate velocity fields using interpolation techniques, proving consistency under mild conditions.
result Consistent estimators of velocity fields improve accuracy in applications like domain adaptation and missing data imputation.
NN-Turb generates turbulent velocity statistics using neural networks.
problem Creating a 1D field with turbulent velocity statistics.
method Fully-convolutional neural network (NN-Turb) to generate the field.
result NN-Turb generates a 1D field that satisfies Kolmogorov's 2/3 and 4/5 laws, exhibiting intermittency.
New algorithms reduce contextual bandits' regret without knowing reward noise variances.
problem Reducing regret in contextual bandits with unknown reward noise variances.
method Developed new algorithms based on the optimism principle.
result Regret scales as the square root of the sum of measurement variances, not the time horizon.
Study finds a crossover from linear to square-root market impact based on order volume.
problem Understanding the dynamics of market impact as a function of order volume.
method Used a large dataset of 8 million trades to establish the crossover between linear and square-root market impact regimes. Applied a dynamical theory of liquidity to explain the results.
result Quantitative agreement with data achieved by considering two liquidity time scales: fast and slow.
The paper establishes a uniform Lipschitz bound on the square root of the systole function in Teichmüller space.
problem Uniform Lipschitz bounds on geometric functions in Teichmüller space.
method Injectivity radius analysis and Lipschitz bounds on systole function.
result Uniform Lipschitz constant for the square root of the systole function on Teichmüller space.
A new method solves large-scale sparse group square-root Lasso problems efficiently.
problem Large-scale linearly constrained sparse group square-root Lasso problems.
method Dual semismooth Newton based augmented Lagrangian method (ALM).
result The proposed method efficiently solves the problem with numerical experiments demonstrating its effectiveness.
Neural solver computes Wasserstein geodesics and velocity fields efficiently.
problem Computing Wasserstein geodesics and velocity fields efficiently.
method Sample-based neural network approach to solve the minimax problem.
result Directly samples from target distribution and estimates velocity field.
Proves strong solutions for graphical Brakke flows with normal velocity.
problem Proving strong solutions for graphical Brakke flows with specific velocity conditions.
method Combining normal velocity with parabolic regularity theory.
result Graphical Brakke flows with forcing term in and are strong and classical solutions.
The paper explores multidimensional critic output in GANs, improving convergence and diversity.
problem Underexplored in GANs literature, multidimensional critic output.
method Generalized Wasserstein GAN framework, SRVT block, maximal p-centrality discrepancy.
result High-dimensional critic output improves GAN performance in convergence and diversity.
Study differential properties of matrix square roots in specific cases.
problem Understanding matrix square roots in semi-simple, symmetric, and orthogonal cases.
method Analysis of differential and metric structures of real square roots of matrices under specific conditions.
result Differential properties of matrix square roots in semi-simple, symmetric, and orthogonal cases.
LFIS uses a time-dependent velocity field to sample from complex distributions.
problem Sampling from unnormalized density functions.
method LFIS learns a time-dependent velocity field to transport samples from a simple initial distribution to a complex target distribution.
result LFIS achieves state-of-the-art performance on various benchmark problems.
A new method simulates square-root processes efficiently.
problem Simulating square-root processes accurately and efficiently.
method Simulate the integrated square-root process instead of the square-root process itself.
result High precision with low number of time steps, and exact limiting Inverse Gaussian distributions.
Adaptive-treed banditsmath.ST
We describe a novel algorithm for noisy global optimisation and continuum-armed bandits, with good convergence properties over any continuous reward function having finitely many polynomial maxima. Over such functions, our algorithm achieves square-root regret in bandits, and inverse-square-root error in optimisation, …
Bitcoin's monetary velocity is constrained by network friction, leading to significant utility contraction during shocks.
problem Bitcoin's monetary velocity is limited by network congestion, causing significant utility loss during economic shocks.
method Empirical analysis using Transaction Cost Index and threshold regression to identify structural breaks and velocity contraction.
result Network friction significantly reduces Bitcoin's monetary velocity, leading to a net utility contraction of -9.39% during shocks.
Generalized Kernel Thinningstat.ML
Improves probability distribution compression with KT algorithm.
problem Efficiently compressing probability distributions.
method Kernel thinning (KT) algorithm with four improvements.
result KT yields tighter, dimension-free guarantees for any kernel.
An -velocity is an -jet with source at , and target in a manifold . An -velocity is said to be regular, if it has a representative which is an immersion at . The manifold of -velocities as well as its open, -invariant, dense submanifold $\Imm …
New method for elastic curve and surface matching.
problem Elastic matching of unparametrized curves and surfaces.
method Combines square root normal fields and varifold fidelity metrics.
result Numerical examples demonstrate the approach's effectiveness.
Study develops efficient algorithm for probabilistic penetration response of composite plates.
problem Probabilistic modeling of discrete structural response, focusing on binary events like buckling.
method Adaptive domain-based decomposition, sparse grid sampling, assumption of monotonic behavior.
result Efficient computational framework for probabilistic penetration response of composite plates.
Compact bilinear pooling approximates covariance features for faster training.
problem Efficiently approximating covariance features for faster training.
method Compact bilinear pooling extended to polynomial approximations of covariance features.
result The proposed method achieves comparable accuracy with fewer dimensions.
The paper shows square roots of certain transformations can't exist on contact manifolds.
problem Existence of square roots of diffeomorphisms on contact manifolds.
method Proving the non-existence of square roots for arbitrary small contactomorphisms.
result There exist arbitrary small contactomorphisms without square roots.
Visual observations of dynamic phenomena, such as human actions, are often represented as sequences of smoothly-varying features . In cases where the feature spaces can be structured as Riemannian manifolds, the corresponding representations become trajectories on manifolds. Analysis of these trajectories is challengin…
Impact is not just volatilityq-fin.TR
Corrects the misconception that market impact is just volatility.
problem Misinterpretation of market impact as volatility.
method Introducing a simple scaling argument and comparing it to empirical data.
result Market impact is not related to price diffusion.
We discuss some aspects about the computation of kinematic, spectroscopic, Fermi and astrometric relative velocities that are geometrically defined in general relativity. Mainly, we state that kinematic and spectroscopic relative velocities only depend on the 4-velocities of the observer and the test particle, unlike F…
DSNE visualizes data velocity in lower dimensions.
problem Understanding movement patterns in high-dimensional data.
method DSNE is a variation of Stochastic Neighbor Embedding that learns velocity embeddings using Euclidean distances on a unit sphere.
result DSNE enables visualization of data movement in lower dimensions.
Unified treatment of elastic metrics for curves in any dimension.
problem Defining metrics on spaces of Euclidean curves for statistical analysis.
method Developing a unified approach to elastic metrics, extending results on existence of solutions and algorithms for computing distances and geodesics.
result Unified treatment of elastic metrics for all parameter choices, extending previous work.
In the shape analysis approach to computer vision problems, one treats shapes as points in an infinite-dimensional Riemannian manifold, thereby facilitating algorithms for statistical calculations such as geodesic distance between shapes and averaging of a collection of shapes. The performance of these algorithms depen…
TVM improves generative modeling by matching terminal velocities.
problem Creating high-fidelity one- and few-step generative models.
method TVM generalizes flow matching, modeling transitions between diffusion timesteps and regularizing terminal behavior.
result TVM achieves state-of-the-art FID scores with minimal architectural changes and fused attention kernel.
A simple trading model based on pair pattern strategy space with holding periods is proposed. Power-law behaviors are observed for the return variance , the price impact and the predictability for both models with linear and square root impact functions. The sum of the traders' wealth displays a positive v…
Reinforcement learning controls car speed for safe, efficient, and comfortable driving.
problem Safe, efficient, and comfortable car following during autonomous driving.
method Deep reinforcement learning with a reward function for safety, efficiency, and comfort.
result The model reduces dangerous minimum time to collision to 8% of human drivers and maintains efficient headways.
Reflected Flow Matchingstat.ML
RFM improves CNFs by adding a boundary constraint term and matching velocity fields.
problem Flow matching on constrained domains leads to unnatural samples.
method RFM adds a boundary constraint term and matches velocity fields in a simulation-free manner.
result RFM achieves comparable or better results on standard image benchmarks and produces high-quality samples.
Log-Ergodic Dynamics in Stochastic Monetary Velocity: Theoretical Insights and Economic Implicationsq-fin.GN
Log-ergodic model improves velocity of money prediction.
problem Improving velocity of money prediction for economic control.
method Log-ergodic processes to simulate monetary velocity.
result Log-ergodic model offers superior predictive power.