Estimates GLMs robustly against label corruptions.
problem Learning GLMs under adversarial label corruptions.
method Iterative trimmed maximum likelihood estimator.
result Achieves minimax near-optimal risk.
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,695 papers · 148 categories
Trend · papers per month
48 results for “Iterative Trimmed Maximum Likelihood”
A new robust GP regression algorithm that trims outliers improves model accuracy.
problem Severe bias in GP regression due to data contamination by outliers.
method Iterative trimming of extreme data points.
result Significantly outperforms standard and robust GP variants in most test cases.
A method for estimating parameters from entangled single-sample distributions, robust to high-noise data.
problem Estimating common parameters from entangled single-sample distributions.
method Iterative trimming of samples to estimate the parameter.
result The method can tolerate a constant fraction of high-noise data points.
New method clusters matrix-variate data with outliers.
problem Clustering matrix-variate data with outliers.
method Iterative approach using subset log-likelihoods.
result Extends OCLUST algorithm to matrix-variate normal data.
TrIM improves gradient-based dimension reduction and regression.
problem Efficiently identifying relevant feature subspace for high-dimensional regression.
method Introduced TrIM forest, an iterative approach using Mondrian forest and EGOP estimate.
result Consistency guarantees and convergence rates for EGOP matrix and random forest estimator.
We call a learner super-teachable if a teacher can trim down an iid training set while making the learner learn even better. We provide sharp super-teaching guarantees on two learners: the maximum likelihood estimator for the mean of a Gaussian, and the large margin classifier in 1D. For general learners, we provide a …
A new method speeds up quantum state estimation.
problem Exponential growth in sample size and dimension for quantum state tomography.
method Stochastic mirror descent with Burg entropy.
result Optimization error vanishes at a rate.
The maximum likelihood approach is adapted to the problem of estimation of drift and diffusion functions of stochastic processes from measured time series. We reconcile a previously devised iterative procedure [Kleinhans et al., Physics Letters A (346), 2005] and put the application of the method on a firm theoretical …
Clustering, or unsupervised classification, is a task often plagued by outliers. Yet there is a paucity of work on handling outliers in clustering. Outlier identification algorithms tend to fall into three broad categories: outlier inclusion, outlier trimming, and post hoc outlier identification methods, with the forme…
We have developed an efficient algorithm for the maximum likelihood joint tracking and association problem in a strong clutter for GMTI data. By using an iterative procedure of the dynamic logic process "from vague-to-crisp," the new tracker overcomes combinatorial complexity of tracking in highly-cluttered scenarios a…
We propose a novel method for maximum likelihood-based parameter inference in nonlinear and/or non-Gaussian state space models. The method is an iterative procedure with three steps. At each iteration a particle filter is used to estimate the value of the log-likelihood function at the current parameter iterate. Using …
Paper proposes robust gossip algorithms for mean and trimmed mean estimation.
problem Vulnerability of mean-based gossip algorithms to malicious nodes.
method Developed extsc{GoRank} for rank estimation and extsc{GoTrim} for trimmed mean estimation.
result Established convergence rates for rank and trimmed mean estimation.
Given a linear regression setting, Iterative Least Trimmed Squares (ILTS) involves alternating between (a) selecting the subset of samples with lowest current loss, and (b) re-fitting the linear model only on that subset. Both steps are very fast and simple. In this paper we analyze ILTS in the setting of mixed linear …
We assess cluster stability by trimming extreme points and tracking data range reduction.
problem Assessing stability of one-dimensional clusters.
method Probabilistic method using diameter-shrinkage ratio to track data range reduction.
result Our method achieves higher accuracy than classical tests in small or noisy samples.
ABI bypasses likelihood intractability with nonparametric distribution matching.
problem Approximate Bayesian computation's inefficiency in high-dimensional settings and under diffuse priors.
method Adaptive Bayesian Inference (ABI) compares posterior distributions directly using nonparametric distribution matching and MSW distance.
result ABI significantly outperforms other methods in high-dimensional or dependent observation regimes.
Many machine learning tasks can be formulated in terms of predicting structured outputs. In frameworks such as the structured support vector machine (SVM-Struct) and the structured perceptron, discriminative functions are learned by iteratively applying efficient maximum a posteriori (MAP) decoding. However, maximum li…
Maximum likelihood inference for high-dimensional problems with multiaffine variable relationsstat.ML
A novel AIRLS algorithm for multiaffine variable relations in high-dimensional problems.
problem Challenges in Maximum Likelihood Estimation in high-dimensional settings with complex variable relations.
method Proposes an Alternating and Iteratively-Reweighted Least Squares (AIRLS) algorithm for multiaffine variable relations.
result Proves convergence for problems with Generalized Normal Distributions and shows empirically super-linear convergence rate.
Principal component analysis (PCA) is recognised as a quintessential data analysis technique when it comes to describing linear relationships between the features of a dataset. However, the well-known sensitivity of PCA to non-Gaussian samples and/or outliers often makes it unreliable in practice. To this end, a robust…
Efficiently estimates missing data parameters without iterations.
problem Randomly missing data in statistics and bioinformatics.
method Novel algorithms for maximum likelihood estimation.
result Less time-consuming and superior estimation performance.
Paper develops efficient algorithms for robust distributed learning with statistical guarantees.
problem Limited communication power and adversarial node behaviors in distributed learning.
method Surrogate likelihood framework and median/trimmed mean operations.
result Provable robustness against Byzantine failures and optimal statistical rates.
Recursive Maximum Likelihood Estimation for Interacting Particle Systems using Virtual Particlesstat.ME
Estimates log-likelihood of interacting particle systems using virtual particles.
problem Inconsistent estimation of finite-particle log-likelihood in large particle systems.
method Stochastic gradient estimate using continuous trajectory and virtual particle systems.
result Convergence to stationary points of limiting mean-field system's log-likelihood.
New algorithms learn latent variable models without tuning, outperforming existing methods.
problem Learning latent variable models without manual tuning.
method Two particle-based algorithms using free energy minimization and coin betting.
result Learning algorithms are entirely tuning-free and competitive with existing methods.
In this paper, we study a simple and generic framework to tackle the problem of learning model parameters when a fraction of the training samples are corrupted. We first make a simple observation: in a variety of such settings, the evolution of training accuracy (as a function of training epochs) is different for clean…
We present the particle stochastic approximation EM (PSAEM) algorithm for learning of dynamical systems. The method builds on the EM algorithm, an iterative procedure for maximum likelihood inference in latent variable models. By combining stochastic approximation EM and particle Gibbs with ancestor sampling (PGAS), PS…
While most approaches to the problem of Inverse Reinforcement Learning (IRL) focus on estimating a reward function that best explains an expert agent's policy or demonstrated behavior on a control task, it is often the case that such behavior is more succinctly represented by a simple reward combined with a set of hard…
Quantum method improves CVaR evaluation under correlated fields.
problem Accurately evaluating CVaR in high-dimensional, correlated material uncertainty.
method Quantum-enhanced inference framework using stabilized IQAE.
result Quantum method achieves lower oracle complexity than classical methods.
Trimming helps in conformal prediction when it separates anomaly scores.
problem Effectiveness of trimming in conformal prediction under contamination.
method Analyse fixed-threshold trimming as a replacement of the contaminated calibration law with a retained law.
result Trimming helps when it separates anomaly scores, reducing clean-target coverage to a one-dimensional score-CDF transfer problem.
New insights into using IPF for inferring dynamic networks from marginals.
problem Inferring dynamic networks from time-aggregated adjacency matrices and time-varying marginals.
method Identifying a generative network model and establishing its maximum likelihood estimates via IPF, with convergence guarantees for sparse data.
result IPF provides principled estimation of dynamic networks from marginals under certain conditions, with structure-dependent error bounds and guaranteed convergence for sparse data.
Paper proposes CoopFlow, a two-flow generator for energy-based models.
problem Training energy-based models with Langevin flow and normalizing flow.
method CoopFlow trains an energy-based model using a normalizing flow initialization and a short-run Langevin flow revision.
result CoopFlow converges to a moment matching estimator and synthesizes realistic images.
Method recovers complex-valued signals from speckle-noised measurements.
problem Recovering complex-valued signals from speckle-noised measurements.
method Bagged Deep Image Priors integrated with projected gradient descent and Newton-Schulz algorithm.
result Achieves state-of-the-art performance in MSE reduction.
We consider the problem of robustifying high-dimensional structured estimation. Robust techniques are key in real-world applications which often involve outliers and data corruption. We focus on trimmed versions of structurally regularized M-estimators in the high-dimensional setting, including the popular Least Trimme…
Transformer improves parameter estimation without needing closed-form solutions.
problem Parameter estimation in statistics, especially for complex distributions.
method Transformer-based approach for parameter estimation without closed-form solutions or derivations.
result Transformer-based approach achieves similar or better accuracy than maximum likelihood estimation.
Maximum likelihood estimation fails to be well-posed in Gaussian process regression.
problem Establishing well-posedness of maximum likelihood estimation in Gaussian process regression.
method Analyzing the conditions under which maximum likelihood estimation is not Lipschitz in the data with respect to the Hellinger distance.
result Maximum likelihood estimation is not well-posed in the noiseless data setting for any Gaussian process with a stationary covariance function whose lengthscale parameter is estimated using maximum likelihood.
Adversarial contamination of networks in the setting of vertex nomination: a new trimming methodstat.ML
New method trims network data to resist adversarial contamination.
problem Adversarial contamination in network data affects statistical and algorithmic performance.
method Proposes a new trimming method operating in model space to address both block and white noise contamination.
result Demonstrates superior performance in simulations compared to direct trimming.
Dual training method for EBMs with overparametrized neural networks.
problem Training EBMs with non-convex energies is challenging.
method Derive variational principles and dual GDA algorithm for feature-learning regime.
result Dual GDA algorithm performs best with similar time scales for features and particles.
Nonconvex penalty methods for sparse modeling in linear regression have been a topic of fervent interest in recent years. Herein, we study a family of nonconvex penalty functions that we call the trimmed Lasso and that offers exact control over the desired level of sparsity of estimators. We analyze its structural prop…
Adversarial learning of probabilistic models has recently emerged as a promising alternative to maximum likelihood. Implicit models such as generative adversarial networks (GAN) often generate better samples compared to explicit models trained by maximum likelihood. Yet, GANs sidestep the characterization of an explici…
Feature selection is important for modeling high-dimensional data, where the number of variables can be much larger than the sample size. In this paper, we develop a support detection and root finding procedure to learn the high dimensional sparse generalized linear models and denote this method by GSDAR. Based on the …
Truncated densities are probability density functions defined on truncated domains. They share the same parametric form with their non-truncated counterparts up to a normalizing constant. Since the computation of their normalizing constants is usually infeasible, Maximum Likelihood Estimation cannot be easily applied t…
OmniFold uses deep learning to deconvolve high-dimensional simulations.
problem Removing detector distortions and accounting for noise processes in high-dimensional simulations.
method OmniFold is a deep learning-based approach for maximum likelihood deconvolution.
result OmniFold can remove detector distortions and account for noise processes and acceptance effects.
The paper addresses speckle noise in coherent imaging systems.
problem Speckle noise degrades image quality in coherent imaging systems.
method Theoretical and algorithmic analysis of likelihood-based approaches for multilook coherent imaging.
result Established the first theoretical upper bound on MSE of the maximum likelihood estimator.
Accelerates MMLE using SVGD with Nesterov acceleration.
problem Maximum Marginal Likelihood Estimation optimization.
method Stein variational gradient descent with Nesterov acceleration.
result Consistently accelerates convergence across various tasks.
Maximum likelihood training improves the performance of score-based diffusion models.
problem Training score-based diffusion models with maximum likelihood.
method Trained by minimizing a weighted combination of score matching losses, with a specific weighting scheme that bounds negative log-likelihood.
result Maximum likelihood training improves the log-likelihood of score-based diffusion models across multiple datasets.
We consider distributed estimation of the inverse covariance matrix, also called the concentration or precision matrix, in Gaussian graphical models. Traditional centralized estimation often requires global inference of the covariance matrix, which can be computationally intensive in large dimensions. Approximate infer…
New study shows MLE can avoid model collapse with gradual synthetic data addition.
problem Model collapse in generative models trained on synthetic data.
method Theoretical study of maximum likelihood estimation (MLE) under iterative training with accumulating synthetic data.
result Non-asymptotic bounds show MLE can avoid model collapse even as real data fraction vanishes.
We describe a general framework for measuring risks, where the risk measure takes values in an abstract cone. It is shown that this approach naturally includes the classical risk measures and set-valued risk measures and yields a natural definition of vector-valued risk measures. Several main constructions of risk meas…
We relate trimmed sums of twists in cylinders along a typical Teichmuller geodesic to the area Siegel-Veech constant.
New method solves sparse approximation problem using trimmed lasso and generalized soft-min penalties.
problem Sparse approximation or best subset selection problem.
method Regularized approach with trimmed lasso and generalized soft-min penalties.
result The trimmed lasso provides sparse recovery guarantees and a practical optimization algorithm.