Semi-discrete Flow Matching produces terminal assignment regions that are topologically simple (open, simply connected, homeomorphic to the ball under assumption) yet geometrically distinct from optimal transport Laguerre cells, as they can be non-convex with curved boundaries.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
years
2026 6roles
background 1polarities
background 1representative citing papers
Temperature scaling of density-matrix eigenvalues from LLM semantic embeddings optimizes proper-score calibration and corrects systematic overconfidence so entropy equals risk.
Establishes exponential convergence in Wasserstein distance for the mean-field limit and finite-particle approximation of a consensus-based method solving nonconvex bi-level optimization problems.
A relative inexact proximal ALM with a tailored semismooth Newton solver solves sparse spectral-risk optimization faster than ADMM while matching stationarity and sparsity on synthetic and real data.
A large-deviations method generates plausible stress scenarios for financial losses by concentrating on most likely configurations conditional on large losses, recovering stressed loss laws even with sparse data.
citing papers explorer
-
Tessellations of Semi-Discrete Flow Matching
Semi-discrete Flow Matching produces terminal assignment regions that are topologically simple (open, simply connected, homeomorphic to the ball under assumption) yet geometrically distinct from optimal transport Laguerre cells, as they can be non-convex with curved boundaries.
-
Eigenvalue Calibration for Semantic Embeddings of Large Language Models
Temperature scaling of density-matrix eigenvalues from LLM semantic embeddings optimizes proper-score calibration and corrects systematic overconfidence so entropy equals risk.
-
Convergence of Consensus-Based Particle Methods for Nonconvex Bi-Level Optimization
Establishes exponential convergence in Wasserstein distance for the mean-field limit and finite-particle approximation of a consensus-based method solving nonconvex bi-level optimization problems.
-
A Semismooth Newton Augmented Lagrangian Method for Sparse Spectral Risk Optimization
A relative inexact proximal ALM with a tailored semismooth Newton solver solves sparse spectral-risk optimization faster than ADMM while matching stationarity and sparsity on synthetic and real data.
-
Generating Plausible Stress Scenarios via Large Deviations
A large-deviations method generates plausible stress scenarios for financial losses by concentrating on most likely configurations conditional on large losses, recovering stressed loss laws even with sparse data.
- Convergence of difference inclusions: a diameter criterion and step-size conditions