New rigidity estimate derived via harmonic map flow.
problem Rigidity of maps from to .
method Harmonic map flow approach.
result Rigidity estimate derived.
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,291 papers · 148 categories
Trend · papers per month
48 results for “mapping estimation”
Gradient estimates for subelliptic harmonic maps with potential.
problem Estimating gradients of subelliptic harmonic maps.
method Investigation of subelliptic harmonic maps with potential from specific manifolds.
result Gradient estimates and Liouville type result established.
Efficiently estimates Weingarten maps and curvatures from manifold data.
problem Estimating Weingarten maps and curvatures from manifold data.
method Statistical model for Weingarten map estimation; convergence rate analysis.
result Convergence rate of the estimator as sample size increases.
Paper investigates optimal transport map estimation in infinite-dimensional spaces.
problem Estimating optimal transport maps in infinite-dimensional spaces is challenging.
method Characterizes -smoothness for optimal transport maps and develops a polynomial-rate estimator.
result Shows polynomial-order minimax risk for optimal transport map estimation.
This work broadens optimal transport map estimation theory to stochastic settings.
problem Existing theory for optimal transport map estimation is restricted to deterministic maps under specific conditions.
method Introduces a novel metric for evaluating stochastic maps, develops computationally efficient estimators with robust guarantees.
result First general-purpose theory for map estimation compatible with real-world stochastic applications.
The paper extends gradient estimates for harmonic maps into singular spaces.
problem Estimating gradients for harmonic maps into singular spaces.
method Using Alexandrov curvature bounds and extending Cheng and Choi's work.
result Yau's gradient estimates for harmonic maps into singular spaces.
Estimates conditional Brenier maps using entropic optimal transport.
problem Non-parametric estimation of conditional Brenier maps.
method Entropic optimal transport for scalable non-parametric estimation.
result Entropic optimal transport maps asymptotically converge to conditional Brenier maps.
Paper studies Laplace operator estimates in harmonic map heat flows.
problem Estimating Laplace operator in harmonic map heat flows outside singularities.
method Investigates estimates using spherical coordinates for and boundary conditions.
result Provides higher-order estimates for the Ericksen--Leslie system.
Estimates curvature for holomorphic maps on Riemann surfaces.
problem Curvature estimation for holomorphic maps on open Riemann surfaces.
method Use of jet differentials to establish a Gauss curvature estimate.
result Established a Gauss curvature estimate for holomorphic maps.
The paper estimates gradients and proves Liouville theorems for p-harmonic maps.
problem Estimating gradients and proving Liouville theorems for p-harmonic maps.
method Obtained an gradient estimate for -harmonic maps, derived from which a Liouville type result was obtained.
result Established a gradient estimate and Liouville theorem for -harmonic maps.
Concentration bounds for linear Monge mapping estimation and optimal transport domain adaptationstat.ML
The paper provides a concentration result and sample complexity for linear Monge mapping estimation and its application in domain adaptation.
problem Estimating the linear Monge mapping between distributions and its application in domain adaptation.
method The approach involves proving a concentration result and sample complexity for the linear mapping operator, and using it to derive a generalization bound for domain adaptation with optimal transport.
result The method achieves a sample complexity of and approaches the performance of theoretical Bayes predictor under mild conditions.
Novel stability bounds for OT maps improve density estimation.
problem Estimating optimal transport maps between probability distributions.
method Developed novel stability bounds for OT maps, reducing the problem to density estimation.
result Stability bounds allow for sharper guarantees without smoothness assumptions.
New framework formalizes estimating valid transport maps, revealing their statistical limits.
problem Estimating valid transport maps in generative modeling.
method Formalized a minimax framework for estimating valid transport maps.
result Estimating any valid transport map is as hard as estimating the optimal transport map under standard stability assumptions.
Estimates optimal transport maps with known cost functions.
problem Ensuring optimal transport maps correspond to real-world usefulness.
method Differentiable neural ground costs with known Monge map forms.
result General approach for incorporating prior information.
The paper optimizes estimating transport maps between distributions.
problem Estimating optimal transport maps between distributions.
method Plugin approach using optimal couplings and extensions.
result Minimax optimality of the proposed estimators.
Efficiently estimates optimal transport maps with rigorous guarantees.
problem Estimating optimal transport maps between distributions efficiently.
method Entropic version of Brenier's theorem, Sinkhorn's algorithm.
result Estimator is parallelizable and efficient for massive data sets.
Paper tackles large-scale optimal transport and mapping estimation.
problem Learning optimal maps between large distributions.
method Two-step approach: first, stochastic dual regularized OT; second, Monge map estimation.
result The method scales better with large samples and converges to optimal maps.
Estimates point counts in Teichmüller space for mapping class groups.
problem Counting points in Teichmüller space under mapping class group actions.
method Quantitative estimates with power saving error terms for Teichmüller metric balls.
result Effectivizes asymptotic counting results of Athreya et al.
Estimates discontinuous optimal transport maps between a discrete and continuous distribution.
problem Estimating discontinuous optimal transport maps between a discrete and continuous distribution.
method Entropic optimal transport estimator, computationally efficient.
result The estimator converges at the minimax-optimal rate in the semi-discrete setting.
Spatially scalable recursive estimation of Gaussian process terrain maps using local basis functionscs.LG
New algorithm speeds up online mapping of unknown terrains.
problem Increasing computational demands of GP mapping as area expands.
method Recursive GP mapping using local basis functions in an information filter.
result Reduces overall computational complexity and speeds up mapping.
For harmonic maps of degree 2, a similar quantitative stability estimate does not hold uniformly.
problem Investigate the quantitative stability of harmonic maps of degree 2.
method Prove a local quantitative stability result for harmonic maps of degree 2, showing dependence on the given harmonic map.
result A uniformly quantitative stability estimate does not hold for degree 2 harmonic maps.
On the Gauss Map of Anisotropic Minimal Surfaces and applications to the Morse Index estimatesmath.DG
Study on Gauss map of anisotropic minimal surfaces with Morse index estimates.
problem Estimating the Morse index of anisotropic minimal surfaces.
method Local analysis of Gauss map, conformal geometric techniques applied to the Gauss map.
result Upper and lower estimates for the Morse index of anisotropic minimal surfaces.
Paper analyzes harmonic maps blow-up neck regions.
problem Understanding blow-up regions in harmonic maps.
method Proved refined estimates in neck regions.
result New estimate reveals neck shape and inequality about nullity and index.
A new method reduces dimensionality for better likelihood-free parameter estimation.
problem Estimating parameters from data with no closed-form likelihood.
method Combines reconstruction map estimation with dimension-reduction techniques.
result The proposed method outperforms existing techniques in accuracy and efficiency.
Study improves regularity estimates for harmonic maps into ellipsoids.
problem Independence of regularity estimates on harmonic maps with varying target dimensions.
method Analyzes harmonic maps into ellipsoids, uses Palais-Smale sequences, and critical metrics.
result Enhanced regularity estimates for Laplace harmonic eigenmaps.
Study stability of rigid motions and Möbius transformations on spheres, proving new rigidity estimates.
problem Stability of rigid motions and Möbius transformations on spheres.
method Investigates both linear and nonlinear stability aspects of rigid motions and Möbius transformations of S^(n-1) into R^n.
result Optimal rigidity estimates for isometric and conformal maps from S^(n-1) to R^n, including new Korn-type inequalities.
The paper estimates sub-Laplacian and proves existence of pseudo-harmonic maps.
problem Estimating sub-Laplacian and proving existence of pseudo-harmonic maps.
method Estimates sub-Laplacian of Riemannian distance functions and deduces a prior horizontal gradient estimate.
result Establishes Liouville theorem and proves existence of pseudo-harmonic maps.
New algorithm estimates transport maps with nearly optimal error.
problem Estimating smooth transport maps efficiently and accurately.
method Solving semi-dual formulation of optimal transport with kernel sums-of-squares.
result Statistical error on maps nearly matches minimax lower-bounds.
Bayesian method improves PCA and MUSIC for unknown number of sources.
problem Estimating the number of sources in PCA and MUSIC algorithms.
method Bayesian inference for computing the exact MAP estimate of the number of sources.
result Bayesian method outperforms AIC in estimating the number of sources.
Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric Projectionsmath.ST
The paper analyzes rates of convergence for optimal transport map estimators using barycentric projections.
problem Estimating optimal transport maps from data sampled according to two distributions.
method Comprehensive analysis of rates of convergence for plug-in estimators defined via barycentric projections.
result New stability estimate for barycentric projections under minimal smoothness assumptions.
We estimate the linear isoperimetric constants of an n-dimensional ellipse. Using these estimates and a technique of Gromov, we estimate the Hopf and linking invariants of Lipschitz maps from ellipses to round spheres. Using these estimates, we give a lower bound for the k-dilation of degree non-zero maps between ellip…
Unified methodology for estimating optimal transport maps in various function spaces.
problem Estimating the function given samples from and .
method Unified methodology based on Poincaré inequality and smooth convex function gradient.
result Nearly sharp results in various settings, including normal distribution and neural networks.
Bayesian HMM for protein alignment state estimation.
problem Estimating the MAP state sequence for a Bayesian HMM.
method Training data with Dirichlet priors, iterative algorithms for MAP path estimation.
result Bayesian setup outperforms frequentist estimation in protein alignment.
The paper bounds the energy index of harmonic Gauss maps on surfaces.
problem Bounding the energy index of harmonic Gauss maps on surfaces.
method Analyzes closed and complete non-compact surfaces in Lie groups with bi-invariant metrics.
result The energy index of the Gauss map is bounded by the topological genus.
Paper introduces a neural network for consistent estimation of optimal transport maps.
problem Statistically consistent estimation of optimal transport maps between probability distributions.
method Lipschitz-constrained GAN penalized by quadratic transportation cost.
result The generator converges uniformly to the optimal transport map as sample size increases.
New risk-averse estimators uniquely characterize MAP and Wallace-Freeman estimators.
problem Formalizing and characterizing Bayesian point estimators.
method Formulated axioms for inference, showing unique characterizations of MAP and Wallace-Freeman estimators.
result Axioms uniquely characterize MAP and Wallace-Freeman estimators for different types of estimation problems.
Statistical Convergence Rates of Optimal Transport Map Estimation between General Distributionsmath.ST
The paper improves OT map estimation rates without strict assumptions.
problem Estimating optimal transport maps under practical conditions.
method Developed new convergence rates and scalable algorithms.
result Improved convergence rates for OT map estimation without restrictive assumptions.
New geometric approach gives apriori estimate for optimal transport maps.
problem Proving regularity of optimal transport maps under Ma--Trudinger--Wang condition.
method Geometric derivation using pseudo-Riemannian geometry.
result New derivation of interior estimate for optimal maps.
For stationary harmonic maps between Riemannian manifolds, we provide a necessary and sufficient condition for the uniform interior and boundary gradient estimates in terms of the total energy of maps. We also show that if analytic target manifolds do not carry any harmonic S^2, then the singular sets of stationary map…
Mapping class group dynamics tracked through Teichmüller space.
problem Tracking mapping class group actions on Teichmüller space.
method Action on Teichmüller space and geometric intersection numbers.
result Effective estimate of mapping class group actions on Teichmüller space.
Estimates index of harmonic maps from surfaces to complex projective spaces.
problem Estimating the index of harmonic maps from surfaces to complex projective spaces.
method Estimating dimensions of spaces of holomorphic sections of line bundles.
result Improved lower bounds on the index of harmonic maps.
GLasso: Regularized Multi-task Graphical Lasso for Joint Estimation of eQTL Mapping and Gene Networkstat.ML
A new method for joint eQTL mapping and gene network estimation.
problem Discovering SNP-gene relationships and gene-gene relationships in gene expression regulation.
method L1-2 regularized multi-task graphical lasso (L1-2 GLasso).
result Competitive performance on capturing true sparse structures of eQTL mapping and gene network.
Quantum SU(n) representations are asymptotically faithful with norm estimates.
problem Asymptotic faithfulness of quantum SU(n) representations of mapping class groups.
method Peak sections in Kodaira embedding and parallell transport of projective connection.
result Norm estimates and asymptotic faithfulness of quantum SU(n) representations.
Paper proves equivalence of derivatives for maps between Carnot groups.
problem Maps between Carnot groups and their derivatives.
method Elementary proof using Euclidean arguments and mean value estimates.
result Maps preserving horizontal curves are continuously Pansu differentiable.
New framework for learning KR maps from data, ensuring stable generalization.
problem Learning monotone triangular transport maps efficiently and accurately.
method General framework using invertible transformations of smooth functions, ensuring no spurious local minima.
result Unique global minimizer corresponds to the KR map under certain conditions.
New method provides exact performance guarantees for MAP inference in deep networks.
problem Analyzing MAP inference in deep networks with complex data.
method Multi-layer vector approximate message passing (ML-VAMP) method.
result Mean squared error of ML-VAMP estimate can be exactly characterized in high-dimensional random limit.
Sharp estimate shows maps with small energy defect are close to rational maps.
problem Quantitative rigidity of maps from to of general degree.
method Proved maps with small energy defect are essentially given by a collection of rational maps at different scales.
result Sharp quantitative rigidity estimate , sharpness shown.
Study compares distances for indoor WiFi mapping, finding Earth Mover's Distance effective.
problem Indoor localization and mapping using WiFi signals.
method Comparison of distance measures and kernel density estimation.
result Earth Mover's Distance is most beneficial for indoor localization.