The study shows that achieving fairness in risk scores is impossible.
problem Achieving fairness in risk scores is impossible due to inherent trade-offs.
method Formalized three fairness conditions and proved that they cannot be satisfied simultaneously.
result There is no method that can satisfy all three fairness conditions simultaneously.
Bias and flexibility trade off in learning algorithms.
problem Understanding the trade-off between bias and expressivity in learning algorithms.
method Measuring expressivity using entropy on algorithm outcome distributions, and deriving bounds on bias and expressivity.
result There is a necessary trade-off between bias and expressivity in learning algorithms.
Efficiently approximates fairness-accuracy trade-offs for diverse datasets.
problem Inherent trade-off between fairness and accuracy in machine learning models.
method You-Only-Train-Once (YOTO) framework for computationally efficient approximation.
result Robust methodology for auditing model fairness with statistical guarantees.
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.
SCORE resolves the robustness vs accuracy trade-off by redefining robust error.
problem The inherent trade-off between robustness and accuracy in adversarial training.
method SCORE defines local equivariance as the ideal robust behavior, leading to a new robust error metric.
result SCORE reconciles robustness and accuracy, improving model performance on RobustBench.
New definition shows no trade-off between adversarial and standard accuracy.
problem Inexact definition of adversarial perturbation causes confusion.
method Proposed a slight modification to adversarial perturbation definition.
result Existence of classifiers that are robust and achieve high standard accuracy.
Shallow trees in ensemble models make models more interpretable and sometimes better.
problem Lack of transparency in high-performing tree ensemble models.
method Developed an interpretation algorithm to convert tree ensembles into functional ANOVA representations. Proposed strategies to enhance interpretability.
result Shallow trees in ensemble models can lead to better generalization performance and improved interpretability.
This work studies adversarial training in high dimensions, revealing key feature trade-offs.
problem Understanding adversarial robustness in high-dimensional settings.
method Introduces a tractable model to study the geometry of data and adversarial attacks.
result Characterizes directions in data associated with robustness vs. usefulness trade-offs.
The paper finds a fundamental trade-off between confidence and efficiency in transductive conformal prediction.
problem The challenge is to balance confidence and efficiency in predicting multiple data points.
method The authors derive a strict finite-sample bound and introduce a practical algorithm to approach this bound.
result Any non-trivial confidence level leads to exponential growth in prediction set size, with a linear scaling in the number of samples.
Bayesian imputation optimizes bias-variance trade-off in time-series data.
problem Look-ahead bias in imputation of missing time-series data.
method Bayesian consensus posterior that fuses multiple posteriors to optimize bias and variance trade-off.
result Benefit of imputation for portfolio allocation with missing returns demonstrated.
New policy tackles evolving externalities in contextual bandits.
problem Difficulty in recovering from wrong decisions over time.
method Rejection-based policy to achieve low regret.
result Low regret achieved regardless of reward matrix structure.
FairVIC improves fairness in neural networks without sacrificing accuracy.
problem Mitigating bias in automated decision-making systems, particularly in deep learning models.
method Integrates variance, invariance, and covariance terms into the loss function during training to abstract fairness concepts.
result Significant improvements in fairness across all tested metrics without compromising accuracy.
Contrastive learning performance doesn't degrade with more negative samples.
problem Theoretical and empirical evidence of negative samples hurting performance in contrastive learning.
method Simple theoretical setting and empirical support on CIFAR-10 and CIFAR-100 datasets.
result Contrastive learning performance does not degrade with the number of negative samples.
This paper benchmarks time-series adversarial defenses and attacks.
problem Adversarial attacks on time-series data.
method Detailed benchmarking of adversarial defense methods in the L∞ threat model. result Adversarial defenses offer robustness against both strong white-box and black-box attacks.
We perform a finite sample analysis of the detection levels for sparse principal components of a high-dimensional covariance matrix. Our minimax optimal test is based on a sparse eigenvalue statistic. Alas, computing this test is known to be NP-complete in general, and we describe a computationally efficient alternativ…
Bayesian imputation optimizes bias-variance tradeoff in time-series data.
problem Look-ahead bias in imputation of missing time-series data.
method Wasserstein interpolation for Bayesian posterior consensus distribution.
result Optimal control of look-ahead bias and variance in imputation.
A new model for point processes without intensity function trade-offs.
problem Inefficiency and trade-offs in existing point process models.
method Point Set Diffusion, a diffusion-based latent variable model.
result Achieves state-of-the-art performance in point process generation.
WHOMP optimizes randomized controlled trials by minimizing subgroup bias.
problem Minimizing subgroup bias in randomized controlled trials.
method Wasserstein Homogeneity Partition (WHOMP) method.
result WHOMP optimally minimizes type I and type II errors in trials.
Regularizes black-box models to improve interpretability.
problem Improving interpretability of black-box models without sacrificing accuracy.
method Regularizes a black-box model at training time to connect model explainability, explanation system, and quality metrics.
result Substantial improvement in explanation fidelity and stability across various datasets and explanation systems, with slight accuracy trade-off.
AdaComm optimizes SGD by dynamically adjusting communication frequency for faster convergence.
problem Achieving optimal error-runtime trade-off in distributed SGD.
method Adaptive communication strategy that starts with infrequent averaging to save delay and improve speed, then increases frequency.
result AdaComm reduces training time by 3x while maintaining the same final loss.
DynamicVAE improves disentanglement and reconstruction accuracy without sacrificing one for the other.
problem The inherent trade-off between disentanglement and reconstruction accuracy in VAE models.
method DynamicVAE uses a modified incremental PI controller to dynamically adjust the weight β during training, decoupling disentanglement and reconstruction accuracy.
result DynamicVAE significantly improves reconstruction accuracy while maintaining disentanglement comparable to existing methods.
AWNN improves matrix completion by adaptively weighting nearest neighbors.
problem Matrix completion with optimal nearest neighbor weights and radii selection.
method Adaptively weighted nearest neighbor method for matrix completion.
result Theoretical guarantees and synthetic experiments support the effectiveness of AWNN.
Paper relaxes differential privacy for correlated features, improving privacy-utility trade-off.
problem Standard differential privacy ignores feature correlation, leading to suboptimal privacy-utility balance.
method Introduces CorrDP framework that accounts for feature correlation, using total variation distance for quantification.
result CorrDP algorithms outperform standard DP in synthetic and real-world datasets with insensitive features.
New method improves nonlinear filtering accuracy with reduced computation.
problem Complex nonlinear filtering with small system noise.
method Asymptotic expansion with ordinary differential equations and Edgeworth-type correction.
result Significantly lower computational cost with improved accuracy.
The paper shows cross-validation fails in learning Gaussian graphical model structures.
problem Cross-validation's failure in learning Gaussian graphical model structures.
method Finite-sample bounds on misidentification probability of Lasso estimator.
result Cross-validation is inconsistent for learning Gaussian graphical model structures.
The paper explores fair machine learning policies for balancing competing objectives in noisy data.
problem Balancing competing objectives in noisy data.
method Analyzes a class of policies that trace an empirical Pareto frontier based on learned scores.
result Characterizes optimal strategies and bounds Pareto errors due to score inaccuracies.
The paper improves decision tree stability for health care applications.
problem Stability of decision trees in health care applications.
method Introducing a new distance metric to determine tree stability and proposing a novel training methodology.
result On average, a 4.6% decrease in predictive power yields a 38% increase in model stability.
Study risk-sensitive reinforcement learning with Lipschitz dynamic risk measures, establishing regret bounds.
problem Risk-sensitive reinforcement learning in Markov decision processes.
method Two model-based algorithms for Lipschitz dynamic risk measures, focusing on regret bounds.
result Upper bounds demonstrate optimal dependencies on actions and episodes, reflecting risk sensitivity vs. sample complexity trade-off.
Private two-sample tests under LDP achieve minimax rates for multinomial and continuous data.
problem Achieving statistical utility while maintaining privacy in two-sample testing.
method Private permutation tests for multinomial data and adaptive tests for continuous data.
result Minimax optimal tests for private two-sample testing under LDP.
Patch Gaussian augmentation improves model robustness without sacrificing accuracy.
problem Challenges in building robust models without sacrificing accuracy.
method Adds Gaussian noise to randomly selected patches in images.
result Achieves state-of-the-art performance on benchmarks while improving clean data accuracy.
ExpO regularizes models to improve their explainability.
problem Improving the interpretability of black-box models.
method ExpO is a hybridization of regularization and post-hoc explanation systems.
result Post-hoc explanations for ExpO-regularized models have better explanation quality.
New tools quantify deep generative models' performance.
problem Measuring the quality-diversity trade-off in deep generative models.
method Established non-asymptotic bounds on sample complexity and introduced frontier integrals.
result Smoothed estimators improve convergence rates of divergence frontiers.
Generative text classifiers are most vulnerable to membership inference attacks.
problem Privacy threat from Membership Inference Attacks on generative text classifiers.
method Comprehensive empirical evaluation of generative, discriminative, and pseudo-generative classifiers across various datasets.
result Generative classifiers explicitly modeling P(X,Y) are most vulnerable to membership leakage. Paper connects sampling and labeling biases in large-output spaces.
problem Efficient training in large-output spaces with label imbalance.
method Unified approach to address sampling and labeling biases.
result Different negative sampling schemes trade-off performance on dominant and rare labels.
Neighbor embeddings balance attraction and repulsion to visualize data.
problem Visualizing high-dimensional datasets with trade-offs between continuous and discrete structures.
method Neighbor embeddings combine attractive and repulsive forces to visualize data.
result Changing the exaggeration parameter in t-SNE yields a spectrum of embeddings with a trade-off between continuous and discrete structures.
This research shows adding regularization boosts accuracy and spatial robustness for adversarially transformed examples.
problem Improving accuracy and spatial robustness for adversarially transformed examples.
method Invariance-inducing regularization using worst-case transformations.
result Adding regularization on top of standard or adversarial training reduces relative error by 20% for CIFAR10 without increasing computational cost.
Study model selection in batch policy optimization with three error sources.
problem Learn a policy competitive with the best model class in batch policy optimization.
method Formalized in contextual bandit setting with linear model classes, addressing approximation error, statistical complexity, and dataset shift.
result No algorithm can optimally trade-off all three error sources, but relaxing any one enables near-oracle inequalities for the others.
Sparse neural networks can be robust to adversarial attacks.
problem Finding robust neural networks that are also sparse.
method Empirical evaluation and analysis of the Lottery Ticket Hypothesis with adversarial training.
result Sparse, robust neural networks can be found using adversarial training.
The paper addresses Qini curve estimation under clustered network interference.
problem Qini curves can be biased when interference is ignored in clustered network settings.
method Proposes three estimation strategies for clustered network interference.
result Identifies the most appropriate approach based on bias-variance trade-offs.
Simple classifiers can't be robust to adversarial perturbations, but more complex ones can.
problem The gap between standard accuracy and robustness to adversarial attacks.
method Theoretical examples and quantitative analysis of classification tasks.
result There is a trade-off between robustness and standard accuracy among simple classifiers.
Improved Markowitz method handles uncertainty in return forecasts.
problem Uncertainty in return statistics forecasts.
method Convex optimization with practical constraints.
result Handles uncertainty gracefully and efficiently.
Robust models may sacrifice standard accuracy for adversarial robustness.
problem Adversarial robustness vs. standard accuracy trade-off.
method Demonstrated through a simple setting, showing the inherent tension between robustness and standard accuracy.
result The trade-off between standard accuracy and adversarial robustness is a consequence of learning fundamentally different feature representations.
This work explores the relationship between expressivity and generalization in GNNs.
problem Understanding the trade-off between expressivity and generalization in GNNs.
method Introducing a novel framework that connects GNN generalization to the variance in graph structures they can capture.
result Theoretical findings align with empirical results, offering a deeper understanding of how expressivity enhances GNN generalization.
The paper develops a method to select features from multiple kernels for efficient risk minimization.
problem Identifying promising features leading to satisfactory out-of-sample performance in nonlinear kernel approximation.
method A greedy selection process using a correlation metric to choose features from multiple kernels.
result An out-of-sample error bound capturing trade-offs between approximation and spectral errors, showing poly-logarithmic scaling with data.
New defence against data-poisoning attacks in neural networks.
problem Data-poisoning attacks can evade existing defences and increase model efficacy.
method Proved geometric mechanism and identified near clone regime in input space.
result Regularisation and data augmentation reduce data fitting capacity and prevent poisoning.
Proposes Pareto efficient fairness for supervised learning models.
problem Ensuring fairness in machine learning models without sacrificing accuracy.
method Formulates a bilevel optimization problem to find Pareto efficient classifiers.
result Guaranteed solution on Pareto frontier for convex and non-convex objectives.
Stabilizing black-box algorithms through task-oriented randomization
problem Ensuring stability of black-box models
method Task-oriented randomization
result Established rigorous theoretical foundations and demonstrated effectiveness through simulations and real-world applications
A new method optimizes MMD test power by dynamically selecting kernels, overcoming traditional trade-offs.
problem Fixed kernels fail to distinguish certain distributions, leading to overfitting and variance collapse.
method Complexity-Penalized MMD (CP-MMD) criterion, derived from concentration inequality, optimizes kernel selection.
result CP-MMD maximizes true test power while ensuring unconditional Type-I validity, matching or exceeding state-of-the-art performance.