New sampling method optimizes learning minimum mean among distributions.
problem Learning the minimum mean from a set of distributions.
method Developed Murphy Sampling, a novel approach.
result Murphy Sampling optimizes learning both low and high true minimums.
Paper studies unique interior points and estimates for generalized translating soliton problems.
problem Generalized translating soliton type problems.
method Proves uniqueness of interior critical points, derives C0 and C1 estimates using minimum principles. result Derives a priori C0 and C1 estimates for solutions. Gradient descent converges to minimum Bayes risk for two-layer ReLU networks in mean field regime.
problem Training two-layer ReLU networks using gradient descent in the mean field regime.
method Describes a condition for convergence to minimum Bayes risk, extending previous results to ReLU-activated networks.
result The condition for convergence does not depend on initialization and concerns weak convergence of network realization.
The paper identifies the minimum mean-variance spanning set and its importance in asset evaluation.
problem Estimating the minimum subset of assets that span the efficient frontier.
method Established identification conditions and developed a novel procedure for MSS estimation and inference.
result The MSS estimator accurately covers the true MSS and converges to it at any desired confidence level.
Efficient adjustment sets found for cost-minimized causal estimations.
problem Estimating interventional means with minimum cost in causal graphical models.
method Defined cost-adjustment sets, constructed flow networks, and used maximum flow algorithms.
result Minimum cost optimal adjustment sets exist and can be found efficiently.
Study shows mean field games can have multiple solutions under certain conditions.
problem Analysis of mean field games with anti-monotone running costs.
method Examined an N+1-player game and mean field game with state space {0,1}, considering a minimum jumping rate. result Mean field game equation may have multiple solutions if a specific condition is met.
Neural networks with Xavier initialization converge to global minimum in the scaling limit.
problem Optimizing neural networks with Xavier initialization in the large network limit.
method Stochastic analysis and convergence to a random ODE with a Gaussian distribution.
result The neural network converges to a global minimum in the limit, with zero loss.
Analyzes surfaces minimizing mean curvature variation using PDEs.
problem Finding surfaces of minimum mean curvature variation.
method Develops an analytic theory using partial differential equations.
result Establishes existence and regularity of minimizers.
Proposes Deep LTMLE for estimating dynamic treatment effects in longitudinal studies.
problem Estimating counterfactual mean outcomes under dynamic treatment policies in longitudinal settings.
method Uses a transformer architecture with temporal-difference learning for initial estimation, followed by TMLE correction and statistical inference.
result Demonstrates superior performance in complex, long-term scenarios compared to existing methods.
The Australian Government uses the means-test as a way of managing the pension budget. Changes in Age Pension policy impose difficulties in retirement modelling due to policy risk, but any major changes tend to be `grandfathered' meaning that current retirees are exempt from the new changes. In 2015, two important chan…
Robust estimation methods find global minima efficiently via quasi-gradients.
problem Efficiently solving robust estimation problems with non-convex optimization.
method Identifying generalized quasi-gradients to guarantee low-regret algorithms.
result Generalized quasi-gradients ensure efficient approximation of global minima.
MSTs provide a fast and meaningful clustering method in low-dimensional data.
problem Quantifying the effectiveness of MSTs in low-dimensional clustering tasks.
method Identifying upper bounds for MST performance, reviewing and extending existing MST-based partitioning schemes.
result MST methods can be very competitive, often outperforming traditional clustering algorithms.
Improved sample complexity for Gaussian Mixture Models using Pair Correlation Factor.
problem Understanding the sample complexity of Gaussian Mixture Models.
method Introducing Pair Correlation Factor (PCF) to measure clustering of component means and improving sample complexity bounds.
result The Pair Correlation Factor (PCF) more accurately determines the difficulty of parameter recovery in Gaussian Mixture Models.
We survey - by means of 20 examples - the concept of varifold, as generalised submanifold, with emphasis on regularity of integral varifolds with mean curvature, while keeping prerequisites to a minimum. Integral varifolds are the natural language for studying the variational theory of the area integrand if one conside…
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.
MC-MCL improves MCL for nonlinear clustering.
problem Nonlinear clustering in data science.
method MC-MCL combines MCL with Minimum Curvilinearity for nonlinear distances.
result MC-MCL outperforms classical MCL and baseline clustering algorithms in nonlinear datasets.
In this paper, we mainly study the mean curvature flow in Kähler surfaces with positive holomorphic sectional curvatures. We prove that if the ratio of the maximum and the minimum of the holomorphic sectional curvatures is less than 2, then there exists a positive constant δ depending on the ratio such that $\cosα\ge…
The discrete-time mean-variance portfolio selection formulation, a representative of general dynamic mean-risk portfolio selection problems, does not satisfy time consistency in efficiency (TCIE) in general, i.e., a truncated pre-committed efficient policy may become inefficient when considering the corresponding trunc…
Data mining enhances a heuristic for the Minimum Latency Problem.
problem Finding optimal solutions for the Minimum Latency Problem efficiently.
method Combining GRASP with data mining to find frequent patterns in high-quality solutions.
result Improved solution quality and reduced computational time compared to existing methods.
This study explains gradient flow dynamics in neural networks for small initialisation.
problem Understanding the training dynamics of neural networks for small initialisation.
method Analysis of gradient flow dynamics for one-hidden layer ReLU networks with orthogonal inputs.
result Gradient flow converges to zero loss and characterizes implicit bias towards minimum variation norm.
Deep networks don't improve on shallow ones for finding minima.
problem Improving representation of multidimensional mappings with deep neural networks.
method Numerical training methods to find minima in deep and shallow networks.
result Minima found with deep networks are worse than those found with shallow networks.
New insights into correntropy-based regression reveal robustness and unified approaches.
problem Learning robust regression functions under additive noise.
method Minimum distance estimation and conditional mean, mode, median functions.
result Unified approach to conditional mean, mode, and median functions.
Traditionally, practitioners initialize the {\tt k-means} algorithm with centers chosen uniformly at random. Randomized initialization with uneven weights ({\tt k-means++}) has recently been used to improve the performance over this strategy in cost and run-time. We consider the k-means problem with semi-supervised inf…
Proposes variational autoencoder for efficient MMSE estimation.
problem Efficient parameterized MMSE estimation for noisy observations.
method Variational autoencoder models data distribution, approximates MMSE.
result Proposed estimator performs well compared to state-of-the-art.
The mean-shift algorithm is a popular algorithm in computer vision and image processing. It can also be cast as a minimum gamma-divergence estimation. In this paper we focus on the "blurring" mean shift algorithm, which is one version of the mean-shift process that successively blurs the dataset. The analysis of the bl…
New algorithm for biclustering with improved performance.
problem Simultaneous clustering of rows and columns with similar patterns.
method Formulated new biclustering problem, developed alternating k-means algorithm.
result Our algorithm finds local minima efficiently and outperforms other methods.
Minimum sum-of-squares clustering (MSSC) is a widely used clustering model, of which the popular K-means algorithm constitutes a local minimizer. It is well known that the solutions of K-means can be arbitrarily distant from the true MSSC global optimum, and dozens of alternative heuristics have been proposed for this …
The study improves bounds on pseudo-Anosov maps and certifies minimum and accumulation points of normalized dilatations.
problem Understanding the set of normalized dilatations of fully-punctured pseudo-Anosov maps.
method Improving bounds on the number of tetrahedra in veering triangulations and using computational means.
result Certified that the minimum element of the set of normalized dilatations is μ2 and the minimum accumulation point is μ4. Optimizes sparse mean-reverting portfolios for higher returns.
problem Finding optimal stock weights for mean-reverting portfolios.
method Transformed optimization problem into SDP, added constraints.
result Sparse mean-reverting portfolios provide higher returns with transaction costs.
We analyze a conservative market model for the competition among economic agents in a close society. A minimum dynamics ensures that the poorest agent has a chance to improve its economic welfare. After a transient, the system self-organizes into a critical state where the wealth distribution have a minimum threshold, …
New insights into spurious local minima in k-means clustering.
problem Understanding and mitigating spurious local minima in k-means clustering.
method Investigating spurious local minima under a probabilistic generative model.
result Proven structures of spurious local minima for k-means clustering.
Although consistency is a minimum requirement of any estimator, little is known about consistency of the mean partition approach in consensus clustering. This contribution studies the asymptotic behavior of mean partitions. We show that under normal assumptions, the mean partition approach is consistent and asymptotic …
Surface area and mean width of a cylinder (the convex hull of two parallel disks) in R^3 are computed. It is more difficult to obtain analogous results for a cone (the convex hull of a disk D and a point p). Oblique formulas for mean width, as well as those for mean curvature, are new. Let L denote the unique diameter …
The K-Mean and EM algorithms are popular in clustering and mixture modeling, due to their simplicity and ease of implementation. However, they have several significant limitations. Both coverage to a local optimum of their respective objective functions (ignoring the uncertainty in the model space), require the apriori…
Paper introduces a new estimator for Rasch model with exact error analysis.
problem Estimating parameters of the Rasch model with performance guarantees.
method Develops a novel L-MMSE estimator for the Rasch model with nonasymptotic analysis.
result The L-MMSE estimator provides exact error analysis and performs similarly to state-of-the-art estimators.
KS-algebra consists of expressions constructed with four kinds operations, the minimum, maximum, difference and additively homogeneous generalized means. Five families of Z-classifiers are investigated on binary classification tasks between English phonemes. It is shown that the classifiers are able to reflect well…
Paper controls shape stability in infinite Riemannian manifolds.
problem Characterizing optimal shapes in infinite-dimensional Riemannian manifolds.
method Uses Riemannian manifold framework and mean curvature analysis.
result Control on shape stability depends only on mean curvature.
The paper introduces explainable k-means with axis-parallel hyperplanes for d-dimensional data.
problem Creating explainable clustering with axis-parallel hyperplanes for complex data.
method An efficient algorithm that finds an explainable clustering with a near-optimal cost function.
result The algorithm achieves a near-optimal k-means cost of k1−2/dpolylog(k) for d-dimensional data. The paper studies quadratic neural networks, proving existence of spurious minima and saddle points.
problem Understanding the loss landscape of neural networks with quadratic activations.
method Theoretical analysis of mean squared error loss for neural networks with quadratic activations.
result Proves existence of spurious local minima and saddle points in the training landscape of deep overparameterized quadratic neural networks.
This paper introduces minimum-risk recalibration for probabilistic classifiers, improving their reliability and accuracy.
problem Improving the reliability and accuracy of probabilistic classifiers.
method Minimum-risk recalibration within the MSE decomposition framework, analyzing UMB method and label shift adaptation.
result The optimal number of bins for UMB scales with n1/3, resulting in a risk bound of approximately O(n−2/3). Exact expressions for double descent and implicit regularization in over-parameterized models.
problem Understanding the generalization error of over-parameterized models like deep neural networks.
method Surrogate random design to replace standard i.i.d. design, leading to exact expressions for mean squared error and implicit regularization.
result Exact non-asymptotic expressions for double descent and implicit regularization in over-parameterized models.
New method estimates robust mean in high dimensions with minimized outliers.
problem Estimating the mean in high dimensions when a fraction of data is corrupted.
method Formulating the problem as ℓ0-norm minimization under second moment constraints, and using ℓ1 and ℓp minimization techniques. result The proposed method achieves order optimal robust mean estimation and significantly outperforms existing methods.
This work provides a computationally efficient and statistically consistent moment-based estimator for mixtures of spherical Gaussians. Under the condition that component means are in general position, a simple spectral decomposition technique yields consistent parameter estimates from low-order observable moments, wit…
Develops a new weighted Laplacian method for graph problems.
problem Graph partitioning and balanced minimum cut problems.
method Weighted Laplacian method based on graph theory and PDEs.
result Established equivalence relations among graph problems.
A new k-means variant minimizes pairwise distances within clusters.
problem The need for improved clustering methods.
method A stochastic optimization procedure that minimizes the k-sums target function.
result The new k-sums method outperforms k-means and its variants.
The minimum message length principle is an information theoretic criterion that links data compression with statistical inference. This paper studies the strict minimum message length (SMML) estimator for d-dimensional exponential families with continuous sufficient statistics, for all d≥1. The partition of an …
We consider the following singularly perturbed Neumann problem \begin{eqnarray*} \ve^2 Δu -u +u^p = 0 \, \quad u>0 \quad {\mbox {in}} \quad Ω, \quad {\partial u \over \partial ν}=0 \quad {\mbox {on}} \quad \partial Ω, \end{eqnarray*} where p>2 and Ω is a smooth and bounded domain in R2. We construct a new class…
Develops a TL framework for estimating RMST difference in clinical trials.
problem Estimating RMST difference in clinical trials with time-to-event outcomes.
method Targeted learning (TL) framework using pseudo-observations and copy reference (CR) approach for sensitivity analysis.
result Demonstrated the effectiveness of the TL framework using real data.