Adapts manifold structure for better clustering performance.
problem Lack of consideration for local manifold structure in existing multiple kernel k-means methods.
method Adopts manifold adaptive kernel to integrate local manifold structure of kernels.
result Proposed method outperforms state-of-the-art methods.
New examples of mean curvature flow converge to minimal surfaces with multiplicity 2.
problem Constructing mean curvature flow examples in closed manifolds.
method Constructing new examples of mean curvature flow with convergence to minimal surfaces with multiplicity 2.
result Mean curvature flow examples converge to minimal surfaces with multiplicity 2.
New example of surface flow converging to a plane with multiplicity 2.
problem Constructing mean curvature flows with specific convergence properties.
method Constructing a new example of a mean curvature flow in R3. result The flow converges to a plane with multiplicity 2 as time approaches infinity.
Solves optimal control for trading multiple mean-reverting assets.
problem How to construct a portfolio from mean-reverting assets.
method Optimal control problem for power utility agent.
result Nearly explicit solution with properties of optimal solution.
In this paper, we show that if the mean curvature of a closed smooth embedded mean curvature flow in R^3 is of type-I, then the rescaled flow at the first finite singular time converges smoothly to a self-shrinker flow with multiplicity one. This result confirms Ilmanen's multiplicity-one conjecture under the assumptio…
Study phase transitions with prescribed mean curvature in Riemannian manifolds.
problem Understanding phase transitions with prescribed mean curvature in geometric settings.
method Analyzing solutions to inhomogeneous semilinear elliptic PDEs, establishing bounds and asymptotics.
result Established upper and lower bounds for eigenvalues of phase transition problems.
In this paper we prove that the generic singularities of mean curvature flow of closed embedded surfaces in R3 modeled by closed self-shrinkers with multiplicity has multiplicity one. Together with the previous result by Colding-Minicozzi in [CM12], we conclude that the only generic singularity of mean curva…
Study on singularity behavior of mean curvature flow with bounded curvature and index.
problem Understanding singularity formation in mean curvature flow with constraints.
method Analyzing flow with bounded mean curvature and Morse index.
result Either mean curvature or Morse index blows up at first singular time.
Proves multiplicity one conjecture for surface flows, with applications in flow regularity.
problem Proving multiplicity one for mean curvature flows of surfaces.
method Analyzing blow-up limits and using level set flow properties.
result Blow-up limits of mean curvature flows have multiplicity one.
The study examines mass drop and multiplicity in mean curvature flow.
problem Analyzing mass drop and multiplicity in mean curvature flow.
method Defined Brakke flow with variational inequality, proved mass drop conditions.
result Mass drop and multiplicity one conjecture are equivalent for Brakke flows.
Paper resolves Huisken's conjecture without strict genus drop theorem.
problem Huisken's genericity conjecture in mean curvature flow in R^3.
method Short density-drop theorem + Bamler-Kleiner multiplicity-one theorem for tangent flows.
result Fully resolves Huisken's conjecture without strict genus drop theorem.
Study on multiplicities in length spectrum of Salem numbers.
problem Understanding multiplicities in the length spectrum of Salem numbers.
method Analysis of square-rootable Salem numbers and their growth rate.
result Proved exponential growth rate for mean multiplicities in length spectrum.
Estimates multiple means in high dimensions using convex combinations.
problem Estimating multiple multi-dimensional means from samples.
method Convex combinations of empirical means with data-dependent weights.
result Our methods asymptotically approach oracle (minimax) improvement.
Improved multi-task averaging reduces mean squared error in high-dimensional data.
problem Joint estimation of multiple distributions using independent data sets.
method Exploits similarities between tasks by shrinking naive estimators towards local averages.
result The method provides a significant reduction in mean squared error, especially in high-dimensional spaces.
Proves unknottedness of certain 3D shapes with multiple ends.
problem Determining the structure of complex 3D shapes.
method Used mean curvature flow to analyze shapes with multiple ends.
result Proves unknottedness of shapes with multiple asymptotically conical ends.
To cluster data that are not linearly separable in the original feature space, k-means clustering was extended to the kernel version. However, the performance of kernel k-means clustering largely depends on the choice of kernel function. To mitigate this problem, multiple kernel learning has been introduced into th…
The paper studies how surfaces move by mean curvature flow and what happens at singular points.
problem Understanding the behavior of surfaces moving by mean curvature flow at singular points.
method Proves that tangent flows at singular times are smooth shrinkers, with a new local Gauss-Bonnet formula.
result Smooth shrinkers without branch points if the initial surface is embedded in 3-manifold.
Proves multiplicity one for boundary minimal hypersurfaces in compact manifolds.
problem Proving multiplicity one for min-max free boundary minimal hypersurfaces in compact manifolds with boundary.
method Developed existence and regularity theory for free boundary hypersurfaces with prescribed mean curvature, including Morse index bounds.
result Proved multiplicity one theorem for min-max free boundary minimal hypersurfaces in compact manifolds with boundary.
The statistical comparison of multiple algorithms over multiple data sets is fundamental in machine learning. This is typically carried out by the Friedman test. When the Friedman test rejects the null hypothesis, multiple comparisons are carried out to establish which are the significant differences among algorithms. …
We compute an approximate Fréchet mean for sets of sparse graphs.
problem Characterizing the location of a set of graphs in a metric space.
method We use the pseudometric defined by the ℓ₂ norm of eigenvalues of adjacency matrices.
result We describe an algorithm to approximate the Fréchet mean of a set of graphs.
Study ruled surfaces with finite multiplicity, focusing on their curves and singularities.
problem Understanding ruled surfaces with finite multiplicity.
method Analyzing striction curves and singularities of ruled surfaces.
result Geometric meanings of invariants related to ruled surfaces.
We prove that, for a generic set of smooth prescription functions h on a closed ambient manifold, there always exists a nontrivial, smooth, closed hypersurface of prescribed mean curvature h. The solution is either an embedded minimal hypersurface with integer multiplicity, or a non-minimal almost embedded hypersur…
The paper simplifies calculus for semimartingales using multiplicative compensation.
problem Developing a formula for complex-valued semimartingales to simplify stochastic calculus.
method Multiplicative compensation for complex-valued semimartingales.
result The stochastic exponential of complex-valued semimartingales becomes a true martingale after compensation.
We investigate a generalized stochastic model with the property known as mean reversion, that is, the tendency to relax towards a historical reference level. Besides this property, the dynamics is driven by multiplicative and additive Wiener processes. While the former is modulated by the internal behavior of the syste…
SimpleMKKM improves multi-kernel clustering efficiency.
problem Efficient multi-kernel clustering.
method Re-formulated minimization-maximization problem into a smooth minimization, solved with gradient descent.
result Outperforms state-of-the-art multi-kernel clustering alternatives.
We design a new algorithm for the Euclidean k-means problem that operates in the local model of differential privacy. Unlike in the non-private literature, differentially private algorithms for the k-means objective incur both additive and multiplicative errors. Our algorithm significantly reduces the additive erro…
We analyze an N+1-player game and the corresponding mean field game with state space {0,1}. The transition rate of j-th player is the sum of his control αj plus a minimum jumping rate η. Instead of working under monotonicity conditions, here we consider an anti-monotone running cost. We show that the mean …
Study rectifying curves in 3D multiplicative Euclidean space.
problem Investigate rectifying curves in a non-Newtonian geometry setting.
method Apply multiplicative differential-geometric concepts to rectifying curves.
result Classify multiplicative rectifying curves using spherical curves.
In this work, we systematically investigate mean field games and mean field type control problems with multiple populations using a coupled system of forward-backward stochastic differential equations of McKean-Vlasov type stemming from Pontryagin's stochastic maximum principle. Although the same cost functions as well…
Singularities of the mean curvature flow of an embedded surface in R^3 are expected to be modelled on self-shrinkers that are compact, cylindrical, or asymptotically conical. In order to understand the flow before and after the singular time, it is crucial to know the uniqueness of tangent flows at the singularity. In …
Study shows uniform decay rate for singular mean curvature flows.
problem Understanding singularities in mean curvature flows.
method Rescaled flow analysis near compact singularities.
result Uniform decay order bound for the rescaled flow.
In this paper, we develop a min-max theory for the construction of constant mean curvature (CMC) hypersurfaces of prescribed mean curvature in an arbitrary closed manifold. As a corollary, we prove the existence of a nontrivial, smooth, closed, almost embedded, CMC hypersurface of any given mean curvature c. Moreover…
Paper accelerates K-means clustering for large sparse document data.
problem Efficiently clustering large-scale sparse document data.
method Designs an AFM algorithm leveraging UCs and inverted-index structure.
result Significantly improves clustering speed for large-scale documents.
PEAK tests means of multiple data streams with sequential betting.
problem Testing means of multiple data streams with nonparametric methods.
method Sequential, nonparametric testing using a betting scheme.
result PEAK provides up to 85% reduction in samples for stopping.
Sophisticated volatility models outperform naive portfolio strategies.
problem Improving mean-variance portfolio performance over the naive 1/N strategy.
method Investigated various econometric and portfolio models across multiple datasets.
result Most models achieve higher Sharpe ratios and lower portfolio volatility than the naive rule.
The paper tackles fair classification with multiple sensitive features.
problem Existing fair classification methods often consider a single sensitive feature, but in practice, individuals are defined by multiple sensitive features.
method Characterizes Bayes-optimal fair classifiers for multiple sensitive features under various fairness measures, proposing in-processing and post-processing algorithms.
result Bayes-optimal fair classifiers for multiple sensitive features are instance-dependent thresholding rules that rely on a weighted sum of group membership probabilities.
Private mean estimation with multiple samples requires a certain number of people to maintain privacy.
problem Private mean estimation with person-level differential privacy for multiple samples.
method The approach involves estimating the mean up to a distance α in ℓ_2-norm under ε-differential privacy, using algorithms based on the clip-and-noise framework and new analyses.
result The necessary and sufficient number of people to estimate the mean up to distance α in ℓ_2-norm is given by a specific formula.
Bayesian model compares ML algorithms on various datasets.
problem Comparing multiple machine learning algorithms across multiple datasets.
method Bayesian Bradley-Terry model, defining regions of practical equivalence (ROPE).
result Allows nuanced statements and ROPE definitions for algorithm comparison.
The Normal Means problem plays a fundamental role in many areas of modern high-dimensional statistics, both in theory and practice. And the Empirical Bayes (EB) approach to solving this problem has been shown to be highly effective, again both in theory and practice. However, almost all EB treatments of the Normal Mean…
We show that the moments of the distribution of historic stock returns are in excellent agreement with the Heston model and not with the multiplicative model, which predicts power-law tails of volatility and stock returns. We also show that the mean realized variance of returns is a linear function of the number of day…
New method combines multiple data sources for optimal decision-making with limited outcomes.
problem Optimal decision-making with limited outcome data from multiple heterogeneous sources.
method Calibrated optimal decision-making method leveraging common intermediate outcomes.
result Proposed estimator of conditional mean outcome is asymptotically normal and more efficient.
Study shows generic surfaces avoid complex flow patterns.
problem Understanding flow patterns of surfaces in 3D space.
method Analyzes mean curvature flow of closed surfaces in R3. result Non-cylindrical self-shrinkers cannot arise generically.
The study examines the long-term behavior of mean curvature flows in closed 3-manifolds.
problem Understanding the long-term behavior of mean curvature flows in closed 3-manifolds.
method The approach involves constructing piecewise almost regular flows and applying perturbative arguments.
result The study constructs minimal surfaces in 3-manifolds via parabolic methods.
We introduce the notion of a conjugation-free geometric presentation for a fundamental group of a line arrangement's complement, and we show that the fundamental groups of the following family of arrangements have a conjugation-free geometric presentation: A real arrangement L, whose graph of multiple points is a union…
A new method treats all variables equally in fitting data.
problem Fitting relationships to data with multiple variables, especially when dependent and independent variables are not clearly defined.
method A general method treating all variables impartially, using geometric mean functional relationships and correlation.
result The method provides coefficients that are easily calculated from covariances or correlations, making it scale-invariant and applicable to various units.
Bayesian models offer great flexibility for clustering applications---Bayesian nonparametrics can be used for modeling infinite mixtures, and hierarchical Bayesian models can be utilized for sharing clusters across multiple data sets. For the most part, such flexibility is lacking in classical clustering methods such a…
We prove under suitable hypotheses that convergence of integral varifolds implies convergence of associated mod 2 flat chains and subsequential convergence of associated integer-multiplicity rectifiable currents. The convergence results imply restrictions on the kinds of singularities that can occur in mean curvature f…
Paper proposes methods to handle missing data in online RL, improving efficiency and uncertainty capture.
problem Missing data in online RL poses challenges due to the need to impute and act at each time step.
method Proposes fully online imputation ensembles and multiple imputation pathways to balance uncertainty and efficiency.
result Preliminary evidence suggests multiple imputation pathways can be a useful framework for simple and efficient online missing data RL methods.