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,694 papers · 148 categories

Trend · papers per month

2356 · Jun 202119922001200920172026
48 results for reparametrization

Study on how reparametrization affects neural nets' parameter spaces from a geometric perspective.

problem Inconsistencies in flatness measures, optimization, and probability densities under reparametrization.
method Riemannian geometry to study invariance of neural nets under reparametrization.
result Invariance of neural nets is an inherent property if the metric is explicitly represented and transformation rules are correct.

DualVDT improves time-series forecasting with a novel dual reparametrized structure.

problem Time-series forecasting with improved performance and analytical rigor.
method Dual reparametrized variational mechanisms on VAE, latent score based generative model, reverse time stochastic differential equation, variational ancestral sampling, KL divergence reduction.
result Advanced performance in time-series forecasting with reduced KL divergence.

New findings show a balance between data fit and complexity in kernel hyperparameters.

problem Overcorrelation due to reparametrization of kernel hyperparameters.
method Reparametrization of kernel hyperparameters and analysis of marginal likelihood.
result Data fit term influences all other kernel hyperparameters, not just the complexity penalty.

We prove an optimal control on the time-dependent measure of a measurable set under a reparametrized Lagrangian mean curvature flow of almost calibrated submanifolds in a Calabi-Yau manifold. Moreover we give a classification of those Lagrangian translating solitons in Cm\mathbb{C}^m that evolve by this reparametrized …

2018-01-22abs ↗pdf ↗

Monge SAM improves deep learning by making sharpness-aware minimization invariant to reparametrizations.

problem Non-invariance of sharpness-aware minimization (SAM) to reparametrizations.
method Introduces Monge SAM, a reparametrization-invariant version of SAM using a Riemannian metric.
result Monge SAM enhances robustness and generalization compared to previous methods.

Completeness of surface metrics established for Sobolev spaces.

problem Ensuring completeness of reparametrization-invariant Sobolev metrics on surface spaces.
method Recasting completeness criteria for infinite-dimensional Riemannian manifolds and applying geometric estimates based on the Michael--Simon--Sobolev inequality.
result Established metric and geodesic completeness for specific Sobolev metrics on immersed surfaces, validating Mumford's conjecture.

A new numerical framework simplifies elastic surface matching and comparison.

problem Challenging problem in surface comparison and matching in computer vision.
method Relaxing the geodesic boundary constraint using a varifold fidelity metric.
result Flexibility to deal with arbitrary topologies and sampling patterns, scalability to large meshes.

Efficiently infers latent SDEs with scalable memory and time costs.

problem Inference of latent SDEs with high time and memory complexity.
method Amortized reparametrization of expectations under linear SDEs, coupled with efficient gradient approximation.
result Achieves similar performance to adjoint sensitivities with fewer model evaluations.

Motivated by Demailly's strategy towards the Kobayashi hyperbolicity conjecture, we study the action on the k-jets of germs of holomorphic discs in a complex manifold X of the reparametrization group of k-jets of germs of biholomorphisms of the source. This reparametrization group is a subgroup of the general linear gr…

2010-12-08abs ↗pdf ↗

Quantized Variational Inference improves ELBO optimization with fast convergence.

problem Maximizing Evidence Lower Bound (ELBO) for variational inference.
method Optimal Voronoi Tesselation for variance-free gradients, Richardson extrapolation for asymptotic improvement.
result Quantized Variational Inference leads to fast convergence with comparable computational cost.

In this article we investigate a first order reparametrization-invariant Sobolev metric on the space of immersed curves. Motivated by applications in shape analysis where discretizations of this infinite-dimensional space are needed, we extend this metric to the space of Lipschitz curves, establish the wellposedness of…

2017-02-14abs ↗pdf ↗

This study compares two methods for sampling with transport maps, finding flow-based proposals work better for multimodal distributions.

problem Sampling from distributions with complex geometries.
method Compares two approaches: (i) proposal draws from the flow and (ii) reparametrization.
result Flow-based proposals are more effective for multimodal distributions in high dimensions, while reparametrization methods are more robust in other scenarios.

In this paper we study the shape space of curves with values in a homogeneous space M=G/KM = G/K, where GG is a Lie group and KK is a compact Lie subgroup. We generalize the square root velocity framework to obtain a reparametrization invariant metric on the space of curves in MM. By identifying curves in MM with thei…

2017-06-09abs ↗pdf ↗

Study on completeness of Sobolev metrics on manifold-valued curves.

problem Completeness of Sobolev metrics on spaces of manifold-valued curves.
method Analysis of reparametrization invariant Sobolev metrics of order n2n\ge 2.
result Sobolev immersions are metrically and geodesically complete for several important cases of metrics.

We introduce Natural Neural Networks, a novel family of algorithms that speed up convergence by adapting their internal representation during training to improve conditioning of the Fisher matrix. In particular, we show a specific example that employs a simple and efficient reparametrization of the neural network weigh…

2015-07-01abs ↗pdf ↗

Improved VI with Price's gradient estimator for target log-density.

