Decentralized optimization on dynamic manifolds with improved regret bound.
problem Optimizing on nonstationary Riemannian manifolds in decentralized systems.
method Decentralized projected Riemannian gradient descent with weighted Frechet mean consensus.
result Achieved dynamic regret bound of O ( T ( 1 + P T ) / ( 1 − σ 2 ( W ) ) ) {\cal O}(\sqrt{T(1+P_T)}/\sqrt{(1-σ_2(W))}) O ( T ( 1 + P T ) / ( 1 − σ 2 ( W )) ) . DFR models dynamic distributional data with weighted Fréchet means.
problem Regression of distribution-valued responses over time.
method Dynamic Fréchet Regression (DFR) with index-aware weighting and feature selection.
result Improved predictive accuracy and feature recovery over existing methods.
Proposes a new random forest weighted local Fréchet regression method.
problem Complex metric space valued responses and curse of dimensionality in Fréchet regression.
method Locally adaptive kernel generated by random forests for local average and local linear Fréchet regression.
result Significantly improves existing Fréchet regression methods with theoretical guarantees.
The paper develops predictors for functional data on manifolds.
problem Functional data prediction on time-varying manifolds.
method Least-squares local linear Fréchet curve predictor and weighted Fréchet mean approach.
result Asymptotical optimality of the proposed predictors.
Paper studies weighted Fermat-Frechet problem for simplex edge lengths.
problem Finding optimal edge lengths for simplex deformations.
method Isometric embedding techniques for K K K -Space. result New variational method to solve weighted Fermat-Frechet problem.
Differentiates Fréchet mean for hyperbolic space applications.
problem Difficulty in applying Fréchet mean due to lack of closed-form derivative.
method Developed differentiation method and explicit gradient expressions for hyperbolic space.
result Fully integrated Fréchet mean into hyperbolic neural network pipeline.
GEORCE-FM algorithm optimizes Fréchet means and distances efficiently.
problem Computing Fréchet means on Riemannian manifolds efficiently.
method GEORCE-FM algorithm that simultaneously computes Fréchet means and distances in local charts.
result GEORCE-FM algorithm converges globally and locally quadratically, and scales to large datasets.
A new method for network regression using optimal transport.
problem How network topology changes with Euclidean covariates.
method Optimal transport approach based on Wasserstein metric.
result The method improves prediction accuracy in real-world data.
Study shows zero probability of cut locus for Fréchet mean on Riemannian manifolds.
problem Understanding the cut locus of Fréchet mean on Riemannian manifolds.
method Analytical proof and examples.
result Cut locus of Fréchet mean has zero probability.
Estimates means in metric spaces using quantization.
problem No practical estimator for Fréchet means in all metric spaces.
method Introduced estimators based on random quantization and data-driven partitioning.
result Universal consistency of estimators across separable metric spaces and Banach spaces.
Sharp threshold found for Frechet mean of inhomogeneous graphs.
problem Finding the Frechet mean of inhomogeneous Erdos-Renyi random graphs.
method Thresholding the expected adjacency matrix of the ensemble.
result The Frechet mean graph of inhomogeneous Erdos-Renyi random graphs exhibits a sharp threshold.
New graph properties inherited by Frechet mean and median.
problem Characterizing the average of graph-valued samples.
method Analysis of Frechet mean and median graphs.
result Edge density is hereditary in Frechet mean and median graphs.
Improved method for computing Fréchet means on SPD matrices.
problem Computing Fréchet means on the manifold of SPD matrices.
method Random matrix theory-based approach for estimating Fréchet means.
result Significantly outperforms state-of-the-art methods in experiments.
New method uses CNNs to estimate graph means.
problem Estimating the mean of graph-valued data.
method Convolutional Neural Networks (CNNs) for graph morphology learning.
result CNNs reliably recover the sample Frechet mean.
A new algorithm solves signed Fréchet regression on manifolds with bounded curvature.
problem Signed Fréchet regression on Riemannian manifolds with bounded curvature.
method Proximal DC algorithm (FRIDA) for computing signed Fréchet regression fits.
result Existence and interiority of minimizers, strong convexity of proximal subproblems, and convergence to stationary points.
We compute an approximate Fréchet mean for sets of sparse graphs.
problem Characterizing the location of a set of graphs in a metric space.
method We use the pseudometric defined by the ℓ₂ norm of eigenvalues of adjacency matrices.
result We describe an algorithm to approximate the Fréchet mean of a set of graphs.
A new mechanism for differentially private Fréchet mean on SPD matrices.
problem Privacy-preserving statistical summaries for SPD matrices.
method Tangent Gaussian mechanism for log-Euclidean metric.
result Significantly better utility and computational efficiency.
Develop a framework for barycentric projections of optimal transport plans on Riemannian manifolds.
problem Optimal transport couplings are probabilistic objects, while many learning pipelines require deterministic maps.
method Develop a framework for barycentric projections of transport couplings on Riemannian manifolds.
result The intrinsic projection maps each source point to the conditional Fréchet mean of its destination law and is shown to be the best deterministic representative under squared geodesic loss.
The paper computes an approximation to the sample Frechet mean of graph sets using spectral information.
problem Characterizing the location of a set of graphs in a metric space.
method The Frechet mean is computed for sets of large graphs using the pseudometric defined by the norm between eigenvalues of adjacency matrices.
result An algorithm to approximate the sample Frechet mean of undirected unweighted graphs is described.
Study on the smoothness of solutions to a specific type of stochastic differential equation.
problem Regularity of solutions to mean-field G G G -SDEs. method Analysis of first and second order Fréchet differentiability in the random initial condition.
result Established the Fréchet differentiability of the solution and specified the corresponding equations.
Study of weighted nonlinear flags in symplectic geometry.
problem Understanding the geometry of weighted nonlinear flags.
method Generalizing weighted nonlinear Grassmannians to Frechet manifolds and using them to describe coadjoint orbits.
result Description of coadjoint orbits of Hamiltonian diffeomorphisms using weighted isotropic nonlinear flags.
Paper introduces a medoid-based approach for efficient Fréchet regression.
problem Regression in metric spaces with random objects.
method Adapted random forest algorithm with medoid-based splitting rule.
result Asymptotic equivalence and consistency of the regression estimator.
Test partial effects in Frechet regression on Bures-Wasserstein manifolds.
problem Assessing partial effects in Frechet regression on complex manifolds.
method Sample splitting strategy to estimate covariance matrices and test statistic convergence.
result The test statistic converges to a weighted mixture of chi squared components.
Framework detects shape shifts in functional profiles using Fréchet mean and shape invariant model.
problem Detecting shape shifts in functional profiles.
method Combining Fréchet mean and shape invariant model for interpretable parameterization of profile deviations.
result Potential shifts in shape deformation process distinguished by significant shifts in amplitude and/or phase.
EpiMer merges models by solving Fréchet mean on a Riemannian manifold.
problem Integrating knowledge from multiple models without retraining.
method EpiMer casts model merging as solving the Fréchet mean on a Riemannian manifold, restricting computation to a low-rank subspace.
result EpiMer outperforms flat-geometry methods on image classification tasks.
Study shows effective resistance distance yields more accurate network barycenter than Hamming distance.
problem Identifying the best metric for computing the Fréchet mean network.
method Compared the effectiveness of Hamming distance and effective resistance distance in capturing network topology.
result Effective resistance distance produces a more accurate Fréchet mean network.
Paper develops statistical tests for covariance matrix regression on manifold.
problem Regression with random covariance matrices in Fréchet space.
method Develops Wasserstein F-tests for Bures-Wasserstein manifold.
result Asymptotic null distribution and power of the test.
New class of heavy-tailed distributions shows weighted averages dominate individual variables.
problem Understanding and comparing risks in heavy-tailed distributions.
method Introducing a new class of heavy-tailed distributions and proving stochastic dominance relations.
result Weighted averages of random variables in this class are stochastically larger than individual variables.
We obtain a Central Limit Theorem for closed Riemannian manifolds, clarifying along the way the geometric meaning of some of the hypotheses in Bhattacharya and Lin's Omnibus Central Limit Theorem for Fréchet means. We obtain our CLT assuming certain stability hypothesis for the cut locus, which always holds when the ma…
E2M predicts metric space outputs using deep learning.
problem Predicting non-Euclidean outputs like distributions and matrices.
method Weighted Fréchet means over learned weights.
result E2M achieves state-of-the-art performance across various outputs.
This work analyzes Fréchet regression using comparison geometry, providing theoretical and practical insights.
problem Analyzing data on complex structures like manifolds and graphs.
method Theoretical analysis through comparison geometry, focusing on existence, uniqueness, and stability of the Fréchet mean.
result Key results on the existence, uniqueness, and stability of the Fréchet mean, along with statistical guarantees for nonparametric regression.
DFNNs predict non-Euclidean responses from Euclidean predictors.
problem Regression with non-Euclidean responses.
method Deep Fréchet neural networks (DFNNs) approximating conditional Fréchet means.
result DFNNs consistently outperform existing methods in empirical studies.
Deep single-index Fréchet regression for metric space-valued outputs
problem Predicting outputs in non-Euclidean spaces
method DeSI (Deep Single-Index Fréchet Regression)
result Interpretable index direction for inputs
Efficiently clusters data on manifolds using Fréchet maps.
problem Clustering on high-dimensional, non-Euclidean manifolds is computationally challenging.
method Introduces p p p -Fréchet map to embed manifold data into Euclidean space for k-means clustering. result Significant performance gains in runtime and accuracy compared to existing methods.
This paper explores the impact of metric choice on Fréchet regression.
problem Choosing the right metric for Fréchet regression in complex data.
method Review and extensive numerical studies of existing dimension reduction methods.
result Different metrics significantly affect the estimation of central and central mean space.
Paper optimizes FTPL for adversarial and stochastic bandits with specific tail distributions.
problem Optimizing Follow-the-Perturbed-Leader (FTPL) policy for bandit problems.
method Analyzes FTPL with Fréchet-type tail distributions in adversarial and stochastic settings.
result FTPL with certain Fréchet-type tail distributions achieves O ( K T ) \mathcal{O}(\sqrt{KT}) O ( K T ) regrets in adversarial bandits. This paper is a short summary of our recent work on the medians and means of probability measures in Riemannian manifolds. Firstly, the existence and uniqueness results of local medians are given. In order to compute medians in practical cases, we propose a subgradient algorithm and prove its convergence. After that, F…
A new method for averaging data on manifolds is proposed, offering simplicity and efficiency.
problem The difficulty of computing Fréchet means on manifolds, especially Stiefel and Grassmann.
method Proposed RL-barycenters, simpler arithmetic means projected onto the manifold.
result RL-barycenters yield simple yet effective means on Stiefel and Grassmann manifolds.
Many complex ecosystems, such as those formed by multiple microbial taxa, involve intricate interactions amongst various sub-communities. The most basic relationships are frequently modeled as co-occurrence networks in which the nodes represent the various players in the community and the weighted edges encode levels o…
We define Lie and Courant algebroids on Fréchet manifolds. Moreover, we construct a Dirac structure on the generalized tangent bundle of a Fréchet manifold and show that it inherits a Fréchet Lie algebroid structure. We show that the Lie algebroid cohomology of the $\bb$ -cotangent bundle Lie algebroid of a weakly sympl…
We introduce the new class of submanifolds of co-Banach type in tame Fréchet manifolds and construct tame Fréchet submanifolds as inverse images of regular values of certain tame maps. Our method furnishes an easy way to construct tame Fréchet manifolds. The results presented are key ingredients in the construction of …
Insurance benefits risk sharing for finite mean risks but not for infinite mean risks.
problem The effect of risk sharing and diversification for infinite mean risks.
method Investigation of risk sharing and diversification for infinite mean models, including stable, Pareto, and Fréchet distributions.
result Risk sharing can have a negative effect for infinite mean models, a phenomenon known as the nondiversification trap.
Some recent work in Frechet geometry is briefly reviewed. In particular an earlier result on the structure of second tangent bundles in the finite dimensional case was extended to infinite dimensional Banach manifolds and Frechet manifolds that could be represented as projective limits of Banach manifolds. This led to …
Paper develops methods for semi-supervised Fréchet regression.
problem High costs of obtaining non-Euclidean labels.
method Proposes semi-supervised NW Fréchet regression and semi-supervised kNN Fréchet regression.
result Demonstrates superior performance over supervised methods.
Novel convex risk measures aggregate multiple uncertain sources for insurance firms.
problem Managing risk from multiple uncertain sources in insurance.
method Proposes convex risk measures based on Fréchet mean.
result Allows for robust risk characterization and closed-form expressions.
Brain Electroencephalography (EEG) classification is widely applied to analyze cerebral diseases in recent years. Unfortunately, invalid/noisy EEGs degrade the diagnosis performance and most previously developed methods ignore the necessity of EEG selection for classification. To this end, this paper proposes a novel m…
A new metric compares dynamical systems using operator eigenvalues.
problem Comparing and interpolating nonlinear dynamical systems from trajectory data.
method Representing systems as distributions of operator eigenvalues and projectors, defining a spectral-Grassmann Wasserstein metric.
result The proposed metric outperforms standard operator-based distances in machine learning applications.
A new model for curves on manifolds using rolling operations.
problem Modeling curves on manifolds without explicit parametrization.
method Using rolling operations to construct Gaussian processes on manifolds.
result Conditions for the rolling of mean to equal Fréchet mean and estimators of parameters.