Paper shows faster convergence to local-minimizers in over-parametrized models under interpolation-like conditions.
problem Escaping saddle-points in over-parametrized models.
method Stochastic and deterministic optimization algorithms under interpolation-like conditions.
result Oracle complexity of PSGD and SCRN algorithms to reach ε-local-minimizer matches or improves upon deterministic rates. This work bridges stochastic interpolants to infinite-dimensional Hilbert spaces.
problem Limited flexibility in generating arbitrary distributions for function-valued data.
method Establishes a rigorous framework for stochastic interpolants in infinite-dimensional Hilbert spaces.
result Achieves state-of-the-art results in conditional generation for complex PDE-based benchmarks.
Improved complexity for machine learning optimization methods.
problem Optimizing over-parametrized models in machine learning.
method Stochastic conditional gradient methods with interpolation-like conditions.
result Improved oracle complexities for finding optimal solutions.
CSI method learns conditional distributions by estimating flow equations.
problem Learning conditional distributions in generative models.
method Estimates probability flow equations to transport reference to target distribution.
result Derives explicit expressions for conditional drift and score functions.
A semi-supervised framework using stochastic interpolation and latent representations.
problem Challenges in conditional generative modeling with scarce labeled data.
method Combines conditional stochastic interpolation with low-dimensional latent representations.
result Significantly improves sample complexity and achieves faster convergence rate.
Proposes a new method for probabilistic forecasting using stochastic interpolants and Föllmer processes.
problem Probabilistic forecasting of dynamical systems.
method Generative modeling and stochastic interpolants to map current state to probabilistic ensemble of forecasts.
result The approach can be used to forecast complex, high-dimensional systems like Navier-Stokes and video sequences.
This work combines recurrent models with diffusion for probabilistic time series forecasting.
problem Scalability and capturing high-dimensional distributions and cross-feature dependencies in time series forecasting.
method Combines recurrent neural networks' efficiency with diffusion models' probabilistic modeling, using stochastic interpolants and conditional generation.
result Offers scalable probabilistic time series forecasting methods.
We consider stochastic second-order methods for minimizing smooth and strongly-convex functions under an interpolation condition satisfied by over-parameterized models. Under this condition, we show that the regularized subsampled Newton method (R-SSN) achieves global linear convergence with an adaptive step-size and a…
Generative model learns shape drift for quantifying domain uncertainty in hemodynamics.
problem Quantifying domain uncertainty in medical image segmentation for biomarker estimation.
method Conditional stochastic interpolant framework based on LDDMM registration.
result Generative model can create random perturbations of shapes for biomarker estimation.
Stochastic gradient method converges as fast as deterministic for overparametrized models.
problem Convergence rate of stochastic gradient methods in overparametrized models.
method Proposes a regularity condition enabling fast convergence of SGD.
result Stochastic gradient method achieves the same convergence rate as deterministic gradient method.
New method generates equilibrium glass configurations efficiently.
problem Sampling equilibrium configurations of amorphous materials is slow and difficult.
method Riemannian stochastic interpolation framework combining Riemannian stochastic interpolant and equivariant flow matching.
result Enforcing geometric and symmetry constraints significantly improves generative performance.
We show that stochastic interpolation flow maps are Lipschitz with a sharp constant.
problem High dimensional sampling and transport problems.
method Investigating stochastic interpolation flow for generating data samples.
result Stochastic interpolation flow maps are Lipschitz with a sharp constant matching optimal transport maps.
We discuss the pricing methodology for Bonus Certificates and Barrier Reverse-Convertible Structured Products. Pricing for a European barrier condition is straightforward for products of both types and depends on an efficient interpolation of observed market option pricing. Pricing products We discuss the pricing metho…
New method generates clean data from corrupted observations.
problem Generating clean data from corrupted observations.
method Iterative update of a transport map using black-box corruption channel access.
result Converges to a self-consistent transport map that effectively inverts the corruption channel.
This work introduces a new method for coupling base and target densities in generative models.
problem Generating samples from complex target distributions using simple base distributions.
method Developed a framework of stochastic interpolants with data-dependent couplings.
result Constructing dynamical transport maps that serve as conditional generative models.
Paper develops SINNOs for approximating stochastic processes.
problem Approximating stochastic processes with neural networks.
method Developed stochastic interpolation neural network operators (SINNOs) with random coefficients.
result Established boundedness, interpolation accuracy, and approximation capabilities of SINNOs.
Recent works have shown that stochastic gradient descent (SGD) achieves the fast convergence rates of full-batch gradient descent for over-parameterized models satisfying certain interpolation conditions. However, the step-size used in these works depends on unknown quantities and SGD's practical performance heavily re…
Optimizes diffusion processes for target distributions.
problem Efficiently generating target distributions from point masses.
method Stochastic interpolant framework with conditional expectation drift.
result Optimal diffusion coefficient minimizes path-space KL divergence.
In this paper we propose a generalized numerical scheme for backward stochastic differential equations(BSDEs). The scheme is based on approximation of derivatives via Lagrange interpolation. By changing the distribution of sample points used for interpolation, one can get various numerical schemes with different stabil…
Covariance shrinkage via stochastic interpolation
problem High-dimensional covariance estimation
method Recasting shrinkage as empirical risk minimization
result Reduces statistical risk through scheduling, flow maps, and early stopping
Revisits stochastic collocation with exponential splines for option pricing.
problem Improving the accuracy of option price interpolation using stochastic collocation.
method Uses exponential quadratic splines and optimizes abscissae or parameters of B-splines.
result Shows that fixing abscissae and optimizing parameters leads to better interpolation accuracy.
Modern machine learning focuses on highly expressive models that are able to fit or interpolate the data completely, resulting in zero training loss. For such models, we show that the stochastic gradients of common loss functions satisfy a strong growth condition. Under this condition, we prove that constant step-size …
Framework learns continuous dynamics from sparse trajectories.
problem Learning dynamics from sparsely sampled and high-dimensional trajectories.
method Interpolative Multi-Marginal Flow Matching (IMMFM) framework.
result IMMFM outperforms existing methods in forecasting and downstream tasks.
New sampling method uses stochastic interpolants and FBSDEs.
problem Sampling from high-dimensional distributions with unnormalized densities.
method Stochastic interpolants and FBSDEs to define and solve diffusion process.
result Effective sampling from challenging distributions.
SGD converges to global minimum for structured non-convex functions.
problem Optimizing non-convex functions using SGD with slow convergence rates.
method Convergence theorems for SGD on structured non-convex functions, including Quasar and PL conditions.
result SGD converges to global minimum for specific non-convex functions under certain conditions.
This paper provides guarantees for DFM models using KL divergence.
problem Ensuring generative models match target distributions efficiently.
method Using KL divergence and Brownian motion bridge for generative models.
result Non-asymptotic guarantees for DFM models under specific conditions.
New method converts and optimizes sampling schedules for generative models.
problem Optimizing sampling schedules for generative models like flows and diffusions.
method Unified framework for stochastic interpolants, including point mass schedules.
result Demonstrated efficient generation of images with fewer steps.
Global approximation for piecewise linear paths via signatures.
problem Global approximation theorems for piecewise linear paths.
method Using signatures of piecewise linear paths and their density in Lp-norms. result Linear functionals of signatures are dense in Lp-norms under an integrability condition. GenSDR tackles SDR by leveraging generative models to fully recover lower-dimensional structures.
problem Challenges in identifying low-dimensional sufficient structures in nonlinear SDR.
method Proposes GenSDR, a method that uses modern generative models to fully recover information in the central σ-field.
result Establishes consistency of GenSDR estimator for sample-level data and extends its applicability to non-Euclidean responses.
Enhances interpolation paths in latent space using particle filters.
problem Generating meaningful interpolations between data points in latent space.
method Introduces a discriminator network to guide particle filter sampling of interpolation paths.
result Improved variability and stronger drift towards high data density areas.
RNGI model bridges two probability densities on Riemannian manifolds efficiently.
problem Limited applicability of Euclidean stochastic interpolants to Riemannian manifolds.
method Introduces RNGI model interpolating between Riemannian manifold probability densities along geodesics.
result Proves temporal marginal density solves transport equation on Riemannian manifold.
Private optimization faster on interpolation problems with quadratic growth.
problem Private optimization in interpolation problems.
method Adaptive algorithm with improved sample complexity.
result Exponential improvement in private sample complexity for quadratic growth.
Monotonic Linear Interpolation property in neural networks persists despite non-convexity.
problem Understanding the geometric properties of neural network loss landscapes.
method Tools from differential geometry to analyze the monotonicity of neural network weights.
result Sufficient conditions for the Monotonic Linear Interpolation property under mean squared error.
The study finds flaws in methods used to estimate foreign exchange option prices.
problem Flaws in estimating foreign exchange option prices.
method Provided counterexamples of popular FX option interpolation methods.
result Popular FX option interpolation methods fail in certain scenarios.
A scalable algorithm for sampling and fine-tuning models using Tilt Matching.
problem Efficient sampling and fine-tuning of generative models.
method Tilt Matching, arising from a dynamical equation, minimizes variance and inherits regularity from stochastic interpolants.
result Empirically verified to be efficient and highly scalable, providing state-of-the-art results.
New method interpolates high-dimensional scattered data using kernel theory.
problem Scattered data in high-dimensional spaces defy traditional distributional assumptions.
method Kernel interpolation framework based on integral operator theory.
result Spectra of kernel matrices predict performance of interpolation methods.
Randomly sampled interpolators achieve zero generalization error with enough data.
problem Understanding the high generalization ability of machine learning models.
method Algebraic geometry tools to prove zero generalization error for random interpolators.
result Generalization error of randomly sampled interpolators becomes zero once the number of training samples exceeds a geometric threshold.
A new method interpolates between sampling and variational inference using stochastic mixtures.
problem Combining the strengths of sampling and variational inference methods.
method Develops a framework using stochastic mixtures of simple component distributions to interpolate between sampling and variational inference.
result Improves on both sampling and variational inference methods by reducing bias and variance.
We propose kernel-based collocation methods for numerical solutions to Heath-Jarrow-Morton models with Musiela parametrization. The methods can be seen as the Euler-Maruyama approximation of some finite dimensional stochastic differential equations, and allow us to compute the derivative prices by the usual Monte Carlo…
The paper characterizes vector fields as interpolating sesqui-harmonic maps on Riemannian manifolds.
problem Characterizing vector fields as interpolating sesqui-harmonic maps on Riemannian manifolds.
method Characterization theorem and critical point condition for interpolating sesqui-harmonic vector fields.
result Conditions for vector fields to be interpolating sesqui-harmonic maps on compact manifolds.
The paper optimizes interpolation schedules in generative models to improve sampling accuracy.
problem Improving sampling accuracy in generative models with fewer resources.
method Minimizing the averaged squared Lipschitzness of the drift field, using transfer formulas.
result Designed schedules yield more accurate fine-scale statistics at fixed integrator budget.
Matrix SMD converges to unique solution minimizing Bregman divergence.
problem High-dimensional multi-output classification and matrix completion problems.
method Stochastic Mirror Descent with matrix parameters and matrix mirror functions.
result Matrix SMD converges exponentially to the unique solution minimizing Bregman divergence.
A new method for normalizing flows using stochastic interpolants simplifies likelihood estimation and improves efficiency.
problem Efficient and scalable likelihood estimation for complex probability distributions.
method Inference of velocity field from time-dependent density interpolating between base and target densities.
result Simplified quadratic loss for velocity estimation, leading to faster and more efficient training.
Proposes a method to fill in missing swaption volatility data using variational autoencoders.
problem Missing swaption volatility data due to market illiquidity.
method Variational autoencoders for learning latent volatility representations, Gibbs sampling for inference.
result Imputed missing volatilities are robust and close to SABR fits.
New algorithms optimize spectral risk measures, improving interpolation between average and worst-case performance.
problem Optimizing spectral risk measures for learning systems.
method Developed stochastic algorithms to optimize spectral risk measures by characterizing their subdifferential and addressing challenges like biasedness of subgradient estimates and non-smoothness.
result Our approach outperforms out-of-the-box stochastic subgradient and dual averaging methods in optimizing spectral risk measures.
Randomly trained neural networks can generalize well if there's a simpler underlying teacher model.
problem Why randomly trained neural networks generalize well despite interpolating training data.
method Examined a random neural network that interpolates training data and showed it generalizes well if there's a simpler underlying teacher model.
result Randomly trained neural networks can generalize well if there's a simpler underlying teacher model.
New algorithm combines Geostatistics and Quantile Random Forests for non-stationary spatial modelling.
problem Non-stationary spatial modelling with multiple secondary variables.
method Combines Geostatistics and Quantile Random Forests to estimate conditional distributions and simulate spatial data.
result Consistent results similar to geostatistical and Quantile Random Forests, allowing for embedding simpler interpolation techniques.
New analysis shows GMD can converge linearly under PL-like conditions.
problem Establishing linear convergence for generalized mirror descent.
method PL-based analysis for time-dependent mirrors, Taylor-series approach for stochastic GMD.
result Linear convergence of stochastic GMD under PL-like conditions.