problem Approximating target distributions from unnormalized log-densities.
method Stochastic gradient-based variational inference with Price's gradient estimator.
result Identifies Price's gradient as the key to WVI's superior performance.

Research shows deep generative models' likelihoods are unreliable for anomaly detection.

problem Anomaly detection using deep generative models' likelihoods is unreliable.
method Examined the behavior of distribution densities through reparametrization.
result The likelihoods used for anomaly detection rely on strong and implicit hypotheses.

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.

MetFlow combines MCMC and VI efficiently for better inference.

problem Combining MCMC and VI for efficient inference.
method Introduces MetFlow, a novel MCMC algorithm with Normalizing Flows, and a new method to combine it with VI.
result MetFlow produces expressive variational families with improved computational efficiency.

Study disproves conjecture about metric completion of curve spaces.

problem Completeness properties of spaces of immersed curves with reparametrization-invariant metrics.
method Examined Sobolev-type metrics on real-valued immersed curves, demonstrating multiple distinct limit points.
result Metric completion of spaces of immersed open curves includes multiple distinct limit points, not a single point as previously conjectured.

New connections share geodesics with superintegrable systems.

problem Understanding geodesics in affine connections related to superintegrable systems.
method Analyzing dual-geodesics and comparing them across different connections.
result Certain torsion-free affine connections associated with second order superintegrable systems share the same dual-geodesics.

A vector field on a Riemannian manifold is called geodesic if its integral curves are reparametrized geodesics. We classify compact Kähler manifolds admitting nontrivial real-holomorphic geodesic gradient vector fields that satisfy an additional integrability condition. They are all biholomorphic to bundles of complex …

2017-03-08abs ↗pdf ↗

We study reparametrization invariant Sobolev metrics on spaces of regular curves. We discuss their completeness properties and the resulting usability for applications in shape analysis. In particular, we will argue, that the development of efficient numerical methods for higher order Sobolev type metrics is an extreme…

2015-02-11abs ↗pdf ↗

Let (Ft)(F_t) be a smooth flow on a smooth manifold MM and h:MMh:M\to M be a smooth orbit preserving map. The following problem is studied: suppose that for every point zz of MM there exists a germ of a smooth function fzf_z at zz such that near zz we have that h(x)=Ffz(x)(x)h(x)=F_{f_z(x)}(x). Can the functions (fz)(f_z) be glued …

2009-02-14abs ↗pdf ↗

The paper studies a natural nn-dimensional generalization of the classical nonholonomic Chaplygin sphere problem. We prove that for a specific choice of the inertia operator, the restriction of the generalized problem onto zero value of the SO(n-1)-momentum mapping becomes an integrable Hamiltonian system after an app…

2009-02-25abs ↗pdf ↗

Normalization methods such as batch [Ioffe and Szegedy, 2015], weight [Salimansand Kingma, 2016], instance [Ulyanov et al., 2016], and layer normalization [Baet al., 2016] have been widely used in modern machine learning. Here, we study the weight normalization (WN) method [Salimans and Kingma, 2016] and a variant call…

2019-11-18abs ↗pdf ↗

Two new proofs of Gromov's non-squeezing theorem using curve reparametrization and gradient bounds.

problem Gromov's non-squeezing theorem in symplectic geometry.
method Reparametrization of pseudo-holomorphic curves and application of mean value inequality or Gromov-Schwarz lemma.
result Uniform bounds on the gradient of pseudo-holomorphic curves leading to compactness of moduli space.

SCORE technique reduces BO's high-dimensional search costs.

problem Bayesian optimization's high computational costs in high-dimensional spaces.
method 1D reparametrization trick to maintain linear time complexity.
result Successfully finds global minimum in high-dimensional optimization.

Consider the equal mass planar 44-body problem with a potential corresponding to an inverse \textit{cube} force. The Jacobi-Maupertuis principle reparametrizes the dynamics as geodesics of a certain metric. We examine the curvature of this geodesic flow in the reduced space on the collinear and parallelogram invariant…

2016-10-26abs ↗pdf ↗

We study the geometry of the Thurston metric on Teichmuller space by examining its geodesics and comparing them to Teichmuller geodesics. We show that, similar to a Teichmuller geodesic, the shadow of a Thurston geodesic to the curve graph is a reparametrized quasi-geodesic. However, we show that the set of short curve…

2014-05-06abs ↗pdf ↗

The paper develops scalable variational inference for Bayesian neural networks under model and parameter uncertainty.

problem Combining structural and parameter uncertainties in scalable Bayesian neural networks.
method Adapted variational inference with reparametrization for model space constraints.
result Comparable accuracy with sparse inference compared to ordinary BNNs.

The paper explores methods to better estimate treatment effects by leveraging shared structure in potential outcomes.

problem Estimating treatment effects when outcomes may vary widely and existing methods often assume heterogeneity.
method Investigates and compares three learning strategies: regularization, reparametrization, and a multi-task architecture.
result All three approaches improve upon existing baselines, providing insights into their relative strengths.