A novel score decouples shape deformations for better shape analysis.
problem High-dimensional deformations absorb lower-dimensional components, affecting statistical analysis.
method Introduces a coupling score using varifold representation of vector fields to quantify and decouple deformation modes.
result The coupling score effectively decouples distinct deformation modes during registration, improving shape analysis.
New optimal transport divergences derived from scoring functions.
problem Developing new divergences for optimal transport.
method Using scoring functions as cost functions in optimal transport.
result Comonotonic coupling is optimal for many new divergences.
Paper introduces a new model for polyphonic music composition.
problem Creating music with multiple interwoven voices.
method Developed a coupled recurrent model using probabilistic factorization and neural network ideas.
result Trained models for single-voice and multi-voice composition on a large dataset.
New bounds close the score matching gap for diffusion models.
problem The difference between sample quality and score matching loss in diffusion models.
method Theoretical analysis of score matching gap, developing tighter bounds for KL divergence, reverse KL divergence, and Wasserstein distance.
result The quality of score approximation impacts closing the score matching gap for low noise scales.
In this paper, we propose an effective THresholding method based on ORder Statistic, called THORS, to convert an arbitrary scoring-type classifier, which can induce a continuous cumulative distribution function of the score, into a cost-sensitive one. The procedure, uses order statistic to find an optimal threshold for…
Paper analyzes convergence of ODE samplers in Wasserstein distances.
problem Limited theoretical understanding of convergence properties of probability flow ODEs.
method Convergence analysis for general probability flow ODEs in 2-Wasserstein distance.
result First non-asymptotic convergence analysis for probability flow ODE samplers.
Algorithm learns non-Gaussian graphical models via Hessian scores and triangular transport.
problem Learning graph structure from non-Gaussian data.
method Score based on integrated Hessian information, coupled with triangular transport map.
result Algorithm successfully recovers graph structure for non-Gaussian data.
A new filter reduces density fitting to a linear solve, improving performance on nonlinear systems.
problem Nonlinear Bayesian filtering challenges in representing belief distributions.
method Combines score matching with Stein's identity to avoid partition function evaluation.
result The Score Kalman Filter (SKF) outperforms existing methods on nonlinear systems.
Improved flow-based models capture dependencies better with multi-scale autoregressive priors.
problem Limited expressiveness of flow-based models for long-range data dependencies.
method Introducing channel-wise dependencies through multi-scale autoregressive priors (mAR) in split coupling flow layers (mAR-SCF).
result Achieves state-of-the-art density estimation results on MNIST, CIFAR-10, and ImageNet.
End-to-end training of DBMs with improved gradient estimation.
problem Biased gradient estimation in DBMs, especially with high-dimensional states.
method Unbiased contrastive divergence using MH coupling and local mode initialization.
result End-to-end training of DBMs without greedy pretraining, achieving FID score of 10.33 for MNIST.
HED Score improves temporal evaluation of detection accuracy.
problem Temporal agnosticism in existing evaluation frameworks for non-stationary processes.
method Measure-theoretic HED Score integrating exponentially decaying kernel over posterior probability stream.
result HED Score achieves 388.8% improvement over ROC/AUC on NSL-KDD benchmark.
Improved generative models using critically-damped Langevin diffusion.
problem Current score-based generative models (SGMs) use overly simplistic diffusion processes, leading to complex denoising tasks and suboptimal performance.
method Proposed a novel critically-damped Langevin diffusion (CLD) and derived a score matching objective and sampling scheme.
result CLD-based SGMs achieve superior performance in synthesis quality compared to previous methods.
Improved sampling in generative models using CLDs with a hyperparameter.
problem Improving sampling performance in generative models.
method Extending Critically-damped Langevin Diffusions with a hyperparameter to control noise.
result Derivation of a novel upper bound on Wasserstein sampling error.
Mathematical analysis improves SGMs, resolving memorization issues.
problem Improving performance and avoiding memorization in SGMs.
method Formulated SGMs using Wasserstein proximal operators and mean-field games.
result Improved SGM performance in terms of training samples and time.
New algorithm samples neural network posteriors efficiently.
problem Challenges of sampling multimodal Bayesian posteriors for neural networks.
method Greedy Bayes method using log-concave coupling of posterior and auxiliary random variable.
result Log-concave coupling facilitates efficient sampling of neuron weights.
SurvivalBoost improves prediction of event times in competing risks scenarios.
problem Predicting event times in scenarios with multiple possible outcomes.
method Developed a strictly proper censoring-adjusted scoring rule for stochastic optimization of competing risks.
result SurvivalBoost outperforms 12 state-of-the-art models across various metrics.
SRMC framework reduces Monte Carlo variance by history-based sampling in high-dimensional spaces.
problem Efficient sampling in high-dimensional discrete or continuous state spaces.
method Score-Repellent Monte Carlo (SRMC) framework that summarizes history through running average of score evaluations.
result Improves estimator variance and mode coverage with constant memory usage.
Paper proposes GAN architectures for generating vector sketches.
problem Lack of GAN architectures for generating vector sketches.
method Proposes SkeGAN and VASkeGAN architectures for vector sketch generation.
result Validated that proposed architectures generate visually appealing sketches.
Framework uses optimal transport to quantify model risk in stochastic path laws.
problem Model risk in stochastic path laws.
method Signature-induced optimal transport framework.
result Explicit robust bounds and budget-aware sparse surrogate method.
We introduce a new method to measure model risk using optimal transport on path signatures.
problem Measuring model risk in financial and insurance models.
method Signature-induced optimal transport framework.
result Explicit robust bounds and a budget-aware sparse surrogate method.
We introduce Primal-Dual Wasserstein GAN, a new learning algorithm for building latent variable models of the data distribution based on the primal and the dual formulations of the optimal transport (OT) problem. We utilize the primal formulation to learn a flexible inference mechanism and to create an optimal approxim…
Modeling complex systems with multi-resolution data and causal dependencies.
problem Accurate prediction of complex systems with varying causal dependencies and multi-resolution data.
method Score-based Variational Graphical Diffusion Model (Temporal-SVGDM) that constructs individual SDEs for each variable at its native resolution and couples them through a causal score mechanism.
result Improved prediction accuracy and causal understanding compared to existing methods, especially in temporal scenarios.
Fragility curves which express the failure probability of a structure, or critical components, as function of a loading intensity measure are nowadays widely used (i) in Seismic Probabilistic Risk Assessment studies, (ii) to evaluate impact of construction details on the structural performance of installations under se…
New sampling method using regularized Wasserstein proximal for Gibbs distributions.
problem Sampling from Gibbs distributions with numerical stability and efficiency.
method Preconditioned regularized Wasserstein proximal operator.
result Discrete-time convergence analysis and explicit bias characterization.
Paper analyzes Langevin dynamics for multimodal Gaussian mixtures, controlling errors across dimensions.
problem Challenges in obtaining stable diffusion-based samplers in high- and infinite-dimensional settings.
method Study of preconditioned Annealed Langevin Dynamics (ALD) for Gaussian mixtures, focusing on Euler-Maruyama (EM) and exponential-integrator schemes.
result Proves dimension-uniform KL bounds for the exponential-integrator scheme, allowing arbitrarily small divergence with dimension.
New method uses rank-conditioned Horvitz-Thompson estimation for unbiased sample reuse in Plackett-Luce best-of-K objective.
problem Estimating the expected maximum reward in Plackett-Luce draws without replacement.
method Rank-conditioned Horvitz-Thompson estimation with joint-score REINFORCE for unbiased sample reuse.
result Unbiased estimation of the Plackett-Luce best-of-K objective with finite second moment guarantees.
A graph neural network improves multivariate post-processing of ensemble forecasts.
problem Systematic biases in ensemble forecasts and loss of dependencies across forecast dimensions.
method A composite-Loss Graph Neural Network (dualGNN) trained with a composite loss function combining ES and VS.
result The dualGNN outperforms traditional methods in multivariate verification metrics and captures spatial relationships.
A new method for SVGD reduces variance in high dimensions.
problem High-dimensional variance in SVGD.
method Grassmann Stein Variational Gradient Descent (GSVGD) projects onto arbitrary subspaces and uses coupled Grassmann-valued diffusion.
result GSVGD explores high-dimensional problems with intrinsic low-dimensional structure efficiently.
SJDs unify masked, continuous, and hybrid diffusion models.
problem Unified modeling of diffusion processes.
method Continuous-time Markov processes with token embeddings and hazard rates.
result Unified model recovers masked, continuous, and hybrid diffusion as limits.
Generative Cross-Entropy improves classification with fewer labels.
problem Limited sample efficiency of cross-entropy loss in data-scarce scenarios.
method Proposes Generative Cross-Entropy (GenCE), a new loss function that incorporates generative principles into a standard discriminative network.
result Generative Cross-Entropy outperforms traditional cross-entropy loss across various datasets and conditions.
New analysis shows how cross-entropy training shapes attention in transformers.
problem Understanding how gradient-based learning creates the required internal geometry in transformers.
method Developed a first-order analysis of cross-entropy training effects on attention scores and values in a transformer attention head.
result Introduced an advantage-based routing law and responsibility-weighted update for attention scores and values, respectively.
Study of coupled Sasaki-Einstein and solitons metrics.
problem Existence and properties of coupled Sasaki-Einstein and solitons metrics.
method Isomorphism between Lie algebra and space of coupled basic functions, use of coupled twisted Laplacians, reduction to Kähler-Einstein metrics, existence of toric coupled Sasaki-Einstein metrics.
result Existence and properties of coupled Sasaki-Einstein and solitons metrics, reduction to known cases when applicable.
This work extends stochastic localization to joint probability measures for data analysis.
problem Data distributional analysis in high-dimensional probability.
method Unified stochastic localization under Eldan's α-scheme, coupled probability measures via shared Brownian motion.
result Eldan's α-distance as a scalable surrogate for Wasserstein distance.
Defines coupled embeddability for maps on products of spaces, generating examples and nonexamples.
problem Understanding when maps on products of spaces can be embedded.
method Uses known results for nonsingular biskew and bilinear maps, studies genericity properties, extends Whitney embedding theorems, and relates to Z/2-coindex of embedding spaces. result Generates strong obstructions to coupled embeddability in terms of combinatorics of triangulations.
A new method generates mixed-type features in tabular data with improved realism and accuracy.
problem Generating mixed-type features combining discrete and continuous data is challenging.
method A cascaded approach: first generates low-resolution categorical and coarse numerical features, then uses these in a high-resolution flow matching model.
result The model significantly improves detection scores, generating more realistic samples and capturing distributional details.
Solves modified conjecture for Fano manifolds using Ding stability.
problem Finding Kähler-Einstein metrics on Fano manifolds.
method Interprets Ding semistability and solves modified conjecture.
result Solves modified conjecture for coupled Kähler-Einstein metrics on Fano manifolds.
UNTIE learns representations of coupled categorical data.
problem Challenges in learning from unlabeled categorical data with complex couplings.
method UNTIE approach for unsupervised representation learning of heterogeneous couplings.
result UNTIE significantly improves categorical data representations on 25 diverse datasets.
Paper discusses conditions for deforming coupled Kähler-Einstein metrics.
problem Conditions for deforming coupled Kähler-Einstein metrics.
method Analyzes deformation of coupled Kähler-Einstein metrics on Fano manifolds.
result Necessary and sufficient condition for deformation of coupled Kähler-Einstein metrics.
Develops non-Markovian couplings for sub-Riemannian Brownian motions.
problem Constructing couplings for sub-Riemannian Brownian motions starting from points on the same vertical fiber.
method Uses global isometries to construct maximal couplings, satisfying a reflection principle.
result Estimates coupling time and applies to inequalities for the heat semigroup.
This work analyzes SGGMs, offering convergence insights and practical design tips.
problem Theoretical convergence analysis for SGGMs with a system of coupled SDEs.
method Non-asymptotic convergence analysis for three graph generation paradigms.
result Unique factors affecting convergence in SGGMs and practical hyperparameter selection.
Numerical observations on martingale couplings are confirmed under certain conditions.
problem Understanding the validity of numerical observations on maximizers and minimizers of martingale couplings.
method Investigation of sufficient conditions and counterexamples for the property to hold.
result The non-decreasing property of martingale couplings is preserved for maximizers under specific conditions.
Compositional diffusion models simulate coupled PDEs efficiently.
problem Efficiently simulating long-horizon coupled PDE systems.
method Diffusion models trained on decoupled data are composed at inference time.
result Compositional diffusion models recover coupled trajectories with low error.
The paper studies the question of whether the classical mirror and synchronous couplings of two Brownian motions minimise and maximise, respectively, the coupling time of the corresponding geometric Brownian motions. We establish a characterisation of the optimality of the two couplings over any finite time horizon and…
Generative Adversarial Networks have become one of the most studied frameworks for unsupervised learning due to their intuitive formulation. They have also been shown to be capable of generating convincing examples in limited domains, such as low-resolution images. However, they still prove difficult to train in practi…
Unified analytic account of correlation emergence and Epps effect in coupled limit order books
problem Correlation emergence and Epps effect in coupled limit order books
method Discrete random-walk description of order flow with creation, cancellation, and diffusion, coupled reaction-diffusion equations with moving reaction boundary
result Realized correlations as a function of aggregation time
Study on kinetic Langevin diffusions and their couplings, showing subtle TV bounds and new non-Markovian couplings.
problem Understanding and quantifying the TV distance between solutions of kinetic Langevin diffusions with different initial values.
method Established new non-Markovian couplings for kinetic Langevin diffusions, derived from optimal coalescence trajectories, and analyzed their TV bounds.
result No Markovian coupling can capture the asymptotic decay rate of the TV distance between solutions of kinetic Langevin diffusions with different initial values.
Vortices and coupled vortices arise from Yang-Mills-Higgs theories and can be viewed as generalizations or analogues to Yang-Mills connections and, in particular, Hermitian-Yang-Mills connections. We proved an analytic compactification of the moduli spaces of vortices and coupled vortices on hermitian vector bundles ov…
Two probability distributions μ and ν in second stochastic order can be coupled by a supermartingale, and in fact by many. Is there a canonical choice? We construct and investigate two couplings which arise as optimizers for constrained Monge-Kantorovich optimal transport problems where only supermartingales are al…