New winsorized mean improves robustness to up to 50% contamination.
problem Improving robustness of mean estimation in the presence of outliers.
method Outlyingness-induced winsorized mean approach.
result Achieves up to 50% contamination robustness with sub-Gaussian performance.
New method uses Winsorized mean estimators for privacy-preserving statistics on dependent data.
problem Privacy-preserving statistics on dependent data with sensitive information.
method Adapting noisy Winsorized mean estimators to handle dependence via log-Sobolev inequalities.
result Asymptotic and finite sample guarantees for item-level and user-level mean estimation similar to \iid{} settings.
WPCA improves subspace recovery robustness to outliers.
problem Improving subspace recovery in the presence of outliers.
method Winsorized PCA (WPCA) with theoretical analysis of accuracy and robustness.
result WPCA provides consistent subspace recovery from contaminated data.
Gradient boosting detects insider purchases predicting abnormal returns in microcap stocks.
problem Predicting abnormal returns in U.S. microcap stocks using insider purchase signals.
method Gradient boosting classifier trained on insider identity, transaction history, and market conditions.
result Gradient boosting classifier achieves AUC of 0.70 on out-of-sample data, with precision and recall of 0.38 and 0.69 respectively.
AI investors signal higher debt in ESG firms, boosting portfolio management.
problem Determining the value of ESG investing amid AI investment trends.
method Cross-sectional regressions of ESG scores and debt ratios of S&P 500 firms.
result ESG scores signal higher debt in firms, supporting ESG investing.
Paper develops robust methods for large-scale testing without tuning parameters.
problem Heavy-tailed data in high-dimensional settings.
method Revisits Hodges-Lehmann estimator for robust inference without tuning parameters.
result Develops confidence intervals and controls false discovery proportion.
Thinking LLMs struggle with stock prediction, especially as data complexity increases.
problem Evaluating the performance of 'thinking' LLMs in stock prediction, especially under varying levels of cross-sectional complexity.
method Rolling 48m/1m walk-forward evaluation, comparing direct LLMs, TLLMs, and classical learners on cross-sectional ranking loss, MSE, and backtests with transaction costs.
result TLLMs' ranking quality deteriorates as cross-sectional complexity grows, while direct LLMs remain stable.
Breathing k-means outperforms greedy k-means++ in clustering.
problem Improving k-means clustering solutions.
method Dynamic adjustment of centroids through breathing technique.
result Breathing k-means outperforms other k-means techniques, especially greedy k-means++.
Median-of-means sampling outperforms mean-of-means for large sample sizes in numerical integration.
problem Improving numerical integration accuracy in high dimensions.
method Median-of-means sampling compared to mean-of-means using RQMC methods.
result Median-of-means sampling is superior for large sample sizes, while mean-of-means is better for smaller sample sizes.
New market makers improve on existing models in DeFi.
problem Improving liquidity and efficiency in decentralized finance.
method Developed a new family of market makers based on generalized means.
result G3Ms offer properties preferable to existing models.
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.
Improved K-Means++ and K-Means∥ with faster run-time.
problem Efficiently selecting initial seeds for K-means clustering.
method Triangle inequality pruning and dynamic priority queue.
result Up to 17x speedup for K-Means++ and 551x for K-Means$\$.
Diffusion means converge to extrinsic means for long times on spheres.
problem Understanding the long-time behavior of diffusion means on manifolds.
method Introduced diffusion means as a parameterized family of location statistics on manifolds, and analyzed their convergence to extrinsic means for long times.
result For real projective spaces and connected compact symmetric spaces, the long-time limit of diffusion means is conjectured to be the extrinsic mean in the isometric embedding.
New estimator reduces kernel mean estimation error.
problem Kernel mean estimation in reproducing kernel Hilbert spaces.
method Corrupt data with known distributions and estimate kernel mean under the corrupted distribution.
result The marginalized kernel mean estimator achieves lower estimation error.
One of the most fundamental concepts in statistics is the concept of sample mean. Properties of the sample mean that are well-defined in Euclidean spaces become unwieldy or even unclear in graph spaces. Open problems related to the sample mean of graphs include: non-existence, non-uniqueness, statistical inconsistency,…
Clustering is a separation of data into groups of similar objects. Every group called cluster consists of objects that are similar to one another and dissimilar to objects of other groups. In this paper, the K-Means algorithm is implemented by three distance functions and to identify the optimal distance function for c…
New collaborative algorithm improves personalized mean estimation in online settings.
problem Online estimation of means from multiple, possibly overlapping distributions.
method Novel collaborative strategy for active querying and mean estimation.
result Algorithm improves mean estimates through communication among agents.
Constructs a mean curvature flow with surgery for compact mean convex hypersurfaces.
problem Mean curvature flow with surgery for compact mean convex hypersurfaces.
method Topological surgeries performed by the flow itself through nondegenerate cylindrical singularities, adjusted at smooth times.
result Extends previous results for 2-convex flows and constructs a flow for compact mean convex hypersurfaces.
Strict convexity proven for certain self-expanders in high dimensions.
problem Convexity of self-expanders in mean curvature flow.
method Investigation of convexity properties for asymptotically conical self-expanders.
result Strict convexity proven for n-dimensional self-expanders. We study the provenance of singularity formation under mean curvature flow and volume preserving mean curvature flow in an axially symmetric setting. We prove that if the mean curvature is uniformly bounded on any finite time interval, then no singularities can develop during that time under both mean curvature flow an…
New method improves mean estimation for heavy-tailed data.
problem Estimating mean of heavy-tailed distributions.
method Median-of-Means (MoM) with symmetrization technique.
result Improved sample complexity bound for mean estimation.
A method to remove mean-shift noise from PCA using knockoffs.
problem High sensitivity of PCA to mean-shift contamination in high-dimensional data.
method Introducing knockoff mean-shift perturbation to separate and remove mean-shift components from PCA.
result The mean-shift spikes are spectrally separable from stable eigenvalues, allowing for robust PCA.
Develops a computationally tractable differentially private mean estimator called the balloon mean.
problem Robust mean estimation in the presence of outliers and heavy-tailed distributions.
method Iterative clipping procedure over Mahalanobis balls.
result Balloon mean is robust to outliers and outperforms existing estimators in contaminated settings.
Alexandrov immersed surfaces maintain their properties under mean curvature flow.
problem Preserving Alexandrov immersivity in mean curvature flow.
method Mean curvature flow techniques adapted for Alexandrov immersed, 2D surfaces.
result Mean curvature flow properties hold for Alexandrov immersed surfaces.
New study confirms some mean curvature flow solutions have bounded mean curvature.
problem Existence of mean curvature flow singularities with bounded mean curvature.
method Construction of specific solutions in RN for N≥8. result A nontrivial subset of solutions has uniformly bounded mean curvature.
Paper adds Fisher Information to mean field optimization for faster convergence.
problem Mean field optimization in neural networks training.
method Developed energy-dissipation method and gradient flow on probability space.
result Marginal distributions converge exponentially to minimizer.
Unbounded convex domains have zero mean curvature on disconnected boundaries.
problem Understanding mean curvature in unbounded convex domains.
method Analyzing mean curvature on disconnected boundary components.
result Mean curvature is zero on disconnected boundary components of unbounded mean convex domains.
In this note we announce results on the mean curvature flow of mean convex sets in 3-dimensions. Loosely speaking, our results justify the naive picture of mean curvature flow where the only singularities are neck pinches, and components which collapse to asymptotically round spheres.
Paper solves a control problem with robust methods.
problem Monotone mean-variance problems with stochastic coefficients.
method Finding saddle point through BSDEs with unbounded coefficients.
result Optimal control and value match mean-variance problems.
GEORCE-FM algorithm optimizes Fréchet means and distances efficiently.
problem Computing Fréchet means on Riemannian manifolds efficiently.
method GEORCE-FM algorithm that simultaneously computes Fréchet means and distances in local charts.
result GEORCE-FM algorithm converges globally and locally quadratically, and scales to large datasets.
Smooth convergence to equidistant surfaces in Fuchsian manifolds.
problem Smooth convergence of modified mean curvature flow in Fuchsian manifolds.
method Modified mean curvature flow starting from an arbitrary graph in a Fuchsian manifold.
result Equidistant surfaces of constant mean curvature are reached as to∞. Compact mean curvature flow solutions with bounded curvature in high dimensions are constructed.
problem Constructing compact mean curvature flow solutions with bounded mean curvature.
method Following Velázquez, Guo, Sesum, and Stolarski's arguments, constructing solutions in \(\mathbb{R}^n\) with \(n \geq 8\).
result Compact mean curvature flow solutions with bounded mean curvature in \(\mathbb{R}^n\) are constructed.
Unified estimates for mean curvature in Lorentz-Minkowski space.
problem Estimating mean curvature for space-like and time-like graphs.
method Using gradient bounds to derive Heinz-type estimates.
result Unified vanishing theorem for mean curvature of constant mean curvature graphs.
In this note we establish that finite-time singularities of the mean curvature flow of compact Riemannian submanifolds are characterised by the blow up of the mean curvature.
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.
Study explores optimal strategies in games with multiple players and mean-field interactions.
problem Optimal strategies in games with multiple players and mean-field interactions.
method Exploration of three different notions of optimality, including mean-field control solution, mean-field coarse correlated equilibria, and mean-field Nash equilibria.
result Approximation of cooperative and competitive equilibria in large N-player games by mean-field control and mean-field equilibria. Finding the optimal k-means clustering is NP-hard in general and many heuristics have been designed for minimizing monotonically the k-means objective. We first show how to extend Lloyd's batched relocation heuristic and Hartigan's single-point relocation heuristic to take into account empty-cluster and single-poin…
The paper proves constant mean curvature surfaces in specific manifold types.
problem Existence of surfaces with constant mean curvature in asymptotically flat and hyperbolic manifolds.
method Combines min-max theory with inverse mean curvature flow.
result Existence of compact surfaces with constant mean curvature in asymptotically flat and hyperbolic manifolds.
The paper proves a theorem about mean curvature in Euclidean and hyperbolic spaces.
problem Proving a theorem about mean curvature in Euclidean and hyperbolic spaces.
method Analyzing connected mean convex regions with at least two components in Rn+1 and hyperbolic space. result Connected mean convex regions in Rn+1 with at least two components cannot have strictly positive mean curvature. Ancient solutions to mean curvature flow have unique shapes.
problem Understanding unique shapes of ancient solutions.
method Proved a Bernstein theorem for ancient solutions.
result Ancient solutions to mean curvature flow have unique shapes.
Novel mean estimation method under user-level differential privacy reduces noise in continual mean estimates.
problem Maintaining accurate running mean estimates under user-level differential privacy.
method Developed a novel mean estimation specific factorization under approximate differential privacy.
result Achieved asymptotically lower mean-squared error bounds in continual mean estimation.
We propose a novel framework for graph mean computation.
problem Defining a mean for graph data is difficult.
method Embeddings in the space of smooth graph signal distributions, using the Wasserstein metric.
result Existence and uniqueness of the graph mean established, and an iterative algorithm provided.
This note finds closed-form solutions for mean-risk portfolios using a specific type of mixture distribution.
problem Finding optimal portfolios under mean-risk criteria for general distributions.
method Using normal mean-variance mixture (NMVM) distributions, the paper derives closed-form expressions for mean-risk frontiers by optimizing a Markowitz model with adjusted return vectors.
result Closed-form solutions for mean-risk portfolios are found for return vectors following NMVM distributions.
The notion of a generalized harmonic inverse mean curvature surface in the Euclidean four-space is introduced. A backward Bäcklund transform of a generalized harmonic inverse mean curvature surface is defined. A Darboux transform of a generalized harmonic inverse mean curvature surface is constructed by a backward Bäck…
Constructs ancient solutions to mean curvature flow with prescribed singular sets.
problem Creating mean-convex ancient solutions with specific singular sets.
method Constructs solutions with a prescribed singular set Kimes{0} using mean curvature flow in a Riemannian metric. result Constructs ancient solutions with a first-time singular set exactly Kimes{0}. We study the mean dimension of the moduli space of Brody curves. We introduce the notion of "mean energy" and show that this can be used to estimate the mean dimension.
In this paper, we prove that the mean curvature blows up at the same rate as the second fundamental form at the first singular time T of any compact, Type I mean curvature flow. For the mean curvature flow of surfaces, we obtain similar result provided that the Gaussian density is less than two. Our proofs are based …
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…