Paper proposes a new UCB approach for estimating maximum mean.
problem Estimating the maximum mean in various applications.
method Upper Confidence Bound (UCB) approach with adaptive sampling.
result LSA estimator shows faster bias decay compared to GA.
Study finds polynomial convergence rate for Farey sequences linked to Riemann hypothesis.
problem Understanding convergence rates of maximum mean discrepancies for Farey sequences.
method Identifying positive-semidefinite kernels and their polynomial convergence rates.
result Polynomial convergence rate of maximum mean discrepancies of Farey sequences is equivalent to the Riemann hypothesis.
Modeling maximum drawdown records in capital markets using PDMP.
problem Capturing the statistical properties of maximum drawdown records in financial markets.
method Piecewise Deterministic Markov Process (PDMP) for modeling, statistical analysis of mean and variance, simulation study, parameter estimation techniques.
result Derivation of statistical results including mean and variance of maximum drawdown records.
Study on mean curvature flow of graphs in higher dimensions.
problem Analyzing the evolution of graphs under mean curvature flow.
method Derives estimates using a new maximum principle for submanifolds, applies to uniformly area decreasing maps.
result Graphicality and area decreasing property are preserved for uniformly area decreasing maps.
The paper proposes a method to produce well-calibrated predictions in regression tasks using maximum mean discrepancy.
problem The need for accurate uncertainty quantification in machine learning predictions.
method The method uses maximum mean discrepancy to minimize the kernel embedding measure and calibrate predictions.
result The method produces well-calibrated and sharp prediction intervals, outperforming state-of-the-art methods.
Based on ideas of L. Alías, D. Impera and M. Rigoli developed in "Hypersurfaces of constant higher order mean curvature in warped products", we develope a fairly general weak/Omori-Yau maximum principle for trace operators. We apply this version of maximum principle to generalize several higher order mean curvature est…
Residual flows are shown to approximate MMD well.
problem Lack of theoretical understanding of normalizing flows' expressiveness.
method Proved residual flows are universal approximators in MMD.
result Residual flows can approximate MMD with a bounded number of blocks.
We derive a parabolic version of Omori-Yau maximum principle for a proper mean curvature flow when the ambient space has lower bound on ℓ-sectional curvature. We apply this to show that the image of Gauss map is preserved under a proper mean curvature flow in euclidean spaces with uniform bounded second fundamenta…
Paper proposes MMD-Sense-Analysis for detecting word sense shifts.
problem Detecting and interpreting shifts in word meanings over time.
method Leverages Maximum Mean Discrepancy (MMD) to identify and explain word sense changes.
result Demonstrates effectiveness of MMD-Sense-Analysis through empirical results.
We study the strong maximum principle for horizontal (p-) mean curvature operator and p-(sub)laplacian operator on subriemannian manifolds including, in particular, Heisenberg groups and Heisenberg cylinders. Under a certain Hormander type condition on vector fields, we show the strong maximum principle holds in higher…
In this paper we mainly study the type II singularities of the mean curvature flow from a symplectic surface or from an almost calibrated Lagrangian surface in a K ähler-Einstein surface. We show the relation between the maximum of the Kähler angle and the maximum of ∣H∣2 on the limit flow.
Generative neural network simulates characteristic functions.
problem Simulating from characteristic functions inaccessible in closed form.
method Generative neural network with Maximum-Mean-Discrepancy loss.
result Universal algorithm independent of dimensionality and function properties.
A new ensemble filter uses transport maps and MMD optimization for high-dimensional data assimilation.
problem High-dimensional data assimilation challenges in ensemble filtering.
method Optimized Maximum Mean Discrepancy (MMD) for transport map construction.
result Significant improvement in robustness and posterior approximation.
We will generalize a Maximum Principle at Infinity in the parabolic case given by De Lima [Ann. Global Anal. Geom. 20, 325-343 2001] and De Lima and Meeks [Indiana Univ. Math. Journal 53 5, 1211-1223 2004], for disjoints hypersurfaces of Rn+1 with bounded mean curvature without restriction…
A new gradient flow for MMD with closed-form implementation.
problem Existing gradient flows either lack tractable numerical implementation or require strong assumptions.
method Introduces a (de)-regularized Maximum Mean Discrepancy (DrMMD) and its gradient flow.
result Guarantees near-global convergence for a broad class of targets in both continuous and discrete time.
Study classifies translators for mean curvature flow in 3D.
problem Classifying semigraphical translators for mean curvature flow in R3. method Morse-Radó theory and angular maximum principle.
result No solution to the translator equation on the upper half-plane with alternating boundary values.
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…
Paper explores two methods for optimal portfolio selection in financial markets.
problem Optimal portfolio selection for financial markets with jumps.
method Maximum principle and dynamic programming approach.
result Relationship between two methods and their adjoint processes.
Paper relaxes convexity assumptions in mean curvature flow results.
problem Relaxing convexity assumptions in mean curvature flow results.
method Proves a generalized Harnack inequality and uses maximum principle.
result Characterizes family of shrinking spheres for ancient solutions.
K-means is a classical clustering algorithm with wide applications. However, soft K-means, or fuzzy c-means at m=1, remains unsolved since 1981. To address this challenging open problem, we propose a novel clustering model, i.e. Probabilistic K-Means (PKM), which is also a nonlinear programming model constrained on lin…
We establish a stochastic maximum principle (SMP) for control problems of partially observed diffusions of mean-field type with risk-sensitive performance functionals.
Efficiently approximates kernel mean embeddings using Nyström method.
problem Computational cost of kernel mean embeddings in large-scale settings.
method Nyström method for approximating a small random subset of the dataset.
result Upper bound on approximation error with sufficient subsample size conditions.
This paper provides a dictionary of closed-form kernel mean embeddings.
problem Challenges in deriving closed-form kernel mean embeddings.
method Comprehensive dictionary and practical tools for deriving new embeddings.
result Provides a Python library with minimal implementations of embeddings.
Survey on rigidity results for graphs with prescribed mean curvature.
problem Rigidity of graphs with prescribed mean curvature.
method Analysis of mean curvature operator, maximum principles, gradient estimates.
result Detailed geometric applications, including Bernstein theorem and splitting theorem.
Study proves spacelike self-shrinkers are hyperplanes under certain conditions.
problem Classifying spacelike self-shrinkers in pseudo-Euclidean space.
method Applied maximum principles to show rigidity.
result Spacelike self-shrinkers are rigid and must be hyperplanes.
We solve the mean parametrization of von Mises-Fisher distribution.
problem No closed-form normalization function for mean parameters exists.
method Derived a second-order ODE for mean normalizer and provided approximations.
result Rapid evaluation of densities and natural parameters in terms of mean parameters.
Optimizes MMD learning for generative models with theoretical guarantees.
problem Theoretical guarantees for optimizing non-convex MMD objectives.
method Analyzes MMD optimization landscape for specific distributions.
result Gradient-based methods globally minimize MMD objective for certain distributions.
New algorithms minimize MMD to approximate probability measures efficiently.
problem Approximating probability measures by representative point sets.
method Sequential greedy minimization of maximum mean discrepancy (MMD) over candidate sets, with mini-batch variants.
result Consistency of proposed algorithms and mini-batch variants established.
HAVER improves error bounds for estimating the largest mean in machine learning tasks.
problem Estimating the largest mean among multiple distributions.
method Proposes HAVER, a novel algorithm for maximum mean estimation.
result HAVER achieves better error bounds than the oracle in many cases.
A new method uses neural tangent kernel to efficiently compute MMD statistic.
problem Efficiently computing Maximum Mean Discrepancy (MMD) statistic with low memory and computational complexity.
method Identifies a connection between neural tangent kernel (NTK) and MMD to develop a computationally and memory-efficient approach.
result The proposed NTK-MMD statistic is validated through numerical experiments on synthetic and real-world datasets.
The paper shows how MMD metrizes weak convergence for certain kernels.
problem Characterizing MMD metrizing weak convergence for a wide class of kernels.
method Proving MMD metrizes weak convergence for specific kernels on a locally compact space.
result Corrected prior results and identified new kernels metrizing weak convergence.
Constrained adaptive filtering algorithms inculding constrained least mean square (CLMS), constrained affine projection (CAP) and constrained recursive least squares (CRLS) have been extensively studied in many applications. Most existing constrained adaptive filtering algorithms are developed under mean square error (…
Study shows distance to boundary is always attained on varifolds with bounded curvature.
problem Understanding varifolds with bounded mean curvature in Riemannian manifolds.
method Proves a barrier principle at infinity using sharp maximum principles.
result Distance to boundary is always attained on varifolds with bounded curvature.
MMD-Flagger detects hallucinations in LLMs by tracking MMD between outputs and temperature-generated counterparts.
problem Detecting hallucinations in large language models.
method Maximum Mean Discrepancy (MMD) to track the difference between model outputs and temperature-generated counterparts.
result MMD-Flagger detects most hallucinations by analyzing the shape of the MMD trajectory.
New method constructs synthetic treatment groups without mean exchangeability assumption.
problem Violations of mean exchangeability assumption in randomized controlled trials.
method Weighted mixture of treatment groups from source populations, minimizing conditional maximum mean discrepancy.
result Asymptotic normality of synthetic treatment group estimator established.
Improved MMD estimator for likelihood-free inference.
problem Computational challenges in estimating MMD for likelihood-free inference.
method Optimally-weighted MMD estimator with improved sample complexity.
result Significantly improved sample complexity for accurate MMD estimation.
We derive, for the square operator of Yau, an analogue of the Omori-Yau maximum principle for the Laplacian. We then apply it to obtain nonexistence results concerning complete spacelike hypersurfaces with constant higher order mean curvature in the Steady State space.
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.
We determine non-Hopf hypersurfaces with constant mean curvature in the complex projective plane which attain equality in a basic inequality between the maximum Ricci curvature and the squared mean curvature.
In this work we extend the ODE Maximum principle of Hamilton to non-compact hypersurfaces using the Omari-Yau maximum principle at infinity. As an application of this result, we investigate Inverse Mean Curvature Flow (IMCF) of non-compact hypersurfaces in hyperbolic space. Specifically, we look at bounded graphs over …
We consider geometric flow equations for contracting and expanding normal velocities, including powers of the Gauss curvature, of the mean curvature, and of the norm of the second fundamental form, and ask whether - after appropriate rescaling - closed strictly convex surfaces converge to spheres. To prove this, many a…
Robust diffusion adaptive estimation algorithms based on the maximum correntropy criterion (MCC), including adaptation to combination MCC and combination to adaptation MCC, are developed to deal with the distributed estimation over network in impulsive (long-tailed) noise environments. The cost functions used in distri…
Paper establishes maximum principles for weakly 1-coercive operators.
problem Finding conditions for solutions of differential equations to satisfy specific inequalities.
method Maximum principles for weakly 1-coercive operators on Riemannian manifolds.
result Guarantees that solutions of certain differential equations satisfy specific inequalities.
Secure SMMD enables data privacy in federated learning.
problem Data privacy in federated learning.
method Homomorphic encryption-based Secure Maximum Mean Discrepancy (SMMD).
result Secure SMMD avoids data leakage and enables effective knowledge transfer.
This note optimizes distributions using kernel mean embeddings with a new parameterization.
problem Optimizing distributions using kernel mean embeddings is challenging due to the difficulty of characterizing probability distribution vectors.
method Proposes a new parameterization of positive functions using kernel sums-of-squares to fit distributions in the MMD geometry.
result Distributions with kernel sum-of-squares densities are dense in the MMD geometry, allowing optimization in the finite-sample setting.
Study on compactness and blow-up of solutions for Yamabe problems on manifolds with non-umbilic boundaries.
problem Compactness and blow-up behavior of solutions to the Yamabe boundary problem on manifolds with non-umbilic boundaries.
method Analysis of stability and blow-up sequences for solutions under perturbations of mean curvature and scalar curvature.
result Existence of a blowing-up sequence of solutions when perturbing the mean curvature from above or below with a function having a large positive maximum.
New methods for Bayesian inference using mean shift particle systems.
problem Approximating expectations with unnormalized densities in Bayesian inference.
method Mean shift interacting particle systems that minimize maximum mean discrepancy (MMD).
result Mean shift interacting particle systems converge quickly and capture complex distributions.
Paper develops MRCs for supervised classification using generalized maximum entropy.
problem Developing robust classifiers for decision problems.
method Generalized maximum entropy principle applied to minimax risk classifiers.
result Learning techniques for determining MRCs with performance guarantees.