This work explores the trade-offs between stability and accuracy in statistical estimation.
problem Understanding the statistical cost of algorithmic stability.
method Statistical decision-theoretic perspective, focusing on worst-case and average-case stability.
result Optimal stable estimators for mean estimation and regression settings are developed, revealing trade-offs between stability and accuracy.
New methods improve statistical accuracy of complex models without high computational cost.
problem Improving statistical accuracy of complex models without high computational cost.
method Neural posterior and likelihood estimation (NPE and NLE) methods.
result NPE and NLE methods have similar theoretical guarantees to ABC and BSL, but achieve accuracy at a reduced computational cost.
Study reveals statistical bias in dataset replication, reducing accuracy drop from 11-14% to 3.6%.
problem Statistical bias in dataset replication affects model generalization accuracy.
method Analyzed ImageNet-v2, identified and corrected for bias, and compared results.
result Correcting bias reduces accuracy drop from 11-14% to 3.6%.
The paper sets limits on the accuracy of macroeconomic forecasts based on statistical moments and trade volumes.
problem Uncertainty in predicting macroeconomic variables like prices and returns.
method Defines theoretical lower bounds of uncertainty and upper limits on forecast accuracy based on statistical moments and trade volumes.
result Accuracy of forecasts of probabilities of macroeconomic variables doesn't exceed Gaussian approximations.
SAAD enhances anomaly detection in automotive systems with high accuracy.
problem Anomaly detection in automotive systems.
method Integrates statistical techniques with machine learning.
result SAAD achieves 88.3% accuracy and 0.921 F1 score.
Range penalization enhances statistical accuracy and resource efficiency in federated learning.
problem Statistical accuracy and resource efficiency in federated learning.
method Range regularization and polar clustering.
result Enhanced statistical accuracy and reduced iteration complexity.
This paper analyzes the trade-off between accuracy and communication in personalized federated learning.
problem The accuracy-communication trade-off in personalized federated learning.
method The paper provides a quantitative characterization of the personalization degree on the trade-off, establishing minimax optimality.
result The paper offers theoretical insights for choosing the personalization degree and validates the results on synthetic and real-world datasets.
The article explains how to estimate confusion matrices for classifiers using unlabeled data.
problem Estimating sensitivity and specificity of binary medical diagnostic tests without gold standard tests.
method Modifying diagnostic test solutions to estimate confusion matrices for classifiers on unlabeled data.
result The approach can be used to estimate accuracy statistics for supervised or unsupervised binary classifiers on unlabeled data.
Optimal kernel improves estimation accuracy in modal statistical methods.
problem Estimation accuracy of kernel-based modal statistical methods depends on the kernel used.
method The study theoretically shows an optimal kernel that minimizes asymptotic error criterion.
result An optimal kernel minimizes the error criterion when using an optimal bandwidth.
Graph Neural Networks improve financial time series forecasting accuracy.
problem Forecasting univariate financial time series with statistical significance.
method Introducing the Time-Geometric model combining geometric and temporal patterns.
result Statistically significant improvements in forecasting accuracy through geometric patterns.
We consider the weakly supervised binary classification problem where the labels are randomly flipped with probability 1−α. Although there exist numerous algorithms for this problem, it remains theoretically unexplored how the statistical accuracies and computational efficiency of these algorithms depend on the degr…
Approximate Bayesian Computation (ABC) methods are used to approximate posterior distributions in models with unknown or computationally intractable likelihoods. Both the accuracy and computational efficiency of ABC depend on the choice of summary statistic, but outside of special cases where the optimal summary statis…
Proposes a new method to improve Bayesian computation accuracy using flexible classification.
problem Bayesian computations accuracy check using rank-based simulation-based calibration has limitations.
method Replaces marginal rank test with a flexible classification approach that learns from data.
result Improves statistical power and provides an interpretable divergence measure of miscalibration.
Private statistics estimation faces a bias, accuracy, and privacy trilemma.
problem Balancing privacy, accuracy, and bias in statistical estimation.
method Use differential privacy (DP) for private statistics, but clip samples to control sensitivity and add noise for privacy, introducing bias.
result No algorithm can simultaneously have low bias, low error, and low privacy loss for arbitrary distributions.
We investigate the efficiency of k-means in terms of both statistical and computational requirements. More precisely, we study a Nyström approach to kernel k-means. We analyze the statistical properties of the proposed method and show that it achieves the same accuracy of exact kernel k-means with only a fraction of co…
Within the framework of statistical learning theory it is possible to bound the minimum number of samples required by a learner to reach a target accuracy. We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning---for which statistical guarantees are …
Linear cost method approximates Gaussian Matérn processes with exponentially convergent accuracy.
problem High computational cost for Gaussian process inference and prediction.
method Optimal rational approximation of spectral density for Gaussian processes on bounded intervals.
result Exponential decrease in covariance error with increasing order of approximation.
AI task delegation faces incentive collapse with unbounded payments as AI accuracy rises.
problem Incentive collapse in AI-assisted task delegation schemes.
method General impossibility result and sentinel-auditing payment mechanism.
result Sentinel-auditing mechanism enforces positive human effort at finite cost, independent of AI accuracy.
The study analyzes the performance of statistical estimators under stability and computational efficiency.
problem Understanding the performance of statistical estimators in relation to stability and computational efficiency.
method Developed a framework to bound statistical accuracy based on the interplay between algorithm convergence rates and stability.
result Unstable algorithms can achieve the same statistical accuracy as stable ones in fewer steps.
A new combinatorial approach groups regression coefficients for improved accuracy.
problem Grouping regression coefficients to reveal shared values within groups.
method Introduces L0-Fusion, a combinatorial grouping approach using mixed integer optimization. result L0-Fusion achieves grouping consistency under weak grouping sensitivity conditions. Generalizes SMCI to improve Boltzmann machine learning accuracy.
problem Limitation in applying higher-order SMCI to dense systems.
method Generalized SMCI (GSMCI) and new PBM learning method.
result GSMCI allows higher-order approximations for dense systems.
Study on trade-offs between accuracy and interpretability in machine learning.
problem Lack of formal study on statistical cost of interpretability.
method Modeling interpretability as a constraint in empirical risk minimization for binary classification.
result Explains conditions under which accuracy trade-off occurs with interpretability constraints.
Learning ReLU networks to high uniform accuracy requires exponentially many samples.
problem Achieving high uniform accuracy on ReLU networks for security-critical applications.
method Quantified the number of training samples needed for any algorithm to guarantee uniform accuracy.
result The minimal number of training samples scales exponentially with network depth and input dimension.
Statistical test detects model degradations in optimized language models.
problem Detecting model degradations in optimized language models.
method Statistical hypothesis testing framework based on McNemar's test.
result Even small accuracy degradations (0.3%) can be attributed to actual degradations, not noise.
Enhanced TSFMs improve time series forecasting accuracy and reliability.
problem Variance, bias, and uncertainty in TSFMs' predictions on real data.
method Statistical and ensemble techniques including bagging, stacking, residual modeling, and prediction intervals.
result Hybrid models consistently outperform standalone TSFMs across multiple horizons.
Two new undersampling methods improve classification accuracy for imbalanced datasets.
problem Class imbalance and distributional differences in large datasets lead to biased models and poor predictive performance.
method Mutual information-based stratified simple random sampling and support points optimization.
result Empirical results show higher balanced classification accuracy compared to traditional techniques.
Unified approach improves accuracy in private estimation.
problem Protecting sensitive information in statistical estimation.
method Unified Bayes Private Point (UBaPP) approach to Bayes point estimation under differential privacy constraints.
result Achieves better accuracy-privacy trade-off than traditional methods.
Nyström KPCA balances computational efficiency and statistical accuracy.
problem Computational burden in large sample situations for kernel methods.
method Theoretical analysis of Nyström approximate kernel principal component analysis (KPCA).
result Nyström approximate KPCA matches statistical performance of non-approximate KPCA while being computationally beneficial.
A new federated learning method speeds up training by selecting faster nodes first.
problem System heterogeneity and stragglers slow down federated learning.
method Adaptive selection of nodes based on data statistical characteristics.
result Significant speedup in wall-clock time compared to standard federated learning.
Machine learning improves earnings forecasting accuracy and speed.
problem Improving earnings forecasting accuracy and speed.
method Adopting machine learning models for earnings forecasting.
result Machine learning model outperforms traditional models in accuracy and speed.
This work improves fairness in federated learning by using zero-shot data augmentation.
problem Statistical heterogeneity leads to biased and less uniform accuracy across clients in federated learning.
method Proposes a federated learning system with zero-shot data augmentation to mitigate statistical heterogeneity and improve fairness.
result Empirical results show improved test accuracy and fairness across clients.
We consider the problem of automated assignment of papers to reviewers in conference peer review, with a focus on fairness and statistical accuracy. Our fairness objective is to maximize the review quality of the most disadvantaged paper, in contrast to the commonly used objective of maximizing the total quality over a…
Stochastic methods improve data assimilation with high-frequency sensor data.
problem Computational challenges in data assimilation with high-frequency sensor data.
method Adapted stochastic approximation methods to handle high-frequency observations.
result Produces high-quality estimates using all observations without compromising statistical accuracy.
ParK efficiently solves kernel ridge regression for large datasets.
problem Large-scale kernel ridge regression efficiency and accuracy.
method Partitioning feature space with random projections and iterative optimization.
result Provably maintains statistical accuracy with reduced space and time complexity.
The paper explores how market-based returns depend on past trade values.
problem Improving accuracy in forecasting market-based average and volatility of returns.
method Derives the dependence of market-based volatility and higher statistical moments of returns on statistical moments and correlations of current and past trade values.
result Market-based statistical moments can be approximated by a finite number of moments, improving forecast reliability.
New algorithms improve privacy in statistical estimation by making them robust.
problem Improving privacy in statistical estimation methods.
method Black-box reduction from privacy to robustness, using Sum-of-Squares method.
result Design of polynomial-time private estimators with optimal tradeoffs among sample complexity, accuracy, and privacy.
Unified method for MMD variance estimation improves accuracy and computational efficiency.
problem Variance estimation for MMD in nonparametric testing.
method Unified finite-sample characterization of MMD variance through U-statistic and Hoeffding decomposition; exact acceleration method for univariate case.
result Unified estimators improve accuracy and computational efficiency for MMD variance.
Project fair estimators while maintaining accuracy.
problem Making estimators fair without sacrificing accuracy.
method Optimal transport tools to find closest fair estimator.
result Efficiently constructs fair estimators with quantified cost.
Proposes a private empirical bootstrap for Gaussian Differential Privacy.
problem Quantifying uncertainty in massive data under Differential Privacy.
method Gaussian Differential Private Bootstrap by Subsampling.
result Consistent and efficient private inference method.
Paper introduces Influence Function to assess OOD generalization stability.
problem Assessing OOD generalization accuracy when target domains are unknown.
method Introduced Influence Function from robust statistics to monitor model stability.
result Accuracy on test domains and Influence Function variance can distinguish OOD algorithms and generalization quality.
Dual-stage sEMG classification improves gesture recognition accuracy.
problem Improving accuracy in hand gesture recognition from sEMG signals.
method Dual-stage classification approach: first stage groups similar activities, second stage classifies within groups.
result Dual-stage classification yields significantly higher accuracy than single-stage approach.
A new test statistic counts tree co-occurrences to detect edge correlation between networks.
problem Detecting edge correlation between networks using latent vertex correspondence.
method The test statistic is based on counting co-occurrences of signed trees for a family of non-isomorphic trees.
result The test runs in n2+o(1) time and succeeds with high probability for large n. This paper examines risks and uncertainties of changing data sources in machine learning for official statistics.
problem Risks and uncertainties associated with changing data sources in machine learning for official statistics.
method An overview of risks, causes, and repercussions of changing data sources, with a checklist of measures.
result Maintaining integrity, reliability, consistency, and relevance in official statistics.
We study the fundamental tradeoffs between computational tractability and statistical accuracy for a general family of hypothesis testing problems with combinatorial structures. Based upon an oracle model of computation, which captures the interactions between algorithms and data, we establish a general lower bound tha…
Paper optimizes experimental design for estimating treatment effect.
problem Estimating treatment effect with heterogeneous subjects and treatments.
method Adaptive experimental design incorporating bandit learning.
result Demonstrates optimality of proposed adaptive experiment framework.
Optimal learning via moderate deviations theory improves statistical accuracy.
problem Statistical estimation of expected loss in various models.
method Develops confidence intervals using moderate deviation principle.
result Proposed confidence intervals are statistically optimal.
Existing nonconvex statistical optimization theory and methods crucially rely on the correct specification of the underlying "true" statistical models. To address this issue, we take a first step towards taming model misspecification by studying the high-dimensional sparse phase retrieval problem with misspecified link…
Price and return predictions are limited by economic complexity, not just volatility.
problem Limited accuracy of price and return probability forecasts by Gaussian distributions.
method Analyzes economic reasons behind limitations in predicting price and return statistical moments.
result Predictions of price and return probabilities by Gaussian distributions are inaccurate due to economic complexity.