We introduce new families of Integral Probability Metrics (IPM) for training Generative Adversarial Networks (GAN). Our IPMs are based on matching statistics of distributions embedded in a finite dimensional feature space. Mean and covariance feature matching IPMs allow for stable training of GANs, which we will call M…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “mean matching”
The paper uses moment matching method for pricing spread options under Lévy models.
problem Pricing spread options under Lévy models with mean-variance mixture.
method Moment matching method applied to Lévy models with mean-variance mixture.
result Obtains semi-closed form formulas for spread option prices.
The paper tackles matching a desired mean in causal systems through shift interventions.
problem Matching a desired mean in causal systems.
method Defining Markov equivalence classes, proposing active learning strategies, deriving lower bounds.
result Proposed active learning strategies require fewer interventions than previous approaches, especially for certain graph classes.
In high dimensions, the mean and geometric median are nearly identical.
problem Understanding the relationship between mean and geometric median in high-dimensional spaces.
method Analytical derivation and simulation of the distance between mean and geometric median.
result The distance between mean and geometric median vanishes with dimensionality in high dimensions.
New MMD estimators detect differences in missing paired data.
problem Handling missing data in matched pairs with complex distributions.
method Maximum mean discrepancy (MMD) estimators for complex data with missing values.
result Valid and consistent estimators detect differences in data distributions.
A new method solves high-dimensional MFGs using particle-based flow matching.
problem Solving high-dimensional Mean-Field Games (MFGs) is computationally challenging.
method Proposes a particle-based deep Flow Matching (FM) method to update particles and train a flow neural network.
result Proves convergence of the scheme to a stationary point sublinearly and linearly under convexity assumptions.
Paper tackles model vulnerabilities by reconstructing training data.
problem Reconstructing training data from model parameters poses a security risk.
method Developed a mathematical framework and score matching method for both Bayesian and non-Bayesian models.
result First score matching framework for reconstructing data in Bayesian models.
A new algorithm estimates mean under varying user data sizes with local differential privacy.
problem Mean estimation with user-level local differential privacy under varying data sizes.
method Distribution-aware mean estimation algorithm for users with varying data sizes.
result Upper and lower bounds on the worst-case risk for mean estimation are derived.
We present a new implementation of anisotropic mean curvature flow for contour recognition. Our procedure couples the mean curvature flow of planar closed smooth curves, with an external field from a potential of point-wise charges. This coupling constrains the motion when the curve matches a picture placed as backgrou…
In real supervised learning scenarios, it is not uncommon that the training and test sample follow different probability distributions, thus rendering the necessity to correct the sampling bias. Focusing on a particular covariate shift problem, we derive high probability confidence bounds for the kernel mean matching (…
New bounds show BBVI's gradient variance matches SGD conditions, improving parameterization efficiency.
problem Understanding and improving the convergence of black-box variational inference (BBVI).
method Showed BBVI satisfies matching gradient variance bounds corresponding to the ABC condition for smooth and quadratically-growing log-likelihoods.
result Proven BBVI's gradient variance matches SGD conditions, with superior dimensional dependence for mean-field parameterization.
CW-Gen models improve probabilistic time series forecasting by incorporating prior information.
problem Challenges in probabilistic forecasting of multivariate time series due to non-stationarity, inter-variable dependencies, and distribution shifts.
method CW-Gen framework that incorporates prior information through conditional whitening. JMCE learns conditional mean and covariance, improving sample quality.
result CW-Gen consistently enhances predictive performance, capturing non-stationary dynamics and inter-variable correlations more effectively than prior-free approaches.
Boosting trees can test necessary conditions for regression model calibration.
problem Testing calibration and auto-calibration in regression models.
method Using boosting trees to test calibration and auto-calibration.
result Boosting trees prove to be very powerful in testing calibration and auto-calibration in large insurance datasets.
The paper examines the optimality of kernel methods in high-dimensional clustering.
problem Understanding the optimality of kernel methods in high-dimensional data clustering.
method High-dimensional Gaussian clustering, exponential kernel function, kernel k-means, semi-definite relaxation.
result The exponential kernel function optimally recovers clusters in high-dimensional data, matching information-theoretic limits up to a factor of √2.
Robust Score Matchingstat.ML
Robust score matching improves parameter estimation in contaminated data.
problem Parameter estimation in data contaminated by outliers.
method Geometric median of means to develop a robust score matching procedure.
result Consistent parameter estimates in contaminated data settings.
Paper proves minimizing movements match smooth droplet flow in 3D.
problem Consistency of minimizing movements with smooth mean curvature flow.
method Proved minimizing movements coincide with smooth droplet flow.
result Minimizing movements and smooth mean curvature flow are consistent in 3D.
Decentralized learning for matching markets with time-varying preferences.
problem Matching between competing agents and supply arms with time-varying preferences.
method Linear contextual bandit framework, learning algorithms to identify latent environment and stable matchings.
result Achieve instance-dependent logarithmic regret, applicable for large markets.
ABae efficiently computes subset means with expensive predicates using stratified sampling.
problem Computing subset means with expensive predicates efficiently.
method Stratified sampling and proxy models.
result Mean squared error of when is split evenly between stages.
Improves deep learning training by matching mini-batch distributions.
problem Overfitting and noise in mini-batch training.
method ITDM, which matches the moments of mini-batch distributions to reduce overfitting.
result ITDM reduces overfitting and improves DNN training.
Study proves NN matching is equivalent to Riesz regression for debiased machine learning.
problem Addressing bias in machine learning models.
method Interprets NN matching as Riesz regression and derives it from LSIF.
result NN matching is shown to be equivalent to Riesz regression.
A new method for training diffusion models using likelihood matching.
problem Training efficient and accurate diffusion models.
method Likelihood Matching approach, quasi-likelihood approximation, score and Hessian estimation.
result Consistent matching of first two transitional moments between diffusion steps.
The well known maximum-entropy principle due to Jaynes, which states that given mean parameters, the maximum entropy distribution matching them is in an exponential family, has been very popular in machine learning due to its "Occam's razor" interpretation. Unfortunately, calculating the potentials in the maximum-entro…
Sharp inequalities for matrix means with unknown variance.
problem Estimating matrix means with unknown variance.
method Empirical Bernstein inequalities for symmetric random matrices.
result Adapts to unknown variance with tight deviation bounds.
We consider two multi-armed bandit problems with arms: (i) given an , identify an arm with mean that is within of the largest mean and (ii) given a threshold and integer , identify arms with means larger than . Existing lower bounds and algorithms for the PAC framework suggest that both …
Method infers parameters in complex diffusion processes.
problem Parameter inference in high-dimensional, non-linear diffusion processes.
method Differentiable score matching to approximate diffusion bridges, used in an importance sampler.
result Numerically stable framework for parameter inference and diffusion mean estimation.
Method learns statistics of return distributions via neural networks and maximum mean discrepancy.
problem Learning probability distributions in reinforcement learning.
method Maximum mean discrepancy (MMD) for learning unrestricted statistics of return distributions.
result Method outperforms standard distributional RL baselines on Atari games.
Runge-Kutta methods are the classic family of solvers for ordinary differential equations (ODEs), and the basis for the state of the art. Like most numerical methods, they return point estimates. We construct a family of probabilistic numerical methods that instead return a Gauss-Markov process defining a probability d…
Gradient matching with Gaussian processes is a promising tool for learning parameters of ordinary differential equations (ODE's). The essence of gradient matching is to model the prior over state variables as a Gaussian process which implies that the joint distribution given the ODE's and GP kernels is also Gaussian di…
We propose a novel procedure which adds "content-addressability" to any given unconditional implicit model e.g., a generative adversarial network (GAN). The procedure allows users to control the generative process by specifying a set (arbitrary size) of desired examples based on which similar samples are generated from…
A new method for generating samples without training, using smoothed score matching.
problem Generating samples efficiently and without training.
method Moment-matched score-smoothed overdamped Langevin dynamics (MM-SOLD).
result The method enables fast, robust, training-free sampling with competitive sample fidelity and diversity.
Simple private estimators for mean and covariance outperform existing methods.
problem Private estimation of mean and covariance at small sample sizes.
method Differentially private estimators for multivariate sub-Gaussian data.
result Asymptotic error rates match theoretical bounds and outperform previous methods.
Deep generative models can learn to generate realistic-looking images, but many of the most effective methods are adversarial and involve a saddlepoint optimization, which requires a careful balancing of training between a generator network and a critic network. Maximum mean discrepancy networks (MMD-nets) avoid this i…
We introduce an evolutionary algorithm called recombinator--means for optimizing the highly non-convex kmeans problem. Its defining feature is that its crossover step involves all the members of the current generation, stochastically recombining them with a repurposed variant of the -means++ seeding algorithm. Th…
Enhances learning of structured distributions using nonlinear denoising score matching.
problem Learning structured distributions from noisy data.
method Latent Nonlinear Denoising Score Matching (LNDSM) integrating nonlinear dynamics with VAE-based latent score matching.
result LNDSM achieves superior sample quality and variability compared to structure-agnostic methods.
The conditional-mean barrier helps diagnose deterministic surrogates missing uncertainty.
problem Uncertainty in deterministic surrogates for complex systems.
method Developed diagnostics to locate the conditional-mean barrier and prove its necessity for distributional objectives.
result Crossing the barrier requires a loss that scores distributions, not point predictions.
Study robust mean estimation under coordinate-level corruptions using Hamming distance.
problem Robust mean estimation under realistic coordinate-level corruptions.
method Introduce a novel Hamming distance-based measure and present information-theoretic analysis.
result Data cleaning-inspired approaches can match information theoretic bounds for robust mean estimation.
New calibration bands for various distributions improve testing for auto-calibration.
problem Testing for auto-calibration in finite samples is challenging.
method Construct calibration bands for the exponential dispersion family using finite sample properties.
result Calibration bands allow for various tests for calibration and auto-calibration.
New algorithm for learning preferences in decentralized matching markets reduces regret to logarithmic levels.
problem Learning preferences in decentralized matching markets without direct communication.
method Introduces a new algorithm for two-sided matching markets with competition.
result The algorithm achieves logarithmic stable regret in shared preferences and quadratic regret in general preferences.
The learning of domain-invariant representations in the context of domain adaptation with neural networks is considered. We propose a new regularization method that minimizes the discrepancy between domain-specific latent feature representations directly in the hidden activation space. Although some standard distributi…
A novel bandit problem with context-dependent rewards and blocking.
problem Contextual bandit problem with blocking.
method Online bipartite matching, UCB algorithm, delayed exploitation, opportunistic subsampling.
result Guaranteed -regret in bandit setting.
We introduce a toy probabilistic model to analyze job-matching processes in recent Japanese labor markets for university graduates by means of statistical physics. We show that the aggregation probability of each company is rewritten by means of non-linear map under several conditions. Mathematical treatment of the map…
We construct a new class of complete constant mean curvature surfaces in R^3. These are geometrically different than the surfaces constructed by Kapouleas' gluing technique. These are obtained by piecing together half-Delaunay surfaces to the truncations of minimal k-noids. The gluing techniques are new: the surfaces a…
We propose an estimator for the mean of a random vector in that can be computed in time for i.i.d.~samples and that has error bounds matching the sub-Gaussian case. The only assumptions we make about the data distribution are that it has finite mean and covariance; in particular, we mak…
CO2 algorithm creates coresets for generic smooth divergences efficiently.
problem Efficiently creating coresets for generic smooth divergences.
method CO2 algorithm using functional Taylor expansion and maximum mean discrepancy minimization.
result Poly-logarithmically many data points suffice for Sinkhorn divergence approximation.
Proposes DWMD for better matching of hidden representations across domains.
problem Measuring data distribution discrepancy between semantically related domains for feature representation matching.
method DWMD, a moment-based probability distribution metric that explicitly orders and weights higher-order moments.
result DWMD is error-free and can strictly reflect distribution differences without feature distribution assumptions.
Bandits with heavy tailstat.ML
The stochastic multi-armed bandit problem is well understood when the reward distributions are sub-Gaussian. In this paper we examine the bandit problem under the weaker assumption that the distributions have moments of order 1+ε, for some . Surprisingly, moments of order 2 (i.e., finite variance) are suffi…
The paper introduces a quantum state system to count perfect matchings in graphs.
problem Counting perfect matchings in graphs using quantum state systems.
method Topological quantum field theory (TQFT) and spectral sequences.
result The filtered -color vertex homology for is generated by perfect matchings.
Given a solution of the (backwards) Ricci flow one can construct a so called canonical soliton metric on space-time, introduced by E. Cabezas-Rivas and P. Topping. We observe that for a mean curvature flow within a (backwards) Ricci flow background, the space-time track of the mean curvature flow yields a canonical sol…