Proposes GDTW for aligning time series on different, incomparable spaces.
problem Dynamic time warping requires comparable spaces, but time series can live on different, incomparable spaces.
method Gromov dynamic time warping (GDTW) considers intra-relational geometry to avoid comparability requirements.
result Demonstrates effectiveness of GDTW in aligning, combining, and comparing time series on incomparable spaces.
This thesis tackles Optimal Transport on incomparable spaces, proposing new tools and properties.
problem How to apply Optimal Transport between graphs and structured data in different metric spaces?
method Study of Gromov-Wasserstein distance and development of new Optimal Transport tools.
result Mathematical properties and algorithmic solutions for transport problems on incomparable spaces.
A new Wasserstein distance method for comparing incomparable distributions.
problem Comparing distributions that are not supported on the same metric space.
method Distributional slicing, embeddings, and closed-form computation of Wasserstein distance.
result HWD preserves properties like rotation-invariance and can be efficiently learned.
Generative Adversarial Networks have shown remarkable success in learning a distribution that faithfully recovers a reference distribution in its entirety. However, in some cases, we may want to only learn some aspects (e.g., cluster or manifold structure), while modifying others (e.g., style, orientation or dimension)…
We propose an SDP relaxation for the Gromov-Wasserstein distance, providing globally optimal solutions.
problem Matching objects between incomparable spaces using the Gromov-Wasserstein distance.
method Semi-definite programming (SDP) relaxation of the GW distance.
result The SDP relaxation provides globally optimal solutions for the GW distance in some instances.
The paper constructs wild Cantor sets in high dimensions.
problem Embedding Cantor sets in high-dimensional spaces.
method Constructing embeddings of Cantor sets in \(\mathbb{R}^n\).
result Embeddings create pairwise wild Cantor sets that are ambiently incomparable.
Local surrogate explainers vary in objectives, leading to incomparable explanations.
problem Variability in objectives among local surrogate explainers.
method Review of multiple local surrogate explainers, focusing on extracted information.
result Diverse explanations from similar methods due to differing objectives.
Faster GW alignment for incomparable point clouds via low-rank couplings.
problem Aligning points across incomparable point clouds.
method Low-rank couplings and costs to solve Gromov-Wasserstein framework in linear time.
result Linear-time computation of Gromov-Wasserstein distances.
Framework benchmarks optimizers on multiple criteria.
problem Benchmarking optimizers across diverse test functions.
method Union-free generic depth function for partial orders/rankings.
result Identifies central and outlying rankings of optimizers.
A new algorithmic framework is proposed for learning autoencoders of data distributions. We minimize the discrepancy between the model and target distributions, with a \emph{relational regularization} on the learnable latent prior. This regularization penalizes the fused Gromov-Wasserstein (FGW) distance between the la…
Unbalanced COOT improves feature alignment robustly to outliers.
problem Optimal transport methods are sensitive to outliers in real-world data.
method COOT infers alignment between features and samples, unbalanced COOT adds robustness.
result Unbalanced COOT is robust to noise in real-world datasets.
New method detects Kaehler scalar flat metrics and minimal hypersurfaces.
problem Detecting Kaehler scalar flat metrics and minimal hypersurfaces.
method New general method to describe Kaehler scalar flat metrics and check stability.
result Penrose Inequality holds for Kaehler scalar flat ALE spaces, and inequalities are incomparable.
This paper benchmarks speech LVMs against deterministic models and adapts a video model to speech.
problem Speech generation models are inferior to deterministic models.
method Developed a speech benchmark of LVMs and compared them against deterministic models.
result The Clockwork VAE outperforms previous LVMs and reduces the gap to deterministic models.
Two commonly arising computational tasks in Bayesian learning are Optimization (Maximum A Posteriori estimation) and Sampling (from the posterior distribution). In the convex case these two problems are efficiently reducible to each other. Recent work (Ma et al. 2019) shows that in the non-convex case, sampling can som…
Proposes an efficient lower bound for Gromov-Wasserstein discrepancy.
problem Comparing structured data from different metric-measure spaces.
method Orthogonal Gromov-Wasserstein (OGW) discrepancy with efficient closed-form lower bound.
result Efficient and tight lower bounds for Gromov-Wasserstein discrepancy.
Researchers analyze neural process architectures and their representational capacities.
problem Understanding what functions can be represented by different neural process architectures.
method Analyzing four types of neural process architectures: CNPs, ANPs, TNPs, and their latent variants.
result Prove these architectures form a strict hierarchy and characterize their representational capabilities.
NATS-Bench benchmarks NAS algorithms for architecture topology and size.
problem Incomparable performance of NAS algorithms due to different search spaces and training setups.
method Unified benchmarking platform for architecture topology and size searching.
result Validated benchmark for 15,625 topology and 32,768 size candidates.
Robotic grasp stability improved with fingertip slippage detection.
problem Improving grasp stability in robotic manipulation.
method Task-relevant feature extraction and efficient classifier design for fingertip slippage detection.
result The proposed method effectively detects object slippage with fingertips in an online fashion.
This work shows how evaluation metrics can be seen as fair gambles.
problem The relationship and evaluation of machine learning forecasts.
method Using game-theoretic probability, the authors show evaluation metrics as fair gambles.
result Standard evaluation metrics are fair gambler outcomes, with calibration and regret metrics on two dimensions.
The PARAFAC2 is a multimodal factor analysis model suitable for analyzing multi-way data when one of the modes has incomparable observation units, for example because of differences in signal sampling or batch sizes. A fully probabilistic treatment of the PARAFAC2 is desirable in order to improve robustness to noise an…
Paper explores learning patterns in binary sequences, finding no method consistently outperforms others.
problem Learning patterns in infinite binary sequences.
method Various learning methods are compared, finding no method consistently outperforms others.
result No learning method consistently outperforms others in predicting binary sequences.
GD outperforms ridge regression and SGD in linear regression problems.
problem Comparing the risks of GD, ridge regression, and SGD in linear regression problems.
method Instance-wise finite-sample risk analysis of GD, ridge regression, and SGD.
result GD outperforms ridge regression and is incomparable with SGD in some cases.
The paper addresses calibration in label ranking, a structured prediction task.
problem Calibration in label ranking is not well understood and often poorly calibrated.
method Formalized calibration for label ranking, developed a hierarchy of notions, and empirically evaluated models.
result Popular label ranking models are often poorly calibrated, with differences between sub-ranking and top-k metrics.
This paper solves optimal consumption-investment problems with time-varying preferences.
problem Optimal consumption-investment problems under time-varying incomplete preferences.
method Develops a martingale-type solution in a topological vector space, using stochastic processes and scalarization methods.
result Optimal investment policies are set-valued, with selectors decomposed into four components.
In this work, we initiate a formal study of probably approximately correct (PAC) learning under evasion attacks, where the adversary's goal is to \emph{misclassify} the adversarially perturbed sample point x ~ \widetilde{x} x , i.e., h ( x ~ ) ≠ c ( x ~ ) h(\widetilde{x})\neq c(\widetilde{x}) h ( x ) = c ( x ) , where c c c is the ground truth concept and h h h is t…
Hierarchical Partial-Order Models for Ranking
problem Rank aggregation combining ordered lists
method Hierarchical partial-order models
result Bayesian inference for latent poset hierarchy
PolyGraph Discrepancy improves graph generative model evaluation.
problem Inability of existing metrics to provide an absolute performance measure and comparability across different graph descriptors.
method Approximates Jensen-Shannon distance using binary classifiers trained to distinguish between real and generated graphs.
result PGD provides a more robust and insightful evaluation compared to MMD metrics.
Feature selection, in the context of machine learning, is the process of separating the highly predictive feature from those that might be irrelevant or redundant. Information theory has been recognized as a useful concept for this task, as the prediction power stems from the correlation, i.e., the mutual information, …
A new method for federated learning aggregates data from multiple sites efficiently.
problem Aggregating data from multiple sites securely and effectively.
method Sequential federated learning with distributed computing.
result Preserves information from individual analyses and accelerates the analysis process.
Unified platform SOCRATES for neural network analysis.
problem Analyzing neural networks for bugs and fairness.
method Standardized format, assertion language, and multiple analysis algorithms.
result Unified platform for neural network analysis.
Online Streaming Feature Selection (OSFS) is a sequential learning problem where individual features across all samples are made available to algorithms in a streaming fashion. In this work, firstly, we assert that OSFS's main assumption of having data from all the samples available at runtime is unrealistic and introd…
Quantum algorithm estimates multivariate mean with near-optimal efficiency.
problem Estimating the mean of multivariate random variables efficiently in quantum computing.
method Combines amplitude amplification, quantum singular value transformation, and Bernstein-Vazirani algorithm.
result Quantum estimator outperforms classical estimators outside low-precision regime.
New design method improves Lasso performance in sparse regression.
problem Sparse linear regression with correlated design columns.
method Introduces partially-rotated designs to improve Lasso's RE constant.
result Lasso achieves better prediction error with high probability.
Study of tangent spaces in diffeological spaces under Lie group actions.
problem Understanding tangent spaces in generalized spaces.
method Generalized tangent space construction and isomorphism proof.
result Internal tangent space isomorphic to stratified tangent space.
(1,1) non-L-space knots are foliar in 3D space.
problem Proving (1,1) non-L-space knots are foliar.
method Analyzing (1,1) non-L-space knots in S 3 S^3 S 3 and lens spaces. result (1,1) non-L-space knots are persistently foliar.
Universal spaces for finite topological spaces simplify shape descriptions.
problem Describing shape properties of compact metric spaces.
method Inverse limits of finite spaces and Alexandroff extensions.
result Universal spaces simplify shape descriptions of compact metric spaces.
The paper extends Stone duality to topological convexity spaces.
problem Understanding the relationship between topological convexity spaces and sup-lattices.
method Extending Stone duality to topological convexity spaces using preconvexity spaces.
result An adjunction between topological convexity spaces and sup-lattices.
No Einstein hypersurfaces found in Damek-Ricci spaces.
problem Existence of Einstein hypersurfaces in symmetric spaces.
method Analyzing properties of Damek-Ricci spaces and proving no Einstein hypersurface exists.
result No Einstein hypersurfaces in Damek-Ricci spaces.
The distance function ϱ ( p , q ) \varrho(p,q) ϱ ( p , q ) (or d ( p , q ) d(p,q) d ( p , q ) ) of a distance space (general metric space) is not differentiable in general. We investigate such distance spaces over R n \mathbb R^n R n , whose distance functions are differentiable like in case of Finsler spaces. These spaces have several good properties, yet they are no F…
New kernels defined for various spaces, including measures.
problem Defining kernels on non-standard spaces like measures.
method Integrally strictly positive definite and characteristic kernels on Hilbert, Banach, and metric spaces.
result Explicit classes of kernels on L p L^p L p spaces and sets of measures. Metric spaces uniquely split into Hilbert and non-line-split parts.
problem Understanding the structure of metric spaces.
method Proved unique decomposition into Hilbert and non-line-split parts.
result Metric spaces have a unique decomposition into a Hilbert space and a non-line-split part.
In a paper (math.DG/0403528) we obtained explicit examples of Moishezon twistor spaces of some compact self-dual four-manifolds admitting a non-trivial Killing field, and also determined their moduli space. In this note we investigate minitwistor spaces associated to these twistor spaces. We determine their structure, …
Study geometry of tetrahedra in complex hyperbolic space and Hilbert spaces.
problem Understanding geometric relationships between complex hyperbolic spaces and Hilbert spaces.
method Use a complex analog of the cosine of a vertex angle as a novel technical tool.
result Describe possible triangular faces of tetrahedra in hyperbolic space and three-dimensional subspaces in Hilbert spaces with Pick kernels.
New curvature positivity helps classify spherical spaces and complex projective spaces.
problem Classifying spherical space forms and complex projective spaces.
method Introducing a new positivity notion for curvature.
result Characterizations for spherical space forms and complex projective spaces.
Study of complete space-like self-expanders in Minkovski space.
problem Characterize complete space-like self-expanders in Minkovski space.
method Use of maximum principle of Omori-Yau type to prove rigidity theorems.
result Classification of 2-dimensional complete space-like self-expanders with constant squared norm of the second fundamental form.
The abstract discusses the linear and smooth structures of mapping spaces.
problem The structure of mapping spaces in differential geometry.
method Proving diffeomorphisms and fibre bundle properties.
result Path spaces and base point preserving mapping spaces are Fréchet spaces.
Study on convergence of transformed metric spaces as dimensions grow.
problem Conditions for convergence of transformed metric spaces.
method Clarifying conditions for convergence of transformed spaces from original sequence and vice versa.
result Spheres and projective spaces converge to Gaussian space and its quotient as dimensions increase.
Characterizes when almost smooth spaces become RCD spaces.
problem Understanding conditions for almost smooth spaces to be RCD spaces.
method Characterizations via local volume doubling and Poincaré inequality.
result Characterizes Einstein 4-orbifolds